A basic family of iteration functions for polynomial root finding and its characterizations
Authors:
- Bahman KalantariBKBahman Kalantari
- Iraj KalantariIKIraj Kalantari
- Rahim Zaare-NahandiRZRahim Zaare-Nahandi
- 1 May 1997
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 80 (2) , 209-226
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Accelerated Convergence in Newton’s MethodSIAM Review, 1994
- On Halley's Iteration MethodThe American Mathematical Monthly, 1985
- On the Convergence of Halley's MethodThe American Mathematical Monthly, 1981
- On Halley's Variation of Newton's MethodThe American Mathematical Monthly, 1977
- On the global convergence of Halley's iteration formulaNumerische Mathematik, 1975
- The Solution of Equations by Continued FractionsThe American Mathematical Monthly, 1953
- On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equationQuarterly of Applied Mathematics, 1949
- Clubs and Allied ActivitiesThe American Mathematical Monthly, 1944
- Haley's Methods for Solving EquationsThe American Mathematical Monthly, 1938
- Methodus nova accurata & facilis inveniendi radices æqnationum quarumcumque generaliter, sine praviæ reductionePhilosophical Transactions of the Royal Society of London, 1694