Numerical analysis Nonlinear equations Theorem
Durand–Kerner method
Builds on Newton's methodRoot of a polynomialMonic polynomialFundamental theorem of algebraRate of convergenceComplex numbers
Statement
Let be a monic polynomial of degree with complex coefficients, whose roots are pairwise distinct. The Durand–Kerner method, also called the Weierstrass method, updates approximations simultaneously by Then there is such that, if for all , the iterates are defined and for each , with quadratic convergence.
Remarks
The update is Newton's method applied to the system of equations in unknowns that says that as polynomials. Equivalently, it is Newton's method for the coefficients of the factorization, and the Jacobian of this system is invertible exactly when the are distinct. This explains the local quadratic convergence at simple roots. The fundamental theorem of algebra guarantees that has complex roots counted with multiplicity. A usual start takes for a complex number that is neither real nor a root of unity, for example . With such starts the method usually converges in practice, but the theorem above is only local. At multiple roots the convergence is only linear.
Going deeper
For a student
The method avoids deflation, which can lose accuracy when roots are removed one by one. Each step costs operations. The Aberth method is a refinement with cubic local convergence.
Reading path
To understand this page from the ground up, read these 40 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Complex numbers object
- Group concept
- Limit point of a set definition
- Rate of convergence concept
- Real numbers object
- Root of a polynomial concept
- Set bounded above definition
- Complex exponential definition
- Contour integral definition
- Power series in the complex plane definition
- Real and imaginary parts definition
- Ring definition
- Limit of a function definition
- Supremum definition
- Circle integral definition
- Disc of convergence definition
- Polynomial ring definition
- Derivative definition
- Completeness axiom statement
- Estimation lemma statement
- Degree of a polynomial definition
- Tangent line concept
- Existence of square roots of nonnegative reals statement
- Leading coefficient definition
- Newton's method concept
- Square root definition
- Monic polynomial definition
- Modulus of a complex number definition
- Complex differentiability definition
- Holomorphic function definition
- Cauchy's integral formula statement
- Entire function definition
- Power series are holomorphic in the disc of convergence statement
- Holomorphic functions are analytic statement
- Holomorphic functions are infinitely differentiable statement
- Cauchy's integral formula for derivatives statement
- Cauchy's estimates statement
- Liouville's theorem statement
- Fundamental theorem of algebra statement
- Durand–Kerner method statement
Further reading
About this page
| Tag | 3X6C5SC7AF |
|---|---|
| URI | m2://3X6C5SC7AF |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65H04 |
| Status | This copy of the site has no build data. Run m2 status 3X6C5SC7AF. |
| About | Root of a polynomial |
| Uses | Newton's method, Root of a polynomial, Monic polynomial, Fundamental theorem of algebra, Rate of convergence, Complex numbers |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.