A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

Numerical Linear Algebra with Applications

Volumn 17, Issue 1, 2010, Pages 43-55

  Dollar, H S ^a   Scott, J A ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Approximate minimum degree ordering algorithm; Dense rows; Graph algorithms; Ordering algorithms; Sparse symmetric matrices

Indexed keywords

EID: 72449162183     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.647     Document Type: Article

References (16)

1. Yannakakis M. Computing the minimum fill-in is NP-complete. SIAM Journal on Discrete Mathematics 1981; 2:77-79.
2. George A. Nested dissection of a regular finite-element mesh. SIAM Journal on Numerical Analysis 1973; 10:345-363.
3. Tinney W, Walker J. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proceedings of the IEEE 1967; 55:1801-1809.
4. Duff IS, Scott JA. Towards an automatic ordering for a symmetric sparse direct solver. Technical Report RAL-TR-2006-001, Rutherford Appleton Laboratory, 2006.
5. Amestoy PR, Davis TA, Duff IS. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications 1996; 17(4):886-905.
6. Amestoy PR, Davis TA, Duff IS. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Transactions on Mathematical Software 2004; 30(3):381-388.
7. Carmen JL. An AMD preprocessor for matrices with some dense rows and columns. See http://www.netlib.org/linalg/amd/amdpre.ps.
8. Davis TA. Direct Methods for Sparse Linear Systems, Fundamentals of Algorithms, vol. 2. SIAM: Philadelphia, PA, 2006.
9. MUMPS. Multifrontal massively parallel solver. See http://mumps.enseiht.fr or http://graal.ens-lyon.fr/MUMPS/.
10. Amestoy PR, Dollar HS, Reid JK, Scott JA. An approximate minimum degree algorithm for matrices with dense rows. Technical Report RAL-TR-2007-020, Rutherford Appleton Laboratory, 2007.
11. Davis T. The University of Florida Sparse Matrix Collection, 2007. See http://www.cise.ufl.edu/davis/techreports/matrices.pdf.
12. HSL. A collection of Fortran codes for large-scale scientific computation, 2007. See http://hsl.rl.ac.uk/.
13. Duff IS. MA57-a new code for the solution of sparse symmetric definite and indefinite systems. ACM Transactions on Mathematical Software 2004; 30:118-154.
14. Rose DJ. Symmetric elimination on sparse positive definite systems and the potential flow network problem. Ph.D. Thesis, Harvard University, 1970.
15. Rose DJ. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. in Graph Theory and Computing, Read RC (ed.). Academic Press: New York, 1973; 183-217.
16. Duff IS, Reid JK. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software 1983; 9(3):302-325.