Skip to Main content Skip to Navigation
Journal articles

Characterizing and Approximating Eigenvalue Sets of Symmetric Interval Matrices

Abstract : We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries are perturbed, with perturbations belonging to some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner approximation algorithm, that in many case estimates exact bounds. To our knowledge, this is the first algorithm that is able to guarantee exactness. We illustrate our approach by several examples and numerical experiments.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-00907534
Contributor : David Daney <>
Submitted on : Thursday, November 21, 2013 - 1:50:15 PM
Last modification on : Tuesday, October 13, 2020 - 2:50:05 PM

Identifiers

Collections

Citation

Milan Hladïk, David Daney, Elias Tsigaridas. Characterizing and Approximating Eigenvalue Sets of Symmetric Interval Matrices. Computers and Mathematics with Applications, Elsevier, 2011, 62 (8), pp.3152--3163. ⟨10.1016/j.camwa.2011.08.028⟩. ⟨hal-00907534⟩

Share

Metrics

Record views

393