Next Article in Journal
Riemann–Liouville Fractional Newton’s Type Inequalities for Differentiable Convex Functions
Previous Article in Journal
New Exact Solutions of Some Important Nonlinear Fractional Partial Differential Equations with Beta Derivative
Previous Article in Special Issue
Derivative-Free Kurchatov-Type Accelerating Iterative Method for Solving Nonlinear Systems: Dynamics and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Dynamical Analysis of a Biparametric Family of Six-Order Ostrowski-Type Method under the Möbius Conjugacy Map

School of Mathematical Sciences, Bohai University, Jinzhou 121000, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(3), 174; https://doi.org/10.3390/fractalfract6030174
Submission received: 21 December 2021 / Revised: 7 March 2022 / Accepted: 18 March 2022 / Published: 21 March 2022
(This article belongs to the Special Issue Convergence and Dynamics of Iterative Methods: Chaos and Fractals)

Abstract

:
In this paper, a family of Ostrowski-type iterative schemes with a biparameter was analyzed. We present the dynamic view of the proposed method and study various conjugation properties. The stability of the strange fixed points for special parameter values is studied. The parameter spaces related to the critical points and dynamic planes are used to visualize their dynamic properties. Eventually, we find the most stable member of the biparametric family of six-order Ostrowski-type methods. Some test equations are examined for supporting the theoretical results.

1. Introduction

In many fields including mathematics, physics and engineering, the problem of solving nonlinear equations f ( x ) = 0 is involved where f : D R R is a differentiable function defined in an open interval D. It is almost impossible to find the exact solutions of nonlinear equations, so an iterative method is used to obtain the as accurate as possible approximate solutions. The most classic iterative scheme is Newton’s iterative method [1]. In recent years, many researchers have devoted themselves to designing a class of high-order iterative methods to solve nonlinear equations by using different techniques to improve Newton’s scheme. Rational linear function method [2], combination method [3] and weight-function method [4] are often used to generate new iterative methods or to improve the convergence order of known methods.
Ostrowski’s method [5] is the optimal fourth-order method under the Kung–Traub’s conjecture [6]. A variant of Ostrowski-type methods using the weight-function procedure is proposed by Chun [7], which is given by
y n = x n f ( x n ) f ( x n ) , w n = y n f ( x n ) f ( x n ) 2 f ( y n ) f ( y n ) f ( x n ) , x n + 1 = w n H ( u n ) f ( w n ) f ( x n ) ,
where u n = f ( y n ) f ( x n ) and H ( u n ) represents a weight function. In view of Theorem 1 of Reference [6], if function H ( u n ) satisfies the conditions H ( 0 ) = 1 , H ( 0 ) = 2 , and | H ( 0 ) | < , then the above iteration scheme is sixth-order. In the current study, we will select the concrete form of H ( u n ) with two-parameter t, k C : H ( u n ) = t + ( 2 t + k ) u n t + k u n .
Hence, we obtain the following biparametric family of sixth-order method (OM):
y n = x n f ( x n ) f ( x n ) , w n = y n f ( x n ) f ( x n ) 2 f ( y n ) f ( y n ) f ( x n ) , x n + 1 = w n t f ( x n ) + ( 2 t + k ) f ( y n ) t f ( x n ) + k f ( y n ) f ( w n ) f ( x n ) .
The fixed point operator of (2) or iteration function is:
R f ( z ) = z f ( z ) f ( z ) f ( z ) f ( z ) 2 f ( y ) f ( y ) f ( z ) t f ( z ) + ( 2 t + k ) f ( y ) t f ( z ) + k f ( y ) f ( w ) f ( z ) ,
where:
y = z f ( z ) f ( z ) , w = y f ( z ) f ( z ) 2 f ( y ) f ( y ) f ( z ) .
For simplicity, we mark w as w ( z ) .
For arbitrary members (except for t = 0 and k = 0 ) of the OM family (2), the speed of convergence is similar. Our main interest is the stability of the OM family in this paper. Since the dynamic properties of the iterative method provide us with important information about the stability and reliability of members. In these respects, several scholars described the dynamical behavior of different iterative families (see [4,6,8,9,10,11]). For example, Maroju et al. [11] analyzed the dynamical behavior of Chebyshev–Halley family. Magreñán [12] studied some anomalies in the fourth-order Jarrat family. These iterative methods are all one-parameter iterative schemes. We will investigate the dynamic properties of rational functions R f ( z ) on low-degree polynomials associated with the biparametric family (2) with the help of complex dynamics tools [13]. This analysis allows us to reject poorly behaved members and select the most stable ones.
Now, we review some basic dynamical concepts (see [8,9,14]) which will be used in paper. Given a rational function R : C ¯ C ¯ , where C ¯ is the Riemann sphere, the orbit of a point z 0 C ¯ is defined as
z 0 , R ( z 0 ) , R 2 ( z 0 ) , , R n ( z 0 ) , .
Moreover, a fixed point z 0 can be divided into the following four types:
(a)
Attractor if | R ( z 0 ) | < 1 .
(b)
Superattractor if | R ( z 0 ) | = 0 .
(c)
Repulsor if | R ( z 0 ) | > 1 .
(d)
Parabolic if | R ( z 0 ) | = 1 .
The basin of attraction of an attractor z * is defined as
A ( z * ) = z 0 C ¯ : R n ( z 0 ) z * , n .
This article is divided into seven sections. Section 2 briefly describes the preliminary results of the dynamics on C ¯ . In Section 3, we obtain the strange fixed points of R f ( z ) and investigate its stability. In Section 4, the relevant properties of the free critical points are described. Section 5 presents the parameter space associated with free critical points and the dynamic plane of family (2) elements. In Section 6, we conduct numerical experiments on the proposed method and the existing methods. In Section 7, we make a short summary.

2. Preliminary Results

