DocumentCode
1936688
Title
Neural networks with problem decomposition for finding real roots of polynomials
Author
Huang, De-Shuang ; Chi, Zheru
fYear
2001
fDate
15-19 July 2001
Abstract
This paper proposes applying feedforward neural networks (FNN) with problem decomposition and constrained learning to finding the real roots of polynomials. In order to alleviate ihe load of the computational complexity for high order polynomials, this network model is extended to one which works recursively with a small number of the real roots of a polynomial (less than the total number of roots to be found) obtained at a time. The recursive formulae for finding i real roots at a time are presented Finallx some computer simulaiion results are reported.
Keywords
Computational complexity; Computational intelligence; Feedforward neural networks; Intelligent networks; Learning systems; Machine learning; Neural networks; Polynomials; Signal processing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 2001. Proceedings. IJCNN '01. International Joint Conference on
Conference_Location
Washington, DC, USA
ISSN
1098-7576
Print_ISBN
0-7803-7044-9
Type
conf
DOI
10.1109/IJCNN.2001.1016718
Filename
1016718
Link To Document