Abstract
AbstractThis article introduces a novel approach to algebraic multigrid methods for large systems of linear equations coming from finite element discretizations of certain elliptic second‐order partial differential equations. Based on a discrete energy made up of edge and vertex contributions, we are able to develop coarsening criteria that guarantee two‐level convergence even for systems of equations such as linear elasticity . This energy also allows us to construct prolongations with prescribed sparsity pattern that still preserve kernel vectors exactly. These allow for a straightforward optimization that simplifies parallelization and reduces communication on coarse levels. Numerical experiments demonstrate efficiency and robustness of the method and scalability of the implementation.
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.
