Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/37713
Title: Neural networks with problem decomposition for finding real roots of polynomials
Authors: Huang, DS
Chi, Z 
Issue Date: 2001
Source: Proceedings of the International Joint Conference on Neural Networks (IJCNN'2001), Washington, DC, U., 15-19 July 2001 How to cite?
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.
URI: http://hdl.handle.net/10397/37713
ISBN: 0-7803-7044-9
DOI: 10.1109/IJCNN.2001.1016718
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

29
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.