| 两个Toeplitz矩阵(或Hankel矩阵)相乘的快速算法 |
| |
| 引用本文： | 沈光星. 两个Toeplitz矩阵(或Hankel矩阵)相乘的快速算法[J]. 杭州师范学院学报(社会科学版), 1991, 0(3) |
| |
| 作者姓名： | 沈光星 |
| |
| 作者单位： | 杭州师范学院数学系 |
| |
| 基金项目： | 浙江省自然科学基金资助课题 |
| |
| 摘 要： | 本文给出了两个n阶Toeplitz矩阵(或Hankcl矩阵)相乘以及Toeplitz矩阵与Hankel矩阵相乘的快速算法,这些算法的计算复杂性都为6n~2+O(nlog_2n)。
|
| 关 键 词： | Toeplitz矩阵 Hankel矩阵 矩阵快速乘法 |
THE FAST AIGORITHM FOR MULTIPCATION OF TWO TOEPLITZ MATRICES (OR HANKEL MATRICES) |
| |
| Shen Guangxing. THE FAST AIGORITHM FOR MULTIPCATION OF TWO TOEPLITZ MATRICES (OR HANKEL MATRICES)[J]. Journal of Hangzhou Teachers College(Humanities and Social Sciences), 1991, 0(3) |
| |
| Authors: | Shen Guangxing |
| |
| Affiliation: | Department of Mathematics |
| |
| Abstract: | In this paper, we present some fast algorithms for multipcation of two n-order Toeplitz matrices ( or n-order Hankel matrices ) and of n-order Toeplitz matrix and n-order Hankel matrix, proving that The com putation time complexity of these algorithms is 6n2 + O(nlog2n). |
| |
| Keywords: | Toeplitz matrix Hankel matrix fast multipcation of matrices. |
| 本文献已被 CNKI 等数据库收录！ |
