Left multiplication by the given Givens rotation mixes rows two and three, so . If , chooseEquivalently modulo . Substitution gives and . If , take ; the desired zero is already present. This also covers singular matrices without division by zero.
The second Givens rotation leaves row three unchanged, so . Its other relevant entry is . For , takeThen and . If both entries vanish, choose . The first column now has zeros below its diagonal.
Rows two and three of both have zero in column one. Any rotation of these rows therefore preserves those zeros, so . In column two, . For , chooseThis gives . Again choose if both relevant entries are zero. Thus the successive Givens rotations have eliminated all entries below the diagonal without recreating earlier ones.
Each plane rotation satisfies . Hence is an orthogonal matrix and is an upper triangular matrix. Multiplication by gives the QR decompositionThe zero-pair cases already handled make this construction valid for every real matrix, including rank-deficient matrices. Orthogonality follows from the product identity, not from any invertibility assumption on .
Articles by others on the same topic
There are currently no matching articles.