Computing the Polar Decomposition—with Applications
From MaRDI portal
Publication:3746789
DOI10.1137/0907079zbMath0607.65014OpenAlexW2088307891WikidataQ55924131 ScholiaQ55924131MaRDI QIDQ3746789
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
convergence accelerationmatrix square rootNewton methodpolar decompositionfactor analysisaerospace computations
Related Items
Stimulus-Driven and Spontaneous Dynamics in Excitatory-Inhibitory Recurrent Neural Networks for Sequence Representation, Some new perturbation bounds of generalized polar decomposition, Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix, Mixed precision algorithms in numerical linear algebra, On optimal symmetric orthogonalisation and square roots of a normal matrix, Solving the algebraic Riccati equation with the matrix sign function, On condition numbers and algorithms for determining a rigid body movement, The matrix sign decomposition and its relation to the polar decomposition, Vector diffusion maps and the connection Laplacian, The effect of perturbations of linear operators on their polar decomposition, Structured matrices and Newton's iteration: unified approach, A Concise Parametrization of Affine Transformation, The symmetric Procrustes problem, Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions, An algorithm to compute the polar decomposition of a \(3 \times 3\) matrix, Computing a nearest symmetric positive semidefinite matrix, A note on backward perturbations for the Hermitian eigenvalue problem, Factorized solution of Lyapunov equations based on hierarchical matrix arithmetic, On approximation algorithm for orthogonal low-rank tensor approximation, Approximating the little Grothendieck problem over the orthogonal and unitary groups, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, A fixed-point method for approximate projection onto the positive semidefinite cone, Approximation by matrices positive semidefinite on a subspace, Minimum-correction second-moment matching: theory, algorithms and applications, Monotonically convergent algorithms for symmetric tensor approximation, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, On the first degree Fejér-Riesz factorization and its applications to \(X+A^{\ast}X^{-1}A=Q\), Generalized Matrix Nearness Problems, Tetrisation of Triangular Meshes and Its Application in Shape Blending, Computing the square root and logarithm of a real \(P\)-orthogonal matrix, An integer approximation method for discrete sinusoidal transforms, Iterative Computation of the Fréchet Derivative of the Polar Decomposition, Numerical stability and tensor nuclear norm, Commutation of geometry-grids and fast discrete PDE eigen-solver GPA, Convergence of the vertical gradient flow for the Gaussian Monge problem, Algorithms for the orthographic-\(n\)-point problem, Perturbation bounds on the polar decomposition, A novel iterative method for polar decomposition and matrix sign function, Projection-Based Finite Elements for Nonlinear Function Spaces, Singular value decomposition for the Takagi factorization of symmetric matrices, On the perturbation bound in unitarily invariant norms for subunitary polar factors, Computing Floquet Hamiltonians with symmetries, A class of iterative methods for computing polar decomposition, The Riemannian and Affine Geometry of Facial Expression and Action Recognition, The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, Combined perturbation bounds. II: Polar decompositions, Convolutional proximal neural networks and plug-and-play algorithms, Time-stepping and preserving orthonormality, Relative perturbation bounds for the unitary polar factor, A sixth-order iterative method for approximating the polar decomposition of an arbitrary matrix, The coninvolutory decomposition and its computation for a complex matrix, Scattered manifold-valued data approximation, A factored variant of the Newton iteration for the solution of algebraic Riccati equations via the matrix sign function, A perturbation bound for the generalized polar decomposition, Low-complexity 8-point DCT approximation based on angle similarity for image and video coding, The iterative methods for computing the polar decomposition of rank-deficient matrix, On tridiagonal matrices unitarily equivalent to normal matrices, New multiplicative perturbation bounds for the generalized polar decomposition, A third-order Newton-type method for finding polar decomposition, A note on the perturbation bound of \(Q\)-factors, Low rank solution of data‐sparse Sylvester equations, Relative perturbation bounds for weighted polar decomposition, On the QR decomposition of \({\mathcal {H}}\)-matrices, Approximation of matrices and a family of Gander methods for polar decomposition, Solving stable Sylvester equations via rational iterative schemes, Some new perturbation bounds for subunitary polar factors, An optimal perturbation bound for the partial isometry associated to the generalized polar decomposition, Several numerical methods for computing unitary polar factor of a matrix, Perturbation analysis for best approximation and the polar factor by subunitary matrices, Euclidean Distance Matrices and Applications, Variations for the \(Q\)- and \(H\)-factors in the polar decomposition, Continuous relaxations for the traveling salesman problem, Approximation of the polar factor of an operator acting on a Hilbert space, Nonlinear power-like iteration by polar decomposition and its application to tensor approximation, Representation and approximation of the polar factor of an operator on a Hilbert space, The Structured Condition Number of a Differentiable Map between Matrix Manifolds, with Applications, On numerical radius bounds involving generalized Aluthge transform, Numerical Computation for Orthogonal Low-Rank Approximation of Tensors, Comparing unconstrained parametrization methods for return covariance matrix prediction, Conditioning of Leverage Scores and Computation by QR Decomposition, Convergence analysis of the block Householder diagonalization algorithm, Global Registration of Multiple Point Clouds Using Semidefinite Programming, On a fourth-order matrix method for computing polar decomposition, Least-squares inner product shaping, Perturbation analysis of the orthogonal Procrustes problem, Matrix factorizations and their perturbations, A Formula for the Fréchet Derivative of a Generalized Matrix Function
