Linear buckling analysis entails the solution of a generalized eigenvalue problem. Popular methods for solving such problems tend to be memory-hungry, and therefore slow for large degrees of freedom.
The main contribution of this paper is a low-memory assembly-free linear buckling analysis method. In particular, we employ the classic inverse iteration, in conjunction with an assembly-free deflated linear solver. The resulting implementation is simple, fast and particularly well suited for parallelization. The proposed method is used here to solve large scale 3D topology optimization problems subject to buckling constraints, where buckling problems must be solved repeatedly.