Next: spcholinv, Previous: spatan2, Up: Function Reference
Compute the Cholesky factor, r, of the symmetric positive definite sparse matrix a, where
r' * r = a.If called with 2 or more outputs p is the 0 when r is positive definite and p is a positive integer otherwise.
If called with 3 outputs then a sparsity preserving row/column permutation is applied to a prior to the factorization. That is r is the factorization of a
(
q,
q)
such thatr' * r = q * a * q'.Note that
splchol
factorizations is faster and use less memory.See also: spcholinv, spchol2inv, splchol.