A novel FFT based fast algorithm for solving high-order polynomial

International Journal of Digital Content Technology and its Applications

Volumn 5, Issue 2, 2011, Pages 126-132

  Fuguo, Dong ^a   Tong, Zhou ^a   Pingqin, Wang ^a  

^a SHANDONG INSTITUTE OF BUSINESS AND TECHNOLOGY   (China)

Author keywords

Fast algorithm; Fast fourier transform; High order polynomial

Indexed keywords

FAST FOURIER TRANSFORMS;

ALGORITHM ANALYSIS; ALGORITHM FOR SOLVING; FAST ALGORITHMS; HIGH ORDER POLYNOMIAL; SOLVING ALGORITHM;

POLYNOMIALS;

EID: 79952796475     PISSN: 19759339     EISSN: None     Source Type: Journal    
DOI: 10.4156/jdcta.vol5.issue2.14     Document Type: Article

References (15)

1. Ma. Louise A.N. DeLas Penas. Exploring Higher Order Polynomial Functions. 2005 CASIO Computer Co., LTD. Page:F02021-F02026
2. Gordon Wong. Higher-Order Polynomials. 2008 Vancouver Community College Learning Centre.
3. DONG Fu-guo, LI Yu-rong. Study on Qin JiuShao algorithm and its application in RSA [J]. Computer Engineering and Applications,2008,44(28):65-66,78 [[Chinese Source] RSA[Chinese Source] [J]. [Chinese Source], 2008, 44(28):65-66, 78]
4. J.W. Cooley and J.W. Tukey. An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19:297.301, 1965.
5. J. W. Cooley, P. A. Lewis, and P. D. Welch. History of the fast Fourier transform. In Proc. IEEE,volume 55, pages 1675.1677, October 1967.
6. Herman H. Goldstine. A History of Numerical Analysis from the 16th through the 19th Century. Springer-Verlag, New York, 1977. ISBN 0-387-90277-5.
7. I. J. Good. The interaction algorithm and practical Fourier analysis. Journal Roy. Stat. Soc., 20:361.372, 1958.
8. M. T. Heideman, D. H. Johnson, and C. S. Burrus. Gauss and the history of the Fast Fourier Transform. Archive for History of Exact Sciences, 34:265.267, 1985.
9. IEEE. Special issue on fast Fourier transform. IEEE Trans. on Audio and Electroacoustics, AU-17:65.186, 1969.
10. Morgenstern. Note on a lower bound of the linear complexity of the fast Fourier transform. JACM: Journal of the ACM, 20, 1973.
11. Rudnick. Note on the calculation of Fourier series (in Technical Notes and Short Papers). j-MATH-COMPUT, 20(95):429.430, July 1966. ISSN 0025-5718.
12. F. Yates. The design and analysis of factorial experiments, volume 35 of Impr. Bur. Soil Sci. Tech. Comm.1937.
13. Benjelloun, H.J. Tellez Oliva, R. Prevot, Edge Closing of Synthetic and Real Images using Polynomial Fitting, JCIT, Vol. 2, No. 4, pp. pp-.9, 2007
14. Siwar Zribi Boujelbene, Dorra Ben Ayed Mezghani, Noureddine Ellouze, Improving SVM by Modifying Kernel Functions for Speaker Identification Task, JDCTA, Vol. 4, No. 6, pp. 100-105, 2010
15. Xiaowei Zhang, Bin Li, Junwu Zhu, Jun Wu, "Utility Based Optimal Task Scheduling Problem in a Multi-agent System", JDCTA, Vol. 4, No. 9, pp. 27-35, 2010