Hessenberg matrix

Hessenberg matrix

In linear algebra, a Hessenberg matrix is 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. They are named for Karl Hessenberg.

For example::egin{bmatrix}1 & 4 & 2 & 3 \3 & 4 & 1 & 7 \0 & 2 & 3 & 4 \0 & 0 & 1 & 3 \end{bmatrix}is upper Hessenberg and:egin{bmatrix}1 & 2 & 0 & 0 \5 & 2 & 3 & 0 \3 & 4 & 3 & 7 \5 & 6 & 1 & 1 \end{bmatrix}is lower Hessenberg.

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 particular, many eigenvalue algorithms reduce their input matrix to Hessenberg form as a first step.

ee also

* Triangular matrix

External links

* [http://mathworld.wolfram.com/HessenbergMatrix.html Hessenberg matrix] at MathWorld.
* [http://planetmath.org/encyclopedia/HessenbergMatrix.html Hessenberg matrix] at PlanetMath.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Hessenberg-Verfahren — Das Hessenberg Verfahren ist ein Verfahren der numerischen linearen Algebra zur Transformation einer quadratischen Matrix in Hessenberggestalt. Die Eigenwerte der entstehenden Hessenbergmatrix lassen sich anschließend einfach berechnen. Es ist… …   Deutsch Wikipedia

  • Matrice de Hessenberg — En algèbre linéaire, une matrice de Hessenberg est une matrice qui est « presque » triangulaire. Pour être exact, tous les éléments d une matrice de Hessenberg supérieure qui se trouvent en dessous de la première sous diagonale (ie… …   Wikipédia en Français

  • Matriz de Hessenberg — En álgebra lineal, una matriz de Hessenberg es una matriz casi triangular. Para ser más exactos, una matriz superior de Hessenberg tiene todos ceros por debajo de la primera subdiagonal, y una matriz inferior de Hessenberg tiene todos ceros por… …   Wikipedia Español

  • Gerhard Hessenberg — (1874 – 1925) est un mathématicien allemand. Il obtint son doctorat à l Université de Berlin en 1899 sous la direction de Hermann Schwarz et Lazarus Fuchs. Il est connu pour : ses travaux sur l axiomatisation de la géométrie, à la suite de… …   Wikipédia en Français

  • Karl Hessenberg — Karl Adolf Hessenberg (September 8, 1904 ndash; February 22, 1959) was a German mathematician and engineer. The Hessenberg matrix form is named after him. However, Hessenberg sum and product of ordinals are named for the mathematician Gerhard… …   Wikipedia

  • Triangular matrix — In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix where the entries either below or above the main diagonal are zero. Because matrix equations with triangular matrices are easier to solve… …   Wikipedia

  • Tridiagonal matrix — In linear algebra, a tridiagonal matrix is a matrix that is almost a diagonal matrix. To be exact: a tridiagonal matrix has nonzero elements only in the main diagonal, the first diagonal below this, and the first diagonal above the main… …   Wikipedia

  • Band matrix — In mathematics, particularly matrix theory, a band matrix is a sparse matrix whose non zero entries are confined to a diagonal band, comprising the main diagonal and zero or more diagonals on either side. Contents 1 Matrix bandwidth 2… …   Wikipedia

  • QR-Algorithmus — Der QR Algorithmus ist ein numerisches Verfahren zur Berechnung aller Eigenwerte und eventuell der Eigenvektoren einer quadratischen Matrix. Das auch QR Verfahren oder QR Iteration genannte Verfahren basiert auf der QR Zerlegung und wurde im… …   Deutsch Wikipedia

  • QR algorithm — In numerical linear algebra, the QR algorithm is an eigenvalue algorithm; that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR transformation was developed in 1961 by John G.F. Francis (England) and by Vera N.… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”