A new family of four-step fifteenth-order root-finding methods with high efficiency index

نویسنده

  • Tahereh Eftekhari Faculty of Mathematics, University of Sistan and Baluchestan, Zahedan 987-98155, Iran
چکیده مقاله:

‎In this paper a new family of fifteenth-order methods with high efficiency index is presented‎. This family include four evaluations of the function and one evaluation of its first derivative per iteration.‎ ‎Therefore‎, ‎this family of methods has the efficiency index which equals 1.71877‎. ‎In order to show the applicability and validity of the class‎, ‎some numerical examples are discussed‎.

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

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

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

منابع مشابه

a new family of four-step fifteenth-order root-finding methods with high efficiency index

‎in this paper a new family of fifteenth-order methods with high efficiency index is presented‎. this family include four evaluations of the function and one evaluation of its first derivative per iteration.‎ ‎therefore‎, ‎this family of methods has the efficiency index which equals 1.71877‎. ‎in order to show the applicability and validity of the class‎, ‎some numerical examples are discussed‎.

متن کامل

A NEW TWO STEP CLASS OF METHODS WITH MEMORY FOR SOLVING NONLINEAR EQUATIONS WITH HIGH EFFICIENCY INDEX

It is attempted to extend a two-step without memory method to it's with memory. Then, a new two-step derivative free class of without memory methods, requiring three function evaluations per step, is suggested by using a convenient weight function for solving nonlinear equations. Eventually, we obtain a new class of methods by employing a self-accelerating parameter calculated in each iterative...

متن کامل

On a family of Weierstrass-type root-finding methods with high order of convergence

in English: In 1985, Kyurkchiev and Andreev [1] constructed a sequence of iterative methods for finding all zeros of a polynomial simultaneously. In the literature there are only local convergence results for these methods (see [1, 5]). In this talk, we present a semilocal convergence theorem for Kyurkchiev-Andreev’s methods under computationally verifiable initial conditions and with an a post...

متن کامل

A Family of Root Finding Methods*

A one parameter family of iteration functions for finding roots is derived. ] h e family includes the Laguerre, Halley, Ostrowski and Euler methods and, as a limiting case, Newton's method. All the methods of the family are cubically convergent for a simple root (except Newton's which is quadratically convergent). The superior behavior of Laguerre's method, when starting from a point z for whic...

متن کامل

A family of root-finding methods with accelerated convergence

Keywords--Determinat ion of polynomial zeros, Simultaneous iterative methods, Convergence analysis, Accelerated convergence, R-order of convergence. 1. I N T R O D U C T I O N The problem of determining polynomial zeros has a great impor tance in theory and practice (for instance, in the theory of control systems, digital signal processing, s tabil i ty of systems, analysis of transfer function...

متن کامل

Root finding by high order iterative methods based on quadratures

We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with n+ 1 nodes is used the resulting iterative method has convergence order at least n+ 2, starting with the case n = 0 (which corresponds to the Newton’s method).

متن کامل

منابع من

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

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 3  شماره 1

صفحات  51- 58

تاریخ انتشار 2015-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023