On a class of higher order methods for simultaneous rootfinding of generalized polynomials.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Page 1
C. Carstensen, Martin Reinders (1993)
Numerische Mathematik
Nedić, Jelena (2001)
Novi Sad Journal of Mathematics
Ph. Saux Picart (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Li, Aihua, Mosteig, Edward (2010)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Ilić, Snežana, Herceg, Djordje, Petković, Miodrag (1998)
Novi Sad Journal of Mathematics
Petković, Ljiljana D., Petković, Miodrag S. (2006)
Novi Sad Journal of Mathematics
Petković, Miodrag S., Rančić, Lidija, Milošević, Dušan (2003)
Publications de l'Institut Mathématique. Nouvelle Série
D'Andrea, Carlos, Hare, Kevin G. (2004)
Experimental Mathematics
Umberto Zannier (2007)
Acta Arithmetica
Bini, Dario A., Daddi, Francesco, Gemignani, Luca (2004)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Akritas, Alkiviadis, Strzeboński, Adam, Vigklas, Panagiotis (2008)
Serdica Journal of Computing
In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that...
Page 1