Lanczos algorithm — where it appears
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
An eigenvalue that arrives twice
A matrix with forty distinct eigenvalues, handed to Lanczos for eighty steps, returns twenty-five extra copies of thirteen of them — the largest arriving five times. Every copy is accurate to 1.9·10⁻⁸ relative. No arithmetic error was made, nothing overflowed, and a caller counting eigenvalues gets the wrong multiplicity from a computation in which no individual number is wrong.
Restarting is a filter
A restart throws away the Ritz values it does not want and begins again from a new starting vector. Written in the eigenbasis, that vector's components have been multiplied by a polynomial with its roots at the discarded values — measured component by component, and agreeing with the polynomial to rounding.
An eigenvalue one vector cannot see
A matrix with an exactly doubled eigenvalue at 10. Twelve Lanczos steps find it once; twenty-four find it once, on a Krylov space of dimension 23 in a 24-dimensional problem. A block of two vectors finds it twice. This is not slow convergence — the second copy is not in the space.
Named alongside it
The objects these essays reach for when they reach for this one.
Krylov subspaceRitz valuesInvariant subspaceMultiplicityReorthogonalisationThree term recurrenceBlock methodsEigenvalue gapEigenvaluesEigenvector conditioningFilter factorsOrthogonality