A procedure for computing the coefficients of a polynomial from its roots, based on the discrete Fourier transform, is presented. The scheme gives acceptable accuracy even when used with polynomials of very high order, in contrast to the standard computational method.
No takes yet. Share an insight, caveat, or question.
M.H. Ackroyd (1970) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: