An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
From MaRDI portal
Publication:329306
DOI10.1007/s11075-016-0098-7zbMath1353.65020OpenAlexW2289110059WikidataQ56998612 ScholiaQ56998612MaRDI QIDQ329306
Vanni Noferini, Nicholas J. Higham
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
algorithmsingular value decompositionnumerical stabilityquaternionspolar decomposition\(3 \times 3\) matrix
Related Items
A geometrically nonlinear Cosserat shell model for orientable and non-orientable surfaces: discretization with geometric finite elements, Quaternions in Collective Dynamics, Projection-Based Finite Elements for Nonlinear Function Spaces, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Julia: A Fresh Approach to Numerical Computing
- Mathematical Basics of Motion and Deformation in Computer Graphics: Second Edition
- 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
- Computing the Polar Decomposition—with Applications
- 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
- Accuracy and Stability of Numerical Algorithms
- Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
- Functions of Matrices
- Quaternions and Reflections
- Certification of numerical computation of the sign of the determinant of a matrix
