Algorithms to Reduce the Bandwidth of a Given Sparse Symmetric Matrix
Original Publication Date: 1980-Oct-01
Included in the Prior Art Database: 2005-Feb-13
Two algorithms are described to reduce the bandwidth of a given sparse symmetric matrix which results in a more efficient solution of the matrix. This is accomplished by proper renumbering of the nodes of the constructed graph which, in turn, results in a matrix with minimum bandwidth.