An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix.
Abstract
A new algorithm for reducing the bandwidth and profile of a sparse matrix is described. Extensive testing on finite element matrices indicates that the algorithm typically produces bandwidth and profile which are comparable to those of the common-used reverse Cuthill-McKee algorithm, yet requires significantly less computation time. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1974
- Accession Number
- AD0783695
Entities
People
- Norman E. Gibbs
- Paul K. Stockmeyer
- William G. Poole Jr.
Organizations
- College of William & Mary