摘要
获得了R-循环分块矩阵的一些充要条件,并利用FFT证明了有关算法的计算复杂性为O(n2mlog2m+mn3).
In this paper, some sufficient and necessary conditions for a block matrix to be Rblock circulant are given. It is proved that the computational complexity of some related algorithms is O(n2mlog2m+mn3).
出处
《四川师范大学学报(自然科学版)》
CAS
CSCD
1998年第4期395-398,共4页
Journal of Sichuan Normal University(Natural Science)