Choose the Givens rotation convention in which equals the identity outside rows and columns , and has blockin those coordinates. It is an orthogonal matrix. For any chosen column , write , and . If , take , . Then the new entries are and . If both entries vanish, take . This proves the requested elimination for each chosen ; the angle is allowed to depend on , and one angle need not eliminate an entire arbitrary row.
For the given matrix, use first for , obtainingUse the same cosine and sine for . It makesThis is already upper triangular, including the zero entry, and every leading nonzero row entry is positive. Thus the requested QR decomposition isThe orthogonal matrix property follows from the two rotations, and direct multiplication verifies .
Articles by others on the same topic
There are currently no matching articles.