An improved fast algorithm for the k-th root of permutation factor circulant matrices

Permutation factor circulant matrices have been applied widely in numerical computation, signal processing, coding theory and oil investigation in recent years, and so on. In this paper, we present a fast algorithm for the k-th root of permutation factor circulant matrices of order n by the fast Fourier transform (FFT), and give a numerical example in order to show the effectiveness of our algorithm finally.