Parallel matching-based AMG preconditioners for elliptic equations discretized by IgA
Pasqua D'Ambra, Fabio Durastante, Salvatore Filippone

TL;DR
This paper evaluates parallel algebraic multigrid preconditioners for large, ill-conditioned linear systems from isogeometric analysis of elliptic problems, emphasizing scalability and efficiency in high-performance computing environments.
Contribution
It introduces and assesses parallel AMG preconditioners specifically designed for IgA discretizations, demonstrating their robustness and scalability on modern HPC architectures.
Findings
AMG preconditioners improve convergence for IgA systems.
Parallel implementation achieves good scalability on HPC systems.
Numerical tests confirm robustness across various problem sizes.
Abstract
Isogeometric analysis (IgA) offers enhanced approximation capabilities for the discretization of elliptic boundary-value problems, yet it results in large, sparse, and increasingly ill-conditioned linear systems due to higher interconnectivity among degrees of freedom. In particular, the discretization with tensor-product B-splines or NURBS of degree on a mesh with elements per parametric direction leads to symmetric positive-definite systems of the form , where the matrix bandwidth and condition number scale unfavorably with both and spatial dimension . To address the computational challenges posed by such systems, especially in three-dimensional or high-order scenarios, Krylov subspace methods with specialized preconditioners become essential. This paper investigates the efficacy of algebraic multigrid (AMG) preconditioners tailored for…
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.
