Power method — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
The algorithm the libraries actually run
Factorise, multiply the factors back in the other order, repeat. That description is complete and correct and produces something nobody would use — on a matrix with eigenvalues +1 and −1 it does not converge at all, and the subdiagonal entry does not move by so much as a rounding error.
A basis that is the same subspace and not the same thing
The interpolation conditions are conditions on a subspace, so any basis of it will do. The one a derivation writes down reaches a condition number of 7.7·10⁹ by its eighth vector, and the rate at which it gets there is set by a number the user chose with no information.
Named alongside it
The objects these essays reach for when they reach for this one.
BasisCondition numberConvergence orderDeflationJacobi's eigenvalue methodKrylov subspaceMoment matchingOrthogonalityPerturbationPetrov–GalerkinThe QR algorithmRational krylov