Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
From MaRDI portal
Publication:6572622
DOI10.1553/ETNA_VOL61S1zbMATH Open1543.65067MaRDI QIDQ6572622FDOQ6572622
Authors: Dario A. Bini 
Publication date: 16 July 2024
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
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
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
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Numerical computation of polynomial zeros by means of Aberth's method
- A fast algorithm for particle simulations
- Title not available (Why is that?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
- Iterative methods for simultaneous inclusion of polynomial zeros
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bibliography on roots of polynomials
- Solving secular and polynomial equations: a multiprecision algorithm
- Solving a Polynomial Equation: Some History and Recent Progress
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A posteriori error bounds for the zeros of polynomials
- A 2002 update of the supplementary bibliography on roots of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Title not available (Why is that?)
- How to find all roots of complex polynomials by Newton's method.
- A stable matrix version of the fast multipole method: stabilization strategies and examples
- Fibonacci-Mandelbrot polynomials and matrices
- On the efficient global dynamics of Newton’s method for complex polynomials
- The Largest Roots of the Mandelbrot Polynomials
- SMASH: structured matrix approximation by separation and hierarchy.
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- An efficient, memory-saving approach for the Loewner framework
- Finding polynomial roots by dynamical systems -- a case study
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- On the speed of convergence of Newton's method for complex polynomials
- A fractal eigenvector
- The Weierstrass–Durand–Kerner root finder is not generally convergent
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572622)
