Computing complex eigenvalues of large non-Hermitian matrices
โ Scribed by W. Kerner; K. Lerbinger; J. Steuerwald
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 887 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
โฆ Synopsis
The generalized eigenvalue problem Ax = hBx with a non-symmetric matrix A is solved by means of inverse vector iteration. The algorithm makes use of the band structure of the matrices, thus allowing quite large dimensions (d 5 3742). In the application all complex eigenvalues for the resistive Alfven modes are successively computed.
๐ SIMILAR VOLUMES
A new fast algorithm for calculating a few maximum (or minimum) eigenvalues and the corresponding eigenvectors of large N x N Hermitian matrices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic oscillators. The time step for iteration is chosen so that only