Robust parallel smoothing for multigrid via sparse approximate inverses

DOI10.1137/S1064827500380623MaRDI QIDQ2780585zbMATH OpenOpenAlexFDO

Authors Oliver Bröker, Marcus J. Grote, Arnold Reusken, Carsten Mayer

Publication date 15 April 2002

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1064827500380623

zbMATH Keywords

comparison of methodsdamped Jacobi methodGauss-Seidel methodincomplete LU-factorizationmultigridparallel computationpreconditionerssmootherssmoothing propertysparse approximate inverses

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)

Review text

Sparse approximate inverses (SPAI) are matrices \(M=(m_1 , m_2, \ldots , m_n)\) with a given sparsity pattern such that \(|e_k - A m_k|\) is minimal for each \(k\). Explicitly known smoothers (or preconditioners) have the advantage that they are suitable for parallel computers in contrast to Gauss-Seidel or ILU. It is shown that SPAI(0), i.e. diagonal matrices of this type are better than damped Jacobi although there is no parameter in SPAI(0). There are also some results for lesss sparse cases.

Recommendations

• Sparse approximate inverse smoothers for geometric and algebraic multigrid
• Parallel Preconditioning with Sparse Approximate Inverses
• Sparse Approximate Inverse Smoother for Multigrid
• Sparse matrix approximations for multigrid methods
• scientific article; zbMATH DE number 1873440

Cited in

(22)

• Sparse approximate inverse smoothers for geometric and algebraic multigrid
• Multigrid with inexact minimal residual smoothing acceleration
• Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
• Multilevel block ILU preconditioner for sparse nonsymmetric M-matrices.
• Parallel \(N\)-body simulation based on the PM and P3M methods using multigrid schemes in conjunction with generic approximate sparse inverses
• An efficient algorithm for polarizable interactions: a uniformly distributed one-dimensional case
• Preconditioning techniques for large linear systems: A survey
• Recursive two-level ILU preconditioner for nonsymmetric M-matrices
• Optimized sparse approximate inverse smoothers for solving Laplacian linear systems
• Asynchronous fine-grain parallel implicit smoother in multigrid solvers for compressible flow
• Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning
• Analysis of a class of parallel multigrid smoothers
• Sparse matrix approximations for multigrid methods
• On the multigrid method based on finite difference approximate inverses
• Multigrid smoothers for ultraparallel computing
• Sparse Approximate Inverse Smoother for Multigrid
• Analysis of two-level domain decomposition preconditioners based on aggregation
• A Fourth-Order Compact Finite Difference Scheme for Higher-Order PDE-Based Image Registration
• Smoothing and regularization with modified sparse approximate inverses
• Optimal polynomial smoothers for parallel AMG
• A comparative study of efficient multigrid solvers for high-order local discontinuous Galerkin methods: Poisson, elliptic interface, and multiphase Stokes problems
• A nested iterative scheme for indefinite linear systems in particulate flows

This page was built for publication: Robust parallel smoothing for multigrid via sparse approximate inverses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780585)