DocumentCode
3351974
Title
Finding multiple real roots by neural networks based on complete discrimination system of polynomial
Author
Zhang, Xinli ; Zhu, Dayong ; Hu, Wang
Author_Institution
Dept. of Comput. Sci., Chengdu Univ. of Inf. Technol., Chengdu
fYear
2008
fDate
21-24 Sept. 2008
Firstpage
236
Lastpage
241
Abstract
A new method of solving the multiple real roots of polynomial by neural networks is proposed in this paper. This method combines the symbolic method with the numerical method. Based on the complete discrimination system of polynomial, the number and multiplicities of the distinct real roots of polynomials can be explicit determined. According to the number of the distinct real roots, a neural networks model for finding the multiple real roots of polynomial is established. From the description of the new model, it is not difficult to find that the existent neural networks for finding real roots of polynomial is the special case of the new one, where all of the real roots are treated as different values. Through training the new model by the gradient descent method, the approximate real roots of polynomial can be obtained. From the simulation results, it is shown that, comparing to the existent neural networks of finding real roots, the new method is not only more effective, but also can avoid the inequality between two or more equal real roots after finishing to solve the polynomial.
Keywords
gradient methods; learning (artificial intelligence); mathematics computing; neural nets; polynomial approximation; symbol manipulation; complete discrimination system; gradient descent method; multiple real root; neural network; numerical method; polynomial approximation; symbolic method; Computational intelligence; Computer networks; Computer science; Equations; Finishing; Intelligent networks; Intelligent systems; Laboratories; Neural networks; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Cybernetics and Intelligent Systems, 2008 IEEE Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4244-1673-8
Electronic_ISBN
978-1-4244-1674-5
Type
conf
DOI
10.1109/ICCIS.2008.4670918
Filename
4670918
Link To Document