Premium
Ordering symmetric sparse matrices for small profile and wavefront
Author(s) -
Reid J. K.,
Scott J. A.
Publication year - 1999
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19990830)45:12<1737::aid-nme652>3.0.co;2-t
Subject(s) - computation , algorithm , wavefront , bandwidth (computing) , reduction (mathematics) , computer science , mathematics , optics , physics , computer network , geometry
The ordering of large sparse symmetric matrices for small profile and wavefront or for small bandwidth is important for the efficiency of frontal and variable‐band solvers. In this paper, we look at the computation of pseudoperipheral nodes and compare the effectiveness of using an algorithm based on level‐set structures with using the spectral method as the basis of the Reverse Cuthill–McKee algorithm for bandwidth reduction. We also consider a number of ways of improving the performance and efficiency of Sloan's algorithm for profile and wavefront reduction, including the use of different weights, the use of supervariables, and implementing the priority queue as a binary heap. We also examine the use of the spectral ordering in combination with Sloan's algorithm. The design of software to implement the reverse Cuthill–McKee algorithm and a modified Sloan's algorithm is discussed. Extensive numerical experiments that justify our choice of algorithm are reported on. Copyright © 1999 John Wiley & Sons, Ltd.