通过极分解计算CS分解的稳定性算法
A Backward Stable Algorithm for Computing the CS Decomposition via the Polar Decomposition
AI总结:
本文提出一种稳定性算法,通过计算两个极分解和一个Hermitian矩阵的特征分解,实现对分块矩阵的CS分解,证明其在稳定性条件下有效。
摘要:
我们介绍了一种计算分块2n×n矩阵的CS分解的稳定性算法,该矩阵具有正交列或秩不足的半单位阵。该算法计算两个n×n的极分解(可并行进行)后,再计算一个精心构造的n×n Hermitian矩阵的特征分解。我们证明,当上述分解以稳定性方式计算时,该算法也是稳定的。由于极分解和对称特征分解高度适合并行化,该算法继承了这一特性。我们通过调用最近开发的极分解和对称特征分解算法来展示这一点,这些算法利用了Zolotarev的符号函数最佳有理逼近。数值示例表明,所得的CS分解算法具有良好的数值稳定性。
英文摘要:
We introduce a backward stable algorithm for computing the CS decomposition of a partitioned $2n \times n$ matrix with orthonormal columns, or a rank-deficient partial isometry. The algorithm computes two $n \times n$ polar decompositions (which can be carried out in parallel) followed by an eigendecomposition of a judiciously crafted $n \times n$ Hermitian matrix. We prove that the algorithm is backward stable whenever the aforementioned decompositions are computed in a backward stable way. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。