A fast iterative algorithm for eigenvalue determination
✍ Scribed by R.P. West; M.N. Pavlović
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 755 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0045-7949
No coin nor oath required. For personal study only.
✦ Synopsis
The task of establishing analytically the natural frequencies of vibration of a partially embedded beam gives rise to a particular difficulty because, frequently, the modes are clustered in close proximity to each other Due to this, and the fact that the exact formulated solution is in the form of a nonsymmetrical eigenvalue problem, neither of the established techniques (using either crude graphical methods or tb: infallible algorithmic methods which are based on a stiffness-matrix approach) can be utilized directI!/ in the solution of this problem. Consequently an alternative technique is proposed which makes use of the concept of sign counting of the main diagonal of the upper triangular form of the solution matrix introduced in the earlier methods. An efficient algorithm is developed which allows near-infallible detection of eigenvalues by using a dynamic increment in the search for diagonal element sign pattern changes. This paper outlines the main features of this procedure and provides a typical example to illustrate its operation.
📜 SIMILAR VOLUMES
We discuss an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. With some assumptions, we show that the algorithm approximates the roots within about log ρ/ χ(P ) iter
We study inexact subspace iteration for solving generalized non-Hermitian eigenvalue problems with spectral transformation, with focus on a few strategies that help accelerate preconditioned iterative solution of the linear systems of equations arising in this context. We provide new insights into a