Cholesky decomposition


1 Cholesky Decomposition

A symmetricPlanetmathPlanetmath and positive definite matrix can be efficiently decomposed into a lower and upper triangular matrixMathworldPlanetmath. For a matrix of any type, this is achieved by the LU decompositionMathworldPlanetmath which factorizes A=L⁢U. If A satisfies the above criteria, one can decompose more efficiently into A=L⁢LT where L is a lower triangular matrix with positive diagonal elements. L is called the Cholesky triangle.

To solve A⁢x=b, one solves first L⁢y=b for y, and then LT⁢x=y for x.

A variant of the Cholesky decomposition is the form A=RT⁢R , where R is upper triangular.

Cholesky decomposition is often used to solve the normal equationsMathworldPlanetmath in linear least squares problems; they give AT⁢A⁢x=AT⁢b , in which AT⁢A is symmetric and positive definitePlanetmathPlanetmath.

To derive A=L⁢LT, we simply equate coefficients on both sides of the equation:

[a11a12⋯a1⁢na21a22⋯a2⁢na31a32⋯a3⁢n⋮⋮⋱⋮an⁢1an⁢2⋯an⁢n]=[l110⋯0l21l22⋯0⋮⋮⋱⋮ln⁢1ln⁢2⋯ln⁢n]⁢[l11l21⋯ln⁢10l22⋯ln⁢2⋮⋮⋱⋮00⋯ln⁢n]

Solving for the unknowns (the nonzero lj⁢is), for i=1,⋯,n and j=i-1,…,n, we get:

li⁢i = (ai⁢i-∑k=1i-1li⁢k2)
lj⁢i = (aj⁢i-∑k=1i-1lj⁢k⁢li⁢k)/li⁢i

Because A is symmetric and positive definite, the expression under the square root is always positive, and all li⁢j are real.

References

  • 1 Originally from The Data Analysis Briefbook (http://rkb.home.cern.ch/rkb/titleA.htmlhttp://rkb.home.cern.ch/rkb/titleA.html)
Title Cholesky decomposition
Canonical name CholeskyDecomposition
Date of creation 2013-03-22 12:07:38
Last modified on 2013-03-22 12:07:38
Owner gufotta (12050)
Last modified by gufotta (12050)
Numerical id 16
Author gufotta (12050)
Entry type Definition
Classification msc 62J05
Classification msc 65-00
Classification msc 15-00
Synonym Cholesky factorization
Synonym matrix square root
Related topic SquareRootOfPositiveDefiniteMatrix
Defines Cholesky triangle