The evolution of the minimum degree ordering algorithm [electronic resource].
- Oak Ridge, Tenn. : Oak Ridge National Laboratory, 1987. and Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy
- Physical Description:
- Pages: (26 pages) : digital, PDF file
- Additional Creators:
- Oak Ridge National Laboratory and United States. Department of Energy. Office of Scientific and Technical Information
- Restrictions on Access:
- Free-to-read Unrestricted online access
- Over the past fifteen years, the implementation of the minimum degree algorithm has received much study, and many important enhancements have been made to it. In this article, we describe these various enhancements, trace their historical development, and provide some experiments showing how very effective they are in improving the execution time of the algorithm. We also present a shortcoming that exists in all of the widely used implementations of the algorithm, namely, that the quality of the ordering provided by the implementations is surprisingly sensitive to the initial ordering. For example, changing the input ordering can lead to an increase (or decrease) of as much as a factor of three in the cost of the subsequent numerical factorization. This sensitivity is caused by the lack of an effective tie-breaking strategy, and our experiments illustrate the importance of developing such a strategy.
- Published through SciTech Connect., 05/01/1987., "ornl/tm-10452", "DE87011705", and George, A.; Liu, J.W.H.
- Funding Information:
View MARC record | catkey: 23780663