Skip to main content
SpringerLink
Log in

An Object-Oriented Collection of Minimum Degree Algorithms

  • Conference paper
  • First Online:
Computing in Object-Oriented Parallel Environments (ISCOPE 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1505))

Abstract

The multiple minimum degree (MMD) algorithm and its variants have enjoyed more than 20 years of research and progress in generating fill-reducing orderings for sparse, symmetric, positive definite matrices. Although conceptually simple, efficient implementations of these algorithms are deceptively complex and highly specialized.

In this case study, we present an object-oriented library that implements several recent minimum degree-like algorithms. We discuss how object-oriented design forces us to decompose these algorithms in a different manner than earlier codes and demonstrate how this impacts the flexibility and efficiency of our C++ implementation. We compare the performance of our code against other implementations in C or Fortran.

This work was supported by National Science Foundation grants CCR-9412698 and DMS-9807172, by a GAANN fellowship from the Department of Education, and by NASA under Contract NAS1-19480

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Parter. The use of planar graphs in Gaussian elimination. SIAM Rev., 3:364–369, 1961.

    Article  Google Scholar 

  2. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM J. Algebraic and Discrete Methods, pages 77–79, 1981.

    Google Scholar 

  3. Joseph W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. on Math. Software, 11:141–153, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  4. Patrick Amestoy, Timothy A. Davis, and Iain S. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl., 17(4):886–905, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  5. Ed Rothberg. Ordering sparse matrices using approximate minimum local fill. Preprint, April 1996.

    Google Scholar 

  6. Ed Rothberg and Stan Eisenstat. Node selection strategies for bottom-up sparse matrix ordering. SIAM J. Matrix Anal. Appl., 19(3):682–695, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  7. Esmond G. Ng and Padma Raghavan. Performance of greedy ordering heuristics for sparse Cholesky factorization. Submitted to SIAM J. Mat. Anal. and Appl., 1997.

    Google Scholar 

  8. Alan George and Joeseph W. H. Liu. The evolution of the minimum degree algorithm. SIAM Rev., 31(1):1–19, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  9. Cleve Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput., 16(6):1404–1411, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  10. Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison Wesley Professional Computing Series. Addison Wesley Longman, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Old Dominion University, Norfolk, VA, USA

    Gary Kumfert & Alex Pothen

  2. NASA Langley Research Center, Hampton, VA, USA

    Alex Pothen

Authors
  1. Gary Kumfert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alex Pothen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Nice - INRIA Sophia Antipolis, 2004 Route des Lucioles, BP 93, F-06902, Sophia Antipolis, France

    Denis Caromel

  2. Computer Science Department, Colorado State University, Fort Collins, CO, 80523, USA

    Rodney R. Oldehoeft

  3. Los Alamos National Laboratory, CIC-8, MS B272, Los Alamos, NM, 87545, USA

    Marydell Tholburn

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumfert, G., Pothen, A. (1998). An Object-Oriented Collection of Minimum Degree Algorithms. In: Caromel, D., Oldehoeft, R.R., Tholburn, M. (eds) Computing in Object-Oriented Parallel Environments. ISCOPE 1998. Lecture Notes in Computer Science, vol 1505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49372-7_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-49372-7_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65387-5

  • Online ISBN: 978-3-540-49372-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation