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...
Asıl Yazarlar: | Benner, P, Nakatsukasa, Y, Penke, C |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Society for Industrial and Applied Mathematics
2022
|
Benzer Materyaller
-
A backward stable algorithm for computing the CS decomposition via the Polar decomposition
Yazar:: Gawlik, E, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
A structure-preserving divide-and-conquer method for pseudosymmetric matrices
Yazar:: Benner, P, ve diğerleri
Baskı/Yayın Bilgisi: (2023) -
Massively parallel polar decomposition on distributed-memory systems
Yazar:: Ltaief, H, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
Yazar:: Nakatsukasa, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
Accuracy and stability of CUR decompositions with oversampling
Yazar:: Park, T, ve diğerleri
Baskı/Yayın Bilgisi: (2024)