(An) algorithm for bandwidth minimization of sparse matrix

Abstract

In this paper, a new algorithm of finding a permutation matrix P for a given sparse, symmetric and positive definite is discussed. This algorithm produces less bandwidth and requires less execution time than the reverse Cuthill-Mckee``s algorithm and Wang``s algorithm by using pseudo-diameter, distance of each node and rowward, columnward bandwidth of the associated graph G(A). A simple example is given to show how this algorithm works. Several numerical experiments are included to illustrate the results.