Robust Ordering of Sparse Matrices using Multisection

Authors:
Cleve Ashcraft;Joseph W. H. Liu
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
1998

Citing 0
Cited 6

Bundle Adjustment - A Modern Synthesis

ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

ACM Transactions on Mathematical Software (TOMS)
References

Sourcebook of parallel computing
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method

ACM Transactions on Mathematical Software (TOMS)
A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations

ACM Transactions on Mathematical Software (TOMS)
FWT2D: A massively parallel program for frequency-domain full-waveform tomography of wide-aperture seismic data-Part 2

Computers & Geosciences

Quantified Score

Hi-index	0.01

Visualization

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.