Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5471673 | Applied Mathematics Letters | 2017 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Tamara Kogan, Luba Sapir, Amir Sapir, Ariel Sapir,