Skip to Main content Skip to Navigation

On the Exponentiation of Interval Matrices

Abstract : The numerical computation of the exponentiation of a real matrix has been intensively studied. The main objective of a good numerical method is to deal with round-off errors and computational cost. The situation is more complicated when dealing with interval matrices exponentiation: Indeed, the main problem will now be the dependency loss of the different occurrences of the variables due to interval evaluation, which may lead to so wide enclosures that they are useless. In this paper, the problem of computing a sharp enclosure of the interval matrix exponential is proved to be NP-hard. Then the scaling and squaring method is adapted to interval matrices and shown to drastically reduce the dependency loss w.r.t. the interval evaluation of the Taylor series.
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download
Contributor : Alexandre Goldsztejn <>
Submitted on : Thursday, August 27, 2009 - 10:34:22 AM
Last modification on : Thursday, July 4, 2019 - 3:30:02 PM
Document(s) archivé(s) le : Tuesday, June 15, 2010 - 10:50:01 PM


Files produced by the author(s)


  • HAL Id : hal-00411330, version 1
  • ARXIV : 0908.3954



Alexandre Goldsztejn, Arnold Neumaier. On the Exponentiation of Interval Matrices. 2009. ⟨hal-00411330v1⟩



Record views


Files downloads