Nonlinear differential algorithm to compute all the zeros of a generic polynomial
Francesco Calogero

TL;DR
This paper introduces a straightforward nonlinear differential algorithm designed to efficiently compute all zeros of a generic polynomial, offering a potentially effective numerical method.
Contribution
The paper presents a novel nonlinear differential algorithm specifically for finding all roots of a polynomial, which is a new approach compared to existing methods.
Findings
Algorithm successfully computes all polynomial zeros
Demonstrates efficiency on generic polynomials
Provides a simple implementation method
Abstract
A simple algorithm to compute all the zeros of a generic polynomial is proposed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
