The Durand-Kerner method, also known as the Weierstrass method, is a root-finding algorithm for solving polynomial equations numerically. Karl Weierstrass discovered it in 1891, and it was independently rediscovered by Durand in 1960 and by Kerner in 1966, which explains why two different names are in use. The method is applied to an equation f(x) = 0 where f is a given polynomial, scaled so that its leading coefficient is 1. Unlike methods that find one root at a time, it is a procedure for the polynomial root-finding problem as a whole, and it is a standard topic in numerical analysis courses on solving polynomial equations.
Connections
In Field
Source Durand-Kerner method (Wikipedia)
Sources
Durand-Kerner method (Wikipedia)
In Group: Root-Finding and Optimization, Lead paragraph
is a root-finding algorithm for solving polynomial equations
In Field: Computational Science, Lead paragraph [in-field]
In numerical analysis, the Weierstrass method or Durand-Kerner method
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.