An algorithm to compute the polar decomposition of a 3 3 matrix
From MaRDI portal
Publication:329306
DOI10.1007/S11075-016-0098-7zbMATH Open1353.65020OpenAlexW2289110059WikidataQ56998612 ScholiaQ56998612MaRDI QIDQ329306FDOQ329306
Authors: Nicholas J. Higham, Vanni Noferini 
Publication date: 21 October 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0098-7
Recommendations
singular value decompositionalgorithmpolar decompositionnumerical stabilityquaternions\(3 \times 3\) matrix
Cites Work
- Julia: a fresh approach to numerical computing
- Functions of Matrices
- Accuracy and Stability of Numerical Algorithms
- Computing the Polar Decomposition—with Applications
- Quaternions and Reflections
- Title not available (Why is that?)
- Explicit polar decomposition and a near-characteristic polynomial: the \(2\times 2\) case
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Topics in quaternion linear algebra
- A universal method of solving quartic equations
- Mathematical basics of motion and deformation in computer graphics
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Accurate Singular Values of Bidiagonal Matrices
- EFFICIENT NUMERICAL DIAGONALIZATION OF HERMITIAN 3 × 3 MATRICES
- Explicit polar decomposition of complex matrices
- Optimal orthonormalization of the strapdown matrix by using singular value decomposition
- Linear transformations on that preserve the Ky Fank-norm and a remarkable special case when (nk) = (4, 2)
- Explicit polar decomposition of companion matrices
- Direct determination of the rotation in the polar decomposition of the deformation gradient by maximizing a Rayleigh quotient
- Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
- Certification of numerical computation of the sign of the determinant of a matrix
Cited In (9)
- Quaternions in collective dynamics
- On Cayley's factorization with an application to the orthonormalization of noisy rotation matrices
- An algorithm for quaternion-based 3D rotation
- Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey
- A geometrically nonlinear Cosserat shell model for orientable and non-orientable surfaces: discretization with geometric finite elements
- An algorithm to decompose \(n\)-dimensional rotations into planar rotations
- The decomposition of an orthogonal transformation as a product of reflections
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
- Projection-based finite elements for nonlinear function spaces
Uses Software
This page was built for publication: An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329306)
