QR Decomposition

Let be a matrix such that and , then there exists an orthogonal matrix and an upper triangular matrix such that .

With this decomposition we can solve equations easily using the properties of orthogonal matrices:

How to get and

To find and we first express as follows:

Now since we know that . We can now apply the Gram-Schmidt Method with normalization to get an Orthonormal Basis that spans which we will call . Next we project onto our new basis by doing the following:

We can then write the system of equations in a compact way:

This gives us the thin QR Decomposition of , in particular, is the thin QR Decomposition of when:

  • Columns of form an orthonormal basis of .
  • is a square matrix.

To get the Full QR Decomposition of we need to have orthonormal columns, in the thin decomposition we only had to get those extra columns we use the orthonormal basis of to do this we may want to use properties of Fundamental Subspaces to realize that , once we find this we can use the Gram-Schmidt Method again with normalization to get which we can then combine into a matrix . Finally we get that:

Note

This is the same as the thin QR from before, so we use thin QR practically but when doing proofs we are using the full QR decomposition.

Example

Go to Find QR Decomposition to see a worked example of finding the QR decomposition of a matrix.