Revision as of 17:48, 30 May 2016 edit 2601:445:4000:2a80:7810:8b85:2f75:c54e (talk) →External links ← Previous edit		Revision as of 17:48, 30 May 2016 edit undo 2601:445:4000:2a80:7810:8b85:2f75:c54e (talk) No edit summary Next edit →
Line 242: * [[Victor Pan]] (May 2002): [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~~Durand–Kerner method)]'', 2003. ==External links==

Durand–Kerner method: Difference between revisions