论文信息 - FFT calculation of a determinantal polynomial

FFT calculation of a determinantal polynomial

An algorithm to find the coefficients of the s -polynomial D(s) = |H(s)| is obtained, where H(s) is an arbitrary s -polynomial square matrix. The algorithm, based on the fast Fourier transform (FFT), is of an order of magnitude faster than existing methods.

G. Pierobon | L. Paccagnella | G. Pierobon | L. Paccagnella

[1] E. Emre,et al. Generalization of Leverrier's algorithm to polynomial matrices of arbitrary degree , 1975 .

[2] Neil Munro,et al. Inversion of rational polynomial matrices , 1970 .

[3] C. Kurth,et al. A Simple Calculation of the Determinant Polynomial of General Networks , 1967, IEEE Transactions on Circuit Theory.