Another Look at Node Renumbering

Node renumbering is an important step in the solution of sparse systems of equations.It aims to reduce the bandwidth and profile of the matrix.This allows for the speeding up of the solution of the system or allows for the addressing of even larger systems than otherwise would be possible.Research on this topic dates to the late sixties.In most of these algorithms nodal degree is an important consideration.In the new algorithm, we consider the maximum difference in adjacent node numbers as the driving criterion.This new algorithm (IFK), when compared against well-known algorithms such as Reverse-Cuthill-McKee (RCM), Gibbs (GBS), Gibbs-Poole-Stockmeyer (GPS) and Sloan's (SLN) over 101 test cases from the Boeing-Harwell sparse matrix cases, achieves significant performance improvement in profile and bandwidth reduction and execution time.