3. Assume A = QR is the QR decomposition of A and assume A is tridiagonal and symmetric. Prove that RQ remains to be tri
Posted: Wed Jul 06, 2022 12:05 pm
3. Assume A = QR is the QR decomposition of A and assume A is tridiagonal and symmetric. Prove that RQ remains to be tridiagonal and symmetric. Even though it is not necessary, but you can assume A is non-singular in the proof. The above result shows that pure QR algorithm reserves the symmetric and tridiagonal structure. [5 marks]