Numerical analysis Direct methods for linear systems Concept
Incomplete Cholesky factorization
Summary
An incomplete Cholesky factorization of a sparse symmetric positive definite matrix is a sparse lower triangular matrix with . It is computed like the Cholesky decomposition, but every entry outside a prescribed sparsity pattern is dropped. Its main use is as a preconditioner for the conjugate gradient method.
Where this leads
9 pages build on this one.
Further reading
About this page
| Tag | QYYCFQ8E5D |
|---|---|
| URI | m2://QYYCFQ8E5D |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65F08, 65F50, 65F10 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.