Abstract
We compare the notions of regularity and strong regularity of interval matrices. For an n × n interval matrix A we construct 2n open convex cones, all of them lying in the interior of the nonnegative orthant. It is shown that regularity of A is characterized by nonemptiness of all these cones, whereas strong regularity is characterized by nonemptiness of their intersection.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beeck, H.: Zur Problematik der Hüllenbestimmung von Intervallgleichungssystemen, in: Nickel, K. (ed.), Interval Mathematics, Lecture Notes in Computer Science 29, Springer-Verlag, Berlin, 1975, pp. 150–159.
Horn, R. A. and Johnson, C. R.: Matrix Analysis, Cambridge University Press, Cambridge, 1985.
Mayer, G. and Rohn, J.: On the Applicability of the Interval Gaussian Algorithm, Reliable Computing 4 (3) (1998), pp. 205–222.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
Neumaier, A.: Linear Interval Equations, in: Nickel, K. (ed.), Interval Mathematics, Lecture Notes in Computer Science 212, Springer-Verlag, Berlin, 1985, pp. 109–120.
Poljak, S. and Rohn, J.: Checking Robust Nonsingularity Is NP-Hard, Mathematics of Control, Signals, and Systems 6 (1993), pp. 1–9.
Rohn, J.: Systems of Linear Interval Equations, Linear Algebra and Its Applications 126 (1989), pp. 39–78.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rohn, J. How Strong Is Strong Regularity?. Reliable Comput 11, 491–493 (2005). https://doi.org/10.1007/s11155-005-0407-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11155-005-0407-7