摘要
In this paper, we researched the radication of r-circulant matrix, and presented an algorithm (RDCT algorithm) for radication of r-circulant matrix of n-order, it neeedn't caculate the eigenvalues, proved that the quantity of all radical matricesis 2n, and that the computation time complexity is O(n log2 n) for calculating one radical matrix and which is O(n2^n) for calculating all radical matrices by using FFT.
In this paper, we researched the radication of r-circulant matrix, and presented
an algorithm (RDCT algorithm) for radication of r-circulant matrix of n-order, it
neeedn't caculate the eigenvalues, proved that the quantity of all radical matrices
is 2~n, and that the computation time complexity is O(n log_2 n) for calculating one
radical matrix and which is O(n2~n) for calculating all radical matrices by using
FFT.
出处
《数值计算与计算机应用》
CSCD
北大核心
2004年第2期122-127,共6页
Journal on Numerical Methods and Computer Applications
基金
国家自然科学基金(9971024)
浙江省自然科学基金(199047)
关键词
R-循环矩阵
开平方
特征值
逆
r-circulant
radication
quantity of radical matrices
time complexity
