Chebyshev filtering Lanczos' process in the subspace iteration method

Chee Hoong Loh · International Journal for Numerical Methods in Engineering · 1984

Abstract Bathe's basic algorithm of subspace iteration for the solution of the symmetric eigenvalue problem is improved by including a Chebyshev filtering mechanism. To obtain satisfactory convergence for the largest eigenvalues, a shifting strategy is adopted. The shift factor is approximately computed by the Lanczos process.

Read the paper · More papers on PaperTik