Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
