An Algorithm for the Real Interval Eigenvalue Problem

Abstract : In this paper we present an algorithm for approximating the range of the real eigenvalues of interval matrices. Such matrices could be used to model real-life problems, where data sets suffer from bounded variations such as uncertainties (e.g. tolerances on parameters, measurement errors), or to study problems for given states. The algorithm that we propose is a subdivision algorithm that exploits so- phisticated techniques from interval analysis. The quality of the computed approximation, as well as the running time of the algorithm depend on a given input accuracy. We also present an efficient C++ implementation and illustrate its efficiency on various data sets. In most of the cases we manage to compute efficiently the exact boundary points (limited by floating point representation).
Type de document :
[Research Report] RR-6680, INRIA. 2008, pp.28
Liste complète des métadonnées

Littérature citée [28 références]  Voir  Masquer  Télécharger
Contributeur : David Daney <>
Soumis le : lundi 13 octobre 2008 - 11:37:23
Dernière modification le : samedi 7 avril 2018 - 01:18:13
Document(s) archivé(s) le : lundi 7 juin 2010 - 17:45:32


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00329714, version 1



Milan Hladik, David Daney, Elias P. Tsigaridas. An Algorithm for the Real Interval Eigenvalue Problem. [Research Report] RR-6680, INRIA. 2008, pp.28. 〈inria-00329714〉



Consultations de la notice


Téléchargements de fichiers