Subspace iteration for complex symmetric eigenproblems
โ Scribed by A.Y.T. Leung
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 886 KB
- Volume
- 184
- Category
- Article
- ISSN
- 0022-460X
No coin nor oath required. For personal study only.
โฆ Synopsis
For a heavily damped system, either viscous or hysteretic or both, the homogeneous solution constitutes a generalized complex symmetric eigenproblem [A][x] = l[B]{x}, where [A] and [B] are sparse complex symmetric matrices. The general method to solve the transformed eigenproblem [B] -1 [A]{x} = l{x} is very demanding in computation and computer storage. The subspace iteration method is generalized to the complex problem. Sparsity and symmetry of the matrices are exploited and cluster eigensolutions can be handled without difficulty. A generalized Jacobi method is adopted to solve the condensed eigenproblem. FORTRAN listing and numerical examples are given.
๐ SIMILAR VOLUMES
An iterative procedure for calculating eigenvector derivatives has been developed based on the subspace iteration concept. The basic formulation is derived directly from the first variation of the resulting equations of subspace iteration for solving eigenvalue problems. Since the basic formulation