Lanczos algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search


English Wikipedia has an article on:


Devised by Cornelius Lanczos.

Proper noun[edit]

Lanczos algorithm

  1. (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.

Related terms[edit]