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...
Автори: | Benner, P, Nakatsukasa, Y, Penke, C |
---|---|
Формат: | Journal article |
Мова: | English |
Опубліковано: |
Society for Industrial and Applied Mathematics
2022
|
Схожі ресурси
-
A backward stable algorithm for computing the CS decomposition via the Polar decomposition
за авторством: Gawlik, E, та інші
Опубліковано: (2018) -
A structure-preserving divide-and-conquer method for pseudosymmetric matrices
за авторством: Benner, P, та інші
Опубліковано: (2023) -
Massively parallel polar decomposition on distributed-memory systems
за авторством: Ltaief, H, та інші
Опубліковано: (2019) -
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
за авторством: Nakatsukasa, Y, та інші
Опубліковано: (2016) -
Accuracy and stability of CUR decompositions with oversampling
за авторством: Park, T, та інші
Опубліковано: (2024)