## Robust Ordering of Sparse Matrices using Multisection (1996)

Venue: | Department of Computer Science, York University |

Citations: | 46 - 2 self |

### BibTeX

@TECHREPORT{Ashcraft96robustordering,

author = {Cleve Ashcraft and Joseph W. H. Liu},

title = {Robust Ordering of Sparse Matrices using Multisection},

institution = {Department of Computer Science, York University},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we provide a robust reordering scheme for sparse matrices. The scheme relies on the notion of multisection, a generalization of bisection. The reordering strategy is demonstrated to have consistently good performance in terms of fill reduction when compared with multiple minimum degree and generalized nested dissection. Experimental results show that by using multisection, we obtain an ordering which is consistently as good as or better than both for a wide spectrum of sparse problems. 1 Introduction It is well recognized that finding a fill-reducing ordering is crucial in the success of the numerical solution of sparse linear systems. For symmetric positive-definite systems, the minimum degree [38] and the nested dissection [11] orderings are perhaps the most popular ordering schemes. They represent two opposite approaches to the ordering problem. However, they share a common undesirable characteristic. Both schemes produce generally good orderings, but the ordering qua...