Solvability of systems of linear interval equations

SIAM Journal on Matrix Analysis and Applications

Volumn 25, Issue 1, 2004, Pages 237-245

  Rohn, Jiri ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Complexity; Linear interval equations; Linear interval inequalities; Solvability

Indexed keywords

EID: 1342288839     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801398955     Document Type: Article

References (12)

1. G. ALEFELD AND J. HERZBERGER, Introduction to Interval Computations, Academic Press, New York, 1983.
2. J. FARKAS, Theorie der einfachen Ungleichungen, J. Reine Angew. Math., 124 (1902), pp. 1-27.
3. V. KREINOVICH, A. LAKEYEV, J. ROHN, AND P. KAHL, Computational Complexity and Feasibility of Data Processing and Interval Computations, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
4. A. NEUMAIER, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, UK, 1990.
5. 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.
6. S. POLJAK AND J. ROHN, Checking robust nonsingularity is NP-hard, Math. Control Signals Systems, 6 (1993), pp. 1-9.
7. J. ROHN, Strong solvability of interval linear programming problems, Computing, 26 (1981), pp. 79-82.
8. J. ROHN, Systems of linear interval equations, Linear Algebra Appl., 126 (1989), pp. 39-78.
9. J. ROHN, An existence theorem for systems of linear equations, Linear Multilinear Algebra, 29 (1991), pp. 141-144.
10. J. ROHN, Cheap and tight bounds: The recent result by E. Hansen can be made more efficient, Interval Comput., 4 (1993), pp. 13-21.
11. J. ROHN, Linear programming with inexact data is NP-hard, Z. Angew. Math. Mech., 78, Suppl. 3, (1998), pp. S1051-S1052.
12. J. ROHN AND J. KRESLOVÁ, Linear interval inequalities, Linear Multilinear Algebra, 38 (1994), pp. 79-82.