The Lanczos algorithm, also called the Lanczos method, is an algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.
Lanczos Algorithm
See also
Eigenvalue, EigenvectorExplore with Wolfram|Alpha
References
Chung, F. R. K. Spectral Graph Theory. Providence, RI: Amer. Math. Soc., 1997.Demmel, J. "CS 267: Notes for Lecture 23, April 9, 1999. Graph Partitioning, Part 2." https://people.eecs.berkeley.edu/~demmel/cs267/lecture20/lecture20.html.Referenced on Wolfram|Alpha
Lanczos AlgorithmCite this as:
Weisstein, Eric W. "Lanczos Algorithm." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/LanczosAlgorithm.html