Alan George

Learn More
This paper describes a very fast implementation of the m~n~mum degree algorithm, which is an effective heuristm scheme for fmding low-fill ordermgs for sparse positive definite matrices. This implementation has two important features: first, in terms of speed, it is competitive with other unplementations known to the authors, and, second, its storage(More)
Software for solving sparse systems of hnear equations typically involves fairly complicated data structures and storage management In many cases the user of such software simply wants to solve a system of equations, and should not have to be concerned with the way this storage management is actually done, or the way the matrix components are actually(More)
The need to find nodes with large eccentricity arises in many heuristic algorithms for ordering sparse matrix equations. A computer program is presented here for finding such nodes, based on an algorithm due to Gibbs, Poole, and Stockmeyer. Several changes have been made to their original method, and experiments suggest that these changes improve its(More)