I. S. Duff
Abstract
We describe the design of a new code for the solution of sparse indefinite symmetric linear systems of equations. The principal difference between this new code and earlier work lies in the exploitation of the additional sparsity available when the matrix has a significant number of zero diagonal entries. Other new features have been included to enhance the execution speed, particularly on vector and parallel machines.
- 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, I (Mar.), 123-160. Google Scholar
Digital Library
- BUNCH, J. R. AND PARLETT, B.N. 1971. Direct methods for so}ving symmetric indefinite systems of }inear equations. SIAM J. Numer. Anal. 8, 639-655.Google ScholarCross Ref
- DONGARRA, J. J., Du CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of }eve} 3 basic linear algebra subroutines. ACM Trans. Math. Softw. 16, I (Mar.), 1-17. Google ScholarDigital Library
- DONGARRA, J. J., Du CROZ, J., HAMMARLING, S., AND HANSON, a.J. 1988. An extended set of Fortran basic linear algebra subprograms. ACM Trans. Math. Softw. 14, I (Mar.), 1-17. See also the companion algorithm, pages 18-32. Google ScholarDigital Library
- 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.Google Scholar
- DUFF, I. S. AND REID, J.K. 1983. The multifrontal solution of indefinite sparse symmetric linear systems. ACM Trans. Math. Softw. 9, 302-325. Google ScholarDigital Library
- 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.Google Scholar
- DUFF, I. S., ERISMAN, A. M., AND REID, J. K. 1986. Direct methods for sparse matrices. Oxford University Press, London. Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google Scholar
- GAY, D.M. 1985. Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newsl.Google Scholar
- HARWELL 1993. Harwell subroutine library catalogue (release 11). Theoretical Studies Department, AEA Technology, Harwell, England.Google Scholar
- LAWSON, C. L., HANSON, a. J., KINCAID, n. a., AND KROGH, F.T. 1979. Basic linear algebra subprograms for Fortran use. ACM Trans. Math. Softw. 5, 308-325. Google ScholarDigital Library
- LIu, J. W.H. 1990. The role of elimination trees in sparse factorization. SIAM J. Matrix Anal. Appl. 11, 134-172. Google ScholarDigital Library
- MARKOWITZ, H.M. 1957. The elimination form of the inverse and its application to linear programming. Manage. Sci. 3, 255-269.Google ScholarDigital Library
Index Terms
- Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems
Recommendations
A Sparse Symmetric Indefinite Direct Solver for GPU Architectures
In recent years, there has been considerable interest in the potential for graphics processing units (GPUs) to speed up the performance of sparse direct linear solvers. Efforts have focused on symmetric positive-definite systems for which no pivoting is ...
MA57---a code for the solution of sparse symmetric definite and indefinite systems
We introduce a new code for the direct solution of sparse symmetric linear equations that solves indefinite systems with 2 × 2 pivoting for stability. This code, called MA57, is in HSL 2002 and supersedes the well used HSL code MA27. We describe some of ...
The design and use of a sparse direct solver for skew symmetric matrices
We consider the LDL^T factorization of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used ...
Comments