Difference between revisions of "Manuals/calci/CHOLESKY"
Jump to navigation
Jump to search
| Line 13: | Line 13: | ||
Partition matrices in as | Partition matrices in as | ||
A= LL^T (Please take the description from http://www.seas.ucla.edu/~vandenbe/103/lectures/chol.pdf ) | A= LL^T (Please take the description from http://www.seas.ucla.edu/~vandenbe/103/lectures/chol.pdf ) | ||
| + | |||
| + | ==ZOS Section== | ||
| + | |||
| + | ==Examples== | ||
| + | |||
| + | ==See Also== | ||
Revision as of 05:37, 8 April 2015
CHOLESKY(ar1)
- 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 =
where
is lower triangular with positive diagonal elements is is the conjugate transpose value of
- Every Hermitian positive-definite matrix (and thus also every real-valued symmetric positive-definite matrix) has a unique Cholesky decomposition.
- Here ,array is set of values to find the factorization value.
Partition matrices in as A= LL^T (Please take the description from http://www.seas.ucla.edu/~vandenbe/103/lectures/chol.pdf )