Perform a symbolic factorization analysis of the sparse matrix S.
The input variables are
S is a real or complex sparse matrix.
Is the type of the factorization and can be one of
"sym"
(default)Factorize S. Assumes S is symmetric and uses the upper triangular portion of the matrix.
"col"
Factorize S' * S
.
"row"
Factorize S * S'
.
"lo"
Factorize S'
. Assumes S is symmetric and uses the lower
triangular portion of the matrix.
When mode is unspecified return the Cholesky factorization for
R. If mode is "lower"
or "L"
then return
the conjugate transpose R'
which is a lower triangular factor.
The conjugate transpose version is faster and uses less memory, but still
returns the same values for all other outputs: count, h,
parent, and post.
The output variables are:
The row counts of the Cholesky factorization as determined by
typ. The computational difficulty of performing the true
factorization using chol
is sum (count .^ 2)
.
The height of the elimination tree.
The elimination tree itself.
A sparse boolean matrix whose structure is that of the Cholesky factorization as determined by typ.
See also: chol, etree, treelayout.
Package: octave