Difference between revisions of "Manuals/calci/CHOLESKY"
Jump to navigation
Jump to search
| Line 71: | Line 71: | ||
|} | |} | ||
| − | 2 | + | {| class="wikitable" |
| + | |+Spreadsheet | ||
| + | |- | ||
| + | ! !! A !! B !! C | ||
| + | |- | ||
| + | ! 1 | ||
| + | | 25 || 15 || -5 | ||
| + | |- | ||
| + | ! 2 | ||
| + | | 15 || 18 || 0 | ||
| + | |- | ||
| + | ! 3 | ||
| + | | -5 || 0 || 11 | ||
| + | |} | ||
| + | =CHOLESKY([[25, 15, -5],[15, 18, 0],[ -5, 0, 11]]) | ||
{| class="wikitable" | {| class="wikitable" | ||
Revision as of 08:05, 4 September 2017
CHOLESKY(arr)
- is the array of numeric elements.
Description
- This function gives the value of Cholesky factorization.
- It is called Cholesky Decomposition or Cholesky Factorization.
- The Cholesky Factorization is only defined for symmetric or Hermitian positive definite matrices.
- Every positive definite matrix A can be factored as =
is lower triangular with positive diagonal elements is is the conjugate transpose value of
- Every Hermitian positive-definite matrix has a unique Cholesky decomposition.
- Here , is set of values to find the factorization value.
- Partition matrices in = is
Algorithm
- Determine and = =
- Compute from =
- This is a Cholesky Factorization of order
Examples
| A | B | C | |
|---|---|---|---|
| 1 | 16 | 32 | 12 |
| 2 | 12 | 18 | 0 |
| 3 | -5 | 0 | 11 |
=CHOLESKY(A1:C3)
| 4 | 0 | 0 |
| 3 | 3 | 0 |
| -1.25 | 1.25 | 2.80624 |
| A | B | C | |
|---|---|---|---|
| 1 | 25 | 15 | -5 |
| 2 | 15 | 18 | 0 |
| 3 | -5 | 0 | 11 |
=CHOLESKY([[25, 15, -5],[15, 18, 0],[ -5, 0, 11]])
| 5 | 0 | 0 |
| 3 | 3 | 0 |
| -1 | 1 | 3 |
Related Videos
See Also
References