Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method

This paper proposes a novel recursive partitioning method based on constrained learning neural networks to find an arbitrary number (less than the order of the polynomial) of (real or complex) roots of arbitrary polynomials. Moreover, this paper also gives a BP network constrained learning algorithm (CLA) used in root-finders based on the constrained relations between the roots and the coefficients of polynomials. At the same time, an adaptive selection method for the parameter δP with the CLA is also given. The experimental results demonstrate that this method can more rapidly and effectively obtain the roots of arbitrary high order polynomials with higher precision than traditional root-finding approaches.

[1]  Zheru Chi,et al.  Neural networks with problem decomposition for finding real roots of polynomials , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[2]  C. E. Schmidt,et al.  A study of techniques for finding the zeros of linear phase FIR digital filters , 1977 .

[3]  Markus Lang,et al.  Polynomial root finding , 1994, IEEE Signal Processing Letters.

[4]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[5]  Dimitris A. Karras,et al.  An efficient constrained training algorithm for feedforward networks , 1995, IEEE Trans. Neural Networks.

[6]  Kurt Hornik,et al.  Learning in linear neural networks: a survey , 1995, IEEE Trans. Neural Networks.

[7]  Paul C. van Oorschot,et al.  A geometric approach to root finding in GF(qm) , 1989, IEEE Trans. Inf. Theory.

[8]  Zheru Chi,et al.  Finding complex roots of polynomials by feedforward neural networks , 2001, IJCNN'01. International Joint Conference on Neural Networks. Proceedings (Cat. No.01CH37222).

[9]  De-Shuang Huang.  Linear feedforward neural network classifiers and reduced-rank approximation , 1998, ICSP '98. 1998 Fourth International Conference on Signal Processing (Cat. No.98TH8344).

[10]  Kenneth Steiglitz,et al.  Phase unwrapping by factorization , 1982 .

[11]  Sun-Yuan Kung,et al.  Principal Component Neural Networks: Theory and Applications , 1996 .

[12]  De-Shuang Huang,et al.  Dilation method for finding close roots of polynomials based on constrained learning neural networks , 2003 .

[13]  A. Aliphas,et al.  Finding the zeros of linear phase FIR frequency sampling digital filters , 1983 .

[14]  George E. Antoniou,et al.  Factorization of 2-D polynomials using neural networks and constrained learning techniques , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.