Symmetric orderings for unsymmetric sparse matrices
Harry A. G. Wijshoff · 1991
The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As the variety of different structured sparse matrices is large, there is no uniform method which is well suited for the whole range of sparse matrices.