The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations

ACM Transactions on Mathematical Software

Volumn 22, Issue 2, 1996, Pages 187-226

  Duff, I S ^a   Reid, J K ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Algorithms; BLAS; Block triangular form; Error estimation; G.1.3 Mathematics of Computing : Numerical Linear Algebra linear systems (direct methods); Gaussian elimination; Performance; Sparse and very large systems; Sparse unsymmetric matrices

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL METHODS; FORTRAN (PROGRAMMING LANGUAGE); ITERATIVE METHODS; LINEAR ALGEBRA; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; USER INTERFACES;

ERROR ESTIMATION; FULL MATRIX PROCESSING; NUMERICAL PHASES; PARTIAL FACTORIZATION; RANK DEFICIENT MATRICES; RECTANGULAR MATRICES; RESTRUCTURING; SPARSE UNSYMMETRIC LINEAR SYSTEMS OF EQUATIONS; SYMBOLIC PHASES;

COMPUTER SOFTWARE;

EID: 0030164754     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/229473.229476     Document Type: Article

References (28)

1. ANDERSON, E., BAI, Z., BISCHOF, C., DEMMEL, J., DONGARRA, J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., OSTROUCHOV, S., AND SORENSEN, D. 1992. LAPACK Users' Guide. SLAM, Philadelphia, Pa.
2. ARIOLI, M., DEMMEL, J. W., AND DUFF, I. S. 1989. Solving sparse linear systems with sparse backward error. SIAM J. Matrix Anal. Appl. 10, 165-190.
3. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of Level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1 (Mar.), 1-17.
4. DONGARRA, J. J., DU CROZ, J., HAMMARLING, S., AND HANSON, R. J. 1988. An extended set of Fortran basic linear algebra subprograms. ACM Trans. Math. Softw. 14, 1-17. See also the companion algorithm, pages 18-32.
5. DUFF, I. S. 1977. MA28 - A set of Fortran subroutines for sparse unsymmetric linear equations. Rep. AERE R8730, HMSO, London.
6. DUFF, I. S. 1981a. On algorithms for obtaining a maximum transversal. ACM Trans. Math. Softw. 7, 315-330.
7. DUFF, I. S. 1981b. Algorithm 575. Permutations for a zero-free diagonal. ACM Trans. Math. Softw. 7, 387-390.
8. DUFF, I. S. 1984. The solution of nearly symmetric sparse linear systems. In Computing Methods in Applied Sciences and Engineering, R. Glowinski and J.-L. Lions, Eds. Vol. 6. North-Holland, Amsterdam, 57-74.
9. DUFF, I. S. AND REID, J. K. 1978a. An implementation of Tarjan's algorithm for the block triangularization of a matrix. ACM Trans. Math. Softw. 4, 137-147.
10. DUFF, I. S. AND REID, J. K. 1978b. Algorithm 529. Permutations to block triangular form. ACM Trans. Math. Softw. 4, 189-192.
11. DUFF, I. S. AND REID, J. K. 1979. Some design features of a sparse matrix code. ACM Trans. Math. Softw. 5, 1 (Mar.), 18-35.
12. DUFF, I. S. AND REID, J. K. 1993. MA48, a Fortran code for direct solution of sparse unsymmetric linear systems of equations. Rep. RAL-93-072, Rutherford Appleton Laboratory, Oxfordshire, England.
13. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct Methods for Sparse Matrices. Oxford University Press, London.
14. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1989. Sparse matrix test problems. ACM Trans. Math. Softw. 15, 1 (Mar.), 1-14.
15. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1992. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1). Rep. RAL-92-086, Rutherford Appleton Laboratory, Oxfordshire, England.
16. EISENSTAT, S. C. AND LIU, J. W. H. 1993. Exploiting structural symmetry in a sparse partial pivoting code. SIAM J. Sci. Stat. Comput. 14, 253-257.
17. GILBERT, J. R. AND PEIERLS, T. 1988. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 862-874.
18. HAGER, W. W. 1984. Condition estimators. SIAM J. Sci. Stat. Comput. 5, 311-316.
19. HARWELL. 1993. Harwell subroutine library catalogue (release 11). Theoretical Studies Dept., AEA Technology, Harwell, England.
20. HIGHAM, N. J. 1988. Fortran codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation. ACM Trans. Math. Softw. 14, 381-396.
21. LAWSON, C. L., HANSON, R. J., KINCAID, D. R., AND KROGH, F. T. 1979. Basic linear algebra subprograms for Fortran use. ACM Trans. Math. Softw. 5, 308-325.
22. MARKOWITZ, H. M. 1957. The elimination form of the inverse and its application to linear programming. Manage. Sci. 3, 255-269.
23. OETTLI, W. AND PRAGER, W. 1964. Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numer. Math. 6, 405-409.
24. POTHEN, A. AND FAN, C.-J. 1990. Computing the block triangular form of a sparse matrix. ACM Trans. Math. Softw. 16, 303-324.
25. SKEEL, R. D. 1980. Iterative refinement implies numerical stability for Gaussian elimination. Math. Comput. 35, 817-832.
26. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
27. ZLATEV, Z. 1980. On some pivotal strategies in Gaussian elimination by sparse technique. SIAM J. Numer. Anal. 17, 18-30.
28. ZLATEV, Z. 1991. Computational Methods for General Sparse Matrices. Kluwer Academic Publishers, Dordrecht, Netherlands.