On positive semidefinite modification schemes for incomplete Cholesky factorization (Q2874998)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On positive semidefinite modification schemes for incomplete Cholesky factorization |
scientific article; zbMATH DE number 6329824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On positive semidefinite modification schemes for incomplete Cholesky factorization |
scientific article; zbMATH DE number 6329824 |
Statements
13 August 2014
0 references
Sparse matrices
0 references
sparse linear systems
0 references
positive-definite symmetric systems
0 references
iterative solvers
0 references
preconditioning
0 references
incomplete Cholesky factorization
0 references
On positive semidefinite modification schemes for incomplete Cholesky factorization (English)
0 references
The authors consider two techniques to avoid factorization breakdown in the incomplete Cholesky factorization algorithm: Jennings-Malik and Tismenetsky semidefinite modifications schemes. They provide new theoretical results and compare the 2-norms of the modifications to \(A\) that each approach makes.
0 references
