Cholesky_decomposition

最新推荐文章于 2023-01-27 16:57:38 发布

dfwz1971

最新推荐文章于 2023-01-27 16:57:38 发布

阅读量395

点赞数

文章标签： c/c++

原文链接：http://www.cnblogs.com/europelee/archive/2010/02/07/3388672.html

版权

from:
http://en.wikipedia.org/wiki/Cholesky_decomposition

The Cholesky-Banachiewicz and Cholesky-Crout algorithms

If we write out the equation A = LL^*,

${\mathbf{A=LL^T}} =\begin{pmatrix} L_{11} & 0 & 0 \\L_{21} & L_{22} & 0 \\L_{31} & L_{32} & L_{33}\\\end{pmatrix}\begin{pmatrix} L_{11} & L_{21} & L_{31} \\0 & L_{22} & L_{32} \\0 & 0 & L_{33}\\\end{pmatrix}=\begin{pmatrix} L_{11}^2 & &(symmetric) \\L_{21}L_{11} & L_{21}^2 + L_{22}^2& \\L_{31}L_{11} & L_{31}L_{21}+L_{32}L_{22} & L_{31}^2 + L_{32}^2+L_{33}^2 \\\end{pmatrix}$

we obtain the following formula for the entries of L:

$L_{i,j} = \frac{1}{L_{j,j}} \left( A_{i,j} - \sum_{k=1}^{j-1} L_{i,k} L_{j,k} \right), \qquad\mbox{for } i>j.$

$L_{i,i} = \sqrt{ A_{i,i} - \sum_{k=1}^{i-1} L_{i,k}^2 }.$

The expression under the square root is always positive if A is real and positive-definite.

For complex Hermitian matrix, the following formula applies:

$L_{i,j} = \frac{1}{L_{j,j}} \left( A_{i,j} - \sum_{k=1}^{j-1} L_{i,k} L_{j,k}^* \right), \qquad\mbox{for } i>j.$

$L_{i,i} = \sqrt{ A_{i,i} - \sum_{k=1}^{i-1} L_{i,k}L_{i,k}^* }.$

So we can compute the (i, j) entry if we know the entries to the left and above. The computation is usually arranged in either of the following orders.

The Cholesky-Banachiewicz algorithm starts from the upper left corner of the matrix L and proceeds to calculate the matrix row by row.
The Cholesky-Crout algorithm starts from the upper left corner of the matrix L and proceeds to calculate the matrix column by column.

[ edit] Stability of the computation

Suppose that we want to solve a well-conditioned system of linear equations. If the LU decomposition is used, then the algorithm is unstable unless we use some sort of pivoting strategy. In the latter case, the error depends on the so-called growth factor of the matrix, which is usually (but not always) small.

Now, suppose that the Cholesky decomposition is applicable. As mentioned above, the algorithm will be twice as fast. Furthermore, no pivoting is necessary and the error will always be small. Specifically, if we want to solve Ax = b, and y denotes the computed solution, then y solves the disturbed system (A + E)y = b where

$\|\mathbf{E}\|_2 \le c_n \varepsilon \|\mathbf{A}\|_2.$

Here, || ||₂ is the matrix 2-norm, c_n is a small constant depending on n, and ε denotes the unit round-off.

There is one small problem with the Cholesky decomposition. Note that we must compute square roots in order to find the Cholesky decomposition. If the matrix is real symmetric and positive definite, then the numbers under the square roots are always positive in exact arithmetic. Unfortunately, the numbers can become negative because of round-off errors, in which case the algorithm cannot continue. However, this can only happen if the matrix is very ill-conditioned.

[ edit] Avoiding taking square roots

An alternative form is the factorization^[2]

Cholesky_decomposition - wwweurope - wwweurope的博客

This form eliminates the need to take square roots. When A is positive definite the elements of the diagonal matrix D are all positive. However this factorization can be used for any square, symmetrical matrix.

The following recursive relations apply for the entries of D and L:

$L_{ij} = \frac{1}{D_{j}} \left( A_{ij} - \sum_{k=1}^{j-1} L_{ik} L_{jk} D_{k} \right), \qquad\mbox{for } i>j.$