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)