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

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)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Numerical computation of polynomial zeros by means of Aberth's method
A bibliography on roots of polynomials
Design, analysis, and implementation of a multiprecision polynomial rootfinder
A 2002 update of the supplementary bibliography on roots of polynomials
Iterative methods for simultaneous inclusion of polynomial zeros
A stable matrix version of the fast multipole method: stabilization strategies and examples
An efficient, memory-saving approach for the Loewner framework
Finding polynomial roots by dynamical systems -- a case study
Solving secular and polynomial equations: a multiprecision algorithm
Newton's method in practice: finding all roots of polynomials of degree one million efficiently
A posteriori error bounds for the zeros of polynomials
Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
On the speed of convergence of Newton’s method for complex polynomials
SMASH: Structured matrix approximation by separation and hierarchy
A Fast Adaptive Multipole Algorithm for Particle Simulations
Solving a Polynomial Equation: Some History and Recent Progress
Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
Diverging orbits for the Ehrlich–Aberth and the Weierstrass root finders
The Weierstrass–Durand–Kerner root finder is not generally convergent
A Fractal Eigenvector
Fibonacci-mandelbrot polynomials and matrices
A modified Newton method for polynomials
The Largest Roots of the Mandelbrot Polynomials
On the efficient global dynamics of Newton’s method for complex polynomials
A fast algorithm for particle simulations
How to find all roots of complex polynomials by Newton's method.
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

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