Skip to Main content Skip to Navigation
Reports

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 perturb in 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 guaran- tee exactness. We illustrate our approach by several examples and numerical experiments.
Document type :
Reports
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/inria-00567385
Contributor : David Daney <>
Submitted on : Monday, February 21, 2011 - 10:22:53 AM
Last modification on : Saturday, April 7, 2018 - 1:18:21 AM
Long-term archiving on: : Sunday, May 22, 2011 - 2:46:20 AM

Files

RR-7544.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00567385, version 1
  • ARXIV : 1102.4180

Collections

Citation

Milan Hladik, David Daney, Elias Tsigaridas. Characterizing and approximating eigenvalue sets of symmetric interval matrices. [Research Report] RR-7544, INRIA. 2011, pp.22. ⟨inria-00567385⟩

Share

Metrics

Record views

415

Files downloads

501