Root finding and approximation approaches through neural networks

DOI10.1145/1140378.1140382MaRDI QIDQ5739516zbMATH OpenOpenAlexFDO

Authors Michael G. Epitropakis, Michael N. Vrahatis

Publication date 18 July 2016

Published in ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1140378.1140382

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method
• Determining the number of real roots of polynomials through neural networks
• A Neural Root Finder of Polynomials Based on Root Moments
• A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
• scientific article; zbMATH DE number 2065714

Cited in

(8)

• A neural network which computes the square root
• A new partitioning neural network model for recursively finding arbitrary roots of higher order arbitrary polynomials
• A case study for constrained learning neural root finders
• Finding all real roots of \(3\times 3\) nonlinear algebraic systems using neural networks
• Determining the number of real roots of polynomials through neural networks
• scientific article; zbMATH DE number 2065714 (Why is no real title available?)
• A Neural Root Finder of Polynomials Based on Root Moments
• Finding roots of arbitrary high order polynomials based on neural network recursive partitioning method

This page was built for publication: Root finding and approximation approaches through neural networks

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