A Simple Proof of the Transposed QR Algorithm
Authors:
- R. R. BurnsideRBR. R. Burnside
- P. B. GuestPGP. B. Guest
- 1 June 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 38 (2) , 306-308
Abstract
This paper presents a simple proof of the transposed QR algorithm which permits the singular value decomposition of a matrix to be introduced to a first course in matrix algebra in the context of iterative procedures.Keywords
This publication has 5 references indexed in Scilit:
- A TQR-iteration based adaptive SVD for real time angle and frequency trackingIEEE Transactions on Signal Processing, 1994
- A Bottom-Up Inductive Proof of the Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 1994
- On the Early History of the Singular Value DecompositionSIAM Review, 1993
- Robust Singular Value Decompositions: A New Approach to Projection PursuitJournal of the American Statistical Association, 1993
- Numerical Mathematics1991