In a previous publication, we have used the discrete Fourier transform to compute the binomial coefficients. In the present paper, we extend the previously proposed method to compute the multinomial coefficients, analyse its precision and performance. The other methods, analysed in our previous publication, are also extended to the multinomial case. The FFT method presents the best performance to compute all multinomial coefficients at a given level.

中文翻译：

---

快速计算多项式系数

在以前的出版物中，我们使用离散傅立叶变换来计算二项式系数。在本文中，我们扩展了先前提出的方法来计算多项式系数，分析了其精度和性能。我们以前的出版物中分析的其他方法也扩展到多项式的情况。FFT方法具有最佳性能，可以在给定级别上计算所有多项式系数。