Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
From MaRDI portal
Publication:5348229
low-rank approximationnumerical experimentsdomain decompositionlinear elasticityKrylov subspace methodSherman-Morrison-Woodbury formulaPoisson's equationparallel preconditionerincomplete LU factorizationLanczos proceduredistributed sparse linear systemsreorthogonalizations
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Classical linear elasticity (74B05) Orthogonalization in numerical linear algebra (65F25)
Abstract: This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain decomposition method and low-rank corrections. The domain decomposition approach decouples the matrix and once inverted, a low-rank approximation is applied by exploiting the Sherman-Morrison-Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with other distributed-memory preconditioning methods are presented.
Recommendations
- Domain decomposition based preconditioner combined local low-rank approximation with global corrections
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- A domain decomposition preconditioner with reduced rank interdomain coupling
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Preconditioners for domain decomposition methods
- Preconditioners for nonconforming domain decomposition methods
- Preconditioners for rank deficient least squares problems
- Domain decomposition preconditioners for the spectral collocation method
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 1069512 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 218047 (Why is no real title available?)
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 2086817 (Why is no real title available?)
- scientific article; zbMATH DE number 897453 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Fast Solver for HSS Representations via Sparse Matrices
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- A fast block low-rank dense solver with applications to finite-element matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- ARMS: an algebraic recursive multilevel solver for general sparse linear systems
- Algorithm 837
- An Approximate Minimum Degree Ordering Algorithm
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Construction and arithmetics of \(\mathcal H\)-matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Direct Methods for Sparse Linear Systems
- Divide and conquer low-rank preconditioners for symmetric matrices
- Efficient structured multifrontal factorization for general large sparse matrices
- Fast algorithms for hierarchically semiseparable matrices
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Finite Elements
- H-matrix Preconditioners in Convection-Dominated Problems
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- The Lanczos Algorithm With Partial Reorthogonalization
- The Lanczos Algorithm with Selective Orthogonalization
- \(\mathcal H\)-matrices for convection-diffusion problems with constant convection
- H^2-matrix approximation of integral operators by interpolation
- pARMS: a parallel version of the algebraic recursive multilevel solver
Cited in
(20)- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- A robust adaptive algebraic multigrid linear solver for structural mechanics
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- Parallel Schur complement techniques based on multiprojection methods
- Distributed algebraic tearing and interconnecting techniques
- Scalable preconditioning for the stabilized contact mechanics problem
- Exploiting spatial symmetries for solving Poisson's equation
- A Numerical Domain Decomposition Method for Solving Elliptic Equations on Manifolds
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Low-rank improvements of two-level grid preconditioned matrices
- Multicolor low-rank preconditioner for general sparse linear systems.
- Efficient AMG reduction-based preconditioners for structural mechanics
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Divide and conquer low-rank preconditioners for symmetric matrices
- A class of efficient locally constructed preconditioners based on coarse spaces
- A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures
- A multigrid reduction framework for domains with symmetries
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
Describes a project that uses
Uses Software
This page was built for publication: Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348229)
