Scilab 5.3.0
- Scilab Online Help
- Linear Algebra
- aff2ab
- balanc
- bdiag
- chfact
- chol
- chsolve
- classmarkov
- cmb_lin
- coff
- colcomp
- companion
- cond
- det
- eigenmarkov
- ereduc
- expm
- fstair
- fullrf
- fullrfk
- genmarkov
- givens
- glever
- gschur
- gspec
- hess
- householder
- im_inv
- inv
- kernel
- kroneck
- linsolve
- lsq
- lu
- lyap
- nlev
- orth
- pbig
- pencan
- penlaur
- pinv
- polar
- proj
- projspec
- psmall
- qr
- quaskro
- randpencil
- range
- rank
- rankqr
- rcond
- rowcomp
- rowshuff
- rref
- schur
- spaninter
- spanplus
- spantwo
- spec
- sqroot
- squeeze
- sva
- svd
- sylv
- trace
Please note that the recommended version of Scilab is 2025.0.0. This page might be outdated.
See the recommended documentation of this function
chol
Cholesky factorization
Calling Sequence
[R]=chol(X)
Arguments
- X
a symmetric positive definite real or complex matrix.
Description
If X
is positive definite, then R = chol(X)
produces an upper
triangular matrix R
such that R'*R = X
.
chol(X)
uses only the diagonal and upper triangle of X
.
The lower triangular is assumed to be the (complex conjugate)
transpose of the upper.
References
Cholesky decomposition is based on the Lapack routines DPOTRF for real matrices and ZPOTRF for the complex case.
<< chfact | Linear Algebra | chsolve >> |