摘要
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.
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.
出处
《数值计算与计算机应用》
CSCD
北大核心
1997年第1期15-19,共5页
Journal on Numerical Methods and Computer Applications
基金
国家和浙江省自然科学基金
