On Schröder’s families of root-finding methods
Authors:
- 1 February 2010
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 233 (8) , 1755-1762
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On K nig's root-finding algorithms*Nonlinearity, 2003
- Newton's method and generation of a determinantal family of iteration functionsJournal of Computational and Applied Mathematics, 2000
- On rediscovered iteration methods for solving equationsJournal of Computational and Applied Mathematics, 1999
- A basic family of iteration functions for polynomial root finding and its characterizationsJournal of Computational and Applied Mathematics, 1997
- Accelerated Convergence in Newton’s MethodSIAM Review, 1996
- Accelerated Convergence in Newton’s MethodSIAM Review, 1994
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomialBIT Numerical Mathematics, 1975
- Roots of equations by functional iterationDuke Mathematical Journal, 1946
- Ueber eine Eigenschaft der PotenzreihenMathematische Annalen, 1884
- Ueber unendlich viele Algorithmen zur Auflösung der GleichungenMathematische Annalen, 1870