Divide and conquer low-rank preconditioners for symmetric matrices
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)
- 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
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- 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 robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Proxy-GMRES: Preconditioning via GMRES in Polynomial Space
- Multicolor low-rank preconditioner for general sparse linear systems.
- Effective matrix-free preconditioning for the augmented immersed interface method
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- 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
- A Rational Function Preconditioner For Indefinite Sparse Linear Systems
- Domain decomposition based preconditioner combined local low-rank approximation with global corrections
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)
