Stable and efficient computation of generalized polar decompositions
We present methods for computing the generalized polar decomposition of a matrix based on the dynamically weighted Halley (DWH) iteration. This method is well established for computing the standard polar decomposition and a stable implementation is available, where matrix inversion is avoided and QR...
Main Authors: | Benner, P, Nakatsukasa, Y, Penke, C |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
Society for Industrial and Applied Mathematics
2022
|
Títulos similares
-
A backward stable algorithm for computing the CS decomposition via the Polar decomposition
por: Gawlik, E, et al.
Publicado: (2018) -
A structure-preserving divide-and-conquer method for pseudosymmetric matrices
por: Benner, P, et al.
Publicado: (2023) -
Massively parallel polar decomposition on distributed-memory systems
por: Ltaief, H, et al.
Publicado: (2019) -
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
por: Nakatsukasa, Y, et al.
Publicado: (2016) -
Accuracy and stability of CUR decompositions with oversampling
por: Park, T, et al.
Publicado: (2024)