In [[numerical analysis]], the '''Durand–Kerner method''', establisheddiscovered 1960–66 and named after E. Durand and Immo Kerner, also called the '''method ofby [[Karl Weierstrass|Weierstrass]]''',establishedin 1859–911891 and namedrediscovered afterby [[KarlDurand Weierstrass]]in 1960 and Kerner in 1966, is a [[root-finding algorithm]] for solving [[polynomial]] [[equation (mathematics)|equations]].<ref name="Petković">{{cite book|last1=Petković|first1=Miodrag|title=Iterative methods for simultaneous inclusion of polynomial zeros|date=1989|publisher=Springer|___location=Berlin [u.a.]|isbn=978-3-540-51485-5|pages=31-32}}</ref> In other words, the method can be used to solve numerically the equation
