Calculation of exact bounds for the solution set of linear interval systems

Linear Algebra and Its Applications

Volumn 251, Issue , 1997, Pages 321-340

  Jansson, C ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031541012     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(96)00681-7     Document Type: Article

References (26)

1. G. Alefeld and J. Herzberger, Introduction to Interval Computations, Academic, New York, 1983.
2. G. Alefeld and L. Platzöder, A quadratically convergent Krawczyk-like algorithm, SIAM, J. Numer. Anal. 20(1):210-219 (1983).
3. W. Barth and E. Nuding, Optimale Lösung von Intervallgleichungssystemen, Computing 12:117-125 (1974).
4. H. Beeck, Charakterisierung der Lösungsmenge von Intervallgleichungssystemen, Z. Angew. Math. Mech. 53:T181-T182 (1973).
5. C. Jansson, A Self-validating method for solving linear programming problems, Computing Suppl. 6:33-46 (1988).
6. C. Jansson, Some Properties of Linear Interval Systems and Applications, Technical Report 94.3 Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 1994.
7. R. Krawczyk, Fehlerabschätzung bei linearer Optimierung, Interval Math. 29 (1975).
8. U. Kulisch, Miranker, W. L., Computer Arithmetic in Theory and Practice, Academic, New York, 1981.
9. R. E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
10. A. Neumaier, Interval Methods for Systems of Equations, Encyclopedia Math. Appl., Cambridge U.P., 1990.
11. K. Nickel, Die Überschätzung des Wertebereichs einer Funktion in der Intervallrechnung mit Anwendungen auf lineare Gleichungstysteme, Computing 18:15-36 (1977).
12. W. Oettli, On the solution set of a linear system with inaccurate coefficients, SIAM J. Numer. Anal. 2:115-118 (1965).
13. 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:405-409 (1964).
14. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, N.J., 1982.
15. S. Poljak and J. Rohn, Checking robust nonsingularity is NP-hard, Math. Control Signals Systems 6:1-9 (1993).
16. J. Rohn, Solving interval linear systems, Freiburger Intervallberichte 84(7):1-14 (1984).
17. J. Rohn, Systems of linear interval equations, Linear Algebra Appl. 126:39-78 (1989).
18. J. Rohn, Checking robust stability of symmetric interval matrices is NP-hard, Comment. Math. Univ. Carol. in 35:795-797 (1994).
19. J. Rohn, Enclosing solutions of linear interval equations is NP-hard, Computing 53:365-368 (1994).
20. J. Rohn, Checking bounds on solutions of linear interval equations is NP-hard, Linear Algebra Appl., to appear.
21. J. Rohn, NP-hardness results for linear algebraic problems with interval data, in Topics in Validated Computation (J. Herzberger, Ed.), North-Holland, 1994.
22. J. Rohn and V. Kreinovich, Computing exact componentwise bounds on solutions of linear systems with interval data is NP-hard, SIAM J. Matrix Anal. Appl. 16:415-420 (1995).
23. S. M. Rump, Validated solution of large linear systems, in Computing Supplementum 9, Validation Numerics (R. Albrecht, G. Alefeld, and H. J. Stetter, Eds.), Springer-Verlag, 1993, pp. 191-212.
24. S. M. Rump, Verification methods for dense and sparse systems of equations, in Topics in Validated Computations - Studies in Computational Mathematics (J. Herzberger, Ed.), Elsevier, Amsterdam, 1994, pp. 63-136.
25. H. Schwandt, An interval arithmetic approach for the construction of an almost globally convergent method for the solution of the nonlinear Poisson equation on the unit square, SIAM J. Sci. Statist. Comput. 5(2):427-452 (1984).
26. S. P. Shary, Optimal solutions of interval linear algebraic systems, Interval Comput. 2:7-30 (1991).