On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems

DOI10.1137/140956671zbMath1310.65036OpenAlexW2031203150MaRDI QIDQ5176059

Miroslav Tůma, Jennifer Scott

Publication date: 2 March 2015

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

Full work available at URL: https://semanticscholar.org/paper/c8100654009a0461faa700e59618cbd9d56ed1fa

zbMATH Keywords

preconditioningsparse matricessparse linear systemsiterative solversnumerical resultincomplete Cholesky factorizationpositive definite symmetric systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08)

Related Items (6)

A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ ILU Preconditioners for Nonsymmetric Saddle-Point Matrices with Application to the Incompressible Navier--Stokes Equations ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices

Uses Software

• HSL_MA97
• HSL_MI28

This page was built for publication: On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems