scientific article; zbMATH DE number 541481

MaRDI QIDQ4286650zbMATH OpenFDO

Authors Sophia E. Mentzelopoulou, Raju Hormis, George E. Antoniou, C. N. Manikopoulos

Publication date 25 May 1994

zbMATH Keywords

computer algorithmsfactorizationneural networkspolynomial theory

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Numerical algorithms for specific classes of architectures (65Y10) Learning and adaptive systems in artificial intelligence (68T05) Multivariable systems, multidimensional control systems (93C35)

Recommendations

• Fast and Provable Algorithms for Learning Two-Layer Polynomial Neural Networks
• Determination of real solutions to two-sided polynomial matrix equations making use of neural networks
• Determining the number of real roots of polynomials through neural networks
• Application of Hopfield-like neural networks to nonlinear factorization
• A Neural Root Finder of Polynomials Based on Root Moments
• Simultaneous Approximations of Polynomials and Derivatives and Their Applications to Neural Networks
• A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
• A 2d neural network with application to solving a class of matrix equations

Cited in

(3)

• A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
• Dilation method for finding close roots of polynomials based on constrained learning neural networks
• Determining the number of real roots of polynomials through neural networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286650)