Advertisement

Properties of Interval Matrices II: Proofs and Auxiliary Results

  • Vladik Kreinovich
  • Anatoly Lakeyev
  • Jiří Rohn
  • Patrick Kahl
Part of the Applied Optimization book series (APOP, volume 10)

Abstract

In this chapter, we prove the results about computational complexity and feasibility of properties of interval matrices that were formulated in the previous chapter. Along the way, we also describe some important auxiliary results.

Keywords

Polynomial Time Rational Number Rational Matrix Positive Definite Matrix Positive Definiteness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Vladik Kreinovich
    • 1
  • Anatoly Lakeyev
    • 2
  • Jiří Rohn
    • 3
  • Patrick Kahl
    • 4
  1. 1.University of Texas at El PasoUSA
  2. 2.Computing CenterRussian Academy of SciencesIrkutskRussia
  3. 3.Charles University and Academy of SciencesPragueCzech Republic
  4. 4.IBMTucsonUSA

Personalised recommendations