Dilation method for finding close roots of polynomials based on constrained learning neural networks

DOI10.1016/S0375-9601(03)00216-0zbMath1011.65024OpenAlexW2018493531MaRDI QIDQ1865473

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

Publication date: 26 March 2003

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0375-9601(03)00216-0

zbMATH Keywords

feedforward neural networkcomplex learning algorithmposition transform

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Numerical computation of solutions to single equations (65H05)

Related Items (9)

A Neural Root Finder of Polynomials Based on Root Moments ⋮ Boundedness and stability for recurrent neural networks with variable coefficients and time-varying delays ⋮ Periodic solution and chaotic strange attractor for shunting inhibitory cellular neural networks with impulses ⋮ Modified constrained learning algorithms incorporating additional functional constraints into neural networks ⋮ A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials ⋮ Improved constrained learning algorithms by incorporating additional functional constraints into neural networks ⋮ Existence and uniqueness of periodic solutions of nonautonomous cellular neural networks with impulses ⋮ A case study for constrained learning neural root finders ⋮ A new approach for function approximation incorporating adaptive particle swarm optimization and a priori information

Cites Work

• Phase unwrapping by factorization
• A geometric approach to root finding in GT(q/sup m/)
• Learning representations by back-propagating errors
• Unnamed Item

This page was built for publication: Dilation method for finding close roots of polynomials based on constrained learning neural networks