Semilocal Convergence of a Multi-Step Parametric Family of Iterative Methods

نویسندگان

چکیده

In this paper, we deal with a new family of iterative methods for approximating the solution nonlinear systems non-differentiable operators. The novelty is that it m-step generalization Steffensen-type method by updating divided difference operator in first two steps but not following ones. This procedure allows us to increase both order convergence and efficiency index respect obtained updates differences only step. We perform semilocal study fix domain uniqueness real applied problems, where existence known priori. After study, some numerical tests are developed apply theoretical results obtained. Finally, mediating dynamic planes generated different compose family, symmetry basins attraction each solution, shape these basins, root polynomial function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Semilocal Convergence of Inexact Newton Methods

Inexact Newton methods are constructed by combining Newton’s method with another iterative method that is used to solve the Newton equations inexactly. In this paper, we establish two semilocal convergence theorems for the inexact Newton methods. When these two theorems are specified to Newton’s method, we obtain a different Newton-Kantorovich theorem about Newton’s method. When the iterative m...

متن کامل

A Family of Iterative Methods with Accelerated Eighth-Order Convergence

We propose a family of eighth-order iterative methods without memory for solving nonlinear equations. The new iterative methods are developed by using weight function method and using an approximation for the last derivative, which reduces the required number of functional evaluations per step. Their efficiency indices are all found to be 1.682. Several examples allow us to compare our algorith...

متن کامل

Semilocal Convergence of Two Iterative Methods for Simultaneous Computation of Polynomial Zeros

In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich’s and Nourein’s iterations. Our theorems generalize and improve recent results of Zheng and Huang [J. Comput. Math. 18 (2000), 113– 122], Petković and Herceg [J. Comput. Appl. Math. 136 (2001), 283–307] and Nedić [Novi Sad J. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2023

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15020536