求块-Toeplitz矩阵QR分解中R及R^￣T的快速算法

求块-Toeplitz矩阵QR分解中R及R ￣T 的快速算法 FAST ALGORITHM FOR R AND R OF QRDECOMPOSITION OF BLOCK-TOEPLITZ MATRICES 胡晓 Hu Xiao 1 first-author 郑慧娆 Zheng Huirao 1 王治平 Wang Zhiping 1 张莉 Zhang Li 1 武汉大学数学系 武汉大学数学系 Department ctf Mathematics , Wuhan University,. Department ctf Mathematics , Wuhan University,. 对块数为ｍ×ｎ阶数为ｍｒ×ｎｓ的块－Ｔｏｅｐｌｉｔｚ矩阵Ｔ提出一种通过Ｔ的Ｃｈｏｌｅｓｋｙ因于Ｒ来求Ｔ的ＱＲ分解中上三角矩阵Ｒ及Ｒ－Ｔ的快速算法，计算量为Ｏ（ｍｎｒｓ２）。 A fast algorithm for the upper triangular matrix R of QR Decomposition of T. （which is m×n block - Toeplitz matrix with r×s rectangular blocks ）and R-T both using only O （mnrs2 ） multiplication is presented. where we get E and R-T by computing the Cholesky factor R of TTT. 块－Toeplitz矩阵 QR分解 Cholesky分解 hyperbolic Househotde O151.21 国家自然科学基金,国家攀登计划资助 1997-03-01 2021-04-01 3