An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations

DOI10.1137/21m1468334zbMath1512.65039OpenAlexW4367322593MaRDI QIDQ6039243

Publication date: 4 May 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1468334

zbMATH Keywords

preconditioner low-rank approximations conditioning analysis orthogonal approximations breakdown-free incomplete Cholesky sparse incomplete Cholesky

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Efficient numerical methods for non-local operators. $\mathcal H^2$-matrix compression, algorithms and analysis.
An aggregation-based algebraic multigrid method
Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
Hierarchical matrices based on a weak admissibility criterion
Preconditioning techniques for large linear systems: A survey
Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
Domain decomposition based ${\mathcal H}$-LU preconditioning
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping
An Algebraic Multigrid Method with Guaranteed Convergence Rate
The university of Florida sparse matrix collection
Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
LAPACK Users' Guide
Generalized Nested Dissection
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Iterative Solution Methods
Iterative Krylov Methods for Large Linear Systems
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Multicolor low‐rank preconditioner for general sparse linear systems
Improving Multifrontal Methods by Means of Block Low-Rank Representations
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
Randomized Sparse Direct Solvers
A Distributed-Memory Randomized Structured Multifrontal Method for Sparse Direct Solutions
Multilevel Preconditioners Constructed From Inverse-Based ILUs
Nested Dissection of a Regular Finite Element Mesh
Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
An algebraic multifrontal preconditioner that exploits the low‐rank property
Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems

This page was built for publication: An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations