The Weierstrass–Durand–Kerner root finder is not generally convergent
DOI10.1090/MCOM/3783OpenAlexW4295693722MaRDI QIDQ5058658FDOQ5058658
Authors: Bernhard Reinke, Dierk Schleicher, Michael Stoll 
Publication date: 21 December 2022
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.04777
Recommendations
- Global convergence of the Durand-Kerner method applied to the equation \(z^ 3 = 0\)
- scientific article; zbMATH DE number 818538
- On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- scientific article; zbMATH DE number 621974
Symbolic computation and algebraic computation (68W30) Numerical computation of roots of polynomial equations (65H04) Dynamical systems in numerical analysis (37N30) Higher-dimensional holomorphic and meromorphic dynamics (37F80)
Cites Work
- The Magma algebra system. I: The user language
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Title not available (Why is that?)
- Numerical methods for roots of polynomials. Part I
- On Schröder's families of root-finding methods
- Numerical methods for roots of polynomials. II
- Parametrizing unstable and very unstable manifolds
- Polynomial root-finding and polynomiography
- Solving a Polynomial Equation: Some History and Recent Progress
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Families of rational maps and iterative root-finding algorithms
- Dynamic rays of bounded-type entire functions
- On the efficiency of algorithms of analysis
- 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.
- On K nig's root-finding algorithms*
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- A Classification of Postcritically Finite Newton Maps
- On the efficient global dynamics of Newton’s method for complex polynomials
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- New progress in univariate polynomial root finding
- 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
- Title not available (Why is that?)
Cited In (6)
- The Weierstrass root finder is not generally convergent
- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- Title not available (Why is that?)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- 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
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
Uses Software
This page was built for publication: The Weierstrass–Durand–Kerner root finder is not generally convergent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058658)
