A neural root finder of polynomials based on root moments

Neural Computation

Volumn 16, Issue 8, 2004, Pages 1721-1762

  Huang, De Shuang ^a,b   Ip, Horace H S ^a   Chi, Zheru ^c  

^a INSTITUTE OF INTELLIGENT MACHINES   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042584634     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976604774201668     Document Type: Article

References (23)

1. Aliphas, A., Narayan, S. S., & Peterson, A. M. (1983). Finding the zeros of linear phase FIR frequency sampling filters. IEEE Trans. Acoust., Speech Signal Processing, 31, 729-734.
2. Anthony, R., & Philip, R. (1978). A first course in numerical analysis. New York: McGraw-Hill.
3. Hormis, R., Antonion, G., & Mentzelopoulou, S. (1995). Separation of twodimensional polynomials via a Σ - ∏ neural net. In Proceedings of International Conference on Modelling and Simulation (pp. 304-306). Pittsburg, PA: International Society of Modeling and Simulation.
4. Hoteit, L. (2000). FFT-based fast polynomial rooting. In Proceedings of ICASSP '2000, 6 (pp. 3315-3318). Istanbul: IEEE.
5. Huang, D. S. (2001). Finding roots of polynomials based on root moments. In 8th Int. Conf. on Neural Information Processing (ICONIP), 3, 1565-1571. Shanghai, China: Publishing House of Electronic Industry.
6. Huang, D. S. (2001). Revisit to constrained learning algorithm. In The 8th International Conference on Neural Information Processing (ICONIP) (Vol. I, pp. 459-464). Shanghai, China: Publishing House of Electronic Industry.
7. Huang, D. S. (2004). A constructive approach for finding arbitrary roots of polynomials by neural networks. IEEE Trans on Neural Networks, Vol. 15, No. 2, pp. 477-491.
8. Huang, D. S., & Chi, Z. (2001). Neural networks with problem decomposition for finding real roots of polynomials. In 2001 Int. Joint Conf. on Neural Networks (IJCNN2001). Washington, DC: IEEE.
9. Huang, D. S., Chi, Z., & Siu, W. C. (2000). Finding real roots of polynomials based on constrained learning neural networks (Tech. Rep.). Hong Kong: Hong Kong Polytechnical University.
10. Huang, D. S., Ip, H., Chi, Z., & Wong, H. S. (2003), Dilation method for finding close roots of polynomials based on constrained learning neural networks. Physics Letters A, 309, 443-451.
11. Hush, D. R., Home, B., & Salas, J. M. (1992). Error surfaces for multilayer perceptrons. IEEE Trans. Syst., Man Cybern, 22, 1152-1161.
12. Karras, D. A., & Perantonis, S. J. (1995). An efficient constrained training algorithm for feedforward networks. IEEE Trans. Neural Networks, 6, 1420-1434.
13. Lang, M., & Frenzel, B.-C. (1994). Polynomial root finding. IEEE Signal Processing Letters, 1, 141-143.
14. Milovanovic, G. V., & Petkovic, M. S. (1986). On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros. ACM Transactions on Mathematical Software, 12, 295-306.
15. Mourrain, B., Pan, V. Y, & Ruatta, O. (2003). Accelerated solution of multivariate polynomial systems of equations. SIAM J. Comput., 32, 435-454.
16. Perantonis, S. J., Ampazis, N., Varoufakis, S., & Antoniou, G. (1998). Constrained learning in neural networks: Application to stable factorization of 2-D polynomials. Neural Processing Letters, 7, 5-14.
17. Schmidt, C. E., & Rabiner, L. R. (1977). A study of techniques for finding the zeros of linear phase FIR digital filters. IEEE Trans. Acoust., Speech Signal Processing, 25,96-98.
18. Stathaki, T. (1998). Root moments: A digital signal-processing perspective. IEEE Proc. Vis. Image Signal Processing, 145, 293-302.
19. Stathaki, T., & Constantinides, A. G. (1995). Root moments: An alternative interpretation of cepstra for signal feature extraction and modeling. In Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (Vol. 2, pp. 1477-1481).
20. Stathaki, T., & Fotinopoulos, I. (2001). Equiripple minimum phase FIR filter design from linear phase systems using root moments. IEEE Trans on Cirsuits and Systems-II: Analog and Digital Processing, 48, 580-587.
21. Steiglitz, K., & Dickinson, B. (1982). Phase unwrapping by factorization. IEEE Trans. Acoust., Speech Signal Processing, 30, 984-991.
22. Thomas, B., Arani, F., & Honary, B. (1997). Algorithm for speech model root location. Electronics Letters, 33, 355-356.
23. William, H. P., Saul, A. T., William, T. V., & Brian, P. F. (1992). Numerical recipes in Fortran (2nd ed.). Cambridge: Cambridge University Press.