Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
From MaRDI portal
Publication:5348229
DOI10.1137/16M110486XzbMATH Open1371.65029arXiv1505.04341OpenAlexW2963970762MaRDI QIDQ5348229FDOQ5348229
Authors: Ruipeng Li, Y. Saad 
Publication date: 14 August 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1505.04341
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
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)
Cites Work
- ARMS: an algebraic recursive multilevel solver for general sparse linear systems
- Algorithm 837
- Title not available (Why is that?)
- Title not available (Why is that?)
- Direct Methods for Sparse Linear Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- Fast algorithms for hierarchically semiseparable matrices
- Title not available (Why is that?)
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- An Approximate Minimum Degree Ordering Algorithm
- Title not available (Why is that?)
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- Title not available (Why is that?)
- Construction and arithmetics of \(\mathcal H\)-matrices
- Approximate Inverse Preconditioners via Sparse-Sparse Iterations
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Title not available (Why is that?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- Title not available (Why is that?)
- Finite Elements
- The Lanczos Algorithm With Partial Reorthogonalization
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- A Fast Solver for HSS Representations via Sparse Matrices
- \(\mathcal H^2\)-matrix approximation of integral operators by interpolation
- Efficient structured multifrontal factorization for general large sparse matrices
- H-matrix Preconditioners in Convection-Dominated Problems
- The Lanczos Algorithm with Selective Orthogonalization
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- pARMS: a parallel version of the algebraic recursive multilevel solver
- Title not available (Why is that?)
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Title not available (Why is that?)
- \(\mathcal H\)-matrices for convection-diffusion problems with constant convection
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- A fast block low-rank dense solver with applications to finite-element matrices
- Divide and conquer low-rank preconditioners for symmetric matrices
Cited In (20)
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- A robust adaptive algebraic multigrid linear solver for structural mechanics
- 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
- Efficient AMG reduction-based preconditioners for structural mechanics
- Multicolor low-rank preconditioner for general sparse linear systems.
- 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
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
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)
