arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0707.1838math.NAcs.NA
收藏

计算完整的CS分解

Computing the complete CS decomposition

Randolph-Macon College(兰道夫-梅肯学院)

Brian D. Sutton

AI总结:

提出一种算法计算分块酉矩阵的完整CS分解,通过两步实现:先化简为双对角块形式,再同时对角化所有块。

摘要:

开发了一种算法来计算分块酉矩阵的完整CS分解(CSD)。尽管CSD的存在性自1977年以来已被认识,但先前的算法仅计算简化版本(2×1 CSD),相当于两个同时的奇异值分解。这里提出的算法计算完整的2×2 CSD,这需要同时对角化一个分为2×2块结构的酉矩阵的所有四个块。该算法似乎是唯一完全指定的可用算法。计算分两个阶段进行。在第一阶段,如Sutton和Edelman所述,将酉矩阵简化为双对角块形式。在第二阶段,使用Golub、Kahan和Demmel的双对角SVD算法中的技术同时对角化这些块。该算法具有许多理想的数值特性。

英文摘要:

An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD) that is equivalent to two simultaneous singular value decompositions. The algorithm presented here computes the complete 2-by-2 CSD, which requires the simultaneous diagonalization of all four blocks of a unitary matrix partitioned into a 2-by-2 block structure. The algorithm appears to be the only fully specified algorithm available. The computation occurs in two phases. In the first phase, the unitary matrix is reduced to bidiagonal block form, as described by Sutton and Edelman. In the second phase, the blocks are simultaneously diagonalized using techniques from bidiagonal SVD algorithms of Golub, Kahan, and Demmel. The algorithm has a number of desirable numerical features.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