Accurate symmetric indefinite linear equation solvers

SIAM Journal on Matrix Analysis and Applications

Volumn 20, Issue 2, 1998, Pages 513-561

  Ashcraft, Cleve ^a   Grimes, Roger G ^a   Lewis, John G ^a  

^a BOEING COMPANY   (United States)

Author keywords

Block pivoting; Dense and sparse matrices; Diagonal pivoting; Matrix inertia; Symmetric indefinite matrices

Indexed keywords

EID: 0032216895     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896296921     Document Type: Article

References (33)

1. J.O. AASEN, On the reduction of a symmetric matrix to tridiagonal form, BIT, 11 (1971), pp. 233-242.
2. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. Du CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, Release 2.0, 2nd ed., SIAM, Philadelphia, 1995.
3. E. ANDERSON AND J. DONGARRA, Evaluating block algorithm variants in LAPACK, in Proc. 5th SIAM Conference on Parallel Processing for Scientific Computing, J. Dongarra, P. Messina, D. Sorensen, and R. Voigt, eds., SIAM, Philadelphia, 1990, pp. 1-8.
4. The Boeing Extended Mathematical Subprogram Library, Boeing Computer Services, P.O. Box 24346, Seattle, WA 98124-0346, 1989.
5. V. BARWELL AND A. GEORGE, A comparison of algorithms for solving symmetric indefinite systems of linear equations, ACM Trans. Math. Software, 2 (1976), pp. 242-251.
6. J. BILMES, K. ASANOVIĆ, J. DEMMEL, D. LAM, AND C.-W. CHIN, Optimizing Matrix Multiply Using PHiPAC: A Portable, High-Performance, ANSI C Coding Methodology, Tech. report LAPACK Working Note 111, University of Tennessee at Knoxville, Knoxville, TN, 1996.
7. J.R. BUNCH, Analysis of the diagonal pivot method, SIAM J. Numer. Anal., 8 (1971), pp. 656-680.
8. J.R. BUNCH AND L. KAUFMAN, Some stable methods for calculating inertia and solving symmetric linear systems, Math. Comp., 31 (1977), pp. 163-179.
9. J.R. BUNCH AND B.N. PARLETT, Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numer. Anal., 8 (1971), pp. 639-655.
10. J.W. DEMMEL AND N.J. HIGHAM, Stability of block algorithms with fast level-3 BLAS, ACM Trans. Math. Software, 18 (1992), pp. 274-292.
11. J.W. DEMMEL, N.J. HIGHAM, AND R.S. SCHREIBER, Stability of block LU factorization, Numer. Linear Algebra Appl., 2 (1995), pp. 173-190.
12. J.J. DONGARRA, I.S. DUFF, D.C. SORENSEN, AND H. VAN DER VORST, Solving Linear Systems on Vector and Shared Memory Computers, SIAM, Philadelphia, 1991.
13. J. J. DONGARRA AND S.C. EISENSTAT, Squeezing the most out of an algorithm in Cray Fortran, ACM Trans. Math. Software, 10 (1984), pp. 219-230.
14. I.S. DUFF, N.I.M. GOULD, J.K. REID, J.A. SCOTT, AND K. TURNER, The factorization of sparse symmetric indefinite matrices, J. Inst. Maths. Appl., 11 (1991), pp. 181-204.
15. I.S. DUFF, R.G. GRIMES, AND J.G. LEWIS, Sparse matrix test problems, ACM Trans. Math. Software, 15 (1989), pp. 1-14.
16. I.S. DUFF AND J.K. REID, MA27: A Set of Fortran Subroutines for Solving Sparse Symmetric Sets of Linear Equations, Tech. report AERE R 10533, AERE Harwell, Didcot, Oxon, UK, 1982.
17. I.S. DUFF AND J.K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
18. I.S. DUFF AND J.K. REID, MA47, a Fortran Code for Direct Solution of Indefinite Sparse Symmetric Linear Systems, Tech. report RAL-95-001, Central Computing Department, Rutherford Appleton Laboratory, Didcot, Oxon, UK, 1995.
19. R. FLETCHER, Factorizing symmetric indefinite matrices, Linear Algebra Appl., 14 (1976), pp. 257-272.
20. G. GOLUB AND C. VAN LOAN, Matrix Computations, 2nd ed., Johns Hopkins Press, Baltimore, MD, 1989.
21. R.G. GRIMES, J.G. LEWIS, AND H.D. SIMON, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 228-272.
22. N.J. HIGHAM, The accuracy of solutions to triangular systems, SIAM J. Numer. Anal., 26 (1989), pp. 1252-1265.
23. N.J. HIGHAM, Iterative refinement for linear systems and LAPACK, IMA J. Numer. Anal., 17 (1997), pp. 495-509.
24. N.J. HIGHAM, Stability of the Diagonal Pivoting Method with Partial Pivoting, Numerical Analysis Report No. 265, Manchester Centre for Computational Mathematics, Manchester, England, 1995; SIAM J. Matrix Anal. Appl., 18 (1997), pp. 52-65.
25. N.J. HIGHAM, Stability of the Diagonal Pivoting Method with Partial Pivoting, Numerical Analysis Report No. 265, Manchester Centre for Computational Mathematics, Manchester, England, 1995; SIAM J. Matrix Anal. Appl., 18 (1997), pp. 52-65.
26. N.J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
27. M.T. JONES AND M.L. PATRICK, Factoring symmetric indefinite matrices on high-performance architectures, SIAM J. Sci. Comput., 15 (1994), pp. 273-283.
28. T factorization, ACM Trans. Math. Software, 21 (1995), pp. 476-489.
29. J.W.-H. LIU, On threshold pivoting in the multifrontal method for sparse indefinite systems, ACM Trans. Math. Software, 13 (1987), pp. 250-261.
30. J.W.-H. LIU, A partial pivoting strategy for sparse symmetric matrix decomposition, ACM Trans. Math. Software, 13 (1987), pp. 173-182.
31. B.N. PARLETT AND J.K. REID, On the solution of a system of linear equations whose matrix is symmetric but not definite, BIT, 10 (1970), pp. 386-397.
32. L.N. TREFETHEN AND R. SCHREIBER, Average case stability of Gaussian elimination, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 335-360.
33. J.H. WILKINSON, Rounding Errors in Algebraic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1963.