Abstract
A robust and efficient numerical solver for three-dimensional linear elliptic partial differential equations without cross derivative terms, but variable coefficients is presented. The proposed algorithm is based on a general meshsize fourth-order compact finite-difference scheme and an accelerated geometric multigrid solver. The former not only increases the accuracy of the discretization, but also does not affect the bandwidth of the common second-order finite-difference scheme, which is relevant for distributed memory parallel implementations of the multigrid preconditioner. The acceleration technique, on the other hand, allows for a dramatic reduction of the number of cycles and smoothing steps required to achieve convergence. Furthermore, it is found that depending on the coefficients of the elliptic partial differential equation, the multigrid preconditioned solver can be the only way to obtain a reliable numerical solution or attain convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
