Forty necessary and sufficient conditions for regularity of interval matrices: A survey

Electronic Journal of Linear Algebra

Volumn 18, Issue , 2009, Pages 500-512

  Rohn, Jiri ^a  

^a Anglo American College   (Czech Republic)

Author keywords

Algorithm; Interval matrix; Necessary and sufficient condition; Regularity; Singularity

Indexed keywords

EID: 70349464603     PISSN: None     EISSN: 10813810     Source Type: Journal    
DOI: 10.13001/1081-3810.1327     Document Type: Article

References (30)

1. VERINTERVALHULL: Verified interval hull of the solution set of a system of interval linear equations, 2007. Available at http://www.cs.cas.cz/rohn/ matlab/verintervalhull.html.
2. VERREGSING: Verified regularity/singularity of an interval matrix, 2007. Available at http://www.cs.cas.cz/rohn/matlab/verregsing.html.
3. VERSOFT: Verification software in MATLAB/INTLAB, 2009. Available at http://www.cs.cas.cz/rohn/matlab.
4. H. Beeck. Charakterisierung der Lösungsmenge von Intervallgleichungssystemen. Zeitschrift für Angewandte Mathematik und Mechanik, 53:T181-T182, 1973.
5. H. Beeck. Zur Problematik der Hüllenbestimmung von Intervallgleichungssystemen. In K. Nickel, editor, Interval Mathematics, Lecture Notes in Computer Science 29, pp. 150-159, Berlin, 1975. Springer-Verlag.
6. M. Fiedler, J. Nedoma, J. Ramík, J. Rohn, and K. Zimmermann. Linear Optimization Problems with Inexact Data. Springer-Verlag, New York, 2006.
7. C. V. Hollot and A. C. Bartlett. On the eigenvalues of interval matrices. Proceedings of the 26th Conference on Decision and Control, Los Angeles, CA, pp. 794-799, 1987.
8. C. Jansson. Calculation of exact bounds for the solution set of linear interval systems. Linear Algebra and its Applications, 251:321-340, 1997.
9. C. Jansson and J. Rohn. An algorithm for checking regularity of interval matrices. SIAM Journal on Matrix Analysis and Applications, 20:756-776, 1999.
10. V. Kreinovich, A. Lakeyev, J. Rohn, and P. Kahl. Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer Academic Publishers, Dordrecht, 1998.
11. J. Kuttler. A fourth-order finite-difference approximation for the fixed membrane eigenproblem. Mathematics of Computation, 25:237-256, 1971.
12. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, 1990.
13. W. Oettli and W. Prager. Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides. Numerische Mathematik, 6:405-409, 1964.
14. S. Poljak and J. Rohn. Checking robust nonsingularity is NP-hard. Mathematics of Control, Signals, and Systems, 6:1-9, 1993.
15. J. Rohn. Solution of a problem proposed by K. RosOlaniec on March 12, 1999. Submission to the reliable computing net of March 15, 1999.
16. J. Rohn. Inverse-positive interval matrices. Zeitschrift für Angewandte Mathematik und Mechanik, 67:T492-T493, 1987.
17. J. Rohn. Systems of linear interval equations. Linear Algebra and its Applications, 126:39-78, 1989.
18. J. Rohn. An existence theorem for systems of linear equations. Linear and Multilinear Algebra, 29:141-144, 1991.
19. J. Rohn. Cheap and tight bounds: The recent result by E. Hansen can be made more efficient. Interval Computations, 4:13-21, 1993.
20. J. Rohn. Interval matrices: Singularity and real eigenvalues. SIAM Journal on Matrix Analysis and Applications, 14:82-91, 1993.
21. J. Rohn. Inverse interval matrix. SIAM Journal on Numerical Analysis, 30:864-870, 1993.
22. 1 is NP-hard. Linear and Multilinear Algebra, 47:195-204, 2000.
23. J. Rohn. Solvability of systems of linear interval equations. SIAM Journal on Matrix Analysis and Applications, 25:237-245, 2003.
24. J. Rohn. Atheor em of the alternatives for the equation Ax+B|x| = b. Linear and Multilinear Algebra, 52:421-426, 2004.
25. J. Rohn. Ahandb ook of results on interval linear problems, 2005. Internet text available at http://www.cs.cas.cz/rohn/handbook.
26. J. Rohn. Linear interval equations: Midpoint preconditioning may produce a 100% overestimation for arbitrarily narrow data even in case n = 4. Reliable Computing, 11:129-135, 2005.
27. J. Rohn. Regularity of interval matrices and theorems of the alternatives. Reliable Computing, 12:99-105, 2006.
28. J. Rohn and V. Kreinovich. Computing exact componentwise bounds on solutions of linear systems with interval data is NP-hard. SIAM Journal on Matrix Analysis and Applications, 16:415-420, 1995.
29. S. M. Rump. Verification methods for dense and sparse systems of equations. In J. Herzberger, editor, Topics in Validated Computations, pages 63-135, Amsterdam, 1994. North-Holland.
30. S. M. Rump. INTLAB - INTerval LABoratory, 2009. Available at http://www.ti3.tuharburg.de/rump/intlab.