In linear algebra, a Householder transformation (also known as Householder reflection or elementary reflector) is a linear transformation that describes a reflection about a plane or hyperplane containing the origin. Householder transformations are widely used in numerical linear algebra, to perform QR decompositions and in the first step of the QR algorithm. The Householder transformation was introduced in 1958 by Alston Scott Householder.[1]
Its analogue over general inner product spaces is the Householder operator.
Contents |
Definition and properties
The reflection hyperplane can be defined by a unit vector v (a vector with length 1) which is orthogonal to the hyperplane. The reflection of a point x about this hyperplane is:
where v is given as a column unit vector with Hermitian transpose v*. This is a linear transformation given by the Householder matrix:
where I is the identity matrix.
The Householder matrix has the following properties:
- it is Hermitian:

- it is unitary:

- hence it is involutary:
.
Applications
Householder reflections can be used to calculate QR decompositions by reflecting first one column of a matrix onto a multiple of a standard basis vector, calculating the transformation matrix, multiplying it with the original matrix and then recursing down the (i, i) minors of that product.
They are also widely used for tridiagonalization of symmetric matrices and for transforming non-symmetric matrices to a Hessenberg form.
Tridiagonalization
This procedure is taken from the book: Numerical Analysis, Burden and Faires, 8th Edition. In the first step, to form the household matrix in each step we need to determine
and r, which are:
;
;
From
and r, construct vector v:
, where v1 = 0;,
, and
for each k=3,4 ..n
Then compute:


Having found
and compute
the process is repeated for k =2; 3 ..n as follow:
;
;


for j=k+2; k+3,..., n


Continuing in this manner, the tridiagonal and symmetric matrix is formed.
Examples
This example is taken from the book "Numerical Analysis" by Richard L. Burden (Author), J. Douglas Faires. In this example, the given matrix is transformed to the similar tridiagonal matrix A2 by using Householder Method.

Following those step in Householder Method. We have:
The first Householder matrix:
Q1 
A1 = Q1AQ1 = 
Used A1 to form Q2 =
A2 = Q2A1Q2=
As we can see, the final result is a tridiagonal symmetric matrix which is similar to the original one. The process finished after 2 steps.
Notes
- ^ Householder, A. S. (1958). "Unitary Triangularization of a Nonsymmetric Matrix". Journal of the ACM 5 (4): 339–342. doi:. MR0111128.
References
- Morrison, D.D. (1960). "Remarks on the Unitary Triangularization of a Nonsymmetric Matrix". Journal of the ACM 7 (2): 185–186. doi:. MR0114291.
- LaBudde, C.D. (1963). "The reduction of an arbitrary real square matrix to tridiagonal form using similarity transformations". Mathematics of Computation 17 (84): 433–437. MR0156455. JSTOR 2004005.
- Francesco Mezzadri, How to Generate Random Matrices from the Classical Compact Groups, Notices of the AMS, May 2007, Volume 54, Issue 5, pp. 592-604. arXiv:math-ph/0609050
External links
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)






