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

Science in China, Series F: Information Sciences

Volumn 47, Issue 2, 2004, Pages 232-245

  Huang, Deshuang ^a   Chi, Zheru ^b  

^a INSTITUTE OF INTELLIGENT MACHINES   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Adaptive parameter selection; BP neural networks; Constrained learning algorithm; High order arbitrary polynomials; Jenkins Traub method; Laguerre method; Muller method; Real or complex roots; Recursive partitioning method

Indexed keywords

EID: 24944586784     PISSN: 10092757     EISSN: None     Source Type: Journal    
DOI: 10.1360/01yf0437     Document Type: Article

References (16)

1. William, H. P., Saul, A. T., William, T. V. et al., Numerical Recipes in Fortran, 2nd ed., New York: Cambridge Univ. Press, 1992, ch.9.
2. Lang, M., Frenzel, B.-C., Polynomial root finding, IEEE Signal Processing Letters, 1994, 1(10): 141-143.
3. m), IEEE Trans. Information Theory, 1989, 35(2): 444-453.
4. Aliphas, A., Narayan, S.S., Peterson, A. M., Finding the zeros of linear phase FIR frequency sampling filters, IEEE Trans. Acoust., Speech Signal Processing, June 1983, 31:729-734.
5. Schmidt, C. E., Rabiner, L. R., A study of techniques for finding the zeros of linear phase FIR digital filters, IEEE Trans. Acoust., Speech Signal Processing, Feb. 1977, 25: 96-98.
6. Steiglitz, K., Dickinson, B., Phase unwrapping by factorization, IEEE Trans. Acoust., Speech Signal Processing, Dec. 1982, 30: 984-991.
7. Baldi, P. F., Hornik, K., Learning in linear neural networks: A survey, IEEE Trans. on Neural Networks, 1995, 6(4): 837-858.
8. Huang, D. S., Systemic Theory of Neural Networks for Pattern Recognition, Beijing: Publishing House of Electronics Industry, 1996.
9. Huang, D. S., Linear feedforward neural network classifiers and reduced-rank approximation, 1998 4th ICSP Proceedings, Oct. 12-16, 1998, Beijing, China, Beijing: Publishing House of Electronics Industry, 1331-1334.
10. Hertz, J., Krogh, A., Palmer, R.G., Introduction to the Theory of Neural Computation, Reading, MA: Addison-Wesley, 1991.
11. Karras, D. A., Perantonis, S. J., An efficient constrained training algorithm for feedforward networks, IEEE Trans. Neural Networks, 1995, 6: 1420-1434.
12. Perantonis, S. J., Ampazis, N., Varoufakis, S. J. et al., Factorization of 2-D polynomials using neural networks and constrained learning techniques, Proceedings of the IEEE Int. Sympos. on Industrial Electronics, ISIE'97, 1997, 1276-1280.
13. Diamantaras, K. I., Kung, S. Y., Principal Component Neural Networks: Theory and Applications, New York: Wiley, 1996.
14. Huang, D. S., Chi Zheru, Neural networks with problem decomposition for finding real roots of polynomials, 2001 Int. Joint Conf. on Neural Networks (IJCNN2001), Washington, DC, Vol. Addendum, July 15-19, 2001, 25-30.
15. Huang, D. S., Chi Zheru, Finding complex roots of polynomials by feedforward neural networks, 2001 Int. Joint Conf. on Neural Networks (IJCNN2001), Washington, DC, Vol. Addendum, July 15-19, 2001, 13-18.
16. Huang, D. S., Ip, H. H. S., Chi Zheru et al., Dilation method for finding close roots of polynomials based on constrained learning neural networks, Physics Letters A, 2003, 309(5-6): 443-451.