An algorithm for addressing the real interval eigenvalue problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computational and Applied Mathematics Year : 2011

An algorithm for addressing 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 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).

Keywords

Dates and versions

hal-00907710 , version 1 (21-11-2013)

Identifiers

Cite

Milan Hladïk, David Daney, Elias P. Tsigaridas. An algorithm for addressing the real interval eigenvalue problem. Journal of Computational and Applied Mathematics, 2011, 235 (8), pp.2715 - 2730. ⟨10.1016/j.cam.2010.11.022⟩. ⟨hal-00907710⟩
127 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More