Hessenberg matrix explained

In linear algebra, a Hessenberg matrix is a special kind of square matrix, one that is "almost" triangular. To be exact, an upper Hessenberg matrix has zero entries below the first subdiagonal, and a lower Hessenberg matrix has zero entries above the first superdiagonal.^[1] They are named after Karl Hessenberg.^[2]

A Hessenberg decomposition is a matrix decomposition of a matrix

A into a unitary matrix P and a Hessenberg matrix H such that $$PHP^*=A$$ where P ^{*} denotes the conjugate transpose.

Definitions

Upper Hessenberg matrix

A square

n x n matrix A is said to be in upper Hessenberg form or to be an upper Hessenberg matrix if a _{i,j} =0 for all i,j with i > j +1 .

An upper Hessenberg matrix is called unreduced if all subdiagonal entries are nonzero, i.e. if

a _{i+1,i} ≠ 0 for all i \in \{ 1 ,\ldots,n -1 \} .

Lower Hessenberg matrix

A square

n x n matrix A is said to be in lower Hessenberg form or to be a lower Hessenberg matrix if its transpose is an upper Hessenberg matrix or equivalently if a _{i,j} =0 for all i,j with j > i +1 .

A lower Hessenberg matrix is called unreduced if all superdiagonal entries are nonzero, i.e. if

a _{i,i+1} ≠ 0 for all i \in \{ 1 ,\ldots,n -1 \} .

Examples

Consider the following matrices.

The matrix

A is an upper unreduced Hessenberg matrix, B is a lower unreduced Hessenberg matrix and C is a lower Hessenberg matrix but is not unreduced.

Computer programming

