Abstract
In the previous chapters, we analyzed the computational complexity and feasibility of the problems in which the main goal was to compute a number (or an interval). In many practical situations, however, we are not interested in the exact value of this number; all we need to know is whether a certain property is true or not: e.g., whether a given controlled system is stable, etc. It turns out that the most interesting practical problems of this type relate to numerical and interval-values matrices: to check whether a given matrix is regular, positive definite, stable, etc.
In this chapter, we describe the main results related to computational complexity and feasibility of such problems. Proofs and several important auxiliary results are presented in the next chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P. (1998). Properties of Interval Matrices I: Main Results. In: Computational Complexity and Feasibility of Data Processing and Interval Computations. Applied Optimization, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2793-7_21
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2793-7_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4785-7
Online ISBN: 978-1-4757-2793-7
eBook Packages: Springer Book Archive