Computing the Polar Decomposition—with Applications
From MaRDI portal
Publication:3746789
DOI10.1137/0907079zbMATH Open0607.65014OpenAlexW2088307891WikidataQ55924131 ScholiaQ55924131MaRDI QIDQ3746789FDOQ3746789
Authors: Nicholas J. Higham 
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0907079
Recommendations
factor analysisconvergence accelerationpolar decompositionNewton methodmatrix square rootaerospace computations
Cited In (only showing first 100 items - show all)
- On optimal symmetric orthogonalisation and square roots of a normal matrix
- The matrix sign decomposition and its relation to the polar decomposition
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- Mixed precision algorithms in numerical linear algebra
- An integer approximation method for discrete sinusoidal transforms
- A novel iterative method for polar decomposition and matrix sign function
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- The iterative methods for computing the polar decomposition of rank-deficient matrix
- Some new perturbation bounds of generalized polar decomposition
- Several numerical methods for computing unitary polar factor of a matrix
- Stimulus-Driven and Spontaneous Dynamics in Excitatory-Inhibitory Recurrent Neural Networks for Sequence Representation
- A note on the perturbation bound of \(Q\)-factors
- Relative perturbation bounds for the unitary polar factor
- A perturbation bound for the generalized polar decomposition
- Representation and approximation of the polar factor of an operator on a Hilbert space
- Relative perturbation bounds for weighted polar decomposition
- Variations for the \(Q\)- and \(H\)-factors in the polar decomposition
- The symmetric Procrustes problem
- Computing a nearest symmetric positive semidefinite matrix
- Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic
- On a fourth-order matrix method for computing polar decomposition
- Perturbation bounds on the polar decomposition
- On the perturbation bound in unitarily invariant norms for subunitary polar factors
- The coninvolutory decomposition and its computation for a complex matrix
- Polar decomposition, Aluthge and mean transforms
- Perturbation analysis for best approximation and the polar factor by subunitary matrices
- New multiplicative perturbation bounds for the generalized polar decomposition
- Generalized Matrix Nearness Problems
- Approximation of matrices and a family of Gander methods for polar decomposition
- A parallel algorithm for computing the polar decomposition
- An optimal perturbation bound for the partial isometry associated to the generalized polar decomposition
- Matrix factorizations and their perturbations
- A fixed-point method for approximate projection onto the positive semidefinite cone
- Structured matrices and Newton's iteration: unified approach
- Low rank solution of data-sparse Sylvester equations
- Algorithms for the Polar Decomposition
- A note on backward perturbations for the Hermitian eigenvalue problem
- Numerical computation for orthogonal low-rank approximation of tensors
- Numerical behaviour of Higham's scaled method for polar decomposition
- An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix
- Solving the algebraic Riccati equation with the matrix sign function
- On tridiagonal matrices unitarily equivalent to normal matrices
- Singular value decomposition for the Takagi factorization of symmetric matrices
- On approximation algorithm for orthogonal low-rank tensor approximation
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- Fast Polar Decomposition of an Arbitrary Matrix
- Some new perturbation bounds for subunitary polar factors
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Vector diffusion maps and the connection Laplacian
- On the first degree Fejér-Riesz factorization and its applications to \(X+A^{\ast}X^{-1}A=Q\)
- Perturbation analysis of the orthogonal Procrustes problem
- Monotonically convergent algorithms for symmetric tensor approximation
- Solving stable Sylvester equations via rational iterative schemes
- Euclidean distance matrices and applications
- Convergence analysis of the block Householder diagonalization algorithm
- Approximation by matrices positive semidefinite on a subspace
- Douglas-Rachford feasibility methods for matrix completion problems
- A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix
- On the explicit determination of the polar decomposition in \(n\)-dimensional vector spaces
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function
- Least-squares inner product shaping
- Computing the square root and logarithm of a real \(P\)-orthogonal matrix
- Global registration of multiple point clouds using semidefinite programming
- Time-stepping and preserving orthonormality
- Scattered manifold-valued data approximation
- Combined perturbation bounds. II: Polar decompositions
- Parsimonious ultrametric Gaussian mixture models
- Numerical stability and tensor nuclear norm
- Low-complexity 8-point DCT approximation based on angle similarity for image and video coding
- Tetrisation of triangular meshes and its application in shape blending
- Conditioning of leverage scores and computation by QR decomposition
- Continuous relaxations for the traveling salesman problem
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- The effect of perturbations of linear operators on their polar decomposition
- On sign function of tensors with Einstein product and its application in solving Yang-Baxter tensor equation
- A factored variant of the Newton iteration for the solution of algebraic Riccati equations via the matrix sign function
- Computing Floquet Hamiltonians with symmetries
- A formula for the Fréchet derivative of a generalized matrix function
- Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix
- Iterative computation of the Fréchet derivative of the polar decomposition
- Commutation of geometry-grids and fast discrete PDE eigen-solver GPA
- The structured condition number of a differentiable map between matrix manifolds, with applications
- Minimum-correction second-moment matching: theory, algorithms and applications
- Convolutional proximal neural networks and plug-and-play algorithms
- The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
- Algorithms for the orthographic-\(n\)-point problem
- Computing the polar decomposition with a secant method
- A note on computing the polar decomposition
- Convergence of the vertical gradient flow for the Gaussian Monge problem
- Complex matrix inversion via real matrix inversions
- A class of iterative methods for computing polar decomposition
- Comparing unconstrained parametrization methods for return covariance matrix prediction
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- Algorithm for orthogonal matrix nearness and its application to feature representation
- On condition numbers and algorithms for determining a rigid body movement
- A third-order Newton-type method for finding polar decomposition
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- On numerical radius bounds involving generalized Aluthge transform
- Approximation of the polar factor of an operator acting on a Hilbert space
This page was built for publication: Computing the Polar Decomposition—with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746789)
