A node ordering algorithm to speed up the solution of sparse matrix and sparse vector linear equation systems

Recently, more attention has been devoted to sparse vector methods in order to reduce the computational burden when solving sparse systems of linear equations. These methods exploit the sparsity of the independent vector and/or the desire to know only a subset of the unknown vector. They are also applicable when refactorization of a slightly modified matrix is required. This paper proposes a scheme to order the nodes with the purpose of reducing the number of operations when applying sparse vector methods.