Content deleted Content added
Rescuing 4 sources and tagging 0 as dead. #IABot (v2.0beta15) |
|||
Line 242:
* Agnethe Knudsen, ''Numeriske Metoder'' (lecture notes), Københavns Teknikum.
* Bo Jacoby, ''Numerisk løsning af ligninger'', Bygningsstatiske meddelelser (Published by Danish Society for Structural Science and Engineering) volume 63 no. 3-4, 1992, pp. 83–105.
* {{cite book|last=Gourdon|first=Xavier|title=Combinatoire, Algorithmique et Geometrie des Polynomes|publisher=Ecole Polytechnique|___location=
* [[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://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.
==External links==
* ''[https://web.archive.org/web/20090701041632/http://home.roadrunner.com/~jbmatthews/misc/groots.html Ada Generic_Roots using the Durand–Kerner Method]'' — an [[open-source]] implementation in [[Ada programming language|Ada]]
* ''[http://sites.google.com/site/drjohnbmatthews/polyroots Polynomial Roots]'' — an [[Open-Source|open-source]] implementation in [[Java programming language|Java]]
* ''[https://web.archive.org/web/20060505043302/http://www.cpc.wmin.ac.uk/~spiesf/Solve/solve.html Roots Extraction from Polynomials : The Durand–Kerner Method]'' — contains a [[Java applet]] demonstration
{{DEFAULTSORT:Durand-Kerner method}}
|