Adaptation of the Lanczos Algorithm for the Solution of Buckling Eigenvalue Problems

Abstract

An adaptation of the conventional Lanczos algorithm is proposed to solve the general symmetric eigenvalue problem K λKG in the case when the geometric stiffness matrix KG is not necessarily positive-definite. The only requirement for the new algorithm to work is that matrix K must be positive-definite. Firstly, the algorithm is presented for the standard situation where no shifting is assumed. Secondly, the algorithm is extended to include shifting since this procedure may be important for enhanced precision or acceleration of convergence rates. Neither version of the algorithm requires matrix inversion, but more resources in terms of memory allocation are needed by the version with shifting.