Properties of Interval Matrices I: Main Results
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.
KeywordsPositive Definiteness Time Time Interval Computation Previous Chapter Interval Matrix
Unable to display preview. Download preview PDF.