The reduction of an arbitrary real square matrix to tridiagonal form using similarity transformations
C. Donald LaBudde
Abstract
Open-access reader
C. Donald LaBudde
Abstract
Open-access reader
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.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Tridiagonal matrix, Mathematics, Square matrix, Generalization, Band matrix, Matrix similarity, Matrix (chemical analysis), Reduction (mathematics)