Generalized biorthogonal bases and tridiagonalisation of matrices (Q1365846)

A minimal Lanczos algorithm is constructed. It computes a block tridiagonal Hessenberg matrix with diagonal blocks of Frobenius form and nondiagonal blocks with a single nonzero number. It needs storage of fewer basis vectors than previous implementations of look ahead. The theory is based on the equivalence between the nonsymmetric Lanczos algorithm with look ahead and biorthogonal Gram Schmidt. Relations to minimal realizations of rational functions are discussed.