Previous Article in Journal
Spatiotemporal Pattern Formation in a Prey-Predator System: The Case Study of Short-Term Interactions Between Diatom Microalgae and Microcrustaceans
Previous Article in Special Issue
Strong Convergence Theorems for Generalized Split Feasibility Problems in Banach Spaces
Open AccessArticle

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

by Ioannis K. Argyros 1,† , Ángel Alberto Magreñán 2,*,† , Alejandro Moysi 2,† , Íñigo Sarría 3 and Juan Antonio Sicilia Montalvo 3 1
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
2
Departamento de Matemáticas y Computación, Universidad de La Rioja, Madre de Dios 53, 26006 Logroño (La Rioja), Spain
3
Escuela Superior de Ingeniería y Tecnología, Universidad Internacional de La Rioja, Avenida de la Paz 123, 26006 Logroño (La Rioja), Spain
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2020, 8(7), 1062; https://doi.org/10.3390/math8071062
Received: 9 May 2020 / Revised: 29 May 2020 / Accepted: 4 June 2020 / Published: 1 July 2020

## Abstract

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.

## 1. Introduction

In this study, inspired in previous papers such us , we want to approximate a locally unique solution $z ∗$ of equation
$G ( z ) = 0 ,$
where $G : I ⊂ → T$, $T = R$ or $T = C$, I is convex and G is a differentiable function.
As society changes, the way in which we understand science also changes, as can be seen in [2,3,4,5,6]. In the case of Mathematical Modelling [2,3,4,5] it is important to comment that it enables us to solve problems with the form of the Equation (1). Based on the results, researchers are working to use the same assumptions to increase the convergence domain of the iterative method because it is usually small, the final purpose is to estimate: $‖ z n + 1 − z n ‖$ and $‖ z n − z ∗ ‖$.
The dynamic behavior of iterative methods provides key information about its reliability and stability. In the past ten years, some studies related to dynamic characteristics have been presented [3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]. The main problem of this research is related to the fact that these families or methods have only one parameter, or even no parameters. In our case, we have more free parameters, so we need another tool to study it. The tools in [19,21], arevery useful for studying the dynamic behavior of families with two different parameters or the actual dynamics in other interactive applications. In this article, we will study the convergence of:
$w n = z n − α G ( z n ) G ′ ( z n ) z n + 1 = w n − G ( w n ) G ′ ( z n ) G ( z n ) + β G ( w n ) G ( z n ) + ( β − 2 ) G ( w n ) ,$
Includes computable convergence radius and error estimates. In addition, we will show the behaviors related to the family by using the convergence planes.
We recognize local, semi-local and global convergence. In the case of local (convergence ball is centered at the solution) and semi-local (convergence ball is centered at the starting point $x 0$) the convergence is faster, and less expensive than global convergence. But global convergence provides all roots inside a domain. It is worth noticing that loocal convergence results are important because they demonstrate the degree of difficulty in choosing starters $x 0$. There is a plethora of literature on solvers. See for example [26,27,28,29,30] and the references therein. In these references other techniques are used on polynomials (or not) considering proper intervals containing a root or all roots. These references do not provide computable bounds on $‖ x n − x ∗ ‖$ or uniqueness of the solution $x ∗$ results. But we do. Moreover, the starter $x 0$ really a shot in the dark, whereas in our case it is picked up from a predetermined ball of convergence.
Consider the motivational example for $T = R$, $I = [ − 1 2 , 3 2 ]$ where
$f ( t ) = t 3 ln t 2 + t 5 − t 4 , t ≠ 0 0 , t = 0$
Then, we have $x ∗ = 0$, and
$f ‴ ( t ) = 6 ln t 2 + 60 t 2 − 24 t + 22 .$
Then, obviously, function $f ‴ ( t )$ is unbounded on I. Hence, earlier results using the third (or higher order, that do not appear on $( 2 )$, but used to compute the order of convergence) derivatives cannot guarantee convergence (2) to $z ∗$,
The convergence studies so far have shown convergence using high order derivatives that do not appear on the method. Hence, limiting the applicability of the method. But we show convergence using only the first derivative that actually appears on the method. Hence, we expand the applicability of the method. A radius of convergence, estimates on $‖ x n − x ∗ ‖$ and uniqueness results not given before are also provided. Our technique can be used to expand the applicability of other methods along the same lines. The convergence order is determined using (COC) orr (ACOC) to be precised in Remark 2.
All this work is organized into different chapters: Next section, number 2, we display the method and the theorems that guarantee the local convergence of the method. In the next section, number 3, the authors study the convergence planes of the method of the previous section applied to a quadratic polynomial. In the next section we introduce some chemical applications that reinforce the applicability of the method and in the last section, number 5, we write the conclusions that complete the article.

