Comment on “Nonlinear differential algorithm to compute all the zeros of a generic polynomial” [J. Math. Phys. 57, 083508 (2016)]

DOI10.1063/1.4965441zbMath1353.65039OpenAlexW2536988671WikidataQ56979183 ScholiaQ56979183MaRDI QIDQ2832737

Francesco Calogero

Publication date: 14 November 2016

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

Full work available at URL: https://doi.org/10.1063/1.4965441

zbMATH Keywords

zerosgeneric polynomialnonlinear differential algorithm

Mathematics Subject Classification ID

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

Related Items (8)

Integrable coupled Liénard-type systems with balanced loss and gain ⋮ Extended supersymmetric Calogero model ⋮ On Non-Commutative Integrable Burgers Equations ⋮ Isochronous Oscillators ⋮ Identification of generic stable dynamical systems taking a nonlinear differential approach ⋮ Recursive Generation of Isochronous Hamiltonian Systems ⋮ How to Extend any Dynamical System so That it Becomes Isochronous, Asymptotically Isochronous or Multi-Periodic ⋮ A Solvable Many-Body Problem in the Plane

Cites Work

• Nonlinear differential algorithm to compute all the zeros of a generic polynomial
• Generations of solvable discrete-time dynamical systems
• On the geometry of Graeffe iteration

This page was built for publication: Comment on “Nonlinear differential algorithm to compute all the zeros of a generic polynomial” [J. Math. Phys. 57, 083508 (2016)]