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 sophisticated techniques from interval analysis. The quality of the computed approximation and 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).
https://hal.inria.fr/hal-00907710
Contributeur : David Daney
<>
Soumis le : jeudi 21 novembre 2013 - 16:04:16
Dernière modification le : samedi 27 janvier 2018 - 01:30:41
Milan Hladïk, David Daney, Elias Tsigaridas. An algorithm for addressing the real interval eigenvalue problem. Journal of Computational and Applied Mathematics, Elsevier, 2011, 235 (8), pp.2715 - 2730. 〈10.1016/j.cam.2010.11.022〉. 〈hal-00907710〉
