- categories: Linear algebra, Factorization
 
Definition
The polar decomposition of a Matrix  (or ) expresses  as the product of two matrices:
where:
- (or ) is a unitary matrix (or Orthogonal matrix if is real), satisfying (or ).
 - (or ) is a Positive Semi-Definite Matrix and Hermitian (or Symmetric Matrix if is real), satisfying and .
 
If is square and invertible, is unitary and is Positive Definite Matrix.
Intuition
The polar decomposition separates a matrix  into two parts:
- represents the “rotation” or “orthogonal transformation” component.
 - represents the “stretching” or “scaling” component.
 
For square matrices, this is analogous to decomposing a complex number into a unit-magnitude rotation and a positive scaling .
Key Properties
- 
Existence and Uniqueness:
- The polar decomposition always exists for any matrix .
 - is uniquely determined. is unique if is full rank.
 
 - 
Computation of :
where is the unique positive semi-definite square root of . - 
Computation of :
if is invertible. If is not full rank, can be determined using a projection. - 
Norm Preservation:
The unitary (or orthogonal) matrix preserves the norm of vectors: for any vector . - 
Special Case (Square Matrices):
If is invertible, is unitary, and is positive definite. 
Applications
- Numerical Linear Algebra: Polar decomposition is used in algorithms requiring matrix decompositions with orthogonal and positive components.
 - Computer Graphics: Used to decompose affine transformations into rotation and scaling parts.
 - Continuum Mechanics: Describes deformation gradients in materials, separating pure rotation from stretch.
 - Signal processing: Polar decomposition helps in solving least squares problems and analyzing signal transformations.