AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C and Fortran 77. A MATLAB interface is included.

Me gusta

Guardar

Me gusta

Guardar

Cite This Study

Amestoy et al. (Wed,) studied this question.

synapsesocial.com/papers/69da127114d58ce4aaa3bfe9 https://doi.org/https://doi.org/10.1145/1024074.1024081

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The Evolution of the Minimum Degree Ordering Algorithm1989 · 382 citations
2Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering2000 · 42 citations
3Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods2001 · 72 citations
4Improving the Run Time and Quality of Nested Dissection Ordering1998 · 142 citations
5Node Selection Strategies for Bottom-Up Sparse Matrix Ordering1998 · 67 citations

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The Evolution of the Minimum Degree Ordering Algorithm1989 · 382 citations
2Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering2000 · 42 citations
3Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods2001 · 72 citations
4Improving the Run Time and Quality of Nested Dissection Ordering1998 · 142 citations
5Node Selection Strategies for Bottom-Up Sparse Matrix Ordering1998 · 67 citations