In this paper, we present a fast Fourier transform algorithm for the inverse of Rblock circulant matrices of order mn, its arithmetic complexity is o（mn log2 mn）.
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...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 present a fast Fourier transform algorithm for the inverse of Rblock circulant matrices of order mn, its arithmetic complexity is o（mn log2 mn）.
文摘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.
