Computer Science – Robotics
Scientific paper
2011-02-21
Computer Science
Robotics
Scientific paper
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.
Daney David
Hladik Milan
Tsigaridas Elias
No associations
LandOfFree
Characterizing and approximating eigenvalue sets of symmetric interval matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Characterizing and approximating eigenvalue sets of symmetric interval matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizing and approximating eigenvalue sets of symmetric interval matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-520370