]*>","")" /> 对称Toeplitz矩阵相乘的快速算法

• 论文 • 上一篇    下一篇

对称Toeplitz矩阵相乘的快速算法

沈光星   

  1. 杭州师范学院计算机系
  • 出版日期:1997-01-20 发布日期:1997-01-20

沈光星. 对称Toeplitz矩阵相乘的快速算法[J]. 数值计算与计算机应用, 1997, 18(1): 15-19.

THE FAST ALGORITHM FOR MULTIPLICATION OF THE SYMMETRIC TOEPLITZ MATRICES

  1. Shen Guangxing(Department of Computer, Hangzhou Teachers' College)
  • Online:1997-01-20 Published:1997-01-20
In this paper, we give the fast algorithm for multiplication for two n-order symmetricToeplitz matrices, proving that the time complexity of this algoithm are n~2 (multiplication) and 2n~2 - 4n + 3 (addition), and that the space complexity of this algorithm isn2 + 4.
()

[1] N.Levinson,The weiner RMS error griterion in filter design and prediction, J , Math. Phys 25(1947),261—278.
[2] W.F. Thench, An algorithm for the inversion of finite toeplitz matrices, J. SIAM, 12(964), 515—522.
[3] 徐士良编,计算机常用算法,清华大学出版社,1994.
[4] 游兆永、李磊,关于三角形Toeplitz系统的复杂性,计算数学, 9:3 (1987),262—265.
No related articles found!
阅读次数
全文


摘要