Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis

DOI10.1553/ETNA_VOL61S1MaRDI QIDQ6572622zbMATH OpenFDO

Authors Dario A. Bini

Publication date 16 July 2024

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

zbMATH Keywords

fast multipole methodpolynomial rootsEhrlich-Aberth iterationMandelbrot polynomials

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) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
• Numerical computation of polynomial zeros by means of Aberth's method
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Finding polynomial roots by dynamical systems -- a case study
• The Largest Roots of the Mandelbrot Polynomials

Cites work

• scientific article; zbMATH DE number 3161517 (Why is no real title available?)
• scientific article; zbMATH DE number 193017 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• A 2002 update of the supplementary bibliography on roots of polynomials
• A Fast Adaptive Multipole Algorithm for Particle Simulations
• A bibliography on roots of polynomials
• A fast algorithm for particle simulations
• A fractal eigenvector
• A modified Newton method for polynomials
• A posteriori error bounds for the zeros of polynomials
• A stable matrix version of the fast multipole method: stabilization strategies and examples
• An efficient, memory-saving approach for the Loewner framework
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Fibonacci-Mandelbrot polynomials and matrices
• Finding polynomial roots by dynamical systems -- a case study
• How to find all roots of complex polynomials by Newton's method.
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Iterative methods for simultaneous inclusion of polynomial zeros
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
• Newton's method in practice: finding all roots of polynomials of degree one million efficiently
• Numerical computation of polynomial zeros by means of Aberth's method
• On the efficient global dynamics of Newton’s method for complex polynomials
• On the speed of convergence of Newton's method for complex polynomials
• SMASH: structured matrix approximation by separation and hierarchy.
• Solving a Polynomial Equation: Some History and Recent Progress
• Solving secular and polynomial equations: a multiprecision algorithm
• The Largest Roots of the Mandelbrot Polynomials
• The Weierstrass–Durand–Kerner root finder is not generally convergent

This page was built for publication: Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis

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