Reliable solution of tridiagonal systems of linear equations

SIAM Journal on Numerical Analysis

Volumn 38, Issue 4, 2001, Pages 1134-1153

  Bar On, Ilan ^a   Leoncini, Mauro ^b,c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF FOGGIA   (Italy)

^c Ist di Matematica Computazionale   (Italy)

Author keywords

Perturbation analysis; Tridiagonal systems; Well definition

Indexed keywords

EID: 0034431554     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142998347991     Document Type: Article

References (23)

1. I. BAR-ON, B. CODENOTTI, AND M. LEONCINI, Checking robust non-singularity of a general tridiagonal matrix in linear time, BIT, 36 (1996), pp. 206-220.
2. I. BAR-ON, B. CODENOTTI, AND M. LEONCINI, A fast parallel Cholesky decomposition algorithm for tridiagonal symmetric matrices, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 403-418.
3. I. BAR-ON AND M. LEONCINI, Fast and Reliable Parallel Solution of Bidiagonal Systems, Tech. Rep. B4-96-08, Istituto di Matematica Computazionale del CNR, Pisa, 1996, submitted for publication.
4. I. BAR-ON AND M. LEONCINI, Well Defined Tridiagonal Systems, manuscript, 1996.
5. I. BAR-ON AND M. LEONCINI, Stable solution of tridiagonal systems, Numer. Algorithms, 18 (1998), pp. 361-388.
6. I. BAR-ON AND M. LEONCINI, Reliable solution of bidiagonal systems with applications, BIT, 39 (1999), pp. 403-416.
7. J. DEMMEL, The componentwise distance to the nearest singular matrix, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 10-19.
8. I. S. DHILLON, Reliable computation of the condition number of a tridiagonal matrix in O(n) time, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 776-796.
9. R. P. FEYNMAN, QED: The Strange Theory of Light and Matter, Princeton University Press, Princeton, NJ, 1985.
10. G. H. GOLUB AND C. F. V. LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
11. N. J. HIGHAM, Efficient algorithms for computing the condition number of a tridiagonal matrix, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 150-165.
12. N. J. HIGHAM, The accuracy of solutions to triangular systems, SIAM J. Numer. Anal., 26 (1989), pp. 1252-1265.
13. N. J. HIGHAM, Bounding the error in Gaussian elimination for tridiagonal systems, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 521-530.
14. N. J. HIGHAM, Algorithm 694: A collection of test matrices in MATLAB, ACM Trans. Math. Software, 17 (1991), pp. 289-305.
15. N. J. HIGHAM, Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia, 1996.
16. G. MEURANT, A review on the inverse of symmetric tridiagonal and block tridiagonal matrices, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 707-728.
17. W. OETTLI AND W. PRAGER, Computability of approximate solution of linear equations with given error bounds for coefficients and right-hand sides, Numer. Math., 6 (1964), pp. 405-409.
18. S. POLJAK AND J. ROHN, Checking robust nonsingularity is NP-Hard, Math. Control, Signals Systems, 6 (1993), pp. 1-9.
19. S. M. RUMP, Bounds for the componentwise distance to the nearest singular matrix, private communication, 1995.
20. K. SIGMON, Matlab Primer 4e, CRC Press, Boca Raton, FL, 1994.
21. R. D. SKEEL, Scaling for numerical stability in Gaussian elimination, J. Assoc. Comput. Mach., 26 (1979), pp. 494-526.
22. R. D. SKEEL, Iterative refinement implies numerical stability for Gaussian elimination, Math. Comp., 35 (1980), pp. 817-832.
23. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, UK, 1965. Reprinted in Oxford Science Publications, 1988.