Householder transformation

In linear algebra, a Householder transformation (also known as a Householder reflection or elementary reflector) is a linear transformation that describes a reflection about a plane or hyperplane containing the origin. The Householder transformation was used in a 1958 paper by Alston Scott Householder. ^[1]

Its analogue over general inner product spaces is the Householder operator.

Definition

Transformation

The reflection hyperplane can be defined by its normal vector, a unit vector ${\textstyle v}$ (a vector with length ${\textstyle 1}$) that is orthogonal to the hyperplane. The reflection of a point ${\textstyle x}$ about this hyperplane is the linear transformation:

${\displaystyle x-2\langle x,v\rangle v=x-2v\left(v^{*}x\right),}$

where ${\textstyle v}$ is given as a column unit vector with conjugate transpose ${\textstyle v^{\textsf {*}}}$.

The Householder transformation acting as a reflection of ${\displaystyle x}$ about the hyperplane defined by ${\displaystyle v}$.

Householder matrix

The matrix constructed from this transformation can be expressed in terms of an outer product as:

${\displaystyle P=I-2vv^{*}}$

is known as the Householder matrix, where ${\textstyle I}$ is the identity matrix.

Properties

The Householder matrix has the following properties:

• it is Hermitian: ${\textstyle P=P^{*}}$,
• it is unitary: ${\textstyle P^{-1}=P^{*}}$ (via the Sherman-Morrison formula),
• hence it is involutory: ${\textstyle P=P^{-1}}$.
• A Householder matrix has eigenvalues ${\textstyle \pm 1}$. To see this, notice that if ${\textstyle x}$ is orthogonal to the vector ${\textstyle v}$ which was used to create the reflector, then ${\textstyle P_{v}x=(I-2vv^{*})x=x-2<v,x>v=x}$, i.e., ${\textstyle 1}$ is an eigenvalue of multiplicity ${\textstyle n-1}$, since there are ${\textstyle n-1}$ independent vectors orthogonal to ${\textstyle v}$. Also, notice ${\textstyle P_{v}v=(I-2vv^{*})v=v-2<v,v>v=-v}$ (since ${\displaystyle v}$ is by definition a unit vector), and so ${\textstyle -1}$ is an eigenvalue with multiplicity ${\textstyle 1}$.
• The determinant of a Householder reflector is ${\textstyle -1}$, since the determinant of a matrix is the product of its eigenvalues, in this case one of which is ${\textstyle -1}$ with the remainder being ${\textstyle 1}$ (as in the previous point), or via the Matrix determinant lemma.

Applications

Geometric optics

In geometric optics, specular reflection can be expressed in terms of the Householder matrix (see Specular reflection § Vector formulation ).

Numerical linear algebra

Householder transformations are widely used in numerical linear algebra, for example, to annihilate the entries below the main diagonal of a matrix, ^[2] to perform QR decompositions and in the first step of the QR algorithm. They are also widely used for transforming to a Hessenberg form. For symmetric or Hermitian matrices, the symmetry can be preserved, resulting in tridiagonalization. ^[3]

QR decomposition

Main article: QR_decomposition § Using_Householder_reflections

Householder transformations can be used to calculate a QR decomposition. Consider a matrix tridiangularized up to column ${\displaystyle i}$, then our goal is to construct such Householder matrices that act upon the principal submatrices of a given matrix

${\displaystyle {\begin{bmatrix}a_{11}&a_{12}&\cdots &&&a_{1n}\\0&a_{22}&\cdots &&&a_{1n}\\\vdots &&\ddots &&&\vdots \\0&\cdots &0&x_{1}=a_{ii}&\cdots &a_{in}\\0&\cdots &0&\vdots &&\vdots \\0&\cdots &0&x_{n}=a_{ni}&\cdots &a_{nn}\end{bmatrix}}}$

via the matrix

${\displaystyle {\begin{bmatrix}I_{i-1}&0\\0&P_{v}\end{bmatrix}}}$.

(note that we already established before that Householder transformations are unitary matrices, and since the multiplication of unitary matrices is itself a unitary matrix, this gives us the unitary matrix of the QR decomposition)

If we can find a ${\displaystyle {\vec {v}}}$ so that

${\displaystyle P_{v}{\vec {x}}={\vec {e}}_{1}}$

we could accomplish this. Thinking geometrically speaking, we are looking for a plane so that the reflection of ${\displaystyle {\overline {v}}}$ about the plane happens to land directly on the basis vector. In other words,

