An algorithm to compute the polar decomposition of a 3 3 matrix
From MaRDI portal
(Redirected from Publication:329306)
An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
Recommendations
Cites work
- scientific article; zbMATH DE number 4189084 (Why is no real title available?)
- A universal method of solving quartic equations
- Accuracy and Stability of Numerical Algorithms
- Accurate Singular Values of Bidiagonal Matrices
- Certification of numerical computation of the sign of the determinant of a matrix
- Computing the Polar Decomposition—with Applications
- Direct determination of the rotation in the polar decomposition of the deformation gradient by maximizing a Rayleigh quotient
- EFFICIENT NUMERICAL DIAGONALIZATION OF HERMITIAN 3 × 3 MATRICES
- Explicit polar decomposition and a near-characteristic polynomial: the 2 2 case
- Explicit polar decomposition of companion matrices
- Explicit polar decomposition of complex matrices
- Functions of Matrices
- Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
- Julia: a fresh approach to numerical computing
- Linear transformations on that preserve the Ky Fank-norm and a remarkable special case when (nk) = (4, 2)
- Mathematical basics of motion and deformation in computer graphics
- Optimal orthonormalization of the strapdown matrix by using singular value decomposition
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Quaternions and Reflections
- Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
- Topics in quaternion linear algebra
Cited in
(9)- On Cayley's factorization with an application to the orthonormalization of noisy rotation matrices
- Quaternions in collective dynamics
- 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
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)