Theorem 1 (The Scaling Theorem).
Let f ( z ) be an analytic function on the Riemann sphere, and let Γ ( z ) = a z + b , a 0 , be an affine map. If h ( z ) = f Γ ( z ) , then the fixed points operator (3) R f is analytically conjugated to R h by Γ, that is Γ R h Γ 1 ( z ) = R f ( z ) .
Proof. 
With the iteration function R ( z ) , we have:
R h ( Γ 1 ( z ) ) = Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) 2 h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) ) h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) ) h ( Γ 1 ( z ) ) t h ( Γ 1 ( z ) ) + ( k + 2 t ) h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) ) t h ( Γ 1 ( z ) ) + k h ( Γ 1 ( z ) h Γ 1 ( z ) h ( Γ 1 ( z ) ) ) h ( w ( Γ 1 ( z ) ) ) h ( Γ 1 ( z ) ) .
since:
h Γ 1 ( z ) = f ( z ) ,
( h Γ 1 ) ( z ) = 1 a h ( Γ 1 ( z ) ) ,
we obtain:
h ( Γ 1 ( z ) ) = a ( h Γ 1 ) ( z ) = a f ( z ) ,
and
h ( Γ 1 ( z ) ) = a 2 f ( z ) .
Using (6) and (8), we obtain:
R h ( Γ 1 ( z ) ) = Γ 1 ( z ) f ( z ) a f ( z ) f ( z ) f ( z ) 2 h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) a f ( z ) t f ( z ) + ( k + 2 t ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) t f ( z ) + k h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( w ( Γ 1 ( z ) ) ) a f ( z ) .
Therefore:
R f ( z ) = Γ R h Γ 1 ( z ) = Γ ( R h ( Γ 1 ( z ) ) ) = a R h ( Γ 1 ( z ) ) + b = a Γ 1 ( z ) f ( z ) f ( z ) f ( z ) f ( z ) 2 h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) f ( z ) t f ( z ) + ( k + 2 t ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) t f ( z ) + k h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( w ( Γ 1 ( z ) ) ) f ( z ) + b = z f ( z ) f ( z ) f ( z ) f ( z ) 2 h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) f ( z ) t f ( z ) + ( k + 2 t ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) t f ( z ) + k h ( Γ 1 ( z ) f ( z ) a f ( z ) ) h ( w ( Γ 1 ( z ) ) ) f ( z ) .
We then just need to prove that h ( Γ 1 ( z ) f ( z ) a f ( z ) ) = f ( y ) and h ( w ( Γ 1 ( z ) ) ) = f ( w ( z ) ) . First prove that h ( Γ 1 ( z ) f ( z ) a f ( z ) ) = f ( y ) . By using the Taylor expansion of h ( Γ 1 ( z ) f ( z ) a f ( z ) ) about Γ 1 ( z ) and (9), we have:
h ( Γ 1 ( z ) f ( z ) a f ( z ) ) = h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) f ( z ) a f ( z ) + h ( Γ 1 ( z ) ) f ( z ) 2 2 a 2 f ( z ) 2 h ( Γ 1 ( z ) ) f ( z ) 3 6 a 3 f ( z ) 3 + = f ( z ) f ( z ) 2 2 f ( z ) 2 f ( z ) f ( z ) 3 6 f ( z ) 3 + = f ( z f ( z ) f ( z ) ) = f ( y ) .
The prove that h ( w ( Γ 1 ( z ) ) ) = f ( w ) . Because:
h ( w ) = h ( z h ( z ) h ( z ) h ( z ) h ( z ) 2 h ( z h ( z ) h ( z ) ) h ( z h ( z ) h ( z ) ) h ( z ) ) .
Replacing z with Γ 1 ( z ) in (13), we obtain:
h ( w ( Γ 1 ( z ) ) ) = h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) 2 h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) ) h ( Γ 1 ( z ) h ( Γ 1 ( z ) ) h ( Γ 1 ( z ) ) ) h ( Γ 1 ( z ) ) ) = h ( Γ 1 ( z ) f ( z ) a f ( z ) f ( z ) f ( z 2 h ( Γ 1 ( z ) f ( z ) a f ( z ) ) ) h ( Γ 1 ( z ) f ( z ) a f ( z ) ) a f ( z ) ) = h ( z b a f ( z ) a f ( z ) f ( z ) f ( z ) 2 f ( y ) f ( y ) a f ( y ) ) = h ( 1 a ( y f ( z ) f ( z ) 2 f ( y ) f ( y ) a f ( z ) b ) ) = f Γ ( 1 a ( y f ( z ) f ( z ) 2 f ( y ) f ( y ) a f ( z ) b ) ) = f ( y f ( z ) f ( z ) 2 f ( y ) f ( y ) a f ( z ) ) = f ( w ) .
From (14), we obtain Γ R h Γ 1 ( z ) = R f ( z ) ; then this proof is completed. □
The above theorem shows that it allows us to conjugate the dynamical behavior of one operator with the behavior related to another, conjugated by an affine application.
Definition 1.
Let F : X C ¯ X and O : Y C ¯ Y be two functions (representing two dynamical systems). We say that F is conjugate to O via Γ if there exists an isomorphism Γ : Y X such that F Γ = Γ O . Such a map Γ is called a conjugacy [15].
According to Theorem 1 which was proven in [4], we find:
Theorem 2.
Let F and O be defined by Definition 1 be of class C 1 and are conjugate to each other via the diffeomorphic conjugacy Γ. Moreover, let ξ be a fixed point of O . Then, the following hold:
(a) 
The fixed points property remains invariant under a topological conjugacy Γ, that is:
ξ = O ( ξ ) i f a n d o n l y i f Γ ( ξ ) = F ( Γ ( ξ ) ) .
(b) 
The Poincar e ´ characteristic multiplier [10] of ξ by O , denoted by m ( O , ξ ) , is invariant under a diffeomorphic conjugacy Γ, that is:
m ( Γ O Γ 1 , Γ ( ξ ) ) = F ( Γ ( ξ ) ) = O ( ξ ) = m ( O , ξ ) .
Remark 1.
Results of Theorem 2 state that a conjugacy Γ indeed preserves the dynamical behavior between the two dynamical systems; for example, if F and O are conjugate to each other via Γ, and ξ is a fixed point of O , then Γ ( ξ ) is a fixed point of F . The converse is also true, that is, let ξ be a fixed point of F , then Γ 1 ( ξ ) is a fixed point of O ; Furthermore, ξ is a critical point or free critical point of O , then Γ ( ξ ) is a critical point or free critical point of F . The converse is also true. The above is based on the invariance properties of the fixed point and its multiplier under the conjugacy.
Furthermore, we discover F = Γ O Γ 1 and F n = ( Γ O Γ 1 ) ( Γ O Γ 1 ) ( Γ O Γ 1 ) = Γ O n Γ 1 . If F and O are extra invertible, we can also find F 1 = Γ O 1 Γ 1 and F n = Γ O n Γ 1 , besides the topological conjugacy, Γ maps an orbit:
, O 2 ( y ) , O 1 ( y ) , y , O ( y ) , O 2 ( y ) ,
of O onto an orbit:
, F 2 ( x ) , F 1 ( x ) , x , F ( x ) , F 2 ( x ) ,
of F , where x = Γ ( y ) . From this, we find that the order of points is preserved. Thus, the orbits of the two maps behave similarly under homeomorphism Γ . According to the invariant properties of the fixed point, the multiplier as well as the scaling theorem, it is assuredly of value to study the dynamics of a conjugated map if simplified through conjugacy Γ .

3. Fixed Points and Stability

