The reduction of an arbitrary real square matrix to tridiagonal form using similarity transformations
C. Donald LaBudde · Mathematics of Computation · 1963
In this paper a new algorithm for reducing an arbitrary real square matrix to tri-diagonal form using real similarity transformations is described. The method is essentially a generalization of a method due to A. S. Householder for accomplishing the same reduction in the case where the matrix is real and symmetric.