Determining the number of real roots of polynomials through neural networks

Computers and Mathematics with Applications

Volumn 51, Issue 3-4, 2006, Pages 527-536

  Mourrain, B ^a   Pavlidis, N G ^a,b   Tasoulis, D K ^a,b   Vrahatis, M N ^a,b  

^a INRIA   (France)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Neural networks; Number of zeros; Roots of polynomials

Indexed keywords

DIFFERENTIAL EQUATIONS; NEURAL NETWORKS; NUMERICAL METHODS; PROBLEM SOLVING;

NUMBER OF ZEROS; ROOTS OF POLYNOMIALS; TEST SETS; UNIVARIATE POLYNOMIALS;

POLYNOMIALS;

EID: 33646592519     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.07.012     Document Type: Article

References (25)

1. Huang D.S., Ip H.H.S., and Chi Z. A neural root finder of polynomials based on root moments. Neural Computation 16 8 (2004) 1721-1762
2. Washington, DC. Huang D.S., and Zheru C. Neural networks with problem decomposition for finding real roots of polynomials. Proceedings of the International Joint Conference on Neural Networks 2001 (IJCNN'01). July 15-19 (2001) 25-30
3. Perantonis S.J., Ampazis N., Varoufakis S., and Antoniou G. Constrained learning in neural networks: Application to stable factorization of 2-D polynomials. Neural Processing Letters 7 (1998) 5-14
4. Huang D.S. A constructive approach for finding arbitrary roots of polynomials by neural networks. IEEE Transactions on Neural Networks 15 2 (2004) 477-491
5. Karras D.A., and Perantonis S.J. An efficient constrained learning algorithm for feedforward networks. IEEE Transactions on Neural Networks 6 (1995) 1420-1434
6. Huang D.S. Constrained learning algorithms for finding the roots of polynomials: A case study. Proc. IEEE Region 10 Tech. Conf. on Computers, Communications, Control and Power Engineering (2002) 1516-1520
7. Haykin S. Neural Networks: A Comprehensive Foundation (1999), Macmillan College Publishing Company
8. Wilson D.R., and Martinez T.R. Improved heterogeneous distance functions. Journal of Artificial Intelligence Research 6 (1997) 1-34
9. Hagan M.T., and Menhaj M. Training feedforward networks with the marquardt algorithm. IEEE Transactions on Neural Network 5 6 (1994) 989-993
10. Igel C., and Hiisken M. Improving the Rprop learning algorithm. In: Bothe H., and Rojas R. (Eds). Proceedings of the Second International ICSC Symposium on Neural Computation (NC 2000) (2000), ICSC Academic Press, New York 115-121
11. Magoulas G.D., Plagianakos V.P., and Vrahatis M.N. Adaptive stepsize algorithms for on-line training of neural networks. Nonlinear Analysis, Theory, Methods and Applications 47 (2001) 3425-3430
12. Magoulas G.D., Vrahatis M.N., and Androulakis G.S. Effective backpropagation training with variable stepsize. Neural Networks 10 1 (1997) 69-82
13. Magoulas G.D., Vrahatis M.N., and Androulakis G.S. Increasing the convergence rate of the error backpropagation algorithm by learning rate adaptation methods. Neural Computation 11 7 (1999) 1769-1796
14. San Francisco, CA. Riedmiller M., and Braun H. A direct adaptive method for faster backpropagation learning: The rprop algorithm. Proceedings of the IEEE International Conference on Neural Networks (1993) 586-591
15. Vrahatis M.N., Androulakis G.S., Lambrinos J.N., and Magoulas G.D. A class of gradient unconstrained minimization algorithms with adaptive stepsize. J. Comput. Appl. Math. 114 2 (2000) 367-386
16. Vrahatis M.N., Magoulas G.D., and Plagianakos V.P. Globally convergent modification of the quickprop method. Neural Processing Letters 12 (2000) 159-170
17. Vrahatis M.N., Magoulas G.D., and Plagianakos V.P. From linear to nonlinear iterative methods. Applied Numerical Mathematics 45 1 (2003) 59-77
18. Møller M. A scaled conjugate gradient algorithm for fast supervised learning. Neural Networks 6 (1993) 525-533
19. Cybenko G. Approximations by superpositions of sigmoidal functions. Mathematics of Control, Signals, and Systems 2 (1989) 303-314
20. Hornik K. Multilayer feedforward networks are universal approximators. Neural Networks 2 (1989) 359-366
21. White H. Connectionist nonparametric regression: Multilayer feedforward networks can learn arbitrary mappings. Neural Networks 3 (1990) 535-549
22. Pinkus A. Approximation theory of the mlp model in neural networks. Acta Numerica (1999) 143-195
23. Dos Reis G., Mourrain B., Rouillier F., and Tribuchet Ph. An environment for symbolic and numeric computation. Technical Report ECG-TR-122102-03 (2002), INRIA
24. Mourrain B., Vrahatis M.N., and Yakoubsohn J.C. On the complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity 18 2 (2002) 612-640
25. Bini D. Numerical computation of polynomial zeros by means of Aberth's method. Numerical Algorithms 13 (1996) 179-200