${\displaystyle {\vec {x}}-2(<{\vec {x}},{\vec {v}}>){\vec {v}}=\alpha {\vec {e}}_{1}}$

1

for some constant ${\displaystyle \alpha }$. However, this also shows that

${\displaystyle {\vec {v}}\propto {\vec {x}}-\alpha {\vec {e}}_{1}}$.

And since ${\displaystyle {\vec {v}}}$ is a unit vector, this means that

${\displaystyle {\vec {v}}=\pm {\frac {{\vec {x}}-\alpha {\vec {e}}_{1}}{\vert \vert {\vec {x}}-\alpha {\vec {e}}_{1}\vert \vert _{2}}}}$

2

Now if we apply equation ( 2 ) back into equation ( 1 ).

${\displaystyle {\vec {x}}-\alpha {\vec {e}}_{1}=2(<{\vec {x}},{\frac {{\vec {x}}-\alpha {\vec {e}}_{1}}{\vert \vert {\vec {x}}-\alpha {\vec {e}}_{1}\vert \vert _{2}}}>){\frac {{\vec {x}}-\alpha {\vec {e}}_{1}}{\vert \vert {\vec {x}}-\alpha {\vec {e}}_{1}\vert \vert _{2}}}}$

Or, in other words, by comparing the scalars in front of the vector ${\displaystyle {\vec {x}}-\alpha {\vec {e}}_{1}}$ we must have

${\displaystyle \vert \vert {\vec {x}}-\alpha {\vec {e}}_{1}\vert \vert _{2}^{2}=2(<{\vec {x}},{\vec {x}}-\alpha e_{1}>)}$.

Or

${\displaystyle 2(\vert \vert {\vec {x}}\vert \vert _{1}^{2}-\alpha x_{1})=\vert \vert {\vec {x}}\vert \vert _{2}^{2}-2\alpha x_{1}+\alpha ^{2}}$

Which means that we can solve for ${\displaystyle \alpha }$ as

${\displaystyle \alpha =\pm \vert \vert {\vec {x}}\vert \vert _{2}^{2}}$

This completes the construction; however, in practice we want to avoid catastrophic cancellation in equation ( 2 ). To do so, we choose the sign of ${\displaystyle \alpha }$ so that

${\displaystyle \alpha =sign(Re(x_{1}))\vert \vert {\vec {x}}\vert \vert _{2}^{2}}$ ^[4]

Tridiagonalization

Main article: Tridiagonal matrix

This procedure is presented in Numerical Analysis by Burden and Faires, and works when the matrix is symmetric. In the non-symmetric case, it is still useful as a similar procedure can result in a Hessenberg matrix.

It uses a slightly altered ${\displaystyle \operatorname {sgn} }$ function with ${\displaystyle \operatorname {sgn} (0)=1}$. ^[5] In the first step, to form the Householder matrix in each step we need to determine ${\textstyle \alpha }$ and ${\textstyle r}$, which are:

${\displaystyle {\begin{aligned}\alpha &=-\operatorname {sgn} \left(a_{21}\right){\sqrt {\sum _{j=2}^{n}a_{j1}^{2}}};\\r&={\sqrt {{\frac {1}{2}}\left(\alpha ^{2}-a_{21}\alpha \right)}};\end{aligned}}}$

From ${\textstyle \alpha }$ and ${\textstyle r}$, construct vector ${\textstyle v}$:

${\displaystyle v^{(1)}={\begin{bmatrix}v_{1}\\v_{2}\\\vdots \\v_{n}\end{bmatrix}},}$

where ${\textstyle v_{1}=0}$, ${\textstyle v_{2}={\frac {a_{21}-\alpha }{2r}}}$, and

${\displaystyle v_{k}={\frac {a_{k1}}{2r}}}$ for each ${\displaystyle k=3,4\ldots n}$

Then compute:

${\displaystyle {\begin{aligned}P^{1}&=I-2v^{(1)}\left(v^{(1)}\right)^{\textsf {T}}\\A^{(2)}&=P^{1}AP^{1}\end{aligned}}}$

Having found ${\textstyle P^{1}}$ and computed ${\textstyle A^{(2)}}$ the process is repeated for ${\textstyle k=2,3,\ldots ,n-2}$ as follows:

