Numerical linear algebra · Definition

Cholesky factorization

numerical methodsnumerical linear algebra

Before you start you need to know

When a matrix is symmetric and positive definite, it can be factored with about half the work of LU factorization. This method exploits symmetry to solve linear systems stably.

Definition

The Cholesky factorization decomposes a symmetric positive definite matrix \(A\) as \(A = LL^{T}\), where \(L\) is lower triangular with positive diagonal.

\[A = LL^{T}, \; l_{jj} = \sqrt{a_{jj} - \sum_{k

If \(A\) is symmetric positive definite, its factorization \(A = LL^{T}\) exists and is unique with positive diagonal in \(L\). Entries are computed column by column: \(l_{jj}=\sqrt{a_{jj}-\sum_{k<j}l_{jk}^{2}}\) and \(l_{ij}=(a_{ij}-\sum_{k<j}l_{ik}l_{jk})/l_{jj}\) for \(i>j\).

For \(A=\begin{pmatrix}4&2\\2&5\end{pmatrix}\), we get \(l_{11}=2\), \(l_{21}=1\), and \(l_{22}=\sqrt{5-1}=2\), so \(L=\begin{pmatrix}2&0\\1&2\end{pmatrix}\). This confirms \(LL^{T}=A\).

A typical error is applying the formula to a symmetric matrix that is not positive definite, where a square root of a negative number appears. Another common mistake is forgetting that \(L^{T}\) is the transpose of \(L\), not its inverse.

Think about it

If a symmetric matrix has a negative eigenvalue, what happens when computing \(l_{jj}\)?

A negative or zero quantity appears under a square root at some step, so the factorization does not exist because the matrix is not positive definite.

Exercises 10

References

  • Richard L. Burden, J. Douglas Faires, Annette M. Burden, Numerical Analysis, 10th edition, Cengage Learning, 2016.
  • Lloyd N. Trefethen, David Bau III, Numerical Linear Algebra, 1st edition, SIAM, 1997.