An algorithm for addressing the real interval eigenvalue problem
✍ Scribed by Milan Hladík; David Daney; Elias P. Tsigaridas
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 511 KB
- Volume
- 235
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
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).
📜 SIMILAR VOLUMES
We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg's isometric Arnoldi process. The implicit restarts are done by the Krylov-Schur methodo
## Abstract A simple, rapidly convergent procedure is described for solving a third‐order symmetric eigenvalue problem Au = λ Bu typically arising in vibration analysis. The eigenvalue problem is represented in terms of its variational dual, the Rayleigh quotient, and the eigenosolution is obtained
In this paper we present a new algorithm to parameterize some kind of hypersurfaces. Our technique extends the Newton-Puiseux algorithm for plane curves to several variables. It is based on the introduction of an order in the monomials of several variables compatible with the total degree and in a r