Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices
From MaRDI portal
Publication:5165449
DOI10.1137/21M139548XzbMath1491.65026arXiv2101.12164OpenAlexW3212687756MaRDI QIDQ5165449
Hussam al Daas, Jennifer Scott, Tyrone Rees
Publication date: 16 November 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.12164
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
A Robust Algebraic Multilevel Domain Decomposition Preconditioner for Sparse Symmetric Positive Definite Matrices, A low-rank update for relaxed Schur complement preconditioners in fluid flow problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- The deflated conjugate gradient method: convergence, perturbation and accuracy
- Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods
- Preconditioned conjugate gradients for solving singular systems
- The block conjugate gradient algorithm and related methods
- An efficient preconditioned CG method for the solution of a class of layered problems with extreme contrasts in the coefficients
- A breakdown-free block conjugate gradient method
- Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps
- On the Construction of Deflation-Based Preconditioners
- A Krylov--Schur Algorithm for Large Eigenproblems
- An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices
- Direct Methods for Sparse Matrices
- A Framework for Deflated and Augmented Krylov Subspace Methods
- Computational Advertising: Techniques for Targeting Relevant Ads
- Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms
- Schur complement-based domain decomposition preconditioners with low-rank corrections
- The university of Florida sparse matrix collection
- Deflation of Conjugate Gradients with Applications to Boundary Value Problems
- A Comparison of Two-Level Preconditioners Based on Multigrid and Deflation
- A Coarse Space Construction Based on Local Dirichlet-to-Neumann Maps
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- An Introduction to Domain Decomposition Methods
- A comparison of abstract versions of deflation, balancing and additive coarse grid correction preconditioners
- Conjugate gradient method with preconditioning by projector
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Randomized Subspace Iteration: Analysis of Canonical Angles and Unitarily Invariant Norms
- A Class of Efficient Locally Constructed Preconditioners Based on Coarse Spaces
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- On the Use of Rigid Body Modes in the Deflated Preconditioned Conjugate Gradient Method
- New development in freefem++
- A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
- A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces
- Deflated and Augmented Krylov Subspace Methods: A Framework for Deflated BiCG and Related Solvers
- HSL_MI28
- Randomized numerical linear algebra: Foundations and algorithms
- The construction of projection vectors for a deflated ICCG method applied to problems with extreme contrasts in the coefficients
- Benchmarking optimization software with performance profiles.
