Difference between revisions of "Manuals/calci/CHOLESKY"
Jump to navigation
Jump to search
| (5 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | <div style="font-size:25px">'''CHOLESKY( | + | <div style="font-size:25px">'''CHOLESKY (Matrix) '''</div><br/> |
| − | *<math> | + | *<math>Matrix</math> is the array of numeric elements. |
==Description== | ==Description== | ||
| Line 10: | Line 10: | ||
<math>L^{T}</math> is is the conjugate transpose value of <math>L</math> | <math>L^{T}</math> is is the conjugate transpose value of <math>L</math> | ||
*Every Hermitian positive-definite matrix has a unique Cholesky decomposition. | *Every Hermitian positive-definite matrix has a unique Cholesky decomposition. | ||
| − | *Here <math>CHOLESKY( | + | *Here <math>CHOLESKY (Matrix) </math>, <math>Matrix</math> is set of values to find the factorization value. |
*Partition matrices in <math>A</math> = <math>LL^{T}</math> is | *Partition matrices in <math>A</math> = <math>LL^{T}</math> is | ||
<math> | <math> | ||
| Line 57: | Line 57: | ||
|- | |- | ||
! 3 | ! 3 | ||
| − | |-5 || 0 || 11 | + | | -5 || 0 || 11 |
|} | |} | ||
=CHOLESKY(A1:C3) | =CHOLESKY(A1:C3) | ||
{| class="wikitable" | {| class="wikitable" | ||
| − | |||
|+Result | |+Result | ||
|- | |- | ||
| Line 72: | Line 71: | ||
|} | |} | ||
| − | + | {| class="wikitable" | |
| + | |+Spreadsheet | ||
| + | |- | ||
| + | ! !! A !! B !! C | ||
| + | |- | ||
| + | ! 1 | ||
| + | | 25 || 15 || -5 | ||
| + | |- | ||
| + | ! 2 | ||
| + | | 15 || 18 || 0 | ||
| + | |- | ||
| + | ! 3 | ||
| + | | -5 || 0 || 11 | ||
| + | |} | ||
| + | =CHOLESKY(A1:C3) | ||
{| class="wikitable" | {| class="wikitable" | ||
| Line 86: | Line 99: | ||
==Related Videos== | ==Related Videos== | ||
| − | {{#ev:youtube| | + | {{#ev:youtube|v=gFaOa4M12KU|280|center|Cholesky Decomposition}} |
==See Also== | ==See Also== | ||
Latest revision as of 14:55, 26 November 2018
CHOLESKY (Matrix)
- 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(A1:C3)
| 5 | 0 | 0 |
| 3 | 3 | 0 |
| -1 | 1 | 3 |
Related Videos
See Also
References