Hessenberg Matrix¶

Constrain a square matrix to be triangular except for one adjacent off-diagonal band, yielding a similarity-reachable form that preserves eigenvalues while making QR iteration and related computations substantially cheaper.

Version: v2 · 2026-09-06 · History
Domain-specific #: 1999
Origin domain: mathematics
Subdomain: numerical linear algebra
Aliases: Upper Hessenberg matrix, Lower Hessenberg matrix, Hessenberg form

Core Idea¶

An upper Hessenberg matrix is a square matrix \(H=(h_{ij})\) with \(h_{ij}=0\) whenever \(i>j+1\): it is upper triangular except that the first subdiagonal may be nonzero. A lower Hessenberg matrix is its transposed orientation, with zeros whenever \(j>i+1\). This one-band allowance is the narrowest general form to which an arbitrary nonsymmetric matrix can be reduced by stable orthogonal or unitary similarity before iterative eigenvalue computation.

The form preserves the eigenvalues of the original matrix while exposing enough zero structure to make subsequent QR steps economical. It is unreduced when every permitted adjacent off-diagonal entry is nonzero; a zero there splits the eigenvalue problem into smaller blocks.

Scope of Application¶

Hessenberg form is central to nonsymmetric eigenvalue algorithms. General matrices are first reduced by orthogonal or unitary similarity; implicit shifted QR iterations then preserve the form while driving subdiagonal entries toward deflation. Householder established unitary triangularization machinery that underlies stable reductions. Francis's implicit QR work made the two-stage reduction-and-iteration architecture computationally decisive.

The form also appears in Krylov methods, companion matrices, control computations, and structured determinant or recurrence problems.

Clarity¶

Always state upper or lower orientation, indexing convention, scalar field, and whether the matrix is unreduced. Separate the matrix property from the algorithm that produces it. When numerical deflation is claimed, state the tolerance and scaling rule: a tiny computed subdiagonal is not mathematically zero without a declared criterion.

Manages Complexity¶

The form concentrates fill into one triangle plus one band. Similarity reduction pays a one-time cubic cost, after which repeated QR steps can exploit the structure rather than operating on a dense general matrix. The adjacent band also exposes block splits immediately, turning one large eigenproblem into independent smaller ones.

Abstract Reasoning¶

Confirm the input is square. 2. Choose upper or lower Hessenberg orientation. 3. Construct orthogonal or unitary transformations that annihilate forbidden entries column by column or row by row. 4. Apply each transformation on both sides to preserve similarity. 5. Store the resulting Hessenberg matrix and, if needed, the accumulated basis change. 6. Verify the zero pattern and backward stability. 7. Run structure-preserving shifted QR steps.

Knowledge Transfer¶

The portable pattern is transform a dense object into the least restrictive near-terminal form that preserves the invariant of interest, then exploit that form across many later iterations. The proposed immediate parent is Matrix.

Relationships to Other Abstractions¶

Current abstraction Hessenberg Matrix Domain-specific

Parents (1) — more general patterns this builds on

Hessenberg Matrix is a kind of Matrix Domain-specific

Matrix is the proposed immediate domain-specific parent.

Hierarchy paths (5) — routes to 5 parentless roots

Hessenberg Matrix → Matrix → Tensor → Transformation → Function (Mapping)

Show alternative paths (4)

Neighborhood in Abstraction Space¶

Hessenberg Matrix sits in a sparse region of the domain-specific corpus (90^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08