Due to topological invariance, we transform R f in (3) into Ω by a linear fractional M o ¨ bius conjugacy map M ( z ) = z a z b , ( a b ) fulfilling:
Ω ( z ; a , b , t , k ) = I ( z ; a , b , t , k ) Θ ( z ; a , b , t , k ) ,
when applied to an arbitrary prototype quadratic polynomial f ( z ) = ( z a ) ( z b ) , where I and Θ are rational polynomials whose coefficients are dependent upon parameters a , b , t , k . One of our aims is to make coefficients of both I and Θ be minimally dependent on parameters. According to the previously mentioned conjugate, we find that all the coefficients of both I and Θ are only dependent upon t and k, and independent of a and b. Consequently, with the aid of the symbolic operation capability of Mathematica [16], (15) can be written as
Ω ( z ; t , k ) = z 4 σ ( z ; t , k ) μ ( z ; t , k ) ,
where:
σ ( z ; t , k ) = k 2 t + ( k + 2 t ) z + 2 t z 2 + ( k + 2 t ) z 3 + t z 4 ,
μ ( z ; t , k ) = t ( k + 2 t ) z 2 t z 2 ( k + 2 t ) z 3 + ( k + 2 t ) z 4 ,
We then apply a special treatment to t, the cases for values t 1 2 , 1 2 , 1 , 1 . The aim is to simplify the rational function also to reduce the dependence on the parameters even further. In this study, the more interesting one is t = 1 , which corresponds to the fixed point operator of the following form:
Ω ( z ; k ) = Ω ( z ; 1 , k ) = z 4 2 k + ( 2 + k ) z + 2 z 2 + ( 2 + k ) z 3 + z 4 1 + ( 2 + k ) z + 2 z 2 + ( 2 + k ) z 3 ( 2 + k ) z 4 .
We will investigate the fixed points of Ω and their stability. The fixed points of Ω ( z ; k ) are given by the roots of:
Ω ( z ; k ) z = z ( z 1 ) 1 + ( 3 + k ) z + ( 5 + k ) z 2 + 3 ( 3 + k ) z 3 + ( 5 + k ) z 4 ( 3 + k ) z 5 + z 6 1 + ( 2 + k ) z + 2 z 2 + ( 2 + k ) z 3 ( 2 + k ) z 4 = z ( z 1 ) ρ ( z ) ζ ( z ) ,
where we handily denote:
ρ ( z ) = 1 + ( 3 + k ) z + ( 5 + k ) z 2 + 3 ( 3 + k ) z 3 + ( 5 + k ) z 4 ( 3 + k ) z 5 + z 6 ,
ζ ( z ) = 1 + ( 2 + k ) z + 2 z 2 + ( 2 + k ) z 3 ( 2 + k ) z 4 .
The conjugacy map we consider is a M o ¨ bius transformation Γ ( z ) = M ( z ) = z a z b , with the following properties:
( i ) Γ ( a ) = 0 , ( i i ) Γ ( b ) = , ( i i i ) Γ ( ) = 1 .
This enable us to discover that z = 0 and z = are clearly two fixed points of Ω = Γ R f Γ 1 , with Γ ( z ) = z a z b , respectively, corresponding to fixed points a and b of R f or the roots a and b of polynomial f ( z ) = ( z a ) ( z b ) . Furthermore, 0 , are free of the parameter k. In addition, they are super-attractive points and suggest the critical points of Ω ( z ; k ) .
Nonetheless, because Ω ( 0 ) = 0 , Ω ( ) = , that is, their orbits draw near themselves, such fixed points would show a tiny impact on the dynamics. Fixed points not excluding 0 , are termed as strange fixed points which are different from the roots of f ( z ) . In order to find further strange fixed points, we need to solve the equations Ω ( z ; k ) z = 0 in (20) for z with given values of k.

3.1. Strange Fixed Points

We first check the existence of k-values for common factors (divisors) of ρ ( z ) and ζ ( z ) . Additionally, both ρ ( z ) and ζ ( z ) will be checked if they have a factor ( z 1 ) . The following theorem best describes the relevant properties of such existence as well as explicit strange fixed points.
Theorem 3.
(a) 
If k = 1 , then ρ ( z ) and ζ ( z ) have a common factor ( z + 1 ) , the operator Ω has the strange fixed points z = 1 , z = 1 , z = i 1 2 ( 3 ± 5 ) , i 1 2 ( 3 ± 5 ) ;
(b) 
If k = 3 , then ρ ( z ) and ζ ( z ) have two common factors 1 + z 2 and 1 z + z 2 , the operator Ω has the strange fixed points z = 1 , z = 0.5 ± 0.866025 i ;
(c) 
If = 27 7 , then ρ ( z ) has a factor ( z 1 ) , the operator Ω has the strange fixed points z = 1 ( t r i p l e ) , z = 0.332631 ± 1.13238 i , z = 0.238798 ± 0.812947 i ;
(d) 
If k = 5 , then ζ ( z ) has a factor ( z 1 ) , the operator Ω has the strange fixed points z = 0.357785 , z = 2.79497 , z = 0.367445 ± 1.27423 i , z = 0.208934 ± 0.724541 i ;
(e) 
For k satisfying ( k + 1 ) ( k + 3 ) ( k + 27 7 ) ( k + 5 ) 0 , the strange fixed points are given by z = 1 and the six roots of ρ ( z ) = 0 in terms of parameter k.
Proof. 
(a), (b) Suppose that ρ ( z ) = 0 and ζ ( z ) = 0 for some values of z C ¯ . Observe that parameter k exists in a linear way in all coefficients of both polynomials. By eliminating k from the two polynomials, we obtain the relation: ( 1 + z 2 ) 2 ( 1 + z ) ( 1 z + z 2 ) = 0 . Hence, ( 1 + z ) , 1 + z 2 , ( 1 + z 2 ) 2 , ( 1 z + z 2 ) = 0 are candidates for common divisors of ρ ( z ) and ζ ( z ) . First, substituting z = 1 , we find ρ ( 1 ) = 6 3 ( 3 + k ) = 0 , ζ ( 1 ) = 3 3 k = 0 , from which k = 1 is obtained. Indeed, ρ ( z ) and ζ ( z ) reduce to, respectively, ( 1 + z ) 2 ( 1 + 3 z 2 + z 4 ) and ( 1 + z ) ( 1 + 2 z 2 z 3 ) , as desired. Second, dividing both ρ ( z ) and ζ ( z ) by 1 + z 2 yields the identical remainder as k 3 , from which the remainder becomes zero for k = 3 . Indeed, ρ ( z ) and ζ ( z ) reduce to, respectively, ( 1 + z 2 ) ( 1 z + z 2 ) ( 1 + z + z 2 ) and ( 1 + z 2 ) ( 1 z + z 2 ) . Accordingly, we find that ( 1 z + z 2 ) is indeed a common factor of ρ ( z ) and ζ ( z ) . Thus, dividing both ρ ( z ) and ζ ( z ) by 1 z + z 2 yields the remainder, respectively, as 3 k 9 , ( 2 k + 6 ) ( k + 3 ) and the remainder becomes zero for k = 3 . After that, it is the same as the previous common factor ( 1 + z 2 ) . Third, the direct division of ρ ( z ) by ( 1 + z 2 ) 2 is performed, then its remainder as ( k + 3 ) z 3 ( k + 2 ) z 2 k 2 , which cannot be zero for any k-values. The rest of the proof only needs to substitute the corresponding ρ ( z ) and ζ ( z ) into (20) and solve its roots to be the strange fixed points.
(c)
We find that ρ ( z ) has a factor for k = 27 7 via solving ρ ( 1 ) = 27 + 7 k = 0 . In fact, for k = 27 7 , we also obtain ρ ( 1 ) = 0 . Hence, ρ ( z ) has a factor ( z 1 ) 2 for k = 27 7 . Then, ρ ( z ) = 1 7 ( z 1 ) 2 ( 7 + 8 z + 17 z 2 + 8 z 3 + 7 z 4 ) , ζ ( z ) = 1 7 ( 7 13 z + 14 z 2 13 z 3 + 13 z 4 ) . The rest of its proof is trivial.
(d)
If ( z 1 ) is a divisor of ζ ( z ) , then ζ ( 1 ) = 5 + k = 0 . For a value of k = 5 , we discover ζ ( z ) = ( z 1 ) ( 1 2 z + 3 z 3 ) . As a result, we obtain the strange fixed points z satisfying ρ ( z ) = 1 2 z 6 z 3 2 z 5 + z 6 = 0 . The rest of the proof is similar to (a).
(e)
It is straightforward for us to claim the results. We numerically obtain the strange fixed points z satisfying ρ ( z ) = 0 for given values of k 1 , 3 , 27 7 , 5 ; detailed analysis will be shown later.

3.2. Stability of the Strange Fixed Points

