Improving the Run Time and Quality of Nested Dissection Ordering

@article{Hendrickson1998ImprovingTR,
  title={Improving the Run Time and Quality of Nested Dissection Ordering},
  author={Bruce Hendrickson and Edward Rothberg},
  journal={SIAM J. Scientific Computing},
  year={1998},
  volume={20},
  pages={468-489}
}
When performing sparse matrix factorization, the ordering of matrix rows and columns has a dramatic impact on the factorization time. This paper describes an approach to the reordering problem that produces significantly better orderings than prior methods. The algorithm is a hybrid of nested dissection and minimum degree ordering, and combines an assortment of different algorithmic advances. New or improved algorithms are described for graph compression, multilevel partitioning, and separator… CONTINUE READING

Figures, Tables, Results, and Topics from this paper.

Key Quantitative Results

  • When these techniques are combined, the resulting orderings average 39% better than minimum degree over a suite of test matrices, while requiring roughly 2.7 times the run time of Liu's multiple minimum degree.
  • In summary, the combination of our techniques reduces operation counts by nearly 40% in comparison to minimum degree ordering, and it reduces storage requirements by roughly 17%.

Citations

Publications citing this paper.
SHOWING 1-10 OF 95 CITATIONS

Sparse Matrix Ordering Methods for Interior Point Linear Programming

  • INFORMS Journal on Computing
  • 1998
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND

Hybridizing Nested Dissection and Halo Approximate Minimum Degree for Efficient Sparse Matrix Ordering

  • Concurrency - Practice and Experience
  • 2000
VIEW 4 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Scalable parallel sparse LU factorization methods on shared memory multiprocessors

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm

  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

1996
2019

CITATION STATISTICS

  • 5 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

Modification of the minimum degree algorithm by multiple elimination

J.W.H. Liu
  • ACM Trans. Math. Software, 11
  • 1985
VIEW 14 EXCERPTS
HIGHLY INFLUENTIAL

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

  • SIAM J. Scientific Computing
  • 1998
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Fast and effective algorithms for graph partitioning and sparse-matrix ordering

  • IBM Journal of Research and Development
  • 1997
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Compressed Graphs and the Minimum Degree Algorithm

  • SIAM J. Scientific Computing
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Generalized nested dissection: some recent progress

C. Ashcraft, J.W.H. Liu
  • Minisymposium presentation at the Fifth SIAM Conference on Applied Linear Algebra, Snowbird, UT
  • 1994
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL