Paper 3, Section II, D

Numerical Analysis | Part IB, 2012

Define the QR factorization of an m×nm \times n matrix AA and explain how it can be used to solve the least squares problem of finding the vector xRnx^{*} \in \mathbb{R}^{n} which minimises Axb\left\|A x^{*}-b\right\|, where bRm,m>nb \in \mathbb{R}^{m}, m>n, and the norm is the Euclidean one.

Define a Householder transformation HH and show that it is an orthogonal matrix.

Using a Householder transformation, solve the least squares problem for

A=[115015003004],b=[1212]A=\left[\begin{array}{rrr} 1 & -1 & 5 \\ 0 & 1 & 5 \\ 0 & 0 & 3 \\ 0 & 0 & 4 \end{array}\right], \quad b=\left[\begin{array}{r} 1 \\ 2 \\ -1 \\ 2 \end{array}\right]

giving both xx^{*} and Axb\left\|A x^{*}-b\right\|.

Typos? Please submit corrections to this page on GitHub.