Lanczos Algorithm

- Natural & Formal Sciences -
Mathematics & Logic Dictionary
Definition
A Krylov-subspace algorithm for Hermitian (symmetric) matrices that generates a tridiagonal matrix representation via short three-term recurrences, enabling efficient extraction of extreme eigenvalues and approximate spectral information for large sparse operators.