A Comparison of Several Bandwidth and Profile Reduction Algorithms
Norman E. Gibbs, William G. Poole, Paul K. Stockmeyer · ACM Transactions on Mathematical Software · 1976
This paper compares and analyzes six algorithms which have been suggested recently for use in reducing, by permutations, the bandwidth and profile of sparse matrices. This problem arises in many different areas of scientific computation such as in the finite element method for approximating solutions of partial differential equations and in analyzing large-scale power transmission systems.