A fast algorithm FBTQ is presented which computes the QR factorization a block-Toeplitz matrix A (A∈R) in O(mns3) multiplications. We prove that the QR decomposition of A and the inverse Cholesky decomposition can be...A fast algorithm FBTQ is presented which computes the QR factorization a block-Toeplitz matrix A (A∈R) in O(mns3) multiplications. We prove that the QR decomposition of A and the inverse Cholesky decomposition can be computed in parallel using the sametransformation.We also prove that some kind of Toeplltz-block matrices can he transformed into the corresponding block-Toeplitz matrices.展开更多
文摘A fast algorithm FBTQ is presented which computes the QR factorization a block-Toeplitz matrix A (A∈R) in O(mns3) multiplications. We prove that the QR decomposition of A and the inverse Cholesky decomposition can be computed in parallel using the sametransformation.We also prove that some kind of Toeplltz-block matrices can he transformed into the corresponding block-Toeplitz matrices.
