Interchange Opportunity in Average Bandwidth Reduction in Sparse Matrices

This paper proposes two methods for determining suit- able interchanges of lines/columns in case of average bandwidth re- duction in sparse and symmetric matrices. First, a greedy heuristic inspired by the laws of physics (mechanics) to reduce the average bandwidth is proposed. The second method is an exact method that allows to estimate the potential of a row/column interchange to reduce the average bandwidth.