A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront

Abstract

Abstract Three widely‐used nodal resequencing algorithms were tested and compared for their ability to reduce matrix profile and root‐mean‐square (rms) wavefront, the latter being the most critical parameter in determining matrix decomposition time in the NASTRAN finite element computer program. The three algorithms are Cuthill–McKee (CM), Gibbs–Poole–Stockmeyer (GPS), and Levy. Results are presented for a diversified collection of 30 test problems ranging in size from 59 to 2680 nodes. It is concluded that GPS is exceptionally fast, and, for the conditions under which the test was made, the algorithm best able to reduce profile and rms wavefront consistently well. An extensive bibliography of resequencing algorithms is included.