A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges

Numerical Linear Algebra with Applications

Volumn 18, Issue 1, 2011, Pages 41-54

  Erway, Jennifer B ^a   Marcia, Roummel F ^b  

^a WAKE FOREST UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Normwise backward stability; Tridiagonal matrices; Unsymmetric indefinite factorization

Indexed keywords

EID: 78651428125     PISSN: 10705325     EISSN: 10991506     Source Type: Journal    
DOI: 10.1002/nla.674     Document Type: Article

References (18)

1. Parlett BN, Taylor DR, Liu ZA. A look-ahead Lánczos algorithm for unsymmetric matrices. Mathematics of Computation 1985; 44(169):105-124.
2. Bank RE, Chan TF. A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems. Numerical Algorithms 1994; 7(1):1-16.
3. Anderson E, Bai Z, Bischof C, Demmel J, Dongarra J, DuCroz J, Greenbaum A, Hammarling S, McKenney A, Ostrouchov S, Sorensen D. LAPACK Users' Guide. SIAM: Philadelphia, 1992.
4. Ashcraft C, Grimes RG, Lewis JG. Accurate symmetric indefinite linear equation solvers. SIAM Journal on Matrix Analysis and Applications 1999; 20(2):513-516 (electronic).
5. Bunch JR, Kaufman L. Some stable methods for calculating inertia and solving symmetric linear systems. Mathematics of Computation 1977; 31(137):163-179.
6. Bunch JR, Parlett BN. Direct methods for solving symmetric indefinite systems of linear equations. SIAM Journal on Numerical Analysis 1971; 8:639-655.
7. Fang HR, O'Leary DP. Stable factorizations of symmetric tridiagonal and triadic matrices. SIAM Journal on Matrix Analysis and Applications 2006; 28(2):576-595.
8. Bunch JR. Partial pivoting strategies for symmetric matrices. SIAM Journal on Numerical Analysis 1974; 11:521-528.
9. T factorization of a symmetric tridiagonal matrix. Linear Algebra and its Applications 1999; 287(1-3):181-189. Special issue celebrating the 60th birthday of Ludwig Elsner.
10. Bunch JR, Marcia RF. A pivoting strategy for symmetric tridiagonal matrices. Numerical Linear Algebra with Applications 2005; 12(9):911-922.
11. Bunch JR, Marcia RF. A simplified pivoting strategy for symmetric tridiagonal matrices. Numerical Linear Algebra with Applications 2006; 13(10):865-867.
12. Marcia RF. On solving sparse symmetric linear systems whose definiteness is unknown. Applied Numerical Mathematics 2008; 58(4):449-458.
13. Freund RW, Gutknecht M, Nachtigal N. An implementation of the look-ahead Lanczos algorithm for non-Hermetian matrices. SIAM Journal on Scientific and Statistical Computing 1993; 14(1):137-158.
14. Gutknecht M. A completed theory of the unsymmetric Lanczos process and related algorithms, part I. SIAM Journal on Matrix Analysis and Applications 1992; 13(2):594-639.
15. Khelifi M. Lanczos maximal algorithm for unsymmetric eigenvalue problems. Applied Numerical Mathematics 1991; 7:179-193.
16. Higham NJ. Stability of the diagonal pivoting method with partial pivoting. SIAM Journal on Matrix Analysis and Applications 1997; 18(1):52-65.
17. Higham NJ. Accuracy and stability of numerical algorithms (2nd edn). Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, 2002.
18. Oettli W, Prager W. Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numerische Mathematik 1964; 6:405-409.