An unsymmetric-pattern multifrontal method for sparse LU factorization

SIAM Journal on Matrix Analysis and Applications

Volumn 18, Issue 1, 1997, Pages 140-158

  Davis, Timothy A ^a   Duff, Iain S ^b,c  

^a University of Florida   (United States)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^c Europ Ctr Res/Adv Train Sci C   (France)

Author keywords

LU factorization; Multifrontal methods; Unsymmetric sparse matrices

Indexed keywords

EID: 0031541111     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479894246905     Document Type: Article

References (29)

1. P. AMESTOY, T. A. DAVIS, AND I. S. DUFF, An approximate minimum degree ordering algorithm, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 886-905.
2. P. R. AMESTOY AND I. S. DUFF, Vectorization of a multiprocessor multifrontal code, Internat. J. Supercomputer Appl., 3 (1989), pp. 41-59.
3. A. R. CURTIS AND J. K. REID, On the automatic sealing of matrices for Gaussian elimination, J. Inst. Math Appl., 10 (1972), pp. 118-124.
4. T. A. DAVIS, Users' Guide to the Unsymmetric-Pattern Multifrontal Package (UMFPACK, Version 1.0). Technical Report TR-93-020, CISE Dept., Univ. of Florida, Gainesville, FL, 1993. Version 1.0 has been superseded by Version 2.0. For a copy of Version 2.0, send e-mail to netlib@ornl.gov with the one-line message send index from linalg.
5. T. A. DAVIS AND I. S. DUFF, Unsymmetric-Pattern Multifrontal Methods for Parallel Sparse LU Factorization, Technical Report TR-91-023, CISE Dept., Univ. of Florida, Gainesville, FL, 1991.
6. J. J. DONGARRA, J. J. DU CROZ, I. S. DUFF, AND S. HAMMARLING, A set of level 3 basic linear algebra subprograms, ACM Trans. Math. Software, 16 (1990), pp. 1-17.
7. I. S. DUFF, On algorithms for obtaining a maximum transversal, ACM Trans. Math. Software, 7 (1981), pp. 315-330.
8. I. S. DUFF, Parallel implementation of multifrontal schemes, Parallel Comput., 3 (1986), pp. 193-204.
9. I. S. DUFF, A. M. ERISMAN, AND J. K. REID, Direct Methods for Sparse Matrices, Oxford Univ. Press, London, 1986.
10. I. S. DUFF, R. G. GRIMES, AND J. G. LEWIS, Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release 1), Technical Report RAL-92-086, Rutherford Appleton Laboratory, Didcot, Oxon, England, 1992.
11. I. S. DUFF AND J. K. REID, An implementation of Tarjan's algorithm for the block triangularization of a matrix, ACM Trans. Math. Software, 4 (1978), pp. 137-147.
12. I. S. DUFF AND J. K. REID, Some design features of a sparse matrix code, ACM Trans. Math. Software, 5 (1979), pp. 18-35.
13. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear systems, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
14. I. S. DUFF AND J. K. REID, The multifrontal solution of unsymmetric sets of linear equations, SIAM J. Sci. Comput., 5 (1984), pp. 633-641.
15. I. S. DUFF AND J. K. REID, MA48, a Fortran Code for Direct Solution of Sparse Unsymmetnc Linear Systems of Equations, Technical Report RAL-93-072, Rutherford Appleton Laboratory, Didcot, Oxon, England, 1993.
16. S. C. EISENSTAT AND J. W. H. Liu, Exploiting structural symmetry in unsymmetric sparse symbolic factorization, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 202-211.
17. S. C. EISENSTAT AND J. W. H. LIU, Exploiting structural symmetry in a sparse partial pivoting code, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 253-257.
18. S. C. EISENSTAT AND J. W. H. LIU, Structural representations of Schur complements in sparse matrices, in Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, Vol. 56, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, Berlin, 1993, pp. 85-100.
19. A. GEORGE AND J. W. H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
20. J. R. GILBERT AND J. W. H. LIU, Elimination structures for unsymmetric sparse LU factors, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 334-354.
21. J. R. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
22. J. R. GILBERT AND T. PEIERLS, Sparse partial pivoting in time proportional to arithmetic operations, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 862-874.
23. S. M. HADFIELD, On the LU Factorization of Sequences of Identically Structured Sparse Matrices within a Distributed Memory Environment, Ph.D. thesis, CISE Dept., Univ. of Florida, Gainesville, FL, 1994; Technical Report TR-94-019, CISE Dept., Univ. of Florida, Gainesville, FL.
24. S. M. HADFIELD AND T. A. DAVIS, Potential and achievable parallelism in the unsymmetric-pattern multifrontal LU factorization method for sparse matrices, in Proc. Fifth SIAM Conf. on Applied Linear Algebra, Snowbird, UT, 1994, SIAM, Philadelphia, PA.
25. S. M. HADFIELD AND T. A. DAVIS, Lost pivot recovery for an unsymmetric-pattern multifrontal method, Technical Report TR-94-029, CISE Dept., Univ. of Florida, Gainesville, FL.
26. J. W. H. LIU, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software, 11 (1985), pp. 141-153.
27. J. W. H. LIU, The multifrontal method for sparse matrix solution: Theory and practice, SIAM Review, 34 (1992), pp. 82-109.
28. H. M. MARKOWITZ, The elimination form of the inverse and its application to linear programming, Management Sci., 3 (1957), pp. 255-269.
29. Z. ZLATEV, On some pivotal strategies in Gaussian elimination by sparse technique, SIAM J. Numer. Anal., 17 (1980), pp. 18-30.