${\displaystyle {\begin{aligned}\alpha &=-\operatorname {sgn} \left(a_{k+1,k}^{k}\right){\sqrt {\sum _{j=k+1}^{n}\left(a_{jk}^{k}\right)^{2}}}\\[2pt]r&={\sqrt {{\frac {1}{2}}\left(\alpha ^{2}-a_{k+1,k}^{k}\alpha \right)}}\\[2pt]v_{1}^{k}&=v_{2}^{k}=\cdots =v_{k}^{k}=0\\[2pt]v_{k+1}^{k}&={\frac {a_{k+1,k}^{k}-\alpha }{2r}}\\v_{j}^{k}&={\frac {a_{jk}^{k}}{2r}}{\text{ for }}j=k+2,\ k+3,\ \ldots ,\ n\\P^{k}&=I-2v^{(k)}\left(v^{(k)}\right)^{\textsf {T}}\\A^{(k+1)}&=P^{k}A^{(k)}P^{k}\end{aligned}}}$

Continuing in this manner, the tridiagonal and symmetric matrix is formed.

Examples

In this example, also from Burden and Faires, ^[5] the given matrix is transformed to the similar tridiagonal matrix A₃ by using the Householder method.

${\displaystyle \mathbf {A} ={\begin{bmatrix}4&1&-2&2\\1&2&0&1\\-2&0&3&-2\\2&1&-2&-1\end{bmatrix}},}$

Following those steps in the Householder method, we have:

The first Householder matrix:

${\displaystyle {\begin{aligned}Q_{1}&={\begin{bmatrix}1&0&0&0\\0&-{\frac {1}{3}}&{\frac {2}{3}}&-{\frac {2}{3}}\\0&{\frac {2}{3}}&{\frac {2}{3}}&{\frac {1}{3}}\\0&-{\frac {2}{3}}&{\frac {1}{3}}&{\frac {2}{3}}\end{bmatrix}},\\A_{2}=Q_{1}AQ_{1}&={\begin{bmatrix}4&-3&0&0\\-3&{\frac {10}{3}}&1&{\frac {4}{3}}\\0&1&{\frac {5}{3}}&-{\frac {4}{3}}\\0&{\frac {4}{3}}&-{\frac {4}{3}}&-1\end{bmatrix}},\end{aligned}}}$

Used ${\textstyle A_{2}}$ to form

${\displaystyle {\begin{aligned}Q_{2}&={\begin{bmatrix}1&0&0&0\\0&1&0&0\\0&0&-{\frac {3}{5}}&-{\frac {4}{5}}\\0&0&-{\frac {4}{5}}&{\frac {3}{5}}\end{bmatrix}},\\A_{3}=Q_{2}A_{2}Q_{2}&={\begin{bmatrix}4&-3&0&0\\-3&{\frac {10}{3}}&-{\frac {5}{3}}&0\\0&-{\frac {5}{3}}&-{\frac {33}{25}}&{\frac {68}{75}}\\0&0&{\frac {68}{75}}&{\frac {149}{75}}\end{bmatrix}},\end{aligned}}}$

As we can see, the final result is a tridiagonal symmetric matrix which is similar to the original one. The process is finished after two steps.

Quantum Computation

Main article: Grover's_algorithm § Geometric_proof_of_correctness

Picture showing the geometric interpretation of the first iteration of Grover's algorithm. The state vector ${\displaystyle |s\rangle }$ is rotated towards the target vector ${\displaystyle |\omega \rangle }$ as shown.

As unitary matrices are useful in quantum computation, and Householder transformations are unitary, they are very useful in quantum computing. One of the central algorithms where they're useful is Grover's algorithm, where we are trying to solve for a representation of an oracle function represented by what turns out to be a Householder transformation:

${\displaystyle {\begin{cases}U_{\omega }|x\rangle =-|x\rangle &{\text{for }}x=\omega {\text{, that is, }}f(x)=1,\\U_{\omega }|x\rangle =|x\rangle &{\text{for }}x\neq \omega {\text{, that is, }}f(x)=0.\end{cases}}}$

(here the ${\displaystyle |x\rangle }$ is part of the Bra-ket notation and is analogous to ${\displaystyle {\vec {x}}}$ which we were using previously)

This is done via an algorithm that iterates via the oracle function ${\displaystyle U_{\omega }}$ and another operator ${\displaystyle U_{s}}$ known as the Grover diffusion operator defined by

${\displaystyle |s\rangle ={\frac {1}{\sqrt {N}}}\sum _{x=0}^{N-1}|x\rangle .}$ and ${\displaystyle U_{s}=2\left|s\right\rangle \!\!\left\langle s\right|-I}$.

Computational and theoretical relationship to other unitary transformations

See also: Rotation (mathematics)

