|
97.
|
|
|
[K2, lm, vm, lM, vM] = cond2sp(A, Cp [, itermax, eps, verb])
|
|
|
represents a line break.
Start a new line in the equivalent position in the translation.
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
98.
|
|
|
5/ if you don't need the Cholesky factorization anymore, it is recommended to free it with taucs_chdel(Cp)
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
99.
|
|
|
if you have lost your pointer you may use taucs_chdel() which frees memory for all the current Cholesky factorizations.
|
|
|
represents a line break.
Start a new line in the equivalent position in the translation.
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
100.
|
|
|
with umfpack:
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
101.
|
|
|
with the taucs snmf Cholesky solver:
|
|
|
represents a space character.
Enter a space in the equivalent position in the translation.
|
|
|
|
(no translation yet)
|
|
|
|
102.
|
|
|
UMFPACK
|
|
|
|
(no translation yet)
|
|
|
|
103.
|
|
|
Sparse Matrices
|
|
|
|
(no translation yet)
|
|
|
|
104.
|
|
|
Harwell-Boeing
|
|
|
|
(no translation yet)
|
|
|
|
105.
|
|
|
condestsp
|
|
|
|
(no translation yet)
|
|
|