Triangularization
Given the following 3x3 Matrix, perform two iterations of the Given's Rotation to bring the matrix to an upper Triangular matrix in order to compute the QR decomposition.
In order to form the desired matrix, we must zero elements (2,1) and (3,2). We first select element (2,1) to zero. Using a rotation matrix of:
We have the following matrix multiplication:
Where:
Plugging in these values for c and s and performing the matrix multiplication above yields a new A of:
We now want to zero element (3,2) to finish off the process. Using the same idea as before, we have a rotation matrix of:
We are presented with the following matrix multiplication:
Where:
Plugging in these values for c and s and performing the multiplications gives us a new matrix of:
This new matrix R is the upper triangular matrix needed to perform an iteration of the QR decomposition. Q is now formed using the transpose of the rotation matrices in the following manner:
Performing this matrix multiplication yields:
This completes two iterations of the Givens Rotation and calculating the QR decomposition can now be done.
Read more about this topic: Givens Rotation