Fast Polar Decomposition Of A sTrAnGe Square Matrix - Help

In summary, the polar decomposition of A can be calculated using the SVD method, where the square root of A is a symmetric, positive definite matrix and the isometry transforms A to its square root.
  • #1
emlio
8
0
Fast Polar Decomposition Of A sTrAnGe Square Matrix --!Help!

Homework Statement



| 2 0 4 |
| 0 1 0 | = A
| 3 0 2 |


Calculate the Polar Decomposition of A: [tex]A = LP[/tex]

[tex]L =^{t}L > 0[/tex] L is symmetric and positive defined

[tex] P^{t}P = I[/tex]

[tex]^{t}P=P^{-1}[/tex] P is an isometry: Transpose of P is egual to P^-1


Is there a quick way to do this?
I know how to do it but is very slow, and I think that must exists a quick way or some tricks to resolve the exercise, infact as you can see the matrix is very particular...

Help Me please...Tnx
 
Physics news on Phys.org
  • #2
Homework EquationsA = LP L =^{t}L > 0 L is symmetric and positive definedP^{t}P = I ^{t}P=P^{-1} P is an isometry: Transpose of P is egual to P^-1The Attempt at a SolutionYou can calculate the polar decomposition of A using the Singular Value Decomposition (SVD). The SVD of A is A = U diag(σ) V^T, where U and V are orthogonal matrices and σ is a vector of singular values. Then the polar decomposition of A is A = U diag(σ) V^T = (U diag(σ^(1/2)))(V diag(σ^(1/2))). The first factor is the symmetric, positive definite square root of A, and the second is the isometry that maps A to its square root.
 

1. What is a fast polar decomposition?

A fast polar decomposition is a mathematical algorithm used to decompose a square matrix into two parts - a symmetric matrix and an orthogonal matrix. It is a commonly used method in linear algebra and has applications in various fields like computer graphics, signal processing, and statistics.

2. How is a polar decomposition different from other matrix decompositions?

Polar decomposition is unique in the sense that it decomposes a square matrix into two parts that have specific properties - one is symmetric and the other is orthogonal. Other matrix decompositions like LU, QR, and singular value decomposition (SVD) may not have these specific properties.

3. Why is fast polar decomposition important?

Fast polar decomposition is important because it is a computationally efficient method to solve linear equations involving square matrices. It also allows for the extraction of useful information from the original matrix, such as eigenvalues and eigenvectors.

4. Can fast polar decomposition be applied to any square matrix?

Yes, fast polar decomposition can be applied to any square matrix, regardless of its size or properties. However, it may not always provide useful results for matrices that are ill-conditioned or do not have specific properties.

5. Is there a specific application of fast polar decomposition in scientific research?

Yes, fast polar decomposition has various applications in scientific research, including image processing, quantum mechanics, and machine learning. It is also commonly used in solving systems of linear equations in numerical analysis.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
1K
Replies
13
Views
3K
  • Calculus and Beyond Homework Help
Replies
6
Views
3K
  • Linear and Abstract Algebra
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
12
Views
4K
  • Classical Physics
Replies
0
Views
146
  • Mechanics
Replies
3
Views
827
  • Calculus and Beyond Homework Help
Replies
2
Views
5K
Back
Top