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
Matrix decomposition
(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!
=== Polar decomposition === {{main|Polar decomposition}} *Applicable to: any square complex matrix ''A''. *Decomposition: <math>A=UP</math> (right polar decomposition) or <math>A=P'U</math> (left polar decomposition), where ''U'' is a [[unitary matrix]] and ''P'' and ''P''' are [[positive semidefinite matrix|positive semidefinite]] [[Hermitian matrices]]. *Uniqueness: <math>P</math> is always unique and equal to <math>\sqrt{A^*A}</math> (which is always hermitian and positive semidefinite). If <math>A</math> is invertible, then <math>U</math> is unique. *Comment: Since any Hermitian matrix admits a spectral decomposition with a unitary matrix, <math>P</math> can be written as <math>P=VDV^*</math>. Since <math>P</math> is positive semidefinite, all elements in <math>D</math> are non-negative. Since the product of two unitary matrices is unitary, taking <math>W=UV</math>one can write <math>A=U(VDV^*)=WDV^* </math> which is the singular value decomposition. Hence, the existence of the polar decomposition is equivalent to the existence of the singular value decomposition.
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)