Symbolic Cholesky decomposition
From Wikipedia, the free encyclopedia
In the mathematical subfield of numerical analysis the symbolic Cholesky decomposition is an algorithm used to determine the non-zero pattern for the L factors of a symmetric sparse matrix when applying the Cholesky decomposition or variants.
[edit] Algorithm
Let
be a sparse symmetric positive definite matrix, which we wish to factorize as
- A = LLT
In order to implement an efficient sparse factorization it has been found to be necessary to determine the non zero structure of the factors before doing any numerical work.
Let 
and 
be sets representing the non-zero patterns of columns i and j (below the diagonal only) of matrices A and L respectively.
Take 
to mean the least element of .
Define the elimination tree on the matrix by use of a parent function π(i).
Then the following algorithm will give an efficient symbolic factorization of A
- For i= 1, n
- For j such that π(j) = i
\{j}
\{i}
