Divide and conquer low-rank preconditioners for symmetric matrices
DOI10.1137/120872735zbMATH Open1362.65036OpenAlexW1979511352MaRDI QIDQ2855656FDOQ2855656
Publication date: 28 October 2013
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120872735
Recommendations
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Multicolor low-rank preconditioner for general sparse linear systems.
- Block approximate inverse preconditioners for sparse nonsymmetric linear systems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
singular value decompositionlow-rank approximationdomain decompositionKrylov subspace methodSherman-Morrison formulaparallel preconditionerincomplete LU factorizationrecursive multilevel preconditioner
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cited In (17)
- Sparse hierarchical solvers with guaranteed convergence
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
- Effective matrix-free preconditioning for the augmented immersed interface method
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Schur complement-based domain decomposition preconditioners with low-rank corrections
- A Robust Multilevel Approximate Inverse Preconditioner for Symmetric Positive Definite Matrices
- Low-Rank Updates and a Divide-And-Conquer Method for Linear Matrix Equations
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- A multigrid reduction framework for domains with symmetries
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Domain decomposition based preconditioner combined local low-rank approximation with global corrections
Uses Software
This page was built for publication: Divide and conquer low-rank preconditioners for symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2855656)
