Checking robust nonsingularity of tridiagonal matrices in linear time

BIT Numerical Mathematics

Volumn 36, Issue 2, 1996, Pages 206-220

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CNR   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Robust nonsingularity; Tridiagonal systems; Well defined systems

Indexed keywords

EID: 0001055305     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01731979     Document Type: Article

References (22)

1. I. Bar-On and M. Leoncini, Reliable sequential algorithms for solving bidiagonal systems of linear equations, submitted.
2. A. Deif, Sensitivity Analysis in Linear Systems, Springer-Verlag, 1988.
3. G. Alefeld and J. Herzberger, Introduction to Interval Computations, Academic New York, 1983.
4. G. H. Golub and C. F. V. Loan, Matrix Computations 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.
5. J. W. Demmel, On Condition Numbers and the distance to the nearest ill-posed problem, Numer. Math., 51 (1987), pp. 251-289.
6. J. W. Demmel, The Componentwise distance to the nearest singular matrix, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 10-19.
7. N. J. Higham, Bounding the error in Gaussian elimination for tridiagonal systems, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 521-530.
8. N. J. Higham, Algorithm 694: A collection of test matrices in MATLAB, ACM Trans. Math. Softw., 17 (1991), pp. 289-305.
9. W. Kahan, Numerical Linear Algebra, Canadian Math. Bull., 9 (1966), pp. 757-801.
10. J. C. Doyle, Analysis of feedback systems with structured uncertainties, in Proc. IEEE 129 (1982), pp. 242-250.
11. K. Knopp, Elements of the Theory of Functions, Dover, New York, 1952.
12. M. Mansour, Robust stability of interval matrices, in Proceedings of the 28th Conference on Decision and Control, Tampa, FL, 1989, pp. 46-51.
13. MATLAB, The Math Works, Inc., Natick, MA., 1994.
14. A. Nemirovskii, Several NP-Hard problems arising in robust stability analysis, Mathematics of Control, Signals, and Systems, 6 (1993), pp. 99-105.
15. A. Neumaier, Interval Methods for Systems of Equations, Cambridge University Press, 1990.
16. W. Oettli and W. Prager, Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides, Numer. Math., 6 (1964), pp. 405-409.
17. S. Poljak and J. Rohn, Checking robust nonsingularity is NP-Hard, Mathematics of Control, and Systems, 6 (1993), pp. 1-9.
18. J. Rohn and V. Kreinovich, Computing exact componentwise bounds for the solution of linear systems with interval data is NP-Hard, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 415-420.
19. S. M. Rump, Bounds for the componentwise distance to the nearest singular matrix, Berichte 95.3, Technische Universität Hamburg, Germany, May 1995.
20. R. Skeel, Scaling for numerical stability in Gaussian elimination, J. Assoc. Comput. Mach., 26 (1979), pp. 494-526.
21. G. Stewart and J. Sun, Matrix Perturbation Theory, Academic Press, 1990.
22. J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, 1965. Reprinted in Oxford Science Publications, 1988.