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

DOI10.1063/1.4960821MaRDI QIDQ2820929zbMATH OpenOpenAlexWikidataFDO

Authors Francesco Calogero

Publication date 12 September 2016

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.05081

zbMATH Keywords

generic polynomialnonlinear differential algorithmzeros

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04)

Abstract: A simple algorithm to compute all the zeros of a generic polynomial is proposed.

Cites work

• New solvable variants of the goldfish many-body problem

Cited in

(4)

• Zeros of entire functions and related systems of infinitely many nonlinearly coupled evolution equations
• Identification of generic stable dynamical systems taking a nonlinear differential approach
• Comment on ``Nonlinear differential algorithm to compute all the zeros of a generic polynomial [J. Math. Phys. 57, 083508 (2016)]
• Novel differential algorithm to evaluate all the zeros of any generic polynomial

This page was built for publication: Nonlinear differential algorithm to compute all the zeros of a generic polynomial

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