The Householder transformation is a reflection about a hyperplane with unit normal vector ${\textstyle v}$, as stated earlier. An ${\textstyle N}$-by-${\textstyle N}$ unitary transformation ${\textstyle U}$ satisfies ${\textstyle UU^{*}=I}$. Taking the determinant (${\textstyle N}$-th power of the geometric mean) and trace (proportional to arithmetic mean) of a unitary matrix reveals that its eigenvalues ${\textstyle \lambda _{i}}$ have unit modulus. This can be seen directly and swiftly:

${\displaystyle {\begin{aligned}{\frac {\operatorname {Trace} \left(UU^{*}\right)}{N}}&={\frac {\sum _{j=1}^{N}\left|\lambda _{j}\right|^{2}}{N}}=1,&\operatorname {det} \left(UU^{*}\right)&=\prod _{j=1}^{N}\left|\lambda _{j}\right|^{2}=1.\end{aligned}}}$

Since arithmetic and geometric means are equal if the variables are constant (see inequality of arithmetic and geometric means), we establish the claim of unit modulus.

For the case of real valued unitary matrices we obtain orthogonal matrices, ${\textstyle UU^{\textsf {T}}=I}$. It follows rather readily (see orthogonal matrix) that any orthogonal matrix can be decomposed into a product of 2 by 2 rotations, called Givens Rotations, and Householder reflections. This is appealing intuitively since multiplication of a vector by an orthogonal matrix preserves the length of that vector, and rotations and reflections exhaust the set of (real valued) geometric operations that render invariant a vector's length.

The Householder transformation was shown to have a one-to-one relationship with the canonical coset decomposition of unitary matrices defined in group theory, which can be used to parametrize unitary operators in a very efficient manner. ^[6]

Finally we note that a single Householder transform, unlike a solitary Givens transform, can act on all columns of a matrix, and as such exhibits the lowest computational cost for QR decomposition and tridiagonalization. The penalty for this "computational optimality" is, of course, that Householder operations cannot be as deeply or efficiently parallelized. As such Householder is preferred for dense matrices on sequential machines, whilst Givens is preferred on sparse matrices, and/or parallel machines.

See also

• Block reflector
• Givens rotation
• Jacobi rotation

Notes

1. Householder, A. S. (1958). "Unitary Triangularization of a Nonsymmetric Matrix" (PDF). Journal of the ACM . 5 (4): 339–342. doi:10.1145/320941.320947. MR   0111128. S2CID   9858625.
2. Taboga, Marco. "Householder matrix, Lectures on matrix algebra".
3. Schabauer, Hannes; Pacher, Christoph; Sunderland, Andrew G.; Gansterer, Wilfried N. (2010-05-01). "Toward a parallel solver for generalized complex symmetric eigenvalue problems". Procedia Computer Science. 1 (1): 437–445. doi: 10.1016/j.procs.2010.04.047 .
4. Saad, Yousef (2003). Iterative methods for sparse linear systems. Society for Industrial and Applied Mathematics. pp. 11–12.
5. Burden, Richard; Faires, Douglas; Burden, Annette (2016). Numerical analysis (10th ed.). Thomson Brooks/Cole. ISBN   9781305253667.
6. Renan Cabrera; Traci Strohecker; Herschel Rabitz (2010). "The canonical coset decomposition of unitary matrices through Householder transformations". Journal of Mathematical Physics . 51 (8): 082101. arXiv: 1008.2477 . Bibcode:2010JMP....51h2101C. doi:10.1063/1.3466798. S2CID   119641896.

References

• LaBudde, C.D. (1963). "The reduction of an arbitrary real square matrix to tridiagonal form using similarity transformations". Mathematics of Computation . 17 (84). American Mathematical Society: 433–437. doi:10.2307/2004005. JSTOR   2004005. MR   0156455.
• Morrison, D.D. (1960). "Remarks on the Unitary Triangularization of a Nonsymmetric Matrix". Journal of the ACM . 7 (2): 185–186. doi: 10.1145/321021.321030 . MR   0114291. S2CID   23361868.
• Cipra, Barry A. (2000). "The Best of the 20th Century: Editors Name Top 10 Algorithms". SIAM News. 33 (4): 1. (Herein Householder Transformation is cited as a top 10 algorithm of this century)
• Press, WH; Teukolsky, SA; Vetterling, WT; Flannery, BP (2007). "Section 11.3.2. Householder Method". Numerical Recipes: The Art of Scientific Computing (3rd ed.). New York: Cambridge University Press. ISBN   978-0-521-88068-8. Archived from the original on 2011-08-11. Retrieved 2011-08-13.