An algorithm to find the coefficients of thes-polynomialD(s) = |H(s)|is obtained, whereH(s)is an arbitrarys-polynomial square matrix. The algorithm, based on the fast Fourier transform (FFT), is of an order of magnitude faster than existing methods.
No takes yet. Share an insight, caveat, or question.
Paccagnella et al. (1976) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: