On signed incomplete Cholesky factorization preconditioners for saddle-point systems
From MaRDI portal
Recommendations
- Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
- Preordering saddle‐point systems for sparse LDLT factorization without pivoting
- A robust incomplete factorization preconditioner for positive definite matrices
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- A robust incomplete factorization based on value and space constraints
Cited in
(9)- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- ILU preconditioners for nonsymmetric saddle-point matrices with application to the incompressible Navier-Stokes equations
- Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Preconditioners for Krylov subspace methods: An overview
- Sparse linear least-squares problems
- Generalized Golub-Kahan bidiagonalization for nonsymmetric saddle-point systems
This page was built for publication: On signed incomplete Cholesky factorization preconditioners for saddle-point systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176059)