A constructive approach for finding arbitrary roots of polynomials by neural networks

IEEE Transactions on Neural Networks

Volumn 15, Issue 2, 2004, Pages 477-491

  Huang, De Shuang ^a  

^a INSTITUTE OF INTELLIGENT MACHINES   (China)

Author keywords

Adaptive learning parameters; Computational complexity; Constrained learning; Multilayer perceptron networks; Polynomials; Recursive; Root moment; Roots

Indexed keywords

BACKPROPAGATION; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRYPTOGRAPHY; DECODING; LEARNING ALGORITHMS; LEARNING SYSTEMS; LINEAR EQUATIONS; POLYNOMIALS; ROOT LOCI;

ADAPTIVE LEARNING PARAMETERS; CONSTRAINED LEARNING ALGORITHM; DIRECTION-OF-ARRIVAL ESTIMATION; ROOT MOMENTS;

MULTILAYER NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; STATISTICAL MODEL;

MODELS, STATISTICAL; NEURAL NETWORKS (COMPUTER);

EID: 2442503670     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2004.824424     Document Type: Article

References (32)

1. S. R. Tate, "Stable computation of the complex roots of unity," IEEE Trans. Signal Processing, vol. 43, pp. 1709-1711, July 1995.
2. F. Y. Yan and C. C. Ko, "Method for finding roots of quartic equation with application to RS codes," Electron. Lett., vol. 34, pp. 2399-2400, 1998.
3. T. N. Lucas, "Finding roots of polynomials by using the Routh array," Electron. Lett., vol. 32, pp. 1519-1521, 1996.
4. A. Aliphas, S. S. Narayan, and A. M. Peterson, "Finding the zeros of linear phase FIR frequency sampling filters," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 729-734, June 1983.
5. C. E. Schmidt and L. R. Rabiner, "A study of techniques for finding the zeros of linear phase FIR digital filters," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 96-98, Feb. 1977.
6. K. Steiglitz and B. Dickinson, "Phase unwrapping by factorization," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-30, pp. 984-991, Dec. 1982.
7. B. Thomas, F. Arani, and B. Honary, "Algorithm for speech model root location," Electron. Lett., vol. 33, pp. 355-356, 1997.
8. D. Starer and A. Nehorai, "Adaptive polynomial factorization by coefficient matching," IEEE Trans. Signal Processing, vol. 39, pp. 527-530, Feb. 1991.
9. H. P. William, A. T. Saul, T. V. William, and P. F. Brian, Numerical Recipes in Fortran, 2nd ed. New York: Cambridge Univ. Press, 1992, ch. 9.
10. R. Anthony and R. Philip, A First Course in Numerical Analysis. New York: McGraw-Hill, 1978.
11. P. Henrici, Elements of Numerical Analysis. New York: Wiley, 1964.
12. M. Lang and B. C. Frenzel, "Polynomial root finding," IEEE Signal Processing Lett., vol. 1, pp. 141-143, Oct. 1994.
13. L. Hoteit, "FFT-based fast polynomial rooting," in Proc. Int. Conf. Acoustics, Speech, and Signal Processing 2000 (ICASSP'00), vol. 6, Istanbul, Turkey, June 2000, pp. 3315-3318.
14. S. J. Perantonis and D. A. Karras, "An efficient constrained learning algorithm with momentum acceleration," Neural Networks, vol. 6, pp. 237-249, 1995.
15. D. A. Karras and S. J. Perantonis, "An efficient constrained training algorithm for feedfoward networks," IEEE Trans. Neural Networks, vol. 6, pp. 1420-1434, Nov. 1995.
16. S. J. Perantonis, N. Ampazis, S. Varoufakis, and G. Antoniou, "Constrained learning in neural networks: Application to stable factorization of 2-D Polynomials," Neural Processing Lett., vol. 7, pp. 5-14, 1998.
17. D.-S. Huang and Zheru Chi, "Neural networks with problem decomposition for finding real roots of polynomials," in Proc. Int. Joint Conf. on Neural Networks 2001 (IJCNN'01), Washington, DC, July 15-19, 2001, Addendum, pp. 25-30.
18. D. R. Hush and B. G. Horne, "Progress in supervised neural networks," IEEE Signal Processing Mag., vol. 10, pp. 8-39, Jan. 1993.
19. D. S. Huang and S. D. Ma, "Linear and nonlinear feedforward neural network classifiers: A comprehensive understanding," J. Intelligent Syst., vol. 9, pp. 1-38, 1999.
20. J. Hertz, A. Krogh, and R. G. Palmer, Introduction to the Theory of Neural Computation. Reading, MA: Addison-Wesley, 1992.
21. D. S. Huang, "One-layer linear perceptron for the inversion of nonsingular matrix," in Proc. Internat. Conf. Robot, Optimization, Vision, Parallel Industry Automation (ROVPIA'96), Ipoh, Malaysia, Nov. 28-30, 1996, pp. 639-643.
22. D. S. Huang and Z. Chi, "Solving linear simultaneous equations by constraining learning neural networks," in Proc. Int. Joint Conf. on Neural Networks 2001 (IJCNN2001), Washington, DC, July 15-19, 2001, Addendum, pp. 31-26.
23. L. Kinderman, A. Lewandowski, and P. Protzel, "A framework for solving functional equations with neural networks," in Proc. Neural Information Processing, ICONIP'01, 02, Shanghai, China, Nov. 14-17, 2001, pp. 1075-1078.
24. D. S. Huang, "Finding roots of polynomials based on root moments," in Proc. Eighth Internat. Conf. on Neural Information Processing (ICONIP'01), vol. III, Shanghai, China, Nov. 14-18, 2001, pp. 1565-1571.
25. D. S. Huang, "Constrained learning algorithms for finding the roots of polynomials: A case study," in Proc. IEEE Region 10 Tech. Conf. on Computers, Communicatins, Control and Power Engineering, Oct. 28-31, 2002, pp. 1516-1520. Tech. Rep.
26. T. Stathaki, "Root moments: A digital signal-processing perspective," Inst. Elect. Eng. Proc. Vision Image Signal Processing, vol. 145, pp. 293-302, Aug. 1998.
27. Handbook of Mathematics, Publ. House High Educat., Beijing, China, 1979, pp. 87-116. D. Z. Fang, in Chinese.
28. R. Hormis, G. Antonion, and S. Mentzelopoulou, "Separation of two-dimensional polynomials via a Σ - Π neural net," in Proc. Int. Conf. Modeling and Simulation, Pittsburgh, PA, 1995, pp. 304-306.
29. D. S. Huang, H. H. S. Ip, Z. Chi, and H. S. Wong, "Dilation method for finding close roots of polynomials based on constrained learning neural networks," Phys. Lett. A, vol. 309, pp. 443-451, 2003.
30. D. E. Rumelhart, G. E. Hinton, and R. J. Williams, "Learning internal representations by error propagation," in Parallel Distributed Processing: Explorations in the Microstructure of Cognition, D. E. Rumelhart and J. L. McClelland, Eds. Cambridge, MA: MIT Press, 1986, ch. 8, pp. 318-362.
31. D. R. Hush, B. Horne, and J. M. Salas, "Error surfaces for multilayer perceptrons," IEEE Trans. Syst., Man, Cybern., vol. 22, pp. 1152-1161, Sep./Oct. 1992.
32. A. E. Bryson and W. F. Denham, "A steepest-ascent method for solving optimum programming problems," J. Appl. Mechan., vol. 29, pp. 247-257, 1962.