Kumar provided the local convergence of a third convergent order method for solving equations defined on the real line. We study the semi-local convergence of this method defined on the real line or complex plain. The local convergence is also provided but under weaker conditions.
Let be a differentiable function, where or and is an open nonempty set.
We are interested in computing a solution of equation
The point is needed in closed form. But this form is attained only in special cases. That explains why most solution methods for (1.1) are iterative. There is a plethora of local convergence results for high convergent iterative methods based on Taylor expansions requiring the existence of higher than one derivatives not present on these methods. But there is very little work on the semi-local convergence of these methods or the local convergence using only the derivative of the operator appearing on these methods. We address these issues using a method by S. Kumar defined by
where It was shown in [6] that the order of this method is three and for
where , . It follows that the convergence requires the existence of but do not appear on method (1.2). So, these assumptions limit the applicability of the method. Moreover, no computable error bounds on or uniqueness of the solution results are given.
For example [1]: Let , . Define on by
Then, we get , and
Obviously is not bounded on . So, the convergence of scheme (1.2) is not guaranteed by the previous analyses in [6]. We address all these concerns by using conditions only on in both the local and semi-local case that appears on method (1.2). This way we expand the applicability of this method. Our technique is very general so it can be used to extend the applicability of other methods along the same lines [2-5, 7-10]. Throughout this paper and for and .
The rest of the paper is set up as follows: In Section 2 we present the semi-local analysis, where in Section 3 we present local analysis. The numerical experiments are presented in Section 4.
II. SEMI-LOCAL ANALYSIS
Let be given positive parameters and . Define scalar sequence by
Next, we shall prove that this equation is majorizing for method (1.2). But first we need to define more parameters and scalar functions:
functions by
and sequences of polynomials by
Notice that is the discriminant of . Consider that any of these conditions hold:
(C1) There exists minimal such that and . Then, suppose .
(C2) There exists minimal such that , and . Then, suppose .
(C3) for all and
(C4) and . Notice that has two solutions: . Suppose and .
Let us denote these conditions by (C).
Next, we present convergence results for sequence (2.1).
Lemma 2.1 Suppose:
Then, the following assertions hold
and
Proof. Assertions follow from (2.1) and (2.2), where is the unique least upper bound of sequence .
The next result is shown under stronger conditions but which are easier to verify than (2.2).
Lemma 2.2 Suppose: conditions (C) hold. Then, assertions (2.3) and (2.4) hold too.
Proof. Mathematical induction on is used to show
This estimate holds for by the definition of and conditions (C). Then, we get and . Suppose and . Then, (2.5) holds if
or
We need a relationship between two consecutive polynomials :
so
Define function by
It then follows from (2.6) and (2.9) that
Case (C1) We have by (2.8) that
So, (2.7) holds if
which is true by the choice of .
Case(C2) Then, again (2.11) and (2.12) hold by the choice of and .
Case(C4) We have
so (2.7) holds if , which is true by (C4).
The induction for items (2.5) so the induction for (2.3) is completed too leading again to the verification of the assertions for in (2.4) replaced by .
Next, we introduce the conditions (A) to be used in the semi-local convergence of method (1.2).
Suppose:
(A1) There exist , such that and .
(A2) There exists such that for all . Set .
(A3) There exist such that and
for all .
(A4) Conditions of Lemma 2.1 or Lemma 2.2 hold and
(A5)
Next, we show the semi-local convergence of method (1.2) under the conditions (A).
Theorem 2.3 Suppose that conditions (A) hold. Then, sequence generated by method (1.2) is well defined remains in and converges to a solution of equation (1.1) such that .
Proof. Mathematical induction is used to show
This estiamte holds by (A1) and (1.2) for . Indeed, we have
so . Suppose (2.13) holds for all values of smaller or equal to . Next, we show . Using the definition of , (A2), (A3) we get in turn that
where we also used by the induction hypotheses that
so . It also follows from (2.14) that and
by the Banach lemma on inverses of functions [8]. Moreover, we can write by method (1.2):
since . By (A3) and (2.16), we obtain in turn
It then follows from (1.2), (2.15) and (2.17) that
and
But sequence is fundamental. So, sequence is fundamental too (by (2.18)), so it converges to some . By letting in (2.17), we deduce that .
Next, we present a uniqueness of the solution result for equation (1.1).
Proposition 2.4 Suppose
(1) There exists such that and
for all
(2) The point is a simple solution of equation for some . (3) There exists such that
Set . Then, the only solution of equation in is .
Proof. Set for some with . Then, in view of (2.20)
so, follows from and
III. LOCAL CONVERGENCE
Let and be positive parameters. Set
Define function by
Suppose this function has a minimal zero . We shall use conditions
(H). Suppose:
(H1) The point is a simple solution of equation (1.1).
(H2) There exists such that
for all . Set
(H3) There exist such that
and
for all .
(H4) Function has a minimal solution .
and
(H5)
Notice that . Then, we get the estimates
leading to
So, we get
and . Hence, we conclude by (3.1) that . Therefore, we arrive at the local convergence result for method (1.2).
Theorem 3.1 Under conditions (H) further suppose that . Then, sequence generated by method (1.2) is well defined in , remains in and converges to .
Next, we present a uniqueness of the solution result for equation (1.2).
Proposition 3.2 Suppose
(1) The point is a simple solution of equation in for some . (2) Condition (H2) holds. (3) There exists such that
Set . Then, the only solution of equation (1.1) in is
Proof. Set for some with . Then, using (H2), we get in turn that
so, follows from and .
IV. NUMERICAL EXAMPLE
We verify convergence criteria using method (1.2) for , so .
Example 4.1 (Semi-local case) Let us consider a scalar function defined on the set for by
Choose . Then, we obtain the estimates ,
for all , so , ,
for all and so
Next, set . Then, we have
Define function on the interval by
Then, we get by this definition that
where is the critical point of function . Notice that . It follows that this function is decreasing on the interval and increasing on the interval , since and . So, we can set
and
But if , then
where and for all . For , we have
n
1
2
3
4
5
tn
0.1833
0.2712
0.3061
0.3138
0.3142
0.3142
(L0+|γ|δ)tn+1
0.4675
0.6916
0.7804
0.8001
0.8011
0.8011
Thus condition (2.2) satisfied.
Example 4.2 Let be defined by
Then, we have for and . So, we have .
References
10 Cites in Article
Ioannis Argyros (1942). Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications.
Ioannis Argyros (2008). Newton-like Methods.
Ioannis Argyros,Santhosh George (2021). Mathematical Modeling for the Solution of Equations and Systems of Equations with Applications. Volume IV.
Ramandeep Behl,V Kanwar (2014). New Highly Efficient Families of Higher-Order Methods for Simple Roots, Permitting<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1"><mml:mrow><mml:msup><mml:mi>f</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math>.
Jisheng Kou,Yitian Li,Xiuhua Wang (2007). A family of fifth-order iterations composed of Newton and third-order methods.
S Kumar,V Kanwar,S Tomar,S Singh (2011). Geometrically constructed families of Newton's method for unconstarined optimization and nonlinear equations.
Muhammad Noor,Khalida Noor (2007). Fifth-order iterative methods for solving nonlinear equations.
J Ortega,W Rheinboldt (2000). Iterative Solution of Nonlinear Equations in Several Variables.
J Traub (1964). Iterative schemes for the solution of equations prentice Hall.
Miodrag Petkovic,Ljiljana Petkovic (2013). Families of optimal multipoint methods for solving nonlinear equations: A survey.
No ethics committee approval was required for this article type.
Data Availability
Not applicable for this article.
How to Cite This Article
Samundra Regmi, Ioannis Argyros, Santhosh George, Christopher Argyros. 2026. "On the Convergence of a Single Step Third Order Method for Solving Equations". Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 22 (GJSFR Volume 22 Issue F1).
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.