On Positive Semidefinite Modification Schemes for Incomplete Cholesky Factorization
From MaRDI portal
Publication:2874998
DOI10.1137/130917582zbMath1298.65049OpenAlexW2093365458MaRDI QIDQ2874998
Publication date: 13 August 2014
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130917582
preconditioningsparse linear systemsiterative solversincomplete Cholesky factorizationSparse matricespositive-definite symmetric systems
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, Preconditioning complex symmetric linear systems, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Preconditioners for Krylov subspace methods: An overview, A Robust Multilevel Approximate Inverse Preconditioner for Symmetric Positive Definite Matrices, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, Communication Avoiding ILU0 Preconditioner
Uses Software
