Abstract
In this paper we prove that, among all one-point iterative processes without memory of order p, the most efficient processes are of order p=3. Moreover, the computational efficiency of one-point iterative processes without memory decreases to 1 as p increases, i.e., the efficiency index of higher order of convergence methods is low. We find the upper and lower bounds of the Ostrowski–Traub index of computational efficiency in a wider class of iterative methods with unit informational efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 40-46 |
| Number of pages | 7 |
| Journal | Applied Mathematics Letters |
| Volume | 66 |
| DOIs | |
| State | Published - 1 Apr 2017 |
Keywords
- Computational efficiency
- Efficiency index
- Informational efficiency
- Iterative methods
- One-point method without memory
- Order of convergence
ASJC Scopus subject areas
- Applied Mathematics