Wednesday, October 9
Kidd Island & North Cape Rooms
Chair: J. Alan George, University of Waterloo, Canada
In this presentation, the speaker will give an overview of the development of robust sparse matrix ordering algorithms and software. Minimum degree and nested dissection are two different approaches to ordering problems. They share a common undesirable characteristic: both schemes produce generally good orderings, but the ordering quality is not uniformly good. The speaker will discuss inconsistent performance of these ordering schemes in the context of the recent method of multisection ordering. The basic tools used in multisection orderings are the notion of multisector and domain decomposition. Experimental results will be used to demonstrate the consistent quality of multisection orderings. This approach combines the advantages of the minimum degree and the nested dissection orderings.
A Sparse Matrix Ordering Perspective: From Dissectors
Joseph W. H. Liu
York University, Canada
Back to SM96 Program-at-a-Glance