Efficient Computation of Dominant Eigenvalues Using Adaptive Block Lanczos with Chebyshev Filtering
By: M. El Guide, K. Jbilou, K. Lachhab
Potential Business Impact:
Finds important numbers in big math problems faster.
We present an efficient method for computing dominant eigenvalues of large, nonsymmetric, diagonalizable matrices based on an adaptive block Lanczos algorithm combined with Chebyshev polynomial filtering. The proposed approach improves numerical stability through two key components: (i) the Adaptive Block Lanczos (ABLE) method, which maintains biorthogonality using SVD based stabilization, and (ii) Chebyshev filtering, which enhances spectral separation via iterative polynomial filtering. Numerical experiments on dense and sparse test problems confirm the effectiveness of the ABLE Chebyshev algorithm.
Similar Papers
Momentum accelerated power iterations and the restarted Lanczos method
Numerical Analysis
Speeds up finding important numbers in big problems.
Accelerating Eigenvalue Dataset Generation via Chebyshev Subspace Filter
Machine Learning (CS)
Finds math answers much faster for computers.
Chebyshev smoothing with adaptive block-FSAI preconditioners for the multilevel solution of higher-order problems
Numerical Analysis
Solves hard math problems faster with new computer tricks.