Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems

ACM Transactions on Mathematical Software

Volumn 22, Issue 2, 1996, Pages 227-257

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

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

2 x 2 pivots; Algorithms; Augmented systems; BLAS; G.1.3 Numerical Analysis : Numerical Linear Algebra linear systems (direct methods); Gaussian elimination; Indefinite symmetric matrices; Performance; Sparse; Sparse and very large systems

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONSTRAINT THEORY; FORTRAN (PROGRAMMING LANGUAGE); LEAST SQUARES APPROXIMATIONS; LINEAR ALGEBRA; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; VECTORS;

ADDITIONAL SPARSITY; AUGMENTED SYSTEMS; GAUSSIAN ELIMINATION; SPARSE INDEFINITE SYMMETRIC LINEAR SYSTEMS; ZERO DIAGONAL ENTRIES;

COMPUTER SOFTWARE;

EID: 0030170479     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/229473.229480     Document Type: Article

References (15)

1. BONGARTZ, I., CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 1995. CUTE: Constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 1 (Mar.), 123-160.
2. BUNCH, J. R. AND PARLETT, B. N. 1971. Direct methods for solving symmetric indefinite systems of linear equations. SIAM J. Numer. Anal. 8, 639-655.
3. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level 3 basic linear algebra subroutines. 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 (Mar.), 1-17. See also the companion algorithm, pages 18-32.
5. DUFF, I. S. AND REID, J. K. 1982. MA27 - A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Rep. AERE R10533, HMSO, London.
6. DUFF, I. S. AND REID, J. K. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325.
7. DUFF, I. S. AND REID, J. K. 1995. MA47, a Fortran code for direct solution of indefinite symmetric linear systems of equations. Rep. RAL 95-001, Rutherford Appleton Laboratory, Oxfordshire, England.
8. DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct methods for sparse matrices. Oxford University Press, London.
9. DUFF, I. S., GOULD, N. I. M., REID, J. K., SCOTT, J. A., AND TURNER, K. 1991. The factorization of sparse symmetric indefinite matrices. IMA J. Numer. Anal. 11, 181-204.
10. DUFF, I. S., GRIMES, R. G., AND LEWIS, J. G. 1992. Users' guide for the Harwell-Boeing sparse matrix collection. Rep. RAL 92-086, Rutherford Appleton Laboratory, Oxfordshire, England.
11. GAY, D. M. 1985. Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newsl.
12. HARWELL 1993. Harwell subroutine library catalogue (release 11). Theoretical Studies Department, AEA Technology, Harwell, England.
13. 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.
14. LIU, J. W. H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 134-172.
15. MARKOWITZ, H. M. 1957. The elimination form of the inverse and its application to linear programming. Manage. Sci. 3, 255-269.