A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
复制标题
一种通过极分解计算CS分解的后向稳定算法
DOI:
10.1137/18m1182747
复制
发表时间:
2018
影响因子:
1.5
通讯作者:
Sutton Brian D.
中科院分区:
文献类型:
--
作者:
Gawlik Evan S.;Nakatsukasa Yuji;Sutton Brian D.
We introduce a backward stable algorithm for computing the CS decomposition of a partitionedmatrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes twopolar decompositions (which can be carried out in parallel) followed by an eigendecomposition of a judiciously craftedHermitian matrix. We prove that the algorithm is backward stable whenever the aforementioned decompositions are computed in a backward stable way. Our algorithm can also be adapted to compute the complete CS decomposition of a square orthogonal or unitary matrix. Since the polar decomposition and the symmetric eigendecomposition are highly amenable to parallelization, the algorithm inherits this feature. We illustrate this fact by invoking recently developed algorithms for the polar decomposition and symmetric eigendecomposition that leverage Zolotarev's best rational approximations of the sign function. Numerical examples demonstrate that the resulting algorithm for computing the CS decomposition enjoys excellent numerical stability.
登录
查看更多内容
DOI:
10.1137/120870785
发表时间:
2013
期刊:
SIAM J. Matrix Anal. Appl.
影响因子:
--
作者:
Brian D. Sutton
通讯作者:
Brian D. Sutton
影响因子:
2.1
作者:
Brian D. Sutton
通讯作者:
Brian D. Sutton
DOI:
10.1137/100813002
发表时间:
2012
期刊:
SIAM J. Matrix Anal. Appl.
影响因子:
--
作者:
Brian D. Sutton
通讯作者:
Brian D. Sutton
影响因子:
1.5
作者:
B. Laszkiewicz;K. Zietak
通讯作者:
K. Zietak