A Neural Root Finder of Polynomials Based on Root Moments
From MaRDI portal
Publication:4832491
DOI10.1162/089976604774201668zbMATH Open1102.68560OpenAlexW2126262069MaRDI QIDQ4832491FDOQ4832491
Authors: De-Shuang Huang, Horace H. S. Ip, Zheru Chi 
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
Recommendations
- A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
- Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method
- A case study for constrained learning neural root finders
- Root finding and approximation approaches through neural networks
- Dilation method for finding close roots of polynomials based on constrained learning neural networks
Cites Work
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- Phase unwrapping by factorization
- Accelerated Solution of Multivariate Polynomial Systems of Equations
- Equiripple minimum phase FIR filter design from linear phase systems using root moments
- Dilation method for finding close roots of polynomials based on constrained learning neural networks
Cited In (17)
- A hybrid learning algorithm combined with generalized RLS approach for radial basis function neural networks
- Finding all real roots of \(3\times 3\) nonlinear algebraic systems using neural networks
- Title not available (Why is that?)
- A neural network which computes the square root
- Machine learning the real discriminant locus
- Dilation method for finding close roots of polynomials based on constrained learning neural networks
- Modified constrained learning algorithms incorporating additional functional constraints into neural networks
- Improved constrained learning algorithms by incorporating additional functional constraints into neural networks
- Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method
- Machine learning approaches for the solution of the Riemann problem in fluid dynamics: a case study
- A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
- Determining the number of real roots of polynomials through neural networks
- A new image thresholding method based on Gaussian mixture model
- A case study for constrained learning neural root finders
- A new approach for function approximation incorporating adaptive particle swarm optimization and a priori information
- New conditions for global exponential stability of cellular neural networks with delays
- Root finding and approximation approaches through neural networks
This page was built for publication: A Neural Root Finder of Polynomials Based on Root Moments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832491)
