Zeroing polynomials using modified constrained neural network approach.
This paper proposes new modified constrained learning neural root finders (NRFs) of polynomial constructed by backpropagation network (BPN). The technique is based on the relationships between the roots and the coefficients of polynomial as well as between the root moments and the coefficients of the polynomial. We investigated different resulting constrained learning algorithms (CLAs) based on the variants of the error cost functions (ECFs) in the constrained BPN and derived a new modified CLA (MCLA), and found that the computational complexities of the CLA and the MCLA based on the root-moment method (RMM) are the order of polynomial, and that the MCLA is simpler than the CLA. Further, we also discussed the effects of the different parameters with the CLA and the MCLA on the NRFs. In particular, considering the coefficients of the polynomials involved in practice to possibly be perturbed by noisy sources, thus, we also evaluated and discussed the effects of noises on the two NRFs. Finally, to demonstrate the advantage of our neural approaches over the nonneural ones, a series of simulating experiments are conducted.
Huang
De-Shuang
DS
Intelligent Computing Laboratory, Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, Anhui 230031, China. huangdeshuang@yahoo.com
Ip
Horace H S
HH
Law
Ken Chee Keung
KC
Chi
Zheru
Z
D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D016571:Neural Networks, Computer; D009716:Numerical Analysis, Computer-Assisted; D012815:Signal Processing, Computer-Assisted; D013269:Stochastic Processes