In this paper we consider the block Toeplitz operators TФ on the weighted Bergman space A2α（D, Cn） and we give a necessary and sufficient condition for the hyponor-mality of block Toeplitz operators with symbol in...In this paper we consider the block Toeplitz operators TФ on the weighted Bergman space A2α（D, Cn） and we give a necessary and sufficient condition for the hyponor-mality of block Toeplitz operators with symbol in the class of functions Ф=F ＋ G＊ withmatrix-valued polynomial functions F and G with degree 2.展开更多
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 Cholesky decomposition and a fast inverse Cholesky decomposition method for A T A are presented,where A is an m×n rectangular Toeplitz block matrix,we give the FCD algorithm for computing...A fast Cholesky decomposition and a fast inverse Cholesky decomposition method for A T A are presented,where A is an m×n rectangular Toeplitz block matrix,we give the FCD algorithm for computing R , and the FICD algorithm for computing R -1 ,both allow for an efficient parallel implementation,for solving a least squares problem and require only O(mn) operations.展开更多
基金supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(2009-0093827)
文摘In this paper we consider the block Toeplitz operators TФ on the weighted Bergman space A2α（D, Cn） and we give a necessary and sufficient condition for the hyponor-mality of block Toeplitz operators with symbol in the class of functions Ф=F ＋ G＊ withmatrix-valued polynomial functions F and G with degree 2.
文摘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 Cholesky decomposition and a fast inverse Cholesky decomposition method for A T A are presented,where A is an m×n rectangular Toeplitz block matrix,we give the FCD algorithm for computing R , and the FICD algorithm for computing R -1 ,both allow for an efficient parallel implementation,for solving a least squares problem and require only O(mn) operations.
