Article ID Journal Published Year Pages File Type
469077 Computers & Mathematics with Applications 2010 10 Pages PDF
Abstract

We present a generalization of a modification of a classic Traub’s result, which allows constructing, from a given iterative method with order of convergence pp, efficient iterative methods with order of convergence at least pq+1pq+1 (q≤p−1q≤p−1, q∈Nq∈N).

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,