Reduction of a square matrix to upper Hessenberg form

The square matrix A could be represented as A=Q·H·Q^T, where Q is an orthogonal matrix, and H is a matrix in upper Hessenberg form.

The matrix in upper Hessenberg form is as follows (non-zero elements are marked with an "X"):

Like other algorithms of orthogonal factorization (for example, QR and LQ decomposition algorithms), this algorithm uses a sequence of elementary reflections to transform the matrix A. The matrix is transformed from the left and from the right. The transformations gradually remove the elements.

As a result of subroutine RMatrixHessenberg, the matrix A is replaced with matrix H and a sequence of reflection transformations stored in compact form. The form in which the transformations are stored and the subroutine parameters are described in more details in the subroutine comments. The method is similar to QR decomposition which uses the lower part of matrix R to store matrix Q.

As with QR decomposition, the subroutines for "unpacking" matrices Q and H are presented: RMatrixHessenbergUnpackQ and RMatrixHessenbergUnpackH. The first subroutine allows to get matrix Q, the second subroutine allows to get matrix H.

This algorithm is transferred from the LAPACK library.