ALGORITHMS FOR LARGE EIGENVALUE PROBLEMS IN VIBRATION AND BUCKLING ANALYSES

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal

View graph of relations

Author(s)

  • A.Y.T. Leung

Detail(s)

Original languageEnglish
Article number97-AA-89
Pages (from-to)1-15
Journal / PublicationAmerican Society of Mechanical Engineers (Paper)
Publication statusPublished - 1997
Externally publishedYes

Conference

TitleASME ASIA '97 Congress & Exhibition
PlaceSingapore
Period30 September - 2 October 1997

Abstract

The eigenvalue problem plays a central role in the dynamic and buckling analyses of engineering structures. In practice, one is interested in only a few dozens of the eigenmodes of a system of thousands of degrees of freedom within a particular eigenvalue range. For linear symmetric eigenproblems, [K]{x} = λ[M]{x}, the eigensolutions are well behaved. The recommendations are subspace iteration or the Lanczos method working with [A] = [K-λ0 M]-1 where λ0 is the middle of the eigenvalue range of interest. Subspace iteration gets both eigenvalues and eigenvectors. Lanczos gives the approximate eigenvalues which can easily be improved by inverse iteration to obtain the eigenvectors as by-products. For real nonsymmetric or complex symmetric linear eigenproblems and polynomial eigenproblems, the eigensolutions may be defective. All classical methods, including subspace iteration fail. We recommend to use the Lanczos method to obtain the approximate eigenvalues of interest and to improve them by a new variance of inverse iteration, one vector at a time, and to get the independent generalized vectors as by-products. We develop solution method for the special case that the approximate eigenvalue is indeed exact rendering a set of singular linear equations which can not be solved by existing algorithms.