论文信息 - A Novel FFT Based Fast Algorithm for Solving High-Order Polynomial - 字舞流文

A Novel FFT Based Fast Algorithm for Solving High-Order Polynomial

Dong Fuguo | Zhou Tong | Wang Pingqin

[1] Don H. Johnson,et al. Gauss and the history of the fast Fourier transform , 1984, IEEE ASSP Magazine.

[2] Bin Li,et al. Utility Based Optimal Task Scheduling Problem in a Multi-agent System , 2010, J. Digit. Content Technol. its Appl..

[3] Siwar Zribi Boujelbene,et al. Improving SVM by Modifying Kernel Functions for Speaker Identification Task , 2010, J. Digit. Content Technol. its Appl..

[4] Herman Heine Goldstine,et al. A History of Numerical Analysis from the 16th through the 19th Century. , 1976 .

[5] J. Tukey,et al. An algorithm for the machine calculation of complex Fourier series , 1965 .

[6] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[7] Mohammed Benjelloun,et al. Edge Closing of Synthetic and Real Images using Polynomial Fitting , 2007, J. Convergence Inf. Technol..