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)