
doi: 10.1137/0708023
This paper is concerned with the order of convergence of iterative procedures for finding a zero of a nonlinear function defined on $R^n $. Some of the results provide conditions for determining the precise order of convergence of a method rather than the usual lower bound on the order. These precise order results are applied to a large class of methods that include many well-known techniques such as the secant method and Steffenson’s method.
Numerical computation of solutions to single equations
Numerical computation of solutions to single equations
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
