Maximal order of multipoint iterations using n evaluations
نویسندگان
چکیده
This paper deals with multipoint iterations without memory for the solution of the nonlinear scalar equation (m) f (x) = 0, m ^ 0. Let P n( ) be the maximal order of iterations which use n evaluations of the function or its derivatives per step. We prove the Kung and Traub conjecture p (0) = 2 n ^ for Hermitian information. We show p (m+l)^p (m) and conjecture P n( ) = 2 . The problem of the maximal order is connected with Birkhoff interpolation. Under a certain assumption we prove that the Polya conditions are necessary for maximal order.
منابع مشابه
An Efficient Family of Root-Finding Methods with Optimal Eighth-Order Convergence
We derive a family of eighth-order multipoint methods for the solution of nonlinear equations. In terms of computational cost, the family requires evaluations of only three functions and one first derivative per iteration. This implies that the efficiency index of the present methods is 1.682. Kung and Traub 1974 conjectured that multipoint iteration methods without memory based on n evaluation...
متن کاملA Family of Optimal Multipoint Root-Finding Methods Based on the Interpolating Polynomials
A family of simple derivative-free multipoint iterative methods, based on the interpolating polynomials, for solving nonlinear equations is presented. It is shown that the presented n-point iterative method has the convergence order 2n−1 with n function evaluations per iteration. It is an optimal iterative method in the sense of the Kung-Traub’s conjecture. Numerical examples are included to su...
متن کاملSome High-order Zero-finding Methods Using Almost Orthogonal Polynomials
Some multipoint iterative methods without memory, for approximating simple zeros of functions of one variable, are described. For m > 0, n ≥ 0, and k satisfying m+1 ≥ k > 0, there exist methods which, for each iteration, use one evaluation of f, f ′, . . . , f (m), followed by n evaluations of f (k), and have order of convergence m + 2n + 1. In particular, there are methods of order 2(n+1) whic...
متن کاملOptimal order and efficiency for iterations with two evaluations
The problem is to calculate a simple zero of a non-linear function f. We consider rational iterations without memory which use two evaluations of f or its derivatives. It is shown that the optimal order is 2. This settles a conjecture of Kung and Traub that an iteration using n evaluations without memory is of order at most 2 "^, for the case n = 2. Furthermore we show that any rational two-eva...
متن کاملNew Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations
A new family of eighth-order derivative-freemethods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015