摘要
利用快速傅里叶变换给出求鳞状循环因子矩阵m次根一种快速算法,同时证明了n阶鳞状循环因子矩阵的m次根中仍为鳞状循环因子矩阵的个数为mn。该算法已编成M文件在Matlab 7.0上运行通过,验证了该算法是稳定有效的。
In this paper,a fast algorithm for computing matrix m-th root of scaled circulant factor matrices by FFT is given.At the same time,it also proves that among the matrix m-th roots of the n-order scaled circulant factor matrices the number of the roots still be scaled circulant factor matrices is mn.The algorithm has been programmed to M-file and has run and passed on Matlab 7.0,which verifies that the algorithm is stable and effective.
出处
《计算机应用与软件》
CSCD
2009年第11期88-90,共3页
Computer Applications and Software
基金
浙江省教育厅科研计划项目(20061554)。
