Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

DOI10.1137/16M110486XzbMath1371.65029arXiv1505.04341OpenAlexW2963970762MaRDI QIDQ5348229

Ruipeng Li, Yousef Saad

Publication date: 14 August 2017

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04341

zbMATH Keywords

linear elasticitydomain decompositionnumerical experimentsPoisson's equationKrylov subspace methodincomplete LU factorizationlow-rank approximationSherman-Morrison-Woodbury formulaparallel preconditionerLanczos proceduredistributed sparse linear systemsreorthogonalizations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Classical linear elasticity (74B05) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Parallel numerical computation (65Y05) Orthogonalization in numerical linear algebra (65F25) Preconditioners for iterative methods (65F08)

Related Items

Scalable preconditioning for the stabilized contact mechanics problem, Low-rank improvements of two-level grid preconditioned matrices, Parallel Schur Complement Techniques Based on Multiprojection Methods, A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures, Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization, Schur complement-based domain decomposition preconditioners with low-rank corrections, Exploiting spatial symmetries for solving Poisson's equation, A Numerical Domain Decomposition Method for Solving Elliptic Equations on Manifolds, A Class of Efficient Locally Constructed Preconditioners Based on Coarse Spaces, A robust adaptive algebraic multigrid linear solver for structural mechanics, A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems, Robust and Effective eSIF Preconditioning for General Dense SPD Matrices, An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices, Distributed algebraic tearing and interconnecting techniques

Uses Software

• AMD
• ARMS
• pARMS
• PETSc
• Scotch
• MFEM
• Chaco
• libPTScotch
• GLVis
• STRUMPACK
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Self-consistent-field calculations using Chebyshev-filtered subspace iteration
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• \(\mathcal H\)-matrices for convection-diffusion problems with constant convection
• Construction and arithmetics of \(\mathcal H\)-matrices
• Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
• \(\mathcal H^2\)-matrix approximation of integral operators by interpolation
• A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
• A fast block low-rank dense solver with applications to finite-element matrices
• 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
• Divide and Conquer Low-Rank Preconditioners for Symmetric Matrices
• Schur complement-based domain decomposition preconditioners with low-rank corrections
• Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
• Fast algorithms for hierarchically semiseparable matrices
• Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation
• The Lanczos Algorithm With Partial Reorthogonalization
• Direct Methods for Sparse Linear Systems
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Superfast Multifrontal Method for Large Structured Linear Systems of Equations
• The Lanczos Algorithm with Selective Orthogonalization
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
• An Approximate Minimum Degree Ordering Algorithm
• A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
• A Rational Function Preconditioner For Indefinite Sparse Linear Systems
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
• Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
• ARMS: an algebraic recursive multilevel solver for general sparse linear systems
• pARMS: a parallel version of the algebraic recursive multilevel solver
• A Fast Solver for HSS Representations via Sparse Matrices
• Algorithm 837
• H-matrix Preconditioners in Convection-Dominated Problems
• Finite Elements