Pages that link to "Item:Q2910965"
From MaRDI portal
The following pages link to Backward stability of iterations for computing the polar decomposition (Q2910965):
Displaying 14 items.
- On iterative algorithms for the polar decomposition of a matrix and the matrix sign function (Q670807) (← links)
- On the backward stability of Gauss-Jordan elimination (Q1180348) (← links)
- On Grioli's minimum property and its relation to Cauchy's polar decomposition (Q1618180) (← links)
- Principal component projection with low-degree polynomials (Q2219638) (← links)
- Improving backward stability of Sakurai-Sugiura method with balancing technique in polynomial eigenvalue problem. (Q2402123) (← links)
- The minimization of matrix logarithms: on a fundamental property of the unitary polar factor (Q2447956) (← links)
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions (Q3186101) (← links)
- On the Matrix Square Root via Geometric Optimization (Q3186698) (← links)
- A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition (Q4689238) (← links)
- Stable and Efficient Computation of Generalized Polar Decompositions (Q5094209) (← links)
- The geometric mean of two matrices from a computational viewpoint (Q5739758) (← links)
- A Structure-Preserving Divide-and-Conquer Method for Pseudosymmetric Matrices (Q6094743) (← links)
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time (Q6142334) (← links)
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format (Q6623671) (← links)
