Finding the maximum modulus roots of polynomials based on constrained neural networks

This paper focuses on how to find the Maximum Modulus Root (MMR) (real or complex) of an arbitrary polynomial. Efficient solution to this problem is important for many fields including neural computation and digital signal processing etc.. In this paper we present neural networks technique for solving this problem. Our Neural Root Finder (NRF) is designed based on partitioning Feedforward Neural Networks (FNN) trained with a Constrained Learning Algorithm (CLA) by imposing the a priori information about the root moment from polynomial into the error cost function. Experimental results show that this neural root-finding method is able to find the maximum modulus roots of polynomials rapidly and efficiently.