To study the stability of fixed points, we need to compute the first derivative of Ω from (19):
Ω ( z ; k ) = z 3 ( 1 + z 2 ) χ ( z ) ζ ( z ) 2 .
where:
χ ( z ) = 8 + 4 k + ( 2 + 7 k + 3 k 2 ) z 4 ( 7 + 4 k + k 2 ) z 2 2 ( 22 + 13 k + k 2 ) z 3 4 ( 7 + 4 k + k 2 ) z 4 ( 2 + 7 k + 3 k 2 ) z 5 + ( 8 + 4 k ) z 6 .
ζ ( z ) = 1 + ( 2 + k ) z + 2 z 2 + ( 2 + k ) z 3 ( 2 + k ) z 4 .
We first check the existence of k-values for common factors (divisors) of χ ( z ) and ζ ( z ) . Additionally, χ ( z ) and ζ ( z ) will be checked for whether they have divisors z 3 , 1 + z 2 . The following theorem best describes the relevant properties of such existence as well as explicit strange fixed points.
Theorem 4.
(a) 
If k = 5 , then Ω ( z ; k ) = 6 z 3 ( 1 + z 2 ) ( 2 3 z 3 z 3 + 2 z 4 ) ( 1 2 z + 3 z 3 ) 2 ;
(b) 
If k = 1 , then Ω ( z ; k ) = 2 z 3 ( 1 + z 2 ) ( 2 5 z 5 z 3 + 2 z 4 ) ( 1 2 z + 3 z 3 ) 2 ;
(c) 
If k = 3 , then Ω ( z ; k ) = 4 z 3 ;
(d) 
If k = 2 , then Ω ( z ; k ) = 12 z 5 ( 1 + z 2 ) 2 ( 1 + 2 z 2 ) 2 ;
(e)
If ( k + 5 ) ( k + 1 ) ( k + 3 ) ( k + 2 ) 0 , then we can demonstrate the desired stability of z by varying parameter k with the aid of Theorem 6.
Proof. 
(a), (b), (c) Suppose that χ ( z ) = 0 and ζ ( z ) = 0 for some values of z. By eliminating k from the two polynomials, we obtain the relation: ( z 1 ) ( z + 1 ) ( 1 + z 2 ) ( 1 z + z 2 ) ( 1 + z 2 4 z 3 + 2 z 4 4 z 5 ) = 0 . Hence, ( z 1 ) , ( z + 1 ) , ( 1 + z 2 ) , ( 1 z + z 2 ) are candidates for common divisors of χ ( z ) and ζ ( z ) . After checking constraints χ ( 1 ) = ζ ( 1 ) = 0 , χ ( 1 ) = ζ ( 1 ) = 0 , we find that k = 5 , 1 yielding common divisors. By checking zero remainders when dividing both χ ( z ) and ζ ( z ) by ( 1 + z 2 ) and ( 1 z + z 2 ) , respectively, we find k = 3 yielding common divisors.
(d)
For χ ( z ) to have a factor z, we require k = 2 by solving χ ( 0 ) = 8 + 4 k = 0 for k. For χ ( z ) to have a factor ( 1 + z 2 ) , we require its remainder ( 8 k 2 + 40 k + 48 ) z = 0 , from which k = 3 , 2 .
(c)
If ζ ( z ) has a factor ( 1 + z 2 ) , then its remainder is k 3 , from which the remainder becomes zero for k = 3 .
The rest of the above proof only needs to substitute the corresponding χ ( z ) and ζ ( z ) into (23).
(e)
If k satisfies ( k + 5 ) ( k + 1 ) ( k + 3 ) ( k + 2 ) 0 , then the graphical stability of z yields the desired results.
Regarding the stability of the strange fixed points, we conduct research in two cases. The first is the stability of the strange fixed points for special k-values; the second is the stability of the other strange fixed points corresponding to the root of ρ ( z ) and z = 1 .
Using the results of Theorem 4 to describe the stability of the fixed points in Theorem 3 in terms of parameter k. Table 1 presents the stability results of the first case.
Theorem 5.
Let k 5 , 1 , 3 , 2 , 27 7 , then the relevant properties of the strange fixed point z = 1 are as follows:
(a) 
If k = 4 , then z = 1 is a superattracting point;
(b) 
If | k + 251 63 | < 8 63 , then z = 1 is an attractive point;
(c) 
If | k + 251 63 | = 8 63 , then z = 1 is a parabolic fixed point;
(d) 
At last, if | k + 251 63 | > 8 63 , then z = 1 is a repulsive point.
Proof. 
Substituting z = 1 into Equation (23), we obtain:
| Ω ( 1 ; k ) | = 8 4 + k 5 + k .
It is easy to confirm that | Ω ( 1 ; 4 ) | = 0 . Again, 8 | 4 + k 5 + k | 1 is equivalent to 8 | 4 + k | | 5 + k | . Let k = x + i y be an arbitrary complex number. Then:
| 4 + k | 2 = ( 4 + x ) 2 + y 2 a n d | 5 + k | 2 = ( 5 + x ) 2 + y 2 .
So:
64 ( 4 + x ) 2 + y 2 ( 5 + x ) 2 + y 2 .
By simplifying:
63 x 2 + 63 y 2 + 502 x + 999 0 .
That is:
x + 251 63 2 + y 2 = 8 63 .
Therefore:
| Ω ( 1 ; k ) | 1 i f a n d o n l y i f | k + 251 63 | 8 63 .
Remark 2.
For later use, we conveniently let A = k C : | Ω ( 1 ; k ) | < 1 , S = { k C : | Ω ( 1 ; k ) | = 1 } and S = k C : | Ω ( 1 ; k ) | > 1 . Then, A , S , B indicate the sets where the strange fixed point z = 1 becomes attractive, repulsive, and indifferent, respectively. As seen in Figure 1, S is the boundary between A as a circle of radius 8 63 centered at 251 63 , 0 . Furthermore, Figure 2 shows a stability surface with z = 1 (independent of parameter k).
Lemma 1.
If ξ C ¯ is the root of ρ ( z ) defined in (21), then 1 ξ is also a root of ρ ( z ) for any k C and any z C ¯ .
Proof. 
Let ρ ( z ) = 0 . Substituting 1 ξ into ρ ( z ) for z, we obtain:
ρ 1 ξ = 1 + ( 3 + k ) 1 ξ + ( 5 + k ) 1 ξ 2 + 3 ( 3 + k ) 1 ξ 3 + ( 5 + k ) 1 ξ 4 + ( 3 + k ) 1 ξ 5 + 1 ξ 6 = ξ 6 + ( 3 + k ) ξ 5 + ( 5 + k ) ξ 4 + 3 ( 3 + k ) ξ 3 + ( 5 + k ) ξ 2 + ( 3 + k ) ξ + 1 ξ 6 = ρ ( ξ ) ξ 6 = 0 .
This completes the proof. □
Corollary 1.
If ξ C ¯ is a fixed point of Ω defined in (19), then 1 ξ is also a fixed point of Ω.
Proof. 
Based on the fact that Ω is conjugate to Ω via conjugacy Γ ( z ) = 1 z . yThus, let X = Y = C ¯ , O = F = Ω in Theorem 2, then Theorem 2 (b) completes this proof. □
Lemma 2.
Let ( k + 5 ) ( k + 1 ) ( k + 3 ) ( k + 2 ) ( k + 27 7 ) 0 and ξ 1 , ξ 2 , ξ 3 C \ 0 be three roots of ρ ( z ) . Then, ρ ( z ) can be expressed as the product of three second-degree polynomials as follows:
ρ ( z ) = i = 1 3 ( 1 + d i z + z 2 ) = i = 1 3 ( z ξ i ) z 1 ξ i ,
where d i = ξ i + 1 ξ i or ξ i = d i d i 2 4 2 for 1 i 3 in terms of k.
Proof. 
In view of Lemma 1 and Corollary 1, we find that if ξ 0 is a strange fixed point of Ω ( z ; k ) found from the roots of ρ ( z ) = 0 for k 5 , 1 , 3 , 2 , 27 7 , then so is 1 ξ .
Hence, the above factorization is valid. Then i = 1 3 ( z ξ i ) z 1 ξ i is easily acquired under the six-degree polynomials ρ ( z ) . ( 1 + d i ( z ) + z 2 ) can be obtained by expanding z 1 ξ i , it is clear that d i = ξ i + 1 ξ i holds.
In order to continue to analyze the stability of the other fixed points from the root of ρ ( z ) , we need to find the root of ρ ( z ) first by solving ρ ( z ) = 1 + ( 3 + k ) z + ( 5 + k ) z 2 + 3 ( 3 + k ) z 3 + ( 5 + k ) z 4 + ( 3 + k ) z 5 + z 6 = 0 . By comparing the expansion of i = 1 3 ( 1 + d i z + z 2 ) with the coefficients of the same order term of ρ ( z ) , we find that the following three equations are related to d 1 , d 2 , d 3 :
d 1 + d 2 + d 3 = 3 + k , 3 + d 1 d 2 + d 1 d 3 + d 2 d 3 = 5 + k , 2 d 1 + 2 d 2 + 2 d 3 + d 1 d 2 d 3 = 3 ( 3 + k ) .
We eliminate variables d 2 , d 3 in (27) using the strong symbolic operation ability of Mathematica to ultimately access a decic equation in d 1 beneath:
d 1 3 ( 3 + k ) d 1 2 + ( 2 + k ) d 1 ( 3 + k ) = 0 .
For convenience, we let Φ ( d 1 ; k ) denote d 1 3 ( 3 + k ) d 1 2 + ( 2 + k ) d 1 ( 3 + k ) . Eliminating d 1 , d 3 and d 1 , d 2 , respectively, we then obtain a unique decic equation in c d 1 , d 2 , d 3 as follows:
Φ ( c ; k ) = 0 .
Now, we calculate the roots of Φ ( c ; k ) and attain:
d 1 ( k ) = 3 + k 3 2 3 ( 3 3 k k 2 ) 3 · n ( k ) + n ( k ) 3 · 2 3 , d 2 ( k ) = 3 + k 3 ( 1 + i 3 ) ( 3 3 k k 2 ) 3 · 4 3 · n ( k ) ( 1 i 3 · n ( k ) ) 6 · 2 3 , d 3 ( k ) = 3 + k 3 ( 1 i 3 ) ( 3 3 k k 2 ) 3 · 4 3 · n ( k ) ( 1 + i 3 · n ( k ) ) 6 · 2 3 .
where:
n ( k ) = 81 + 36 k + 9 k 2 + 2 k 3 + 3 3 · 239 + 204 k + 86 k 2 + 24 k 3 + 3 k 4 3 .
Then, substituting d i ( k ) for ξ i = d i d i 2 4 2 , i = 1 , 2 , 3 . The result is a k-dependent strange fixed point of Ω . □
The stability surfaces of the strange fixed points dependent on parameter k are illustrated in Figure 3.
Lemma 3.
If ξ C ¯ is the root of χ ( z ) defined in (24), then 1 ξ is also a root of χ ( z ) for any k C and any z C ¯ .
Proof. 
As in the proof of Lemma 1, we obtain by direct calculation that χ 1 ξ = χ ( ξ ) ξ 6 , because χ ( ξ ) = 0 , proof completed. □
Theorem 6.
Let z be a strange fixed point of Ω ( z ; k ) satisfying ρ ( z ) = 0 . Then, the following holds:
Ω ( z ; k ) = Ω 1 z ; k .
Proof. 
The derivative of Ω is Ω ( z ; k ) = z 3 ( 1 + z 2 ) χ ( z ) ζ ( z ) 2 . Substituting 1 z into Ω ( z ; k ) for z and knowing from the proof of Lemma 3 that χ 1 z = χ ( z ) z 6 , eventually, we obtain Ω 1 z ; k = ( 1 + z 2 ) χ ( z ) z 11 ζ 1 z 2 . As a result, it continues to check the relation:
z 3 ζ ( z ) 2 = 1 z 11 ζ 1 z 2 .
By direct computation:
z 3 ζ ( z ) 2 1 z 11 ζ 1 z 2 = z 14 ζ 1 z 2 ζ ( z ) 2 z 11 ζ ( z ) 2 ζ 1 z 2 = 1 ( k + 1 ) z + k z 2 + 2 z 3 2 z 5 k z 6 + ( 1 + k ) z 7 + z 8 z 11 ζ ( z ) 2 ζ 1 z 2 · ρ ( z ) = 0 .
is found. This completes the proof. □
The following lemma depicts how to find the super-attraction point under the strange fixed point of conjugated maps Ω ( z ; k ) for some values of k. We need to concurrently solve ρ ( z ) = χ ( z ) = 0 for some values of k; in this way, the super-attractors of Ω ( z ; k ) can be found. We first eliminate the parameter k from ρ ( z ) = χ ( z ) = 0 , resulting in a polynomial over z with degree 16:
( 1 + z ) 2 ( 1 + z 2 ) ( 1 z + z 2 ) ( 1 + 6 z 2 9 z 3 + 12 z 4 16 z 5 + 12 z 6 9 z 7 + 6 z 8 + z 10 ) = 0 .
In view of Theorem 6, there are only eight pairs super-attractors denoted by z i , 1 z i for 1 i 8 , the stability of z i and 1 z i are the same. Then, after solving Ω ( z ; k ) = 0 for k numerically, we achieve the following Lemma deeming the needed super-attractors:
Lemma 4.
Let z 1 = 1 , z 2 = i , z 3 = 0.5 + 0.866025 i , z 4 = 0.791164 + 2.35788 i , z 5 = 0.255105 0.966913 i , z 6 = 0.127905 + 0.381192 i , z 7 = 0.215007 + 0.976613 i , z 8 = 0.959167 + 0.282841 i . Then z i , 1 z i , ( i = 1 , 2 , , 8 ) are super-attractors of Ω ( z ; k ) , respectively, for eight values of k { 0 , 3 , 3.33333 + 9.87028 × 10 7 i , 0.870604 2.7565 i , 1.2134 1.08719 × 10 6 i , 0.87065 + 2.7565 i , 2.78296 + 2.96051 × 10 6 i , 3.77916 2.48912 × 10 7 i or { 1 , 2 , 3 + 5.64784 × 10 13 i , 2.23529 + 0.297382 i , 3.50312 + 1.25267 × 10 6 i , 2.23529 0.297381 i , 2.71908 4.18506 × 10 6 i , 4.79253 2.27167 × 10 7 i .

4. Critical Points and Free Critical Points

The critical points of map Ω ( z ; k ) are defined as the roots of Ω ( z ; k ) = 0 . From this known fact, each basin of attraction contains at least one free critical point. Operator R f ( z ) has as critical point 0, along with the roots of this sixth degree polynomial χ ( z ) where 0 and are related to a and b. Critical points that are different from 0 and are defined as free critical points. We are interested due to the orbital behavior of the free critical points, and we will deal with the free critical points which depend on parameter k.
Regarding the free critical points, we also divide the study into two parts such as the fixed points. One is to find the corresponding critical points for some special parameter valve k; the other is to find the critical points corresponding to the root of χ ( z ) .
In view of Theorem 4, the free critical points for special k-values can easily be found and shown in Table 2.
Lemma 5.
If η C ¯ is the root of χ ( z ) defined in (24), then 1 η is also a root of χ ( z ) for any k C and any z C ¯ , that is, χ 1 z = χ ( z ) z 6 hold.
Corollary 2.
If η is any critical point, then so is 1 η .
Proof. 
According to Theorem 2 (b), let X = Y = C ¯ , O = F = Ω and Γ ( z ) = 1 z under the fact that Ω is conjugated to itself.
To seek k-dependent free critical points of Ω ( z ; k ) , we need to solve χ ( z ) = 0 as defined in (24) for k 5 , 1 , 3 , 2 , 27 7 . Based on Lemma 5, χ ( z ) can be written as second-degree polynomials. As a result, χ ( z ) = ( 8 + 4 k ) j = 1 3 ( 1 + e j z + z 2 ) . We define a function ψ ( r ) = r r 2 4 2 for the convenience of the following. Then, six roots η of χ ( η ) = 0 are the k-dependent free critical points η j of map Ω ( z ; k ) given as follows:
η j = ψ ( e j ) , η j + 3 = 1 η j , ( 1 j 3 )
where:
e 1 = ( 2 + 7 k + 3 k 2 ) δ 1 δ 0 + δ 1 2 12 ( 2 + k ) δ 1 ,
e 2 = ( 4 + 14 k + 6 k 2 ) δ 1 + ( 1 + i 3 ) δ 0 ( 1 i 3 ) δ 1 2 24 ( 2 + k ) δ 1
e 3 = ( 4 + 14 k + 6 k 2 ) δ 1 + ( 1 i 3 ) δ 0 ( 1 + i 3 ) δ 1 2 24 ( 2 + k ) δ 1 ,
δ 0 = 1252 1324 k 493 k 2 90 k 3 9 k 4 ,
δ 1 = 37720 65868 k 30990 k 2 + 739 k 3 + 2943 k 4 + 405 k 5 + 27 k 6 + 24 3 γ 0 3 ,
γ 0 = 312336 727456 k 1288216 k 2 2095336 k 3 2200225 k 4 1345816 k 5 474904 k 6 94582 k 7 10240 k 8 592 k 9 9 k 10 .

5. Parameter Spaces and Dynamical Planes

Lemma 6.
Ω 1 z ; k = 1 Ω ( z ; k ) and Ω q 1 z ; k = 1 Ω q ( z ; k ) hold for any k C , z C ¯ and q N are given.
Proof. 
The proof is simple. First, Ω ( z ; k ) Γ ( z ) = Γ ( z ) Ω ( z ; k ) , we chose a topological conjugacy Γ ( z ) = 1 z , that is to say, Ω ( z ; k ) 1 z = Ω 1 z ; k = 1 z Ω ( z ; k ) = 1 Ω ( z ; k ) . Then, Ω q ( z ; k ) = Γ ( z ) Ω q ( z ; k ) Γ 1 ( z ) for a given q N . Similarly, Γ ( z ) = 1 z such that Ω q ( z ; k ) Γ ( z ) = Ω q 1 z ; k = Γ ( z ) Ω q ( z ; k ) = 1 Ω q ( z ; k ) . □
Corollary 3.
If z C ¯ is a q-periodic point of Ω, then so is 1 z , let q N be given.
Proof. 
With the help of Lemma 6, we have Ω q 1 z ; k = 1 Ω q ( z ; k ) . As z is a q-periodic point of Ω , clearly, Ω q ( z ; k ) = z . Hence, Ω q 1 z ; k = 1 z , this shows 1 z is also a q-periodic point. □
The above corollary explains whether the orbit of free critical point η j , ( j = 1 , 2 , 3 ) approaches a q-periodic point ξ j of Ω , then the orbit of η j + 4 = 1 ξ j approaches a q-periodic point 1 ξ j for any integer q 1 and k 5 , 1 , 3 , 2 , 27 7 . This means that only one branch of η j needs to be considered for its orbit behavior. We naturally define two concepts called the parameter space P and dynamical plane D for the iterative map Ω ( z ; k ) as follows:
  • P = { k C ¯ : an orbit of a free critical point η tends towards a number v under the action of Ω ( z ; k ) }.
  • D = { z C ¯ : an orbit of z ( k ) for a given k P tends towards a number u under the action of Ω ( z ; k ) }.
We are going to seek the best members of the family by virtue of the parameter space connected with the free critical point η j (see [6]) and dynamic plane.
Now, we analyze the asymptotic behavior of the free critical points of our proposed method family (2) with the technique [13]. These free critical points that depend on k are the roots of polynomial χ ( z ) . For this, we draw the parameter space related to points η j . In the previous analysis, we already know that the free critical points are conjugated, so only three planes need to be drawn. We create a mesh of 500 × 500 points in the complex plane and each point corresponds a different complex parameter value k. We select z 0 = η j ( k ) as an initial estimate for iterative schemes (2) where k goes through every point in the mesh and set the maximum number of iterations to 50. If the method converges to z = 1 , the points are painted in blue; red denotes the convergence of the method to 0 (associated with a); yellow denotes those points that eventually converge to (associated with the b) and they are black in other cases, i.e., they diverge.
The parameter space related to the free critical points η j are obtained in Figure 4, Figure 5, Figure 6 about different intervals. k [ a , b ] × [ c , d ] where [ a , b ] and [ c , d ] are the range of the real and imaginary parts of k, respectively; (b) is a detail on (a). In Figure 4b, we observe a small disk (the blue is denoted by D): D corresponds to values of k for which z = 1 is attractive or superattractive. In addition, it is very clear that, except for the red and yellow areas, the other color domains are not the best for the selection of the parameter k-value in terms of stability. From Figure 4, Figure 5, Figure 6, we see broad regions for red and yellow, suggesting that some members of family (2) are numerically stable. We will analyze the dynamic plane of family (2) with parameter k in the red and yellow areas of Figure 4, Figure 5, Figure 6.
The dynamic plane of the new family (2) for a given value of k is presented. Each basin of attraction is painted in a different color: convergence to 0 and are in orange and blue, respectively; if it converges to the fixed point z = 1 then it is in green; black indicates that the point does not converge to any root. We plotted the orbit of a point in red. Similarly to the parametric space, the maximum number of iterations is 50, and these dynamic planes are generated by a mesh of 500 × 500 points.
First of all, we provide dynamical planes for k = 1 , k = 2 , k = 3 , k = 5 and k = 27 / 7 in Figure 7, respectively. It can be seen that only the black color appears in Figure 7e. In addition to Figure 7e, the attraction basins in other planes are only related to a or b, which means that k-values have good convergence properties. In other words, the corresponding members of the Ostrowski-type iterative family (2) are numerically stable.
Figure 8 presents the dynamic planes converging to the strange fixed point for k = 4 , k = 3.75 and k = 0.870604 + 2.7565 i . Furthermore, three different basins of attraction appear in each figure.
In Figure 9, different kinds of unstable behavior can be found. Figure 9 shows that z = 1 is a parabolic fixed point which is consistent with Theorem 5(c) and then it exists in the Julia set but it has its own basin of attraction (black in the figure).
Finally, in Figure 10a, the dynamical plane of the iterative scheme corresponds to k = 251 / 63 (the center of circle S) is shown. Figure 10b–d are the dynamic planes with respect to the neighborhood of 251 / 63 but still within the circle S. We find that with 0.01198 1.262 i , 0.01896 1.283 i , 0.01198 1.269 i and 0.06088 1.283 i as the initial points, respectively, their orbits eventually converge to z = 1 , which corresponds to Theorem 5 (b) and Remark 2.
Through the above analysis, we can see that these methods corresponding to k = 1 , k = 2 , k = 3 and k = 5 outperform the other elements of the Ostrowski-type iterative family (2) in most numerical applications. Furthermore, t = 1 , k = 3 is the most stable member due to Cayley’s test [17].

6. Numerical Experiments

In this section, different test functions and previous methods are used to verify the effectiveness of the proposed method OM. The iterative methods used are as follows.
Gupta et al. presented the method (GM, see [18]):
y n = x n f ( x n ) f ( x n ) , w n = y n f ( y n ) f ( x n ) f ( x n ) f ( x n ) 2 f ( y n ) , x n + 1 = w n f ( w n ) ( w n y n ) f ( w n ) f ( y n ) .
Maroju et al. showed the method (MM, see [11]):
y n = x n f ( x n ) f ( x n ) , z n = x n 1 + f ( y n ) f ( x n ) f ( x n ) + f ( y n ) f ( x n ) f ( y n ) · f ( x n ) f ( x n ) , x n + 1 = z n f ( z n ) f ( x n ) + g ( x n ) ( z n x n ) .
where:
g ( x n ) = 2 f ( y n ) f ( x n ) 2 f ( x n ) 2 .
Table 3 shows the test functions used in the subsequent comparison. As seen in Table 4, we clearly know that the error of k = 3 is the smallest under the same number of iterations, which is the same as the result in the dynamic plane. As Table 5 suggests, our proposed method shows favorable performance compared to Maroju and Gupta methods.

7. Conclusions

We analyze the stability of the Ostrowski-type iterative method with six orders. The dynamic analysis of any quadratic polynomial was performed to select the family members with better stability characteristics. The stability of the strange fixed points is studied. There are many possible values for which members of this family have been proven to have good stability from the parameter space. The dynamic plane also shows that some members of this family are numerically stable. The results in Figure 7 and Table 4 are consistent, that is, t = 1 , k = 3 has the best numerical behavior. Some numerical experiments support that the new method for t = 1 , k = 3 has better performance than existing methods.

Author Contributions

Methodology, X.W.; writing—original draft preparation, X.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the National Natural Science Foundation of China (No. 61976027).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Ortega, J.M.; Rheinbolt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  2. Wang, X. A family of Newton-type iterative methods using some special self-accelerating parameters. Int. J. Comput. Math. 2017, 95, 2112–2127. [Google Scholar] [CrossRef]
  3. Wang, X. An Ostrowski-type method with memory using a novel self-accelerating parameter. J. Comput. Appl. Math. 2017, 330, 710–720. [Google Scholar] [CrossRef]
  4. Geaum, Y.H.; Kim, Y.I. Long-term orbit dynamics viewed through the yellow main component in the parameter space of a family of optimal fourth-order multiple-root finders. Discret. Contin. Dyn. Syst. Ser. B 2020, 25, 3087. [Google Scholar]
  5. Ostrowski, A.M. Solution of Equations in Euclidean and Banach Space; Academic Press: New York, NY, USA, 1973. [Google Scholar]
  6. Cordero, A.; Guasp, L.; Torregrosa, J.R. Choosing the most stable members of Kou’s family of iterative methods. J. Comput. Appl. Math. 2018, 330, 759–769. [Google Scholar] [CrossRef]
  7. Chun, C.; Ham, Y.M. Some sixth-order variants of Ostrowski root-finding methods. Appl. Math. Comput. 2007, 193, 389–394. [Google Scholar] [CrossRef]
  8. Blanchard, P. Complex analytic dynamics on the Riemann sphere. Bull. Amer. Math. Soc. 1984, 11, 85–141. [Google Scholar] [CrossRef] [Green Version]
  9. Carleson, L.; Gamelin, T.W. Complex Dynamics; Springer: New York, NY, USA, 1993. [Google Scholar]
  10. Thompson, J.M.T.; Stewart, H.B. Nonlinear Dynamics and Chaos; John Wieley and Sons Ltd.: New York, NY, USA, 1986. [Google Scholar]
  11. Maroju, P.; Magrenan, A.A.; Mosta, S.S.; Sarria, I. Second derivative free sixth order continuation method for solving nonlinear equations with applications. J. Math. Chem. 2018, 56, 2099–2116. [Google Scholar] [CrossRef]
  12. Magreñán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
  13. Chicharro, F.I.; Cordero, A.; Torregrosa, J.R. Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. 2013, 2013, 780153. [Google Scholar] [CrossRef] [PubMed]
  14. Ahlfors, L.V. Complex Analysis; McGraw-Hill Book, Inc.: New York, NY, USA, 1979. [Google Scholar]
  15. Beardon, A.F. Iteration of Rational Function; Springer: New York, NY, USA, 1991. [Google Scholar]
  16. Wolfram, S. The Mathematica Book, 5th ed.; Wolfram Media: Champaign, IL, USA, 2003. [Google Scholar]
  17. Babajee, D.K.R.; Cordero, A.; Torregrosa, J.R. Torregrosa, Study of multipoint iterative methods through the Cayley Quadratic Test. J. Comput. Appl. Math. 2014, 291, 358–369. [Google Scholar] [CrossRef]
  18. Parhi, S.K.; Gupta, D.K. A sixth order method for nonlinear equations. Appl. Math. Comput. 2012, 218, 10548–10556. [Google Scholar] [CrossRef]
Figure 1. Stability circle S for the strange fixed point z = 1 .
Figure 1. Stability circle S for the strange fixed point z = 1 .
Fractalfract 06 00174 g001
Figure 2. Stability surfaces of strange fixed point z = 1 .
Figure 2. Stability surfaces of strange fixed point z = 1 .
Fractalfract 06 00174 g002
Figure 3. Stability surfaces of the strange fixed points ξ i , i = 1 , 2 , 3 .
Figure 3. Stability surfaces of the strange fixed points ξ i , i = 1 , 2 , 3 .
Fractalfract 06 00174 g003
Figure 4. Parameter space associated with the free critical point η 1 .
Figure 4. Parameter space associated with the free critical point η 1 .
Fractalfract 06 00174 g004
Figure 5. Parameter space associated with the free critical point η 2 .
Figure 5. Parameter space associated with the free critical point η 2 .
Fractalfract 06 00174 g005
Figure 6. Parameter space associated with the free critical point η 3 .
Figure 6. Parameter space associated with the free critical point η 3 .
Fractalfract 06 00174 g006
Figure 7. Dynamical planes for special k-values.
Figure 7. Dynamical planes for special k-values.
Fractalfract 06 00174 g007
Figure 8. Dynamical planes converging to the strange fixed points.
Figure 8. Dynamical planes converging to the strange fixed points.
Fractalfract 06 00174 g008
Figure 9. Dynamical planes for | k + 251 / 63 | = 8 / 63 .
Figure 9. Dynamical planes for | k + 251 / 63 | = 8 / 63 .
Fractalfract 06 00174 g009
Figure 10. Dynamical planes of the neighborhood of 251 / 63 .
Figure 10. Dynamical planes of the neighborhood of 251 / 63 .
Fractalfract 06 00174 g010
Table 1. Stability of strange fixed points ξ for special k-values.
Table 1. Stability of strange fixed points ξ for special k-values.
k ξ No. of ξ
| Ω ( ξ ; k ) | : m w
−11−1 i 1 2 ( 3 ± 5 ) i 1 2 ( 3 ± 5 ) 6
6:g3.5:g7.81025:g7.81025:g
−50.3577852.79497−0.367445 ± 1.27423i−0.208934 ± 0.724541i6
11.787:g11.7871:g5.73:g5.72996:g
−27/71((triple)−0.332631 ± 1.13238i−0.238798 ± 0.812947i 7
1:f4.91055:g4.91066:g
−31−0.5 ± 0.866025i 3
4:g4:g
−2−0.732786 ± 0.68046i0.0732949 ± 0.673932i0.159491 ± 1.46648i 6
4.86704:g10.8788:g10.8786:g
ω|Ω(ξ;k)|: m denotes that ξ is attractive, parabolic and repulsive, if m = e(|Ω| < 1), m = f(|Ω| = 1), m = g(|Ω| > 1), respectively.
Table 2. Free critical points ξ for special k-values.
Table 2. Free critical points ξ for special k-values.
k η No. of η
−5±i, 0.557699, 1.79308, −0.425391 ± 0.90501i6
−1±i, 0.360048, 2.77741, −0.318729 ± 0.947846i6
−3 0
−2i (double), −i (double)4
−27/7±i, 0.326533 ± 0.945186i, 0.67332 ± 0.739352i, 0.974642 ± 0.223771i8
Table 3. The function f i ( x ) , initial guesses x 0 and zeros α .
Table 3. The function f i ( x ) , initial guesses x 0 and zeros α .
i f i ( x ) x 0 α
1 sin 2 ( x ) x 2 + 1 1.31.4044916482153412
2 x 3 10 22.1544346900318837
3 cos Π 2 x + x 2 Π 22.0347248962791266
4 exp x sin x + log ( x 2 + 1 ) 10
5 x 4 log x 5 1.61.5259939537536892
Table 4. Comparison for special k-values.
Table 4. Comparison for special k-values.
k f i ( x ) | x 1 x 0 | | x 2 x 1 | | x 3 x 2 | | x 4 x 3 |
−5 f 1 ( x ) 0.104491.7367 × 10 6 2.8778 × 10 35 5.9578 × 10 208
f 2 ( x ) 0.154439.537 × 10 7 4.6831 × 10 38 6.5657 × 10 226
−1 f 1 ( x ) 0.104492.0417 × 10 6 7.074 × 10 35 1.2239 × 10 205
f 2 ( x ) 0.154441.0177 × 10 6 5.8526 × 10 38 2.1164 × 10 225
−3 f 1 ( x ) 0.104491.4665 × 10 7 3.5972 × 10 43 7.8344 × 10 257
f 2 ( x ) 0.154431.0231 × 10 7 5.4912 × 10 45 1.3126 × 10 268
−2 f 1 ( x ) 0.104498.5343 × 10 7 1.8169 × 10 37 1.6918 × 10 221
f 2 ( x ) 0.154444.1677 × 10 7 1.2544 × 10 40 9.3276 × 10 242
−27/7 f 1 ( x ) 0.104498.8583 × 10 7 2.272 × 10 37 6.467 × 10 221
f 2 ( x ) 0.154434.9404 × 10 7 4.2762 × 10 40 1.7983 × 10 238
Table 5. Comparison of iterative methods for the test functions.
Table 5. Comparison of iterative methods for the test functions.
f i ( x ) nOMMMOGM
| x n x n 1 | | f ( x n ) | | x n x n 1 | | f ( x n ) | | x n x n 1 | | f ( x n ) |
f 1 ( x ) 11.0449 × 10 1 3.6406 × 10 7 1.0449 × 10 1 5.16692 × 10 7 1.0449 × 10 1 1.17938 × 10 6
21.4665 × 10 7 8.9299 × 10 43 2.0814 × 10 7 2.43255 × 10 41 4.7508 × 10 7 7.22718 × 10 39
33.5972 × 10 43 1.94486 × 10 256 9.7989 × 10 42 2.64877 × 10 247 2.9113 × 10 39 3.82701 × 10 232
47.8344 × 10 257 2.07559 × 10 1538 1.067 × 10 247 4.41503 × 10 1483 1.5416 × 10 232 8.43734 × 10 1392
f 2 ( x ) 11.5443 × 10 1 1.42466 × 10 6 1.5443 × 10 1 3.95386 × 10 6 1.5443 × 10 1 3.53539 × 10 6
21.0231 × 10 7 7.6464 × 10 44 2.8394 × 10 7 1.39756 × 10 40 2.5389 × 10 7 5.35701 × 10 41
35.4912 × 10 45 1.82778 × 10 267 1.0037 × 10 41 2.72565 × 10 247 3.8471 × 10 42 6.48392 × 10 250
41.3126 × 10 268 3.4098 × 10 1609 1.9574 × 10 248 1.49989 × 10 1487 4.6564 × 10 251 2.03858 × 10 1503
f 3 ( x ) 13.4725 × 10 2 9.21225 × 10 12 3.4725 × 10 2 1.68613 × 10 11 3.4725 × 10 2 3.70924 × 10 10
22.2171 × 10 12 6.67277 × 10 73 4.058 × 10 12 7.38308 × 10 71 8.927 × 10 11 9.67886 × 10 62
31.6059 × 10 73 9.63714 × 10 440 1.7769 × 10 71 5.20373 × 10 427 2.3294 × 10 62 3.05532 × 10 371
42.3194 × 10 440 8.74583 × 10 2641 1.2524 × 10 427 6.3794 × 10 2564 7.3532 × 10 372 3.02312 × 10 2228
f 4 ( x ) 10.951755.29461 × 10 2 0.951375.33921 × 10 2 0.952645.18821 × 10 2
24.8254 × 10 2 1.67183 × 10 8 4.8627 × 10 2 4.89593 × 10 8 4.7363 × 10 2 2.02955 × 10 7
31.6718 × 10 8 5.33748 × 10 47 4.8959 × 10 8 1.0712 × 10 43 2.0296 × 10 7 2.05003 × 10 39
45.3375 × 10 47 5.65194 × 10 278 1.0712 × 10 43 1.17509 × 10 257 2.05 × 10 39 2.17731 × 10 231
f 5 ( x ) 10.74006 × 10 1 4.74263 × 10 7 0.74006 × 10 1 2.48963 × 10 6 0.0740061.29563 × 10 6
23.4978 × 10 8 7.50338 × 10 45 1.8362 × 10 7 6.84712 × 10 40 9.5557 × 10 8 7.70349 × 10 42
35.534 × 10 46 1.17674 × 10 271 5.05 × 10 41 2.96314 × 10 241 5.6816 × 10 43 3.40343 × 10 253
48.6788 × 10 273 1.7507 × 10 1632 2.1854 × 10 242 1.94632 × 10 1449 2.5101 × 10 254 2.53102 × 10 1521
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, X.; Chen, X. The Dynamical Analysis of a Biparametric Family of Six-Order Ostrowski-Type Method under the Möbius Conjugacy Map. Fractal Fract. 2022, 6, 174. https://doi.org/10.3390/fractalfract6030174

AMA Style

Wang X, Chen X. The Dynamical Analysis of a Biparametric Family of Six-Order Ostrowski-Type Method under the Möbius Conjugacy Map. Fractal and Fractional. 2022; 6(3):174. https://doi.org/10.3390/fractalfract6030174

Chicago/Turabian Style

Wang, Xiaofeng, and Xiaohe Chen. 2022. "The Dynamical Analysis of a Biparametric Family of Six-Order Ostrowski-Type Method under the Möbius Conjugacy Map" Fractal and Fractional 6, no. 3: 174. https://doi.org/10.3390/fractalfract6030174

APA Style

Wang, X., & Chen, X. (2022). The Dynamical Analysis of a Biparametric Family of Six-Order Ostrowski-Type Method under the Möbius Conjugacy Map. Fractal and Fractional, 6(3), 174. https://doi.org/10.3390/fractalfract6030174

Article Metrics

Back to TopTop