Jump to content

Minimum degree algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by MathMartin (talk | contribs) at 22:07, 28 September 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the mathematical subfield of numerical analysis the minimum degree algorithm is an algorithm used to optimize a symmetric sparse matrix before applying the Cholesky decomposition.

The algorithm calculates the worst possible fill-in during the Cholesky decomposition and reduces the bandwidth of the matrix.

Algorithm

References

Alan George and Joseph Liu. The evolution of the Minimum Degree Ordering Algorithm, SIAM Review, 31:1-19, 1989.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Minimum_degree_algorithm&oldid=9792376"