Durand–Kerner method: Difference between revisions

Revision as of 03:45, 5 June 2016

Revision as of 05:05, 6 June 2016

Line 1:

In [[numerical analysis]], the '''Durand–Kerner method''', discovered by [[Karl Weierstrass]] in 1891 and rediscovered independently by Durand 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-3231–32}}</ref> In other words, the method can be used to solve numerically the equation

: ƒ(''x'') = 0

Line 230:

==References==

{{Reflist}}

* {{cite conference|last=Weierstraß|first= Karl|authorlink=Karl Weierstraß|title=Neuer Beweis des Satzes, dass jede ganze rationale Function einer Veränderlichen dargestellt werden kann als ein Product aus linearen Functionen derselben Veränderlichen|booktitle=Sitzungsberichte der königlich preussischen Akademie der Wissenschaften zu Berlin|year=1891|url=http://bibliothek.bbaw.de/bibliothek-digital/digitalequellen/schriften/anzeige?band=10-sitz/1891-2&seite:int=00000565}}