symamd: Symmetric approximate minimum degree permutation. p = symamd(S) for a symmetric positive definite matrix S, returns the permutation vector p such that S(p,p) tends to have a sparser Cholesky factor than S. To find the ordering for S, symamd constructs a matrix M such that spones(M’*M) = spones (S), and then computes p = colamd(M). The symamd function may also work well for symmetric indefinite matrices.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Davis, Timothy A.; Natarajan, E.Palamadai: Sparse matrix methods for circuit simulation problems (2012)
- Druinsky, Alex; Toledo, Sivan: Factoring matrices with a tree-structured sparsity pattern (2011)
- Davis, Timothy A.; Hager, William W.: A sparse proximal implementation of the LP dual active set algorithm (2008)
- Davis, Timothy A.; Gilbert, John R.; Larimore, Stefan I.; Ng, Esmond G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm (2004)