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 stu
An algorithm for an eigenvalues problem in the Earth rotation theory
✍ Scribed by Ana B. González; Juan Getino; JoséM. Farto
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 580 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
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 recursive construction of a sequence of convex-hulls together with a tree search. We have developed this algorithm to determine the free frequencies (appearing as eigenvalues of a certain matrix) of realistic non-rigid Earth rotation models. We have implemented the algorithm in a Maple V package called ~oli3e'ar. (~) 1999 Elsevier Science B.V. All rights reserved.
📜 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