Durand–Kerner method: Difference between revisions

Revision as of 03:52, 21 May 2025

Latest revision as of 05:14, 4 August 2025

(2 intermediate revisions by 2 users not shown)

Line 215:

* [[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|issue= 2|url=https://www.mat.univie.ac.at/~neum/papers.html#polzer|doi= 10.1016/S0377-0427(03)00380-7|pages= 389–401|bibcode= 2003JCoAM.156..389N|doi-access= free}}

* Jan Verschelde, ''[httphttps://www2.math.uic.edu/~jan/mcs471f03/Project_Two/proj2/node2.html The method of Weierstrass (also known as the Durand–Kerner method)]'', 2003.

* Bernhard Reinke, Dierk Schleicher, and Michael Stoll, ``"[https://arxiv.org/abs/2004.04777 The Weierstrass root finder is not generally convergent]''", 2020

** Bernhard Reinke, Dierk Schleicher and Michael Stoll: "The Weierstrass-Durand-Kerner root finder is not generally convergent", Math. Comp. vol.92 (2023), pp.839-866. DOI: https://doi.org/10.1090/mcom/3783 .

==External links==