Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Hessenberg matrix
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Kind of square matrix in linear algebra}} In [[linear algebra]], a '''Hessenberg matrix''' is a special kind of [[square matrix]], one that is "almost" [[Triangular matrix|triangular]]. To be exact, an '''upper Hessenberg matrix''' has zero entries below the first [[diagonal#Matrices|subdiagonal]], and a '''lower Hessenberg matrix''' has zero entries above the first [[Diagonal#Matrices|superdiagonal]].<ref>{{harvtxt|Horn|Johnson|1985}}, page 28; {{harvtxt|Stoer|Bulirsch|2002}}, page 251</ref> They are named after [[Karl Hessenberg]].<ref>Biswa Nath Datta (2010) Numerical Linear Algebra and Applications, 2nd Ed., Society for Industrial and Applied Mathematics (SIAM) {{ISBN|978-0-89871-685-6}}, p. 307</ref> A '''Hessenberg decomposition''' is a [[matrix decomposition]] of a matrix <math>A</math> into a [[unitary matrix]] <math>P</math> and a Hessenberg matrix <math>H</math> such that <math display=block>PHP^*=A</math> where <math>P^*</math> denotes the [[conjugate transpose]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)