The Weierstrass–Durand–Kerner root finder is not generally convergent
From MaRDI portal
Publication:5058658
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
Cites work
- scientific article; zbMATH DE number 3161517 (Why is no real title available?)
- scientific article; zbMATH DE number 3772598 (Why is no real title available?)
- scientific article; zbMATH DE number 44879 (Why is no real title available?)
- A 2002 update of the supplementary bibliography on roots of polynomials
- A Classification of Postcritically Finite Newton Maps
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
- Dynamic rays of bounded-type entire functions
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Families of rational maps and iterative root-finding algorithms
- Finding polynomial roots by dynamical systems -- a case study
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- How to find all roots of complex polynomials by Newton's method.
- New progress in univariate polynomial root finding
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Numerical methods for roots of polynomials. II
- Numerical methods for roots of polynomials. Part I
- On K nig's root-finding algorithms*
- On Schröder's families of root-finding methods
- On the efficiency of algorithms of analysis
- On the efficient global dynamics of Newton’s method for complex polynomials
- On the speed of convergence of Newton's method for complex polynomials
- Parametrizing unstable and very unstable manifolds
- Polynomial root-finding and polynomiography
- Solving a Polynomial Equation: Some History and Recent Progress
- The Magma algebra system. I: The user language
- The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(6)- Numerical computation of the roots of Mandelbrot polynomials: an experimental analysis
- scientific article; zbMATH DE number 818538 (Why is no real title available?)
- 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
- The Weierstrass root finder is not generally convergent
- Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders
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)
