Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18130
Title: A neural root finder of polynomials based on root moments
Authors: Huang, DS
Ip, HHS
Chi, Z 
Issue Date: 2004
Publisher: M I T Press
Source: Neural computation, 2004, v. 16, no. 8, p. 1721-1762 How to cite?
Journal: Neural Computation 
Abstract: This letter proposes a novel neural root finder based on the root moment method (RMM) to find the arbitrary roots (including complex ones) of arbitrary polynomials. This neural root finder (NRF) was designed based on feedforward neural networks (FNN) and trained with a constrained learning algorithm (CLA). Specifically, we have incorporated the a priori information about the root moments of polynomials into the conventional backpropagation algorithm (BFA), to construct a new CLA. The resulting NRF is shown to be able to rapidly estimate the distributions of roots of polynomials. We study and compare the advantage of the RMM-based NRF over the previous root coefficient method-based NRF and the traditional Muller and Laguerre methods as well as the mathematica roots function, and the behaviors, the accuracies of the resulting root finders, and their training speeds of two specific structures corresponding to this FNN root finder: the log Σ and the Σ - ∏ FNN. We also analyze the effects of the three controlling parameters {δP0θp,η} with the CLA on the two NRFs theoretically and experimentally. Finally, we present computer simulation results to support our claims.
URI: http://hdl.handle.net/10397/18130
ISSN: 0899-7667
DOI: 10.1162/089976604774201668
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

66
Last Week
1
Last month
0
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

60
Last Week
0
Last month
0
Citations as of Sep 21, 2017

Page view(s)

47
Last Week
1
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



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