Science Fair Project Encyclopedia
Minimum degree algorithm
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.
Last updated: 08-03-2005 19:04:42
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


