Local convergence and the dynamics of a family of high convergence order method for solving nonlinear equations

2018 ◽  
Author(s):  
Á. A. Magreñán ◽  
I. K. Argyros ◽  
Í. Sarría ◽  
J. A. Sicilia
Keyword(s):  
Nonlinear Equations ◽  
Local Convergence ◽  
Convergence Order ◽  
Order Method

scholarly journals Convergence Analysis of a Three Step Newton-like Method for Nonlinear Equations in Banach Space under Weak Conditions

2016 ◽  
Vol 54 (2) ◽  
pp. 37-46
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Banach Space ◽  
Convergence Analysis ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Convergence Order ◽  
Order Method ◽  
Numerical Examples ◽  
Local Convergence Analysis

Abstract In the present paper, we study the local convergence analysis of a fifth convergence order method considered by Sharma and Guha in [15] to solve equations in Banach space. Using our idea of restricted convergence domains we extend the applicability of this method. Numerical examples where earlier results cannot apply to solve equations but our results can apply are also given in this study.

scholarly journals Local Convergence of an Efficient High Convergence Order Method Using Hypothesis Only on the First Derivative

Algorithms ◽  
2015 ◽  
Vol 8 (4) ◽  
pp. 1076-1087 ◽  
Author(s):  
Ioannis Argyros ◽  
Ramandeep Behl ◽  
S.S. Motsa
Keyword(s):  
Local Convergence ◽  
Convergence Order ◽  
Order Method ◽  
First Derivative

scholarly journals Local Comparison between Two Ninth Convergence Order Algorithms for Equations

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 147
Author(s):  
Samundra Regmi ◽  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Error Estimates ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Numerical Experiments ◽  
Radius Of Convergence ◽  
Convergence Order ◽  
Convergence Criteria ◽  
First Derivative ◽  
Local Comparison ◽  
Uniqueness Of The Solution

A local convergence comparison is presented between two ninth order algorithms for solving nonlinear equations. In earlier studies derivatives not appearing on the algorithms up to the 10th order were utilized to show convergence. Moreover, no error estimates, radius of convergence or results on the uniqueness of the solution that can be computed were given. The novelty of our study is that we address all these concerns by using only the first derivative which actually appears on these algorithms. That is how to extend the applicability of these algorithms. Our technique provides a direct comparison between these algorithms under the same set of convergence criteria. This technique can be used on other algorithms. Numerical experiments are utilized to test the convergence criteria.

scholarly journals Two-step secant type method with approximation of the inverse operator

2013 ◽  
Vol 5 (1) ◽  
pp. 150-155 ◽  
Author(s):  
S.M. Shakhno ◽  
H.P. Yarmola
Keyword(s):  
Numerical Experiment ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Quadratic Convergence ◽  
Inverse Operator ◽  
Convergence Order ◽  
Test Problems ◽  
Type Method ◽  
Consistent Approximation

The two-step secant type method with a consistent approximation of the inverse operator for solving nonlinear equations is proposed. The local convergence of the proposed method is studied and the quadratic convergence order is established. A numerical experiment is made on the test problems.

scholarly journals Application of a Generalized Secant Method to Nonlinear Equations with Complex Roots

Axioms ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 169
Author(s):  
Avram Sidi
Keyword(s):  
Nonlinear Equations ◽  
Local Convergence ◽  
Real Root ◽  
Numerical Procedure ◽  
Secant Method ◽  
Convergence Theory ◽  
Simple Complex ◽  
Real Roots ◽  
Complex Roots ◽  
Appl Math

The secant method is a very effective numerical procedure used for solving nonlinear equations of the form f(x)=0. In a recent work (A. Sidi, Generalization of the secant method for nonlinear equations. Appl. Math. E-Notes, 8:115–123, 2008), we presented a generalization of the secant method that uses only one evaluation of f(x) per iteration, and we provided a local convergence theory for it that concerns real roots. For each integer k, this method generates a sequence {xn} of approximations to a real root of f(x), where, for n≥k, xn+1=xn−f(xn)/pn,k′(xn), pn,k(x) being the polynomial of degree k that interpolates f(x) at xn,xn−1,…,xn−k, the order sk of this method satisfying 1<sk<2. Clearly, when k=1, this method reduces to the secant method with s1=(1+5)/2. In addition, s1<s2<s3<⋯, such that limk→∞sk=2. In this note, we study the application of this method to simple complex roots of a function f(z). We show that the local convergence theory developed for real roots can be extended almost as is to complex roots, provided suitable assumptions and justifications are made. We illustrate the theory with two numerical examples.

scholarly journals Local Convergence of an Optimal Eighth Order Method under Weak Conditions

Algorithms ◽  
2015 ◽  
Vol 8 (3) ◽  
pp. 645-655 ◽  
Author(s):  
Ioannis Argyros ◽  
Ramandeep Behl ◽  
S.S. Motsa
Keyword(s):  
Local Convergence ◽  
Order Method ◽  
Eighth Order

scholarly journals On an Aitken-Steffensen-Newton type method

2018 ◽  
Vol 34 (1) ◽  
pp. 85-92
Author(s):  
ION PAVALOIU ◽  
Keyword(s):  
Local Convergence ◽  
Convergence Result ◽  
Convergence Order ◽  
Monotone Convergence ◽  
Type Method ◽  
Numerical Examples ◽  
Newton Iterations ◽  
Convergence Orders

We consider an Aitken-Steffensen type method in which the nodes are controlled by Newton and two-step Newton iterations. We prove a local convergence result showing the q-convergence order 7 of the iterations. Under certain supplementary conditions, we obtain monotone convergence of the iterations, providing an alternative to the usual ball attraction theorems. Numerical examples show that this method may, in some cases, have larger (possibly sided) convergence domains than other methods with similar convergence orders.

scholarly journals Metode Iterasi Tiga Langkah untuk Menyelesaikan Persamaan NonLinear dengan Menggunakan Matlab

2019 ◽  
Vol 4 (2) ◽  
pp. 34
Author(s):  
Deasy Wahyuni ◽  
Elisawati Elisawati
Keyword(s):  
Numerical Simulations ◽  
Nonlinear Equations ◽  
Newton Method ◽  
Iteration Method ◽  
Newton's Method ◽  
Order Of Convergence ◽  
Higher Order ◽  
Convergence Order ◽  
Matlab Program ◽  
Analytical Results

Newton method is one of the most frequently used methods to find solutions to the roots of nonlinear equations. Along with the development of science, Newton's method has undergone various modifications. One of them is the hasanov method and the newton method variant (vmn), with a higher order of convergence. In this journal focuses on the three-step iteration method in which the order of convergence is higher than the three methods. To find the convergence order of the three-step iteration method requires a program that can support the analytical results of both methods. One of them using the help of the matlab program. Which will then be compared with numerical simulations also using the matlab program.  Keywords : newton method, newton method variant, Hasanov Method and order of convergence

Sign in / Sign up

Export Citation Format

Share Document