Revision as of 21:00, 10 July 2020 edit Ninguem wiki (talk \| contribs) 37 edits →Example ← Previous edit		Revision as of 20:22, 31 July 2020 edit undo Bender the Bot (talk \| contribs) Bots 1,064,377 edits m →References: HTTP → HTTPS for University of Vienna mathematics department, replaced: http://www.mat.univie.ac.at/ → https://www.mat.univie.ac.at/ Tag: AWB Next edit →
Line 244: * {{cite book\|last=Gourdon\|first=Xavier\|title=Combinatoire, Algorithmique et Geometrie des Polynomes\|publisher=Ecole Polytechnique\|___location=Paris\|year=1996\|url=http://algo.inria.fr/gourdon/thesis.html\|access-date=2006-08-22\|archive-url=https://web.archive.org/web/20061028060132/http://algo.inria.fr/gourdon/thesis.html\|archive-date=2006-10-28\|url-status=dead}} * [[Victor Pan]] (May 2002): [https://web.archive.org/web/20060907205721/http://www.cs.gc.cuny.edu/tr/techreport.php?id=26 ''Univariate Polynomial Root-Finding with Lower Computational Precision and Higher Convergence Rates'']. Tech-Report, City University of New York * {{cite journal\|first= Arnold\|last= Neumaier\|title= Enclosing clusters of zeros of polynomials\|journal= Journal of Computational and Applied Mathematics\|volume= 156 \|year=2003\|url=~~http~~https://www.mat.univie.ac.at/~neum/papers.html#polzer\|doi= 10.1016/S0377-0427(03)00380-7\|pages= 389}} * Jan Verschelde, ''[http://www2.math.uic.edu/~jan/mcs471f03/Project_Two/proj2/node2.html The method of Weierstrass (also known as the Durand–Kerner method)]'', 2003.

Durand–Kerner method: Difference between revisions