Math 2.0

Numerical analysis Direct methods for linear systems Concept

Incomplete Cholesky factorization

Summary

An incomplete Cholesky factorization of a sparse symmetric positive definite matrix AA is a sparse lower triangular matrix LL with LLT≈AL L^T \approx A. 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

  1. Web https://en.wikipedia.org/wiki/Incomplete_Cholesky_factorization
About this page
TagQYYCFQ8E5D
URIm2://QYYCFQ8E5D
Kindconcept
WritingW0 stub
MSC65F08, 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.

What links here

Definitions

Used by