## 2. Local Convergence Analysis

We start to introduce in this section the method we will study throughout the article. We study the local convergence analysis of the two-step King-like method defined as follow for each $n = 0 , 1 , …$ by
$w n = z n − α G ( z n ) G ′ ( z n ) z n + 1 = w n − G ( w n ) G ′ ( z n ) G ( z n ) + β G ( w n ) G ( z n ) + ( β − 2 ) G ( w n ) ,$
where $z 0$ is an initial point, $α ∈ T$ and $β ∈ T$ are parameters. Some well-known methods, such as our King’s family methods or Traub-Ostrowski method, are special cases of this family.
We consider $N ≥ 1$, $L 0 , L > 0$ and $α , β ∈ T$. We now want to demonstrate the local convergence of the method (2) for which we are going to use the following auxiliary functions and parameters defined as:
The first auxiliary function that we are going to define is called $k 1$ on the interval $[ 0 , 1 L 0 )$ by
$k 1 ( t ) = 1 2 ( 1 − L 0 t ) ( L t + 2 N | 1 − α | )$
and
$r 1 = 2 ( 1 − N | 1 − α | ) 2 L 0 + L$
$r A = 2 2 L 0 + L .$
Next, taking into account the definition of N and $α$, we can write
$| 1 − α | N < 1 .$
Based on the above, we obtain as a consequence
$0 < r 1 < r A < 1 L 0 ,$
$k 1 ( r 1 ) = 1 and 0 ≤ k 1 ( t ) < 1 for each t ∈ [ 0 , r 1 ) .$
Now consider the interval $[ 0 , 1 L 0 )$ and defining a new auxiliary functions
$k 0 ( t ) = L 0 2 t + N | β − 2 | k 1 ( t ) ,$
and other auxiliary function
$p 0 ( t ) = k 0 ( t ) − 1 ,$
Next, suppose that
$N 2 | ( 1 − α ) ( 2 − β ) | < 1 ,$
It clearly follows that
$p 0 ( 0 ) = N 2 | ( 1 − α ) ( β − 2 ) | − 1 < 0$
and consequently,
$p 0 ( t ) → + ∞$
when
$t → 1 L 0 − .$
Using now the Intermediate Value Theorem, it is clear that there exist at least one root of $p 0$ located in the interval $( 0 , 1 L 0 )$, we will call $r 0$ the smallest zero in that interval.
Now we can perform the same technique, for this we define on the interval $[ 0 , r 0 )$ a new auxiliary functions
$k 2 ( t ) = 1 + N 2 ( 1 + | β | k 1 ( t ) ) ( 1 − L 0 t ) ( 1 − k 0 ( t ) ) k 1 ( t )$
and
$p 2 ( t ) = k 2 ( t ) − 1 .$
Similarly, suppose
$N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | + 1 | 1 − α | N < 1 ,$
it is easy to see that
$p 2 ( 0 ) = N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | + 1 | 1 − α | N − 1 < 0$
and
$p 2 ( t ) → ∞$
when
$t → r 0 − .$
So, it is clear that there exist at least one root of $p 2$ located in the interval $( 0 , r 0 )$. We will call $r 2$ as the smallest zero in the interval.
We also define the value r as the minimum of the values between $r 1$ and $r 2$
$r = min { r 1 , r 2 } .$
For $t ∈ [ 0 , r )$, the following conditions are fulfilled by definition of the functions
$0 ≤ k 0 ( t ) < 1 ,$
$0 ≤ k 1 ( t ) < 1$
and
$0 ≤ k 2 ( t ) < 1 .$
From now on, we will also consider $U ( v , ρ )$ as the open ball in T with center $v ∈ T$ and radius $ρ > 0$, as $U ¯ ( v , ρ )$ the closed one and $I 0 = I ∩ U ( Z ∗ , 1 L 0 )$, where $L 0$ is positive therefore we can present the following result.
Theorem 1.
Let $G : I ⊂ T → T$ be a differentiable function. Suppose that there exists $z ∗ ∈ I$, $L 0 , L > 0$, $N ≥ 1$ and $α , β ∈ T$ such that the following requirements are true
$G ′ ( z ∗ ) ≠ 0 , G ( z ∗ ) = 0 ,$
$| ( 1 − α ) ( 2 − β ) | N 2 < 1 ,$
$N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | | 1 − α | N < 1 ,$
$‖ G ′ ( z ∗ ) − 1 ( G ′ ( z ) − G ′ ( z ∗ ) ‖ ≤ L 0 ‖ z − z ∗ ‖ , f o r e a c h z ∈ I$
$‖ G ′ ( z ∗ ) − 1 ( G ′ ( z ) − G ′ ( w ) ‖ ≤ L ‖ z − w ‖ , f o r e a c h z , w ∈ I 0$
$‖ G ′ ( z ∗ ) − 1 G ′ ( z ) ‖ ≤ N , f o r e a c h z ∈ I 0$
and
$U ¯ ( z ∗ , r ) ⊆ I .$
Then, the method (2) generate a well defined sequence ${ z n }$ for $z 0 ∈ U ( z ∗ , r ) \ { z ∗ }$, and ${ z n }$ remains in $U ( z ∗ , r )$ for each $n = 0 , 1 , 2 , …$ and moreover, the sequence converges to $z ∗$..
Furthermore, the inequalities written below are also fulfilled
$‖ w n − z ∗ ‖ ≤ k 1 ( ‖ z n − z ∗ ‖ ) ‖ z n − z ∗ ‖ < ‖ z n − z ∗ ‖ ≤ r ,$
and
$‖ z n + 1 − z ∗ ‖ ≤ k 2 ( ‖ z n − z ∗ ‖ ) ‖ z n − z ∗ ‖ ≤ ‖ z n − z ∗ ‖ ,$
Moreover, if we take R in the form
$R ∈ [ r , 2 L 0 )$
the limit point $z ∗$ is the only solution of Equation (1) in the domain
$I 1 : = U ¯ ( z ∗ , R ) ∩ I .$
Proof.
To prove the Theorem we are going to use the mathematical induction method to show estimates (16) and (17). First of all, using
$z 0 ∈ U ( z ∗ , r ) \ { z ∗ }$
and (12) we get
$‖ ( G ′ ( z 0 ) − G ′ ( z ∗ ) ) ‖ ‖ G ′ ( z ∗ ) ‖ ≤ L 0 ‖ z 0 − z ∗ ‖ < L 0 r < 1 .$
Using this condition and the Banach lemma on invertible functions [2,3,5] it is obvious that
$G ′ ( z 0 )$
is not equal to zero and satisfied
$‖ G ′ ( z 0 ) − 1 G ′ ( z ∗ ) ‖ ≤ 1 1 − L 0 ‖ z 0 − z ∗ ‖ ≤ 1 1 − L 0 r .$
As a consequence, $w 0$ is well defined. Now, using (11) we obtain
$G ( z 0 ) = G ( z 0 ) − G ( z ∗ ) is equal to ∫ 0 1 G ′ ( z ∗ + θ ( z 0 − z ∗ ) ) ( z 0 − z ∗ ) d θ .$
Notice that $θ ( z 0 − z ∗ ) + z ∗ ∈ U ( z ∗ , r )$ since $‖ θ ( z 0 − z ∗ ) − z ∗ + + z ∗ ‖ = θ ‖ z 0 − z ∗ ‖ < r .$
Now, from (14) and (19), we obtain
$‖ G ′ ( z ∗ ) − 1 G ( z 0 ) ‖ is equal to ‖ ∫ 0 1 G ′ ( θ ( z 0 − z ∗ ) z ∗ ) ( z 0 − z ∗ ) d θ ‖ ≤ N ‖ z 0 − z ∗ ‖ .$
From method (2) for $n = 0$, and the Equations (7), (8), (13), (19) and (22) we get
$‖ w 0 − z ∗ ‖ ≤ ‖ ( z 0 − z ∗ − G ′ ( z 0 ) − 1 G ( z 0 ) ) + ( 1 − α ) G ′ ( z 0 ) − 1 G ( z 0 ) ‖ ≤ ‖ G ′ ( z 0 ) − 1 G ( z ∗ ) ‖ ‖ ∫ 0 1 G ′ ( z ∗ ) − 1 G ( z ∗ + θ ( z 0 − z ∗ ) − G ′ ( z 0 ) ) ( z 0 − z ∗ ) d θ ‖ + | 1 − α ‖ G ′ ( z 0 ) − 1 G ′ ( z ∗ ) ‖ ‖ G ′ ( z ∗ ) − 1 G ( z 0 ) ‖ ≤ L ‖ z 0 − z ∗ ‖ 2 2 ( 1 − L 0 ‖ z 0 − z ∗ ‖ ) + N | 1 − α | ‖ z 0 − z ∗ ‖ 1 − L 0 ‖ z 0 − z ∗ ‖ = k 1 ( ‖ z 0 − z ∗ ‖ ) ‖ z 0 − z ∗ ‖ ≤ ‖ z 0 − z ∗ ‖ < r .$
As a result, it is satisfied (16) taking $n = 0$ and $y 0 ∈ U ( x ∗ , r )$.
Now, replace $z 0$ by $w 0$ in the previous inequality (22) we get
$‖ G ′ ( z ∗ ) − 1 G ( w 0 ) ‖ ≤ N ‖ w 0 − z ∗ ‖ .$
Now we must prove $G ( z 0 ) + ( β − 2 ) G ( w 0 ) ≠ 0$ for $z 0 ≠ z ∗$.
From conditions (7), (9), (11), (12) and (22)–(23) it follows that
$‖ G ′ ( z 0 ) ( z 0 − z ∗ ) ) − 1 G ( z 0 ) − G ( z ∗ ) − G ′ ( z ∗ ) ( z 0 − z ∗ ) + ( β − 2 ) G ( w 0 ) ≤ ‖ z 0 − z ∗ ‖ − 1 ‖ G ′ ( z ∗ ) − 1 ( G ( z 0 ) − G ( z ∗ ) − G ′ ( z ∗ ) ( z 0 − z ∗ ) ) ‖ + | 2 − β | ‖ G ′ ( z ∗ ) − 1 G ( w 0 ) ‖ ≤ ‖ z 0 − z ∗ ‖ − 1 L 0 2 ‖ z 0 − z ∗ ‖ 2 + | 2 − β | N ‖ w 0 − z ∗ ‖ ≤ L 0 2 ‖ z 0 − z ∗ ‖ + | 2 − β | N k 1 ( ‖ z 0 − z ∗ ‖ ) = k 0 ( ‖ z 0 − z ∗ ‖ ) < k 0 ( r ) < 1 .$
Or what is the same, from (24) we obtain
$‖ ( G ( z 0 ) + ( 2 − β ) G ( w 0 ) ) − 1 G ′ ( z ∗ ) ‖ ≤ 1 ( 1 − k 0 ( ‖ z 0 − z ∗ ‖ ) ) ‖ z 0 − z ∗ ‖ .$
Consequently, $z 1$ is well defined by the second substep of method (2) for $n = 0$.
Now, from (2) for $n = 0$, (7), (10), (19), (22) and (25) we get
$‖ z 1 − z ∗ ‖ ≤ ‖ w 0 − z ∗ ‖ + ‖ G ′ ( z 0 ) − 1 G ′ ( z ∗ ) ‖ ‖ G ′ ( z ∗ ) − 1 G ( y 0 ) ‖ × ( ‖ G ′ ( z ∗ ) − 1 G ( z 0 ) ‖ + | β | ‖ G ′ ( z ∗ ) − 1 G ( w 0 ) ‖ ) ‖ ( G ( z 0 ) + ( β − 2 ) G ( w 0 ) ) − 1 G ′ ( z ∗ ) ‖ ≤ ‖ w 0 − z ∗ ‖ + N 2 ‖ w 0 − z ∗ ‖ ( ‖ z 0 − z ∗ ‖ + | β | ‖ w 0 − z ∗ ‖ ( 1 − L 0 ‖ z 0 − z ∗ ‖ ) ‖ z 0 − z ∗ ‖ ( 1 − k 0 ( ‖ z 0 − z ∗ ‖ ) ) = 1 + N 2 ( 1 + | β | k 1 ( ‖ z 0 − z ∗ ‖ ) ) ( 1 − L 0 ‖ z 0 − z ∗ ‖ ) ( 1 − k 0 ( ‖ z 0 − z ∗ ‖ ) ‖ w 0 − z ∗ ‖ ≤ k 2 ( ‖ z 0 − z ∗ ‖ ) ‖ z 0 − z ∗ ‖ ≤ ‖ z 0 − z ∗ ‖ < r ,$
which demonstrates the Equation (17) with $n = 0$ and $z 1 ∈ U ( z ∗ , r )$.
Now substituting $z 0$, $w 0$, $z 1$ by $z k$, $w k$, $z k + 1$ in the previous estimates we reach (16)–(18).
Next, from $‖ z k + 1 − z ∗ ‖ ≤ c | z k − z ∗ ‖ < r$, where $c = k 2 ( ‖ z 0 − z ∗ ‖ ) ∈ [ 0 , 1 ] =$, we obtain: $lim k → ∞ z k = z ∗$ and $z k + 1 ∈ U ( z ∗ , r )$.
Finally, we set
$M = ∫ 0 1 G ′ ( w ∗ + θ ( z ∗ − w ∗ ) ) d θ$
for some $w ∗ ∈ U ¯ ( z ∗ , R )$ with $G ( w ∗ ) = 0$. From (12), we obtain
$‖ G ′ ( z ∗ ) − 1 ( M − G ′ ( z ∗ ) ) ‖ ≤ ‖ ∫ 0 1 L 0 ‖ w ∗ + θ ( z ∗ − w ∗ ) ‖ d θ = L 0 ∫ 0 1 ( 1 − θ ) ‖ w ∗ − z ∗ ‖ ≤ L 0 2 R < 1 .$
It is clear that from (26), $M − 1 ∈ L ( T , T )$. Finally, using $0 = G ( w ∗ ) − G ( z ∗ ) = M ( w ∗ − z ∗ )$, we get
$z ∗ = w ∗ .$
□
Remark 1.
• Moreover for the error bounds in practice we can use the computational order of convergence (COC)  using
• or the approximate computational order of convergence (ACOC)  using iterations instead of the exact solution
Remark 2.
(a)
Condition (11) and estimates (12)(14) are natural Lipschitz-type conditions which are standard in the study of iterative methods. In fact (12)(14) can be condensed in one condition. But used this way is better for reasons of precision.
(b)
Concerning the second and the thirs conditions in Theorem 1, these were left as uncluttered as possible. One can easily see that there are infinitely many pair of values $( α , β )$ satisfying these inequalities (but not as weak). Indeed, suppose that
$| ( 1 − α ) ( 2 − β ) | < 1 2 N 2$
Then, the second inequality is satisfied provided that
$2 N 2 ( 1 + | β | N | 1 − α | ) | 1 − α | N < 1$
or
$| 1 − α | < 1 N 2 N 2 + 2 | β | ( < 1 N ) .$
Then, the original inequalities certainly hold, if (27) and (28) hold. Moreover, (27) (in view of (28)) can ever be replaced by
$| 2 − β | < 1 2 N 4 N 2 + 2 | β | .$
However as noted earlier condtions (27) and (28) or (28) and (29) are stronger than the two inequalities appearing in the statemetn of Theorem 1 (and can certainly replace them). Either way, as claimed above there are infinitely many choices of $( α , β )$.

## 3. The Convergence Planes Applied to the Quadratic Polynomial $p ( z ) = z 2 − 1$ Using Method (2)

Once the convergence of the method has been demonstrated in the previous section, we will study the convergence planes. We should first study the parameter planes of the method (2), but the details of these parameter planes can be seen in . We will show the convergence planes applied to $p ( z ) = z 2 − 1$ a polynomial of degree two, taking different values of the method parameters $α$ and $β$. In this article, to draw the points, we iterate a maximum of 200 times and a tolerance of $10 − 3$. We will use different colors to differentiate the numerical behavior of the points when they are iterated:
• in yellow if the iteration of the initial point diverges to ,
• in magenta if the starting point converges to the first root of the quadratic polynomial, $z = 1$,
• in cyan if the iteration of the starting point converges to the other root of the quadratic polynomial $z = − 1$,
• if the iteration of the initial point converges to any strange fixed points, it is colored in red,
• in other colors if the iteration of the initial point converge to different n-cycles ($n ≤ 8$),
• in black if the iteration of the initial point has other behavior.
Consequently, we are only interested in points painted in cyan or magenta since it means that the selection of parameters $α$ and $β$ for that initial point $z 0$ in numerical terms is a good one.
In Figure 1 we see the convergence plane associated to the method (2) applied to the two order polynomial $p ( z ) = z 2 − 1$ with the initial point $z 0 = 0.5$ and in the region of the plane $( α , β ) ∈ [ − 5 , 5 ] × [ − 5 , 5 ]$. and in Figure 2 with starting point $z 0 = − 0.75$ and in the region of the plane $( α , β ) ∈ [ − 5 , 5 ] × [ − 5 , 5 ]$

## 4. Application Examples

To show the applicability of the theorems and results presented in this article, let’s look at the Planck’s radiation law problem, which can be obtained from the reference :
$φ ( λ ) = 8 π s P λ − 5 e s P λ B K − 1$
which estimates the density of within an isothermal black body.
If we use a variable change:
$x = s P λ B K ,$
The expression which estimates the density of within an isothermal black body can be defined in the following terms:
$1 − x 5 = e − x$
And if we now define the function h(x) as:
$h ( x ) = e − x − 1 + x 5 .$
As a result, if we are able to find the roots of Equation (32) can provide us the maximum wavelength of radiation ($λ$) through the expression:
$λ ≈ s P x ∗ B K .$
Let’s consider the interval $D = [ 4 , 6 ]$ and the solution $x ∗ = 4.965114 …$.
Then, we will introduce the applicability of the three special cases introduced in previous Section 3.
Application 1.
First we will consider the case $α = 0.9$ and $β = 2.5$
We obtain the values for this case
$L 0 = 0.060865 … ,$
$L = 0.0948885 …$
and
$N = 1.02331 … .$
Moreover, we can conclude the following conditions
$N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | + 1 | 1 − α | N = 0.273262 … < 1 .$
$N 2 | ( 1 − α ) ( 2 − β ) | = 0.0523577 … < 1 ,$
are satisfied. Then, due to the definition of the “k” functions we can derive
$r 0 = 9.71092 … ,$
$r 1 = 9.23282 …$
and
$r 2 = 2.64413 … .$
Therefore, if we take the alpha and beta values as $α = 0.9$, $β = 2.5$ and $r = r 2 = 2.64413 …$ we we can assure that the method described in (2) converges to the unique solution $x ∗$ of the function $h ( x )$ by Theorem 1..
Application 2.
Secondly we will consider the case $α = 0.75$ and $β = 2.01$
We obtain the values for this case
$L 0 = 0.060865 … ,$
$L = 0.0948885 …$
and
$M = 1.02331 … .$
Moreover, we can conclude the following conditions
$1 + N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | | 1 − α | N = 0.867984 … < 1 .$
$| ( 1 − α ) ( 2 − β ) | N 2 = 0.00261788 … < 1 ,$
are satisfied.
Now, applying the definition of the “k” functions we get
$r 0 = 16.09389 … ,$
$r 1 = 6.87083 …$
and
$r 2 = 1.18924 … .$
So, taking the values: $α = 0.75$, $β = 2.01$ and $r = r 2 = 1.18924 …$ we can assure the convergence of the method described in (2) to the solution $x ∗$ of $h ( x )$ applying Theorem 1.
Application 3.
Finally we will consider the case $α = β = 1$.
We obtain the values for this case
$L 0 = 0.060865 … ,$
$L = 0.0948885 …$
and
$N = 1.02331 … .$
Moreover, we can conclude the following conditions
$N 2 ( 1 + | β | N | 1 − α | ) 1 − N 2 | ( 1 − α ) ( 2 − β ) | + 1 | 1 − α | N = 0 < 1 .$
$| ( 1 − α ) ( 2 − β ) | N 2 = 0 < 1 ,$
are satisfied. Now, applying the definition of the “k” functions we get
$r 0 = 9.71092 … ,$
$r 1 = 9.23282 …$
and
$r 2 = 2.64413 … .$
So, taking the values: $α = 0.9$, $β = 2.5$ and $r = r 2 = 2.64413 …$ we can assure the convergence of the method described in (2) to the solution $x ∗$ of $f ( x )$ by Theorem 1.

## 5. Conclusions

In this paper, we have studied the local convergence of the two-step King-like method of Equation (2). The local convergence of the method has been proved giving the theorem that assure it, in addition to its proof. The advantage of this research is that it is only necessary to apply conditions to the first derivative to ensure local convergence, which can avoid the study of advanced derivatives that may not be simple, thus expanding the applicability of the method. In addition, the dynamics of the method for quadratic polynomials has been studied to prove the performance of the method. We finish by showing several examples using the new proposed method where we can assure the convergence.

## Author Contributions

All authors have contributed equally, read and agreed to the published version of the manuscript.

## Funding

This research was partially supported by Ministerio de Ciencia, Innovación y Universidades under grant PGC2018-095896-B-C21 and by Séneca under grant 20928/PI/18.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Magrenán, Á.A.; Argyros, I.K. Ball convergence theorems and the convergence planes of an iterative method for nonlinear equations. SEMA J. 2015, 71, 39–55. [Google Scholar] [CrossRef]
2. Argyros, I.K. Convergence and Application of Newton-Type Iterations; Springer: Berlin, Germany, 2008. [Google Scholar]
3. Argyros, I.K.; Hilout, S. Numerical methods in Nonlinear Analysis; World Scientific Publishing Company: Hackensack, NJ, USA, 2013. [Google Scholar]
4. Traub, J.F. Iterative Methods for the Solution of Equations; Prentice- Hall Series in Automatic Computation; Englewood Cliffs: Bergen County, NJ, USA, 1964. [Google Scholar]
5. Rall, L.B. Computational Solution of Nonlinear Operator Equations; Robert, E., Ed.; Krieger Pub. Co. Inc.: New York, NY, USA, 1979. [Google Scholar]
6. Bruns, D.D.; Bailey, J.E. Nonlinear feedback control for operating a nonisothermal CSTR near an unstable steady state. Chem. Eng. Sci. 1997, 32, 257–264. [Google Scholar] [CrossRef]
7. Amat, S.; Busquier, S.; Plaza, S. Dynamics of the King and Jarratt iterations. Aequationes Math. 2005, 69, 212–223. [Google Scholar] [CrossRef]
8. Budzko, D.; Cordero, A.; Torregrosa, J.R. A new family of iterative methods widening areas of convergence. Appl. Math. Comput. 2015, 252, 405–417. [Google Scholar] [CrossRef]
9. Amat, S.; Busquier, S.; Plaza, S. Chaotic dynamics of a third-order Newton-type method. J. Math. Anal. Appl. 2010, 366, 24–32. [Google Scholar] [CrossRef]
10. Candela, V.; Marquina, A. Recurrence relations for rational cubic methods I: The Halley method. Computing 1990, 44, 169–184. [Google Scholar] [CrossRef]
11. Candela, V.; Marquina, A. Recurrence relations for rational cubic methods II: The Chebyshev method. Computing 1990, 45, 355–367. [Google Scholar] [CrossRef]
12. Chicharro, F.; Cordero, A.; Torregrosa, J.R. Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. 2013, 2013, 780153. [Google Scholar] [CrossRef]
13. Chun, C. Some improvements of Jarratt’s method with sixth-order convergence. Appl. Math. Comput. 1990, 190, 1432–1437. [Google Scholar] [CrossRef]
14. Ezquerro, J.A.; Hernández, M.A. New iterations of R-order four with reduced computational cost. BIT Numer. Math. 2009, 49, 325–342. [Google Scholar] [CrossRef]
15. Ezquerro, J.A.; Hernández, M.A. On the R-order of the Halley method. J. Math. Anal. Appl. 2005, 303, 591–601. [Google Scholar] [CrossRef]
16. Gutiérrez, J.M.; Hernández, M.A. Recurrence relations for the super-Halley method. Comput. Math. Appl. 1998, 36, 1–8. [Google Scholar] [CrossRef]
17. Ganesh, M.; Joshi, M.C. Numerical solvability of Hammerstein integral equations of mixed type. IMA J. Numer. Anal. 1991, 11, 21–31. [Google Scholar] [CrossRef]
18. Hernández, M.A.; Salanova, M.A. Sufficient conditions for semilocal convergence of a fourth order multipoint iterative method for solving equations in Banach spaces. Southwest J. Pure Appl. Math. 1999, 1, 29–40. [Google Scholar]
19. Kou, J.; Li, Y. An improvement of the Jarratt method. Appl. Math. Comput. 2007, 189, 1816–1821. [Google Scholar] [CrossRef]
20. Kou, J.; Wang, X. Semilocal convergence of a modified multi-point Jarratt method in Banach spaces under general continuity conditions. Numer. Algorithms 2012, 60, 369–390. [Google Scholar]
21. Li, D.; Liu, P.; Kou, J. An improvement of the Chebyshev-Halley methods free from second derivative. Appl. Math. Comput. 2014, 235, 221–225. [Google Scholar] [CrossRef]
22. Ezquerro, J.A.; Hernández, M.A. Recurrence relations for Chebyshev-type methods. Appl. Math. Optim. 2000, 41, 227–236. [Google Scholar] [CrossRef]
23. Magrenán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
24. Magrenán, Á.A. A new tool to study real dynamics: The convergence plane. Appl. Math. Comput. 2014, 248, 215–224. [Google Scholar] [CrossRef]
25. Sarría Martínez de Mendivil, Í.; González Crespo, R.; González-Castanø, A.; Magrenán Ruiz, Á.A.; Orcos Palma, L. Herramienta pedagógica basada en el desarrollo de una aplicación informática para la mejora del aprendizaje en matemática avanzada. Rev. Esp. Pedagog. 2019, 274, 457–485. (In Spanish) [Google Scholar] [CrossRef]
26. McNamee, J.M. A bibliography on roots of polynomials. J. Comput. Appl. Math. 1993, 47, 391–394. [Google Scholar] [CrossRef]
27. McNamee, J.M. A supplementary bibliography on roots of polynomials. J. Comput. Appl. Math. 1997, 78, 1. [Google Scholar] [CrossRef]
28. Mcnamee, J.M. An updated supplementary bibliography on roots of polynomials. J. Comput. Appl. Math. 1999, 110, 305–306. [Google Scholar] [CrossRef]
29. Bartoň, M.; Jüttler, B. Computing roots of polynomials by quadratic clipping. Comput. Aided Geom. Des. 2007, 24, 125–141. [Google Scholar] [CrossRef]
30. Sherbrooke, E.C. Computation of the solutions of nonlinear polynomial systems. Comput. Aided Geom. Des. 1993, 10, 379–405. [Google Scholar] [CrossRef]
31. Cordero, A.; Torregrosa, J.R. Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 2007, 190, 686–698. [Google Scholar] [CrossRef]
32. Divya, J. Families of Newton-like methos with fourth-order convergence. Int. J. Comput. Math. 2013, 90, 1072–1082. [Google Scholar]
Figure 1. Convergence plane of method (2). The starting point is $z 0 = 0.5$.
Figure 1. Convergence plane of method (2). The starting point is $z 0 = 0.5$. Figure 2. Convergence plane of method (2). The starting point is $z 0 = 0.75$.
Figure 2. Convergence plane of method (2). The starting point is $z 0 = 0.75$. 