# A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms

@article{Neff2014ALM,
title={A Logarithmic Minimization Property of the Unitary Polar Factor in the Spectral and Frobenius Norms},
author={Patrizio Neff and Yuji Nakatsukasa and Andreas Fischle},
journal={SIAM J. Matrix Anal. Appl.},
year={2014},
volume={35},
pages={1132-1154}
}
• Published 28 August 2014
• Mathematics
• SIAM J. Matrix Anal. Appl.

### Direct determination of the rotation in the polar decomposition of the deformation gradient by maximizing a Rayleigh quotient

• Mathematics
• 2005
We develop a new effective method of determining the rotation R and the stretches U and V in the polar decomposition F = RU = VR of the deformation gradient. The method is based on a minimum property

### A New Scaling for Newton's Iteration for the Polar Decomposition and its Backward Stability

• Mathematics
SIAM J. Matrix Anal. Appl.
• 2008
It is proved that if matrix inverses computed in finite precision arithmetic satisfy a backward-forward error model, then the numerical method is backward stable and it is also proved that Newton's method with Higham's scaling or with Frobenius norm scaling is backwardstable.

### Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD

• Computer Science
SIAM J. Sci. Comput.
• 2013
New spectral divide and conquer algorithms for the symmetric eigenvalue problem and the singular value decomposition that are backward stable, achieve lower bounds on communication costs recently derived by Ballard, Demmel, Holtz, and Schwartz, and have operation counts within a small constant factor of those for the standard algorithms.

### Backward Stability of Iterations for Computing the Polar Decomposition

• Mathematics
SIAM J. Matrix Anal. Appl.
• 2012
This work shows that a general iteration of X_{k+1} = f(X_k) for computing the unitary polar factor is backward stable under two conditions and proves the backward stability of the scaled Newton iteration under the assumption of mixed backward--forward stable manner.

### Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition

• Mathematics
SIAM J. Matrix Anal. Appl.
• 2010
The Halley iteration can be implemented via QR decompositions without explicit matrix inversions, and it is an inverse free communication friendly algorithm for the emerging multicore and hybrid high performance computing systems.

### Geometric Means in a Novel Vector Space Structure on Symmetric Positive-Definite Matrices

• Mathematics
SIAM J. Matrix Anal. Appl.
• 2006
This work defines the Log‐Euclidean mean from a Riemannian point of view, based on a lie group structure which is compatible with the usual algebraic properties of this matrix space and a new scalar multiplication that smoothly extends the Lie group structure into a vector space structure.

### Sum of squared logarithms - an inequality relating positive definite matrices and their matrix logarithm

• Mathematics
• 2013
AbstractLet y1,y2,y3,a1,a2,a3∈(0,∞) be such that y1y2y3=a1a2a3 and y1+y2+y3≥a1+a2+a3,y1y2+y2y3+y1y3≥a1a2+a2a3+a1a3. Then

### Rank one convexity of the exponentiated Hencky-logarithmic strain energy in finite elastostatics

• Mathematics
• 2014
We investigate a family of isotropic volumetric-isochoric decoupled strain energies F 7→ WeH(F ) := ŴeH(U) :=    μ k e ‖ devn logU‖ 2 + κ 2k̂ e [tr(logU)] 2 if det F > 0, +∞ if detF ≤ 0, based on