Dynamics of Newton-like root finding methods

نویسندگان

چکیده

Abstract When exploring the literature, it can be observed that operator obtained when applying Newton-like root finding algorithms to quadratic polynomials z 2 − c has same form regardless of which algorithm been used. In this paper, we justify why expression is obtained. This done by studying symmetries operators after a family degree d p ( ) = . Moreover, provide an iterative procedure obtain new algorithms. We also carry out dynamical study given generic and general conclusions type methods.

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

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

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

منابع مشابه

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...

متن کامل

Chemical Process Optimization Using Newton-like Methods

Various interrelated issues that effect the reliability and efficiency of Newton-like methods for chemical process optimization are studied. An algorithm for solving large, sparse quadratic programming (QP) problems that is based on an active set strategy and a symmetric, indefinite factorization is presented. The QP algorithm is fast and reliable. A simple asymmetric trust region method is pro...

متن کامل

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‎.

متن کامل

Newton-type iterative methods for finding zeros having higher multiplicity

Abstract: In this paper, using the idea of Gander, families of several iterative methods for solving non-linear equations f (x) = 0 having zeros of higher multiplicity are presented. The families of methods presented here include methods of Newton type, Steffensen type and their variant. We obtain families of methods of order 2 as well as 3. Some numerical examples are also presented in support...

متن کامل

A cubically convergent class of root finding iterative methods

In this paper, we propose a new two-parameter class of iterative methods to solve a nonlinear equation. It is proved that any method in this class is cubically convergent if and only if the parameters sum up to one. Some of the existing third-order methods, by suitable selection of parameters, can be put in this class. Every iteration of the class requires an evaluation of the function, three o...

متن کامل

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


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

ژورنال

عنوان ژورنال: Numerical Algorithms

سال: 2022

ISSN: ['1017-1398', '1572-9265']

DOI: https://doi.org/10.1007/s11075-022-01474-w