Lanczos algorithm
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Devised by Cornelius Lanczos.
Proper noun[edit]
- (computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n.