A Root-Node Based Algebraic Multigrid Method
Thomas A. Manteuffel, Luke N. Olson, Jacob B. Schroder, Ben S., Southworth

TL;DR
This paper introduces a root-node algebraic multigrid method that effectively solves large, complex linear systems from PDE discretizations, including challenging non-symmetric and anisotropic problems, with detailed cost analysis.
Contribution
It presents a unified root-node AMG algorithm with filtering strategies and theoretical insights, enhancing robustness and scalability for difficult SPD and non-SPD problems.
Findings
Successfully solves non-symmetric problems with robustness
Demonstrates scalability on large systems
Provides detailed computational cost estimates
Abstract
This paper provides a unified and detailed presentation of root-node style algebraic multigrid (AMG). Algebraic multigrid is a popular and effective iterative method for solving large, sparse linear systems that arise from discretizing partial differential equations. However, while AMG is designed for symmetric positive definite matrices (SPD), certain SPD problems, such as anisotropic diffusion, are still not adequately addressed by existing methods. Non-SPD problems pose an even greater challenge, and in practice AMG is often not considered as a solver for such problems. The focus of this paper is on so-called root-node AMG, which can be viewed as a combination of classical and aggregation-based multigrid. An algorithm for root-node is outlined and a filtering strategy is developed, which is able to control the cost of using root-node AMG, particularly on difficult problems. New…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
