Basis of an improved hybrid node renumbering algorithm for matrix bandwidth reduction Original Research Article

A new node renumbering algorithm for the reduction of matrix bandwidth is presented. The algorithm is a hybrid of existing algorithms and original methods. This new hybrid algorithm is compared against the commonly used Gibbs-Poole-Stockmeyer technique (GPS) and the direct reduction hybrid algorithm presented by Armstrong (NSAS) using example problems compiled by Everstine. The result showed a net overall improvement against these two highly efficient reduction schemes. In fact, two of the test cases were observed to exhibit the smallest bandwidth ever obtained, and six other cases tied for the best yet bandwidths found.