Many linear algebra algorithms require significantly less computational effort when applied to triangular matrices, and this improvement often carries over to Hessenberg matrices as well. If the constraints of a linear algebra problem do not allow a general matrix to be conveniently reduced to a triangular one, reduction to Hessenberg form is often the next best thing. In fact, reduction of any matrix to a Hessenberg form can be achieved in a finite number of steps (for example, through Householder's transformation of unitary similarity transforms). Subsequent reduction of Hessenberg matrix to a triangular matrix can be achieved through iterative procedures, such as shifted QR-factorization. In eigenvalue algorithms, the Hessenberg matrix can be further reduced to a triangular matrix through Shifted QR-factorization combined with deflation steps. Reducing a general matrix to a Hessenberg matrix and then reducing further to a triangular matrix, instead of directly reducing a general matrix to a triangular matrix, often economizes the arithmetic involved in the QR algorithm for eigenvalue problems.

Reduction to Hessenberg matrix

Householder transformations

Any

n x n matrix can be transformed into a Hessenberg matrix by a similarity transformation using Householder transformations. The following procedure for such a transformation is adapted from A Second Course In Linear Algebra by Garcia & Roger.^[3]

Let

A be any real or complex n x n matrix, then let A ^{\prime} be the (n - 1 ) x n submatrix of A constructed by removing the first row in A and let a ^{\prime} _{1} be the first column of A' . Construct the (n -1 ) x (n -1 ) householder matrix V _{1} = I _{(n-1)} -2 (ww ^{*})/(\|w\| ^{2}) where$$w\; =\; \backslash begin\backslash |\backslash mathbf^\backslash prime\_1\backslash |\_2\backslash mathbf\_1\; -\; \backslash mathbf^\backslash prime\_1\; \backslash ;\backslash ;\backslash ;\backslash ;\backslash ;\backslash ;\backslash ;\backslash ;,\; \backslash ;\backslash ;\backslash ;\; a^\backslash prime\_\; =\; 0\; \backslash \backslash \backslash |\backslash mathbf^\backslash prime\_1\backslash |\_2\backslash mathbf\_1\; +\; \backslash frac$$\mathbf^\prime_1 \;\;\;, \;\;\; a^\prime_ \neq 0 \\\end

This householder matrix will map

a ^{\prime} _{1} to \| a ^{\prime} _{1 \|} e _{1} and as such, the block matrix U _{1} = \begin{bmatrix} 1 & 0 \ 0 & V _{1} \end{bmatrix} will map the matrix A to the matrix U _{1A} which has only zeros below the second entry of the first column. Now construct (n -2 ) x (n -2 ) householder matrix V _{2} in a similar manner as V _{1} such that V _{2} maps the first column of A ^{\prime\prime} to \| a ^{\prime\prime} _{1 \|} e _{1} , where A ^{\prime\prime} is the submatrix of A ^{\prime} constructed by removing the first row and the first column of A ^{\prime} , then let U _{2} = \begin{bmatrix} 1 & 0 & 0 \ 0 & 1 & 0 \ 0 & 0 & V _{2\end{bmatrix}} which maps U _{1A} to the matrix U _{2U} _{1A} which has only zeros below the first and second entry of the subdiagonal. Now construct V _{3} and then U _{3} in a similar manner, but for the matrix A ^{\prime\prime\prime} constructed by removing the first row and first column of A ^{\prime\prime} and proceed as in the previous steps. Continue like this for a total of n -2 steps.

By construction of

U _{k} , the first k columns of any n x n matrix are invariant under multiplication by U ^{*} _{k} from the right. Hence, any matrix can be transformed to an upper Hessenberg matrix by a similarity transformation of the form U _{(n-2)} ( ... (U _{2(U} _{1} A U ^{*)} _{2} ... )U ^{*} _{(n -2 )} = U _{(n-2)} ... U _{2U} _{1A(U} _{(n-2)} ... U _{2U} ^{*} ^{1 )} = UAU ^{*} .

Jacobi (Givens) rotations

A Jacobi rotation (also called Givens rotation) is an orthogonal matrix transformation in the form

A\to A' = J(p,q,\theta) ^{TAJ(p,q,\theta)} , where J(p,q,\theta) , p< q , is the Jacobi rotation matrix with all matrix elements equal zero except for\left\{\begin{align} J(p,q,\theta) _{ii} &{} = 1 \forall i \ne p,q\\ J(p,q,\theta) _{pp} &{} = \cos(\theta) \\ J(p,q,\theta) _{qq} &{} = \cos(\theta) \\ J(p,q,\theta) _{pq} &{} = \sin(\theta) \\ J(p,q,\theta) _{qp} &{} = - \sin(\theta) . \end{align}\right. One can zero the matrix element A' _{p-1,q} by choosingthe rotation angle \theta to satisfy the equationA _{p-1,p} \sin\theta + A _{p-1,q} \cos\theta =0 , Now, the sequence of such Jacobi rotations with the following (p,q) (p,q) = ( 2 , 3 ),( 2 , 4 ), ... ,( 2 ,n),( 3 , 4 ), ... ,( 3 ,n), ... ,(n -1 ,n) reduces the matrix A to the lower Hessenberg form.^[4]

Properties

For

n \in \{ 1 , 2 \} , it is vacuously true that every n x n matrix is both upper Hessenberg, and lower Hessenberg.^[5]

The product of a Hessenberg matrix with a triangular matrix is again Hessenberg. More precisely, if

A is upper Hessenberg and T is upper triangular, then AT and TA are upper Hessenberg.

A matrix that is both upper Hessenberg and lower Hessenberg is a tridiagonal matrix, of which the Jacobi matrix is an important example. This includes the symmetric or Hermitian Hessenberg matrices. A Hermitian matrix can be reduced to tri-diagonal real symmetric matrices.^[6]

Hessenberg operator

S , given by $$[Sf](z)\; =\; z\; f(z).$$

The eigenvalues of each principal submatrix of the Hessenberg operator are given by the characteristic polynomial for that submatrix. These polynomials are called the Bergman polynomials, and provide an orthogonal polynomial basis for Bergman space.

See also

• Hessenberg variety

Notes

1. , page 28;, page 251
2. Biswa Nath Datta (2010) Numerical Linear Algebra and Applications, 2nd Ed., Society for Industrial and Applied Mathematics (SIAM), p. 307
3. Book: Ramon Garcia . Stephan . Horn . Roger . A Second Course In Linear Algebra . 2017 . Cambridge University Press . 9781107103818.
4. 1501.07812 . 10.1016/j.laa.2015.08.026 . Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications . 2016 . Bini . Dario A. . Robol . Leonardo . Linear Algebra and Its Applications . 502 . 186–213 .
5. https://www.cs.cornell.edu/~bindel/class/cs6210-f16/lec/2016-10-21.pdf Lecture Notes. Notes for 2016-10-21
6. Web site: Computational Routines (eigenvalues) in LAPACK . sites.science.oregonstate.edu . 2020-05-24.

References

• .
• .

External links

• Hessenberg matrix at MathWorld.
  • High performance algorithms for reduction to condensed (Hessenberg, tridiagonal, bidiagonal) form
• Algorithm overview