scholarly journals Study of Local Convergence and Dynamics of a King-Like Two-Step Method with Applications

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1062
Author(s):  
Ioannis K. Argyros ◽  
Ángel Alberto Magreñán ◽  
Alejandro Moysi ◽  
Íñigo Sarría ◽  
Juan Antonio Sicilia Montalvo
Keyword(s):  
Nonlinear Equations ◽  
Local Convergence ◽  
Step Method ◽  
First Derivative ◽  
Family Behavior ◽  
Local Results

In this paper, we present the local results of the convergence of the two-step King-like method to approximate the solution of nonlinear equations. In this study, we only apply conditions to the first derivative, because we only need this condition to guarantee convergence. As a result, the applicability of the method is expanded. We also use different convergence planes to show family behavior. Finally, the new results are used to solve some applications related to chemistry.

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 Local convergence of a multi-step high order method with divided differences under hypotheses on the first derivative

2017 ◽  
Vol 16 (1) ◽  
pp. 41-50
Author(s):  
Ioannis K. Argyros ◽  
Santhosh George
Keyword(s):  
Banach Spaces ◽  
Local Convergence ◽  
Sixth Order ◽  
Divided Differences ◽  
Order Method ◽  
Step Method ◽  
Convergence Conditions ◽  
Numerical Examples ◽  
High Order Method ◽  
First Derivative

AbstractThis paper is devoted to the study of a multi-step method with divided differences for solving nonlinear equations in Banach spaces. In earlier studies, hypotheses on the Fréchet derivative up to the sixth order of the operator under consideration is used to prove the convergence of the method. That restricts the applicability of the method. In this paper we extended the applicability of the sixth-order multi-step method by using only hypotheses on the first derivative of the operator involved. Our convergence conditions are weaker than the conditions used in earlier studies. Numerical examples where earlier results cannot be applied to solve equations but our results can be applied are also given in this study.

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 for Multi-Step High Order Solvers under Weak Conditions

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 179
Author(s):  
Ramandeep Behl ◽  
Ioannis K. Argyros
Keyword(s):  
Banach Space ◽  
Nonlinear Equations ◽  
Local Convergence ◽  
Nonlinear Problems ◽  
Fréchet Derivative ◽  
High Order ◽  
Order Derivative ◽  
First Order ◽  
Lipschitz Constants ◽  
Convergence Study

Our aim in this article is to suggest an extended local convergence study for a class of multi-step solvers for nonlinear equations valued in a Banach space. In comparison to previous studies, where they adopt hypotheses up to 7th Fŕechet-derivative, we restrict the hypotheses to only first-order derivative of considered operators and Lipschitz constants. Hence, we enlarge the suitability region of these solvers along with computable radii of convergence. In the end of this study, we choose a variety of numerical problems which illustrate that our works are applicable but not earlier to solve nonlinear problems.

A new efficient implicit four-step method with vanished phase-lag and some of its derivatives for the numerical solution of the radial Schr¨odinger equation

2017 ◽  
Vol 8 (1-2) ◽  
pp. 77 ◽  
Author(s):  
Ali Shokri ◽  
Morteza Tahmourasi
Keyword(s):  
Approximate Solution ◽  
Stability Analysis ◽  
Multistep Method ◽  
Phase Lag ◽  
Order Method ◽  
Step Method ◽  
One Dimensional ◽  
First Derivative ◽  
Algebraic Order ◽  
The One

A new four-step implicit linear sixth algebraic order method with vanished phase-lag and its first derivative is constructed in this paper. The purpose of this paper is to develop an efficient algorithm for the approximate solution of the one-dimensional radial Schr¨odinger equation and related problems. In order to produce an efficient multistep method the phase-lag property and its derivatives are used. An error analysis and a stability analysis is also investigated and a comparison with other methods is also studied. The efficiency of the new methodology is proved via theoretical analysis and numerical applications.

scholarly journals A Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Fiza Zafar ◽  
Gulshan Bibi
Keyword(s):  
Iterative Method ◽  
Iterative Methods ◽  
Nonlinear Equations ◽  
Order Of Convergence ◽  
Efficiency Index ◽  
Numerical Examples ◽  
New Class ◽  
First Derivative ◽  
New Methods ◽  
Specific Step

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order by n+10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 141/5 =1.695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.

Sign in / Sign up

Export Citation Format

Share Document