A Neural Root Finder of Polynomials Based on Root Moments

DOI10.1162/089976604774201668zbMath1102.68560OpenAlexW2126262069MaRDI QIDQ4832491

Zheru Chi, De-Shuang Huang, Horace H. S. Ip

Publication date: 4 January 2005

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/089976604774201668

zbMATH Keywords

Constrained Learning Algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

Machine learning the real discriminant locus ⋮ Modified constrained learning algorithms incorporating additional functional constraints into neural networks ⋮ Improved constrained learning algorithms by incorporating additional functional constraints into neural networks ⋮ A case study for constrained learning neural root finders ⋮ Determining the number of real roots of polynomials through neural networks ⋮ A new approach for function approximation incorporating adaptive particle swarm optimization and a priori information ⋮ A new image thresholding method based on Gaussian mixture model ⋮ A hybrid learning algorithm combined with generalized RLS approach for radial basis function neural networks ⋮ New conditions for global exponential stability of cellular neural networks with delays

Cites Work

• Dilation method for finding close roots of polynomials based on constrained learning neural networks
• Phase unwrapping by factorization
• On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
• Equiripple minimum phase FIR filter design from linear phase systems using root moments
• Accelerated Solution of Multivariate Polynomial Systems of Equations

This page was built for publication: A Neural Root Finder of Polynomials Based on Root Moments