Complexity of solving linear interval equations

ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik

Volumn 76, Issue SUPPL. 3, 1996, Pages 271-274

  Rohn, J ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21444445118     PISSN: 00442267     EISSN: 15214001     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. ALEFELD, G., HERZBERGER, J.: Introduction to interval computations. Academic Press, New York 1983.
2. GAREY, M. E., JOHNSON, D. S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco 1979.
3. GOLUB, G. H., VAN LOAN, C. F.: Matrix computations. The Johns Hopkins University Press, Baltimore 1983.
4. KREINOVICH, V., LAKEYEV, A. V., NOSKOV, S. I.: Optimal solution of interval linear systems is intractable (NP-hard). Interval Computations 1 (1993), 6-14.
5. ROHN, J.: Checking positive definiteness or stability of symmetric interval matrices is NP-hard. Commentat. Math. Univ. Carolinae 35 (1994), 795-797.
6. ROHN, J.: NP-hardness results for some linear and quadratic problems. Technical Report No. 619, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague 1995, 11 p.
7. ROHN, J., KREINOVICH, V.: Computing exact componentwise bounds on solutions of linear systems with interval data is NP-hard. SIAM J. Matr. Anal. Appl. 16 (1995), 415-420.