Linear Algebra - Polar decomposition

Finally, you can verify that |A| = P by plugging in the values for A and P. In summary, you can find the polar decomposition of a matrix A by calculating the eigenvalues and eigenvectors of A*A, constructing U and P from them, and verifying that A = UP.
  • #1
Mumba
27
0
nwjyoz.jpg


First i calculated the eigenvalues: I got
[tex](i-\lambda)(-i-\lambda)+1[/tex], so
[tex]\lambda_{1,2}=+-\sqrt{2}i[/tex]

Is it correct to go on on like this:

[tex]\lambda_{1}a+b=\sqrt{\lambda_{1}}[/tex]
[tex]\lambda_{2}a+b=\sqrt{\lambda_{2}}[/tex]

After calculating a and b, we plug it into f(x) = ax+b -->
[tex]f(A^{*}A)=a(A^{*}A)+bI[/tex]

Then
[tex]f(A^{*}A)=\sqrt{A^{*}A}=|A|[/tex] and
[tex]U=A|A|^{-1}[/tex]

This way i find U, and i think |A|=P

So i have the polar decompostion A = UP?!
Is the way correct?

Thx
Mumba

Edit: A* - Transpose
 
Last edited:
Physics news on Phys.org
  • #2
of matrix AYes, your approach is correct. The polar decomposition of a matrix A is given by A = UP, where U is a unitary matrix and P is a positive semidefinite matrix. To find U, you need to calculate the eigenvalues of A*A, then take their square roots, and then solve the equation (A*A - λI)x = 0 for x to find the eigenvectors. Then construct U from the eigenvectors, and P from the eigenvalues.
 

FAQ: Linear Algebra - Polar decomposition

What is the definition of polar decomposition in linear algebra?

Polar decomposition is a mathematical concept that decomposes a linear transformation into two parts: a rotation and a scaling. It is used to break down a complex transformation into simpler components for easier analysis and understanding.

What is the significance of polar decomposition in linear algebra?

Polar decomposition is important in linear algebra because it helps us understand the behavior of linear transformations. It allows us to separate the rotational and scaling components of a transformation, which can provide insights into the properties and behavior of a system.

What is the difference between polar decomposition and singular value decomposition (SVD)?

Polar decomposition and SVD are both ways to decompose a linear transformation. However, polar decomposition only works for square matrices, while SVD can be applied to any matrix. Additionally, polar decomposition separates a transformation into rotation and scaling, while SVD separates it into rotation, scaling, and shear.

How is polar decomposition used in practical applications?

Polar decomposition has many practical applications, such as in computer graphics, signal processing, and image processing. It can be used to analyze and understand the behavior of systems, as well as to simplify complex transformations for easier computation.

What are some limitations of polar decomposition?

One limitation of polar decomposition is that it only works for square matrices. Additionally, it may not always be unique, meaning that different polar decompositions can result in the same transformation. It also does not take into account any non-linear components of a transformation.

Similar threads

Back
Top