Massively parallel polar decomposition on distributed-memory systems
We present a high-performance implementation of the Polar Decomposition (PD) on distributed-memory systems. Building upon on the QR-based Dynamically Weighted Halley (QDWH) algorithm, the key idea lies in finding the best rational approximation for the scalar sign function, which also corresponds to...
Main Authors: | Ltaief, H, Sukkari, D, Esposito, A, Nakatsukasa, Y, Keyes, D |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Association for Computing Machinery
2019
|
Similar Items
-
High-performance SVD partial spectrum computation
by: Keyes, D, et al.
Published: (2023) -
A backward stable algorithm for computing the CS decomposition via the Polar decomposition
by: Gawlik, E, et al.
Published: (2018) -
Stable and efficient computation of generalized polar decompositions
by: Benner, P, et al.
Published: (2022) -
Truss decomposition in massive networks
by: Wang, Jia, et al.
Published: (2013) -
The massively parallel processing system JUMP-1 /
by: Hidehiko Tanaka