An algorithm for profile and wavefront reduction of sparse matrices
Scott William Sloan · International Journal for Numerical Methods in Engineering · 1986
Abstract An algorithm for reducing the profile and wavefront of a sparse matrix is described. The scheme is applicable to any sparse matrix which has a symmetric pattern of zeros and may be used to generate efficient labellings for finite element grids. In particular, it is suitable for generating efficient labellings for profile and frontal solution schemes. Empirical evidence, obtained from analysis of the 30 test problems collected by Everstine, suggests that the new algorithm is superior to existing methods for profile and wavefront reduction. It is fast, requires only a small amount of memory, and is simple to program.