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.

The reflection hyperplane can be defined by its *normal vector*, a unit vector (a vector with length ) that is orthogonal to the hyperplane. The reflection of a point about this hyperplane is the linear transformation:

where is given as a column unit vector with conjugate transpose .

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

is known as the **Householder matrix**, where is the identity matrix.

The Householder matrix has the following properties:

- it is Hermitian: ,
- it is unitary: ,
- hence it is involutory: .
- A Householder matrix has eigenvalues . To see this, notice that if is orthogonal to the vector which was used to create the reflector, then , i.e., is an eigenvalue of multiplicity , since there are independent vectors orthogonal to . Also, notice , and so is an eigenvalue with multiplicity .
- The determinant of a Householder reflector is , since the determinant of a matrix is the product of its eigenvalues, in this case one of which is with the remainder being (as in the previous point).

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

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]}

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 minors of that product. To accomplish this, a hermitian unitary matrix **Q** is sought which takes a complex vector **x** into a complex multiple of a complex vector **e**. For the QR decomposition, **e** will be a unit coordinate vector, say for the kth coordinate. A complex matrix **Q** having the form **Q** = **I** - **u u*** with **u*** **u** = 2 has the desired property of being hermitian unitary. Here * denotes the conjugate transpose. Since the only two vectors involved are **x** and **e**, the vector **u** must have the form **u** = a **x** + b **e**, where a and b are complex coefficients to be determined. Since an overall phase factor for **u** does not matter, the coefficient a can be chosen to be positive real. Now **Q** **x** = **x** (1 – a (**u*** **x**)) - **e** (b (**u*** **x**)). For the coefficient of the vector **x** to be zero, the two terms in **u*** **x** must have the same phase within a multiple of 180 degrees, so we must have arg(b) = arg(**e*** **x**) within a multiple of 180 degrees. There are two solutions according to whether an even or odd multiple of 180 degrees is chosen. So for the complex coefficient of the vector **x** to be zero, two linear equations in the moduli of a and b must be solved. The phases of a and b have already been determined. Suppose **e** to be the kth unit coordinate vector so that **e*** **e** = 1 and x_{k}= **e*** **x** and let |**x**|= sqrt(**x*** **x**). Then a and b may be expressed simply either as a =1/sqrt (|**x**| (|**x**|+ |x_{k}|)) and b = a |**x**| exp(i*arg(x_{k})) or as a =1/sqrt (|**x**| (|**x**|- |x_{k}|)) and b = - a |**x**| exp(i*arg(x_{k})). The multiplier of **e** is -b/a for both solutions. The first solution is better because the denominator cannot be near zero compared to |**x**|.

Main article: Tridiagonal matrix |

This procedure is presented in Numerical Analysis by Burden and Faires. It uses a slightly altered function with .^{[4]}
In the first step, to form the Householder matrix in each step we need to determine and , which are:

From and , construct vector :

where , , and

- for each

Then compute:

Having found and computed the process is repeated for as follows:

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

In this example, also from Burden and Faires,^{[4]} the given matrix is transformed to the similar tridiagonal matrix A_{3} by using the Householder method.

Following those steps in the Householder method, we have:

The first Householder matrix:

Used to form

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.

See also: Rotation (mathematics) |

The Householder transformation is a reflection about a hyperplane with unit normal vector , as stated earlier. An -by- unitary transformation satisfies . Taking the determinant (-th power of the geometric mean) and trace (proportional to arithmetic mean) of a unitary matrix reveals that its eigenvalues have unit modulus. This can be seen directly and swiftly:

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, . 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.^{[5]}

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.