PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 1, 1986SIAM Journal on Scientific and Statistical Computing433 citations

Computing the Polar Decomposition—with Applications

View Full Paper
NHNicholas J. Higham

Key Points

  • This research aims to present an efficient Newton method for computing the polar decomposition of matrices and explore its applications.
  • Introduced acceleration parameters to enhance the convergence rate.
  • Analyzed the Hermitian polar factor of nonsingular Hermitian matrices for positive definite approximation.
  • Derived perturbation bounds for polar factors.
  • Proven that the Hermitian polar factor is a good approximation to the original matrix.
  • Established 1/2(A / H) as the best Hermitian positive semi-definite approximation to A.
  • Outlined applications in factor analysis, aerospace computations, and optimization.

Abstract

A quadratically convergent Newton method for computing the polar decomposition of a-rank matrix is presented and analysed. Acceleration parameters are introduced so as to enhance the rate of convergence and it is shown how reliable estimates of the optimal parameters may be computed practice. add to the known best approximation property of the unitary polar factor, the Hermitian polar H of a nonsingular Hermitian matrix A is shown to be a good positive definite approximation to A 1/2 (A / H) is shown to be a best Hermitian positive semi-definite approximation to A. Perturbation for the polar factors are derived. of the polar decomposition to factor analysis, aerospace computations and optimisation outlined; and a new method is derived for computing the square root of a symmetric positive definite.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Nicholas J. Higham (1986) studied this question.

synapsesocial.com/papers/6a09285f266340834eb629cdhttps://doi.org/10.1137/0907079
Ask AI
Helpful
Bookmark
Share
View Full Paper