Research article Special Issues

Dynamical analysis of an iterative method with memory on a family of third-degree polynomials

  • Qualitative analysis of iterative methods with memory has been carried out a few years ago. Most of the papers published in this context analyze the behaviour of schemes on quadratic polynomials. In this paper, we accomplish a complete dynamical study of an iterative method with memory, the Kurchatov scheme, applied on a family of cubic polynomials. To reach this goal we transform the iterative scheme with memory into a discrete dynamical system defined on R2. We obtain a complete description of the dynamical planes for every value of parameter of the family considered. We also analyze the bifurcations that occur related with the number of fixed points. Finally, the dynamical results are summarized in a parameter line. As a conclusion, we obtain that this scheme is completely stable for cubic polynomials since the only attractors that appear for any value of the parameter, are the roots of the polynomial.

    Citation: Beatriz Campos, Alicia Cordero, Juan R. Torregrosa, Pura Vindel. Dynamical analysis of an iterative method with memory on a family of third-degree polynomials[J]. AIMS Mathematics, 2022, 7(4): 6445-6466. doi: 10.3934/math.2022359

    Related Papers:

    [1] Alicia Cordero, Arleen Ledesma, Javier G. Maimó, Juan R. Torregrosa . Design and dynamical behavior of a fourth order family of iterative methods for solving nonlinear equations. AIMS Mathematics, 2024, 9(4): 8564-8593. doi: 10.3934/math.2024415
    [2] Mudassir Shams, Nasreen Kausar, Serkan Araci, Liang Kong . On the stability analysis of numerical schemes for solving non-linear polynomials arises in engineering problems. AIMS Mathematics, 2024, 9(4): 8885-8903. doi: 10.3934/math.2024433
    [3] Xinna Mao, Hongwei Feng, Maryam A. Al-Towailb, Hassan Saberi-Nik . Dynamical analysis and boundedness for a generalized chaotic Lorenz model. AIMS Mathematics, 2023, 8(8): 19719-19742. doi: 10.3934/math.20231005
    [4] Mudassir Shams, Nasreen Kausar, Serkan Araci, Liang Kong, Bruno Carpentieri . Highly efficient family of two-step simultaneous method for all polynomial roots. AIMS Mathematics, 2024, 9(1): 1755-1771. doi: 10.3934/math.2024085
    [5] Jia Yu, Xiaofeng Wang . A single parameter fourth-order Jarrat-type iterative method for solving nonlinear systems. AIMS Mathematics, 2025, 10(4): 7847-7863. doi: 10.3934/math.2025360
    [6] Rabha W. Ibrahim, Dumitru Baleanu . Global stability of local fractional Hénon-Lozi map using fixed point theory. AIMS Mathematics, 2022, 7(6): 11399-11416. doi: 10.3934/math.2022636
    [7] Xiaofeng Wang, Mingyu Sun . A new family of fourth-order Ostrowski-type iterative methods for solving nonlinear systems. AIMS Mathematics, 2024, 9(4): 10255-10266. doi: 10.3934/math.2024501
    [8] Muhammad Bilal Riaz, Syeda Sarwat Kazmi, Adil Jhangeer, Jan Martinovic . Unveiling solitons and dynamic patterns for a (3+1)-dimensional model describing nonlinear wave motion. AIMS Mathematics, 2024, 9(8): 20390-20412. doi: 10.3934/math.2024992
    [9] Xiongxiong Du, Xiaoling Han, Ceyu Lei . Dynamics of a nonlinear discrete predator-prey system with fear effect. AIMS Mathematics, 2023, 8(10): 23953-23973. doi: 10.3934/math.20231221
    [10] Yao Shi, Zhenyu Wang . Bifurcation analysis and chaos control of a discrete fractional-order Leslie-Gower model with fear factor. AIMS Mathematics, 2024, 9(11): 30298-30319. doi: 10.3934/math.20241462
  • Qualitative analysis of iterative methods with memory has been carried out a few years ago. Most of the papers published in this context analyze the behaviour of schemes on quadratic polynomials. In this paper, we accomplish a complete dynamical study of an iterative method with memory, the Kurchatov scheme, applied on a family of cubic polynomials. To reach this goal we transform the iterative scheme with memory into a discrete dynamical system defined on R2. We obtain a complete description of the dynamical planes for every value of parameter of the family considered. We also analyze the bifurcations that occur related with the number of fixed points. Finally, the dynamical results are summarized in a parameter line. As a conclusion, we obtain that this scheme is completely stable for cubic polynomials since the only attractors that appear for any value of the parameter, are the roots of the polynomial.



    Non-linearity is inherent in a wide variety of physical processes observed in real life, as well as in the systems underlying engineering problems. If they are linearized for the sake of greater simplicity, then much of the complexity disappears, but it is also removed from the reality that defines it and, therefore, the solution to the problem is a worse approximation of the real solution. Iterative schemes are very useful in this context in order to estimate the solution of nonlinear equations, f(x)=0, that model these kind of problems.

    Although the most known fixed-point iterative method is Newton's scheme, it is only the reference for a subclass of numerical procedures: iterative schemes without memory, due to the fact that it only uses the actual iterate in order to calculate the next one of the sequence that will converge to the solution. There exists another class of iterative schemes that use more than one known iterate to calculate the following one: they are known as iterative procedures with memory, and the most known scheme with memory is the classical secant one, whose iterative expression is

    xn+1=xnf(xn)(xnxn1)f(xn)f(xn1), n=1,2,

    being x0 and x1 initial guesses. The simplicity of its expression makes it very useful but its convergence is only super-linear, in contrast with the quadratic convergence of Newton's scheme. To overload this inconvenient, Kurchatov designed in [1], by using interpolation techniques, the root-finding algorithm known as Kurchatov's scheme,

    Δn=xnxn1,xn+1=xn2f(xn)Δnf(xn+Δn)f(xnΔn),

    that is also an iterative method with memory that holds the second order of convergence of Newton's scheme.

    In the last years, different schemes with memory have been designed (a good overview can be found in [2]) with increasing order of convergence (and, therefore, higher computational complexity). In terms of stability, some researchers compared the wideness of their basins of attraction (the set of starting points converging to the same attractor) by using techniques of discrete dynamics. In [3], the authors observed that iterative schemes with memory of seventh-order of convergence showed better stability properties than many optimal eight-order procedures without memory. This graphical comparison was used afterwards by different authors; see, for example, the work by Cordero et al. [4], that of Wang et al. [5] in 2016 or the research by Bakhtiari et al. in [6] and Howk et al. [7] in the following years.

    Meanwhile, the authors developed in [8] a technique using multidimensional real discrete dynamics, able to analyze the stability of iterative schemes with memory, not only in graphical terms, but essentially analytical. It has also been used to make a brief analytical study of other schemes as in the paper by the authors [9], or that defined by Choubey et al. in [10], or those by Chicharro et al. in [11,12,13].

    A key fact to deeply understand the performance of the iterative schemes are the poles of the rational functions composing its multidimensional operator.

    If we denote by xn1=x and xn=y, as it was defined in [8,9], the algorithm of Kurchatov can be studied from a dynamical point of view as a two dimensional map

    K:(xy)(yy2f(y)(yx)f(2yx)f(x)), (1.1)

    with a vanishing denominator.

    In [14], a parametric family of iterative procedures, including Kurchatov's scheme, was designed. By using the tools of multidimensional real discrete dynamics, the performance on quadratic polynomials is studied pointing out many particular schemes with very good properties in terms of stability and wideness of the set of converging starting points; several other methods found with unstable or even chaotic performance were also described as members of this class of iterative procedures.

    As far as we know, there are not many papers dealing with the dynamics of iterative methods with memory applied on polynomials of degree greater than two. A complete study of the secant method for polynomials of arbitrary degree can be found in [20,21]. In [22], Bairstow's method is studied for a family of cubic polynomials equivalent to the one studied in this paper.

    Our goal in this manuscript is to analyze the behaviour of Kurchatov's method on cubic polynomials and state its stability in this context. To get this aim, we introduce in the following section some concepts and properties of multidimensional real discrete dynamics that are used in the subsequent sections. Our final conclusion is that this scheme is stable for every value of the parameter of the family these polynomials.

    The rest of this manuscript is organized as follows: Section 2 is devoted to introduce all these necessary concepts and tools for the analysis of the stability of the fixed points of the multidimensional rational operator associated to Kurchatov's scheme on a generic cubic polynomial p(x)=x(x1)(xa) in Section 3. We also analyze the focal points and prefocal lines, that help us to delimit the boundaries of the basins of attraction. In Section 3.2, we study the inverses of the mentioned rational operator and their properties. The basins of attraction of the fixed points of the rational operator are presented, and the dynamical planes and bifurcations are also studied. The manuscript finishes with the conclusions and the references used.

    In this section we recall some basic concepts related with multidimensional dynamics. Let us denote as T a vectorial rational operator. We define the orbit of x(0) as a set of the successive images by T, that is, {x(0),T(x(0)),,Tm(x(0)),}. Indeed, the dynamical behavior of a point xRn can be characterized by analyzing its asymptotic performance, thus x such that T(x)=x is called a fixed point of T. Some results about stability of fixed points are summarized in the next result ([15]).

    Theorem 2.1. Let T:RnRn be C2. Assume x is a fixed point. Let λ1,λ2,,λn be the eigenvalues of the Jacobian JT(x). Then,

    a) If |λj|<1, j{1,2,,n}, then x is attracting.

    b) If, at least, one eigenvalue λj0 holds |λj0|>1, then x is unstable, that is, repelling or saddle.

    c) If |λj|>1, j{1,2,,n}, then x is repelling.

    Indeed, if x is an attracting fixed point of the rational function T, we define its basin of attraction A(x) as the set of preimages of any order such that

    A(x)={x(0)Rn:Tm(x(0))x,m}

    and it is denoted by A(x) if the set of preimages considered is in the same connected component as x.

    Now, we recall some definitions and properties related to maps with vanishing denominators. We refer to [16,17,18,19,24,25] for a more complete study.

    Definition 2.2. A map with vanishing denominator is a map T of Rn, with n2, that is not defined in the whole space Rn because at least one of its components contains a denominator that can vanish. The set of points δT where the denominators vanish is called the set of non definition of the map.

    We consider an arbitrary map of the form:

    T:(xy)(F(x,y)G(x,y)=N(x,y)D(x,y)), (2.1)

    where the continuously differentiable functions F(x,y),N(x,y) and D(x,y) have not common factors and are defined on the whole plane R2. The set of non definition

    δT={(x,y)R2/D(x,y)=0}

    is usually made of the union of smooth curves in the plane.

    Many global properties of two dimensional maps can be explained from the analysis of some kinds of singularities, such as the sets where the denominator of the map vanishes, some inverses vanish, their preimages and the points where the map takes the form 0/0.

    As commented before, some dynamical properties of two-dimensional maps can be explained from the analysis of their singularities, such as the set of points where the denominator of the map (or some of its inverses) vanishes, see [19,23]. The following definition helps us to understand it.

    Definition 2.3. Consider a two dimensional map T of the form (2.1). A point Q that belongs to the set of non-definition δT, is a focal point if at least one component of the map takes the form 0/0 in Q and there exist smooth simple arcs γ(τ) with γ(0)=Q, such that limτ0T(γ(τ)) is finite. The set of all such finite values, obtained by taking different arcs γ(τ) through Q, is called the prefocal set δQ.

    A focal point Q is simple if:

    (NxDyNyDx)|Q0.

    Let us consider a smooth simple arc γ transverse to δT (not tangential) and look how it is transformed by applying the map T, that is, what is the shape of its image. Consider a point (x0,y0)δT and assume that in a neighborhood of (x0,y0) the arc γ is represented by the parametric equations:

    γ(τ)={x(τ)=x0+ξ1τ+ξ2τ2+y(τ)=y0+η1τ+η2τ2+

    with τ0. As (x0,y0)δT, there exists a vanishing denominator, but if the numerator is different from zero, then:

    limτ0T(γ(τ))=(y0,).

    This means that the image T(γ(τ)) is made up of two disjoint arcs asymptotic to the line x=y0. Different arcs through the same point are mapped into different arcs asymptotic to the same line, see Figure 1.

    Figure 1.  Mapping Ta on transverse arcs with unbounded image.

    If the point (x0,y0)δT satisfies that both numerator and denominator vanish, then the limit can be finite and the image of an arc can be bounded, see Figure 2.

    Figure 2.  Mapping Ta on transverse arcs with bounded image.

    In this paper, we study the dynamics of the map K associated to the Kurchatov's method given in (1.1), when f(x) is a generic cubic polynomial, p(x)=x(x1)(xa) and a is real. By applying (1.1) to this polynomial, we obtain a uniparametric family of maps:

    Ka:(xy)(yy(x2+3y2y(1+a+2x))x2+4y22y(1+a+x)+a). (3.1)

    The set of non definition of Ka is given by the ellipse

    δKa={(x,y)R2/x2+4y22y(1+a+x)+a=0}.

    So, the iteration of Ka is well defined, provided that the initial condition belongs to the set E given by:

    E=R2Λ,

    where

    Λ=n0Kna(δKa),

    that is, Λ is the set of preimages (of any order) of the ellipse δKa cancelling the denominator of a component of the rational operator.

    The iterations of the map Ka:EE can be considered as a discrete dynamical system. As the singular set δKa corresponds to a curve in the plane, the set of points excluded from the phase space of the iterations of Ka has zero Lebesgue mesure in R2.

    Proposition 3.1. The fixed points of map Ka are (0,0), (1,1) and (a,a) and all of them are attractive.

    Proof. The fixed points satisfy Ka(x0,y0)=(x0,y0). In this case, the fixed points coincide with the roots of the cubic polynomial:

    Ka(xy)=(xy)(yy(x2+3y2y(1+a+2x))x2+4y22y(1+a+x)+a)=(xy).

    From the first equation we obtain x=y. The second equation gives:

    y(x2+3y2y(1+a+2x))=y(x2+4y22y(1+a+x)+a).

    One solution is y=0. For y0, x2+3y2y(1+a+2x)=x2+4y22y(1+a+x)+a. By substituting y=x and simplifying:

    y2y(1+a)+a=0y=1,y=a.

    Then, the fixed points coincide with the roots of the cubic polynomial.

    In order to study their stability we build the Jacobian matrix:

    JKa(x,y)=(01GxGy)

    where:

    Gx=2y(y1)(ya)(yx)(x2+4y22y(1+a+x)+a)2,Gy=x2(a+x2)2(1+a+2x)(a+x2)y+(2(1+a)2+6x(1+a)+9(a+x2))y2(x2+4y22y(1+a+x)+a)2++12(1+a+x)y3+12y4(x2+4y22y(1+a+x)+a)2.

    Then, the fixed points are attractive since the value of the Jacobian evaluated at each of them is:

    JKa(x,y)=(0100).

    The following property gives us the lines on the plane that are mapped onto the fixed points.

    Property 3.2. Let R=(x,y) be a fixed point of Ka. Then, Ka(x,y)=(x,y) if and only if y=y.

    Proof. The fixed points of Ka are (0,0), (1,1) and (a,a).

    For R=(0,0)

    Ka(x,y)=(0,0)(yy(x2+3y2y(1+a+2x))x2+4y22y(1+a+x)+a)=(00)y=0.

    Similarly, for R=(1,1)

    Ka(x,y)=(1,1)y=1

    and for R=(a,a)

    Ka(x,y)=(a,a)y=a.

    That is, the line y=y is mapped onto the fixed point R.

    Focal points are defined as those points where at least one of the components of the two dimensional map is 0/0 with finite limit. In our case, we obtain two simple focal points for almost all values of a.

    Now, let us consider the two dimensional map Ka defined by (3.1).

    Proposition 3.3. The map Ka has two simple focal points Q1 and Q2 with associated prefocal sets δQ1 and δQ2 respectively, given by:

    Q1=(a,0), Q2=(a,0),

    δQ1=δQ2={(x,y)R2/x=0} for a<0.

    Q1=(aa(1a),a), Q2=(a+a(1a),a),

    δQ1=δQ2={(x,y)R2/x=a} for 0<a<1.

    Q1=(1a1,1), Q2=(1+a1,1),

    δQ1=δQ2={(x,y)R2/x=1} for a>1.

    For a=0 and a=1, the focal points are double and coincide with the double root of the polynomial.

    Proof. Focal points of Ka satisfy the equations:

    y(x2+3y2y(1+a+2x))=0,x2+4y22y(1+a+x)+a=0.

    The first equation implies y=0 or x2+3y2y(1+a+2x)=0. Taking y=0 and substituting in the second equation, we obtain x2+a=0; so, the points (a,0) and (a,0) are obtained, that exist for a0.

    From x2+3y2y(1+a+2x)=0 we can deduce x22yx=3y2+y(1+a), and substituting in the second equation we obtain:

    3y2+y(1+a)+4y22y(1+a)+a=0y2y(1+a)+a=0y=1 or y=a.

    If y=1, then x22x=2+ax=1±a1, that exists if a>1. For y=a, then x22ax=2a2+ax=a±a(1a), that exists if 0a1. It is easy to check that when a=0 there is a unique focal point at (0,0), that is also a double root of the polynomial; for a=1, the double focal point is (1,1).

    As said above, for a map T as given by (2.1), a focal point Q is simple if:

    (NxDyNyDx)|Q0.

    In our case:

    N(x,y)=y(x2+3y2y(1+a+2x)),D(x,y)=x2+4y22y(1+a+x)+a.

    It can be checked that:

    (NxDyNyDx)|Q1,2=±2aa,  a<0,(NxDyNyDx)|Q1,2=2a(1a)a(1a),  0<a<1,(NxDyNyDx)|Q1,2=2(a1)a1,  a>1.

    Then, the focal points are simple for any value of the parameter different from a=0 and a=1. On the other hand, for a=0 and for a=1 focal points coincide with the double root of the polynomial and they are not simple.

    Let us obtain the prefocal sets. For a given value a, a0 and a1, consider a focal point Q=(x0,y0)δKa, and take smooth simple arcs γ transverse to δKa at this point, represented by the parametric equations:

    γ(τ)={x(τ)=x0+ξ1τ+ξ2τ2+...y(τ)=y0+η1τ+η2τ2+...

    with τ0. Then, if we apply the map Ka on this point the numerator and the denominator vanish and

    limτ0Ka(γ(τ))=(y0,limτ0N(γ(τ))D(γ(τ)))=(xγ,yγ).

    Then, xγ=y0 and

    yγ=¯Nx+¯Nym¯Dx+¯Dym,

    where m=ξ1η1 and ¯Nx means the derivative of N respect to x evaluated in the focal point.

    For a<0, the focal points are Q1=(a,0),Q2=(a,0)δKa. Then, xγ=0 and

    yγ=am2(±a+(1+a±a)m).

    Let us notice that the values of yγ go over the entire real line except when m=±a1+a±a. This value of the slope corresponds to curves that are tangent to δKa at the focal points.

    The same can be proven for the focal points obtained for the other values of a. So, the prefocal sets in our case are given by x=F(Q) (see [16]):

    x=0,  a<0,x=a,  0<a<1,x=1,  a>1,

    where F:R2R2 is defined in (3.1).

    In order to understand the global dynamical properties of a map, it is important to see how many inverses map has Ka and in which regions of the phase plane the inverses are defined. Let (x,y) be a given point of the plane. Then, by solving the system of equations obtained from (3.1), we can get either two distinct real solutions, called rank-1 preimages of point (x,y), or no real solutions. We call Z2 and Z0 the regions of the plane whose points have, respectively, two distinct rank-1 preimages and no preimages at all.

    K1a:(xy)(x=x±Δy=x), (3.2)

    where

    Δ=2x3+ay2(1+a)xy+x2(1+a+3y)xy.

    These regions are given by:

    Z0={(x,y)R2 / 2x3+ay2(1+a)xy+x2(1+a+3y)>0,xy<0}{(x,y)R2 / 2x3+ay2(1+a)xy+x2(1+a+3y)<0,xy>0},Z2={(x,y)R2 / 2x3+ay2(1+a)xy+x2(1+a+3y)>0,xy>0}{(x,y)R2 / 2x3+ay2(1+a)xy+x2(1+a+3y)<0,xy<0},

    and they are separated by the line y=x and the graphic of the rational function y=x2(2x(a+1))3x22(a+1)x+a. These curves form the boundary of the regions Z0 and Z2, but they are not a locus of critical points where the two inverses are defined and merge, since the denominator vanishes for y=x.

    Let

    LC={(x,y)R2/y=f(x)=x2(2x(a+1))3x22(a+1)x+a} (3.3)

    be the critical set, that is, the set of points where the preimages merge.

    Merging preimages are located in another set of points LC1 that is included in the set of points in which the determinant of the Jacobian matrix vanishes:

    LC1J0={(x,y)R2/detJ(Ka)=0}.

    Moreover, it is easy to check the following results.

    Property 3.4. The intersection of the two curves that form the boundary of Z0 and Z2 are the fixed points.

    Proof. The solutions of the system

    y=x2(2x(a+1))3x22(a+1)x+a,y=x,

    are (0,0), (1,1) and (a,a).

    Property 3.5. The inverse of the curve LC is given by

    LC1={(x,y)R2/y=x}.

    Moreover, LC1J0.

    Proof. It is easy to check that

    Ka(x,x)=(x,x2(2x(a+1))3x22(a+1)x+a).

    As J0={(x,y)R2/detJ(Ka)=0} and detJ(Ka)=2y(y1)(ya)(yx)(x2+4y22y(1+a+x)+a)2, then LC1J0.

    Property 3.6. The fixed points are critical points of LC.

    Proof. The derivative of f(x)=x2(2x(a+1))3x22(a+1)x+a is f(x)=2x(x1)(xa)(3x(a+1))(3x22(a+1)x+a)2.

    So, f(x) vanishes for x=0, x=1 and x=a, that coincide with the fixed points.

    Property 3.7. The points of intersection of the set δKa and the line y=x belong to the asymptotes of LC. Moreover, they are the maximum and the minimum of the ellipse δKa.

    Proof. It is easy to check that the points satisfying the equations:

    4y2+x22y(1+a+x)+a=0,x=y,

    are:

    P1=(1+aa2a+13,1+aa2a+13),P2=(1+a+a2a+13,1+a+a2a+13),

    so, they belong to the asymptotes of LC. On the other hand, the slope of the tangent lines to the ellipse is y|P=yx4y(1+a+x)|P; this slope vanishes if the point satisfies x=y, being y0.

    In this section, we describe the basins of attraction of the fixed points and their bifurcations as the parameter a varies. As we have said before, this map has three fixed points for every value of the parameter except for a=0 and a=1, where two of the fixed points collide. Moreover, for these values the two focal points also collide and coincide with the double fixed point.

    Another bifurcation occurs when the focal points are in Z2 and change to be in Z0. This kind of bifurcation is described in the next result.

    Lemma 3.8. Focal points Q1 and Q2 satisfy the following statements:

    Q1 has two preimages if and only if a(,322)(14(2+2),2(22)).

    Q1 has one preimage if and only if a=322 or a=14(2+2) or a=2(22).

    Q1 has no preimage for the other parameter values.

    Q2 has two preimages if and only if a(3+22,14(22))(2(2+2),).

    Q2 has one preimage if and only if a=3+22 or a=14(22) or a=2(2+2).

    Q2 has no preimage for the other parameter values.

    Proof. For a<0, the preimages of Q1=(a,0) satisfy the system:

    y=a,x2+3y2y(1+a+2x)=0,

    whose solution is

    x=a±a(a+1)+2a.

    The values of the parameter that satisfy a(a+1)+2a>0 and a<0 are those satisfying a<322. For a=322, then Q1 has one preimage.

    Following the same reasoning it is easy to check that the focal point Q2=(a,0) has two preimages if a(a+1)+2a>0 and a<0, that implies 3+22<a<0. For a=3+22, then Q2 has one preimage.

    For 0<a<1, the preimages of Q1=(aa(1a),a) satisfy:

    y=aa(1a,x2+3y2y(1+a+2x)x2+4y22y(1+a+x)+a=a,

    whose solution is

    x=aa(1a)±2a(a1)+(2a1)a(1a).

    The values of the parameter that satisfy 2a(a1)+(2a1)a(1a)>0 and 0<a<1 are those verifying 14(2+2)<a<1. For a=14(2+2), then Q1 has one preimage.

    With the same reasoning it is easy to check that the focal point Q2=(a+a(1a),a) has two preimages if 0<a<14(22). For a=14(22), Q2 has one preimage.

    Finally, for a>1, the preimages of Q1=(1a1,1) satisfy:

    y=1a1,x2+3y2y(1+a+2x)x2+4y22y(1+a+x)+a=1,

    whose solution is

    x=1a1±2(1a)+(2a)a1.

    The values of the parameter that satisfy 2(1a)+(2a)a1>0 and a>1 are those satisfying 1<a<2(22). For a=2(22), then Q1 has one preimage.

    Similarly, it is easy to check that the focal point Q2=(1+a1,1) has two preimages if a>2(2+2). For a=2(2+2), then Q2 has one preimage.

    Remark 3.9. Let us notice that the focal points have not any preimage if a(322,3+22)(14(22),14(2+2))(2(22),2(2+2)).

    Remark 3.10. There is not any parameter value for which both focal points have preimages simultaneously.

    These results can be observed in Figure 3, where focal points are colored in blue.

    Figure 3.  Location of the focal points for different values of a.

    In Figure 3 we can also observe that there is always a fixed point surrounded by the singular set δKa, which leads to the next result:

    Proposition 3.11. Let Ri=(xi,xi),i=1,2,3, be the three fixed points such that x1<x2<x3. Then, the immediate basin of attraction of R2 is bounded.

    Proof. For a<0, the three fixed points are R1=(a,a), R2=(0,0) and R3=(1,1). By substituting the point (0,0) in the equation of δKa we obtain a, as a<0 we have that R2=(0,0) is located in the interior of the closed curve of δKa. On the other hand, by substituting R1 and R3 we obtain a2+4a22a(1+a+a)+a=a2a=a(a1)>0 and 1+42(1+a+1)+a=1a>0, respectively, that means that R1=(a,a) and R3=(1,1) are located in the exterior of δKa.

    For 0<a<1, then R2=(a,a). By substituting it in equation δKa we obtain a2+4a22a(1+a+a)+a=a2a=a(a1)<0. For the point R1=(0,0) we obtain a>0, and for R3=(1,1) we obtain 1+42(1+a+1)+a=1a>0.

    Finally, for a>1, R2=(1,1) and substituting it in δKa we obtain 1+42(1+a+1)+a=1a<0. For the point R1=(0,0) we obtain a>0, and for R3=(a,a) the result is a2+4a22a(1+a+a)+a=a2a=a(a1)>0.

    So, we deduce that R2 is located in the interior of the ellipse δKa while R1 and R3 are located outside the curve δKa for any case. As this curve is in the boundary of different basins of attraction, the immediate basin of R2 must be in the region delimited by δKa which involves that A(R2) is bounded.

    Let us observe that line y=x divides the singular set δKa in two symmetric parts, δKa=δK,lδK,r whose equations are:

    δK,l:x=y2y(1+a)(3y2+a),δK,r:x=y+2y(1+a)(3y2+a).

    If we consider a small neighborhood U of the fixed point Ri that belongs to the prefocal line δQi, the points belonging to UZ0 have no preimages, while the points belonging to UZ2 have two distinct preimages given by an unbounded area K1a(U) that must include the line y=y. As it is shown in Figure 4, the fixed point Ri=(xi,xi) is in the intersection of the two curves that form the boundary of Z2, so the boundary of the disk, U, cuts each of these curves in two different points. When U cuts the curve y=x their preimages go to ± asymptotically to the line y=y as function Δ does too. When U cuts the prefocal line x=x their preimages go to the focal points. So, the preimage of the disk U is formed by a bounded region, with the two focal points in its boundary, around the fixed point and by two unbounded regions that start from these focal points. In Figure 4, we observe two cases for a<0; in the left figure the two focal points are inside Z0 and in the right figure there is one focal point inside Z2. The preimages of the boundary of the disk, K1a(U), in this figure are the magenta and cyan curves; magenta curves correspond to the preimages of the upper side of the disk inside Z2 and the cyan curves correspond to the bottom side. Let us notice that both preimages go to as the two side of the disk inside Z2 cut the line y=x.

    Figure 4.  Sketch of the preimages K1a(U) of the neighborhood U of the fixed point that belongs to the prefocal line.

    Nevertheless, let us notice that when one of the focal points is inside Z2 the preimages of the border of the disk, K1a(U), have three different pieces inside Z2 and the preimages of one of them does not go to as it does not cut the line y=x; in fact, their preimages give the border of a disk, as you can see in the right picture of Figure 5.

    Figure 5.  Sketch of the preimages K2a(U) of the neighborhood U of the fixed point that belongs to the prefocal line.

    In the following, we obtain all types of curves in the set of non definition, Λ, of Kurchatov's map. We calculate the preimages of the arcs obtained from the intersection of the different curves with Z2, starting from the curve δKa. The different arcs are colored in blue in Figure 6, and their corresponding rank-1 preimages are colored in magenta.

    Figure 6.  Sketch of the preimages K1(γ) of different curves embedded in Z2.

    Proposition 3.12. Let γ be an arc defined by ΓZ2, where ΓΛ=n0Kna(δKa) and let LC be the critical set defined in (3.3); then, γ satisfies oneof the following statements:

    The arc γ goes from the curve LC to the line y=x.

    The arc γ connects the curve LC with the curve LC indifferent points.

    The arc γ connects the line y=x with the line y=x indifferent points.

    Moreover, if an arc cuts the line y=x, then its preimages go to infinity.If it does not cut the line y=x its preimages give a closed curve.

    Proof.. The intersection of the critical set δKa with Z2 gives two arcs, colored in blue in Figures 6(A) and 6(B) and denoted γ. In both cases, the intersection of the arc with Z2 is produced at two points: one on LC and the other on line y=x. Then, both arcs connect the curve LC and line y=x. Now, let us see how is the rank-1 preimage of such arcs.

    Let us consider the preimages of the points of γ for the case (A), moving along γ from right to left. The preimages of the intersection of γ with line y=x are infinity due to the term Δ in the map K1a (see (3.2)). As x>0, the second component of K1a is positive. For each point of γ we have two preimages, starting at + and , respectively; when γ reaches the prefocal line, these two preimages are the focal points. The curve K1a(γ) turns at these points and crosses the invariant line y=y and finally, the two preimages merge at the point corresponding to the preimage of the point of γ on the curve LC, when y=x.

    We now consider the intersections of this curve with Z2. We again obtain two arcs. One of them connects the curve LC and line y=x. If one prefocal point is inside Z2, the other arc connects LC with LC, intersecting LC at two different points (see this type of arc colored in blue in Figure 6(C)).

    Let P and P be the intersection points of γ with LC; the preimages of this type of curve γ form a closed curve K1a(γ) since the two preimages of these curve coincide at the points K1a(P) and K1a(P), as we have obtained previously.

    If we now consider the intersection of this closed curve with Z2, we obtain an arc that cuts the line y=x at two different points. We represent this type of arc in blue in Figure 6(D).

    As seen before, the preimages of each point on line y=x are ±, due to the function Δ. As the arc γ does not cut the curve LC, their preimages do not coincide at any point. The preimage of such arc can be seen colored in magenta in Figure 6(D). If this curve is located in Z0, then it has no preimages.

    So, three types of arcs are obtained: arcs connecting LC with LC, arcs connecting LC with line y=x and arcs connecting line y=x with line y=x.

    In a similar way, it can be described the curves preimages of the arc γ in Figure 6(B) obtaining the same type of arcs, and so, the same type of curves.

    Due to the classification obtained above, we have the description of the curves ΓΛ: they go from to +, passing through the focal points, they form closed curves or they form tongues.

    Following the results of the previous section, it is possible to make an outline of dynamical planes depending on whether there is a focal point inside Z2 or the two focal points are in Z0.

    To describe the basin boundaries we have to consider the singular set δKa and its preimages. From Figure 3 it is observed that δKaZ2 is divided into two different branches denoted by δK,b and δK,t such that δKaZ2=δK,bδK,t. Moreover, it can be checked that δK,bδK,r and δK,tδK,l. The portion of δKa located into Z0 has no preimages whereas the portion located into Z2 is made up of two disjoint branches, each one having two rank-1 preimages. Therefore, K1a(δKa) is made up of four branches. As Lemma 3.8 tell us, one of the focal points can belong to δK,bδK,t or none of them are in these branches.

    In Figure 7 we have drawn the preimages K1a(δKa) and K2a(δKa) for two different cases: the first one corresponds to the case where none of the focal points are in Z2 and the second case corresponds to one focal point in Z2. Let us observe that all the preimages of δKa go from to + turning at the focal points if the two focal points are in Z0. However, we can observe the emergence of closed curves that do not cross the focal points when one focal point is in Z2, as it was predicted in Proposition 3.12. The two points where this curve is cut by other preimage of δKa correspond to the two preimages of the focal point.

    Figure 7.  Sketch of the preimages K1a(δKa) and K2a(δKa) for a=4 and a=9.

    The corresponding dynamical planes can be observed in Figure 8: in the left figure, the two focal points are embedded in Z0, in the right one, there is a focal point in Z2.

    Figure 8.  Dynamical planes for a=4 and a=9.

    In this section, we study three types of bifurcation: when the number of fixed and focal points change, the changes produced when the number of the preimages of focal points changes and the changes produced in the dynamical system when bounded and isolated preimages of some basins of attraction appear.

    The design of the basins of attraction changes depending on the number of preimages of the focal points. So, we study what happens when one focal point has not any preimage and the other has only one preimage. As Lemma 3.8 states, the values of the parameter for which Q1 has one preimage are: a=322, a=12(2+2 and a=2(22). For a=3+22, a=12(22) or a=2(2+2), Q2 has one preimage.

    If focal points have not preimages, the pieces of δKa and their preimages embedded in Z2 go from line y=x to the rational function o vice versa as they cut the prefocal line and have to cross the focal points. So, if these preimages of δKa also go from line y=x to the rational function o vice versa, all the borders of the basins of attraction of the fixed points go across the focal points similarly to those drawn in Figure 7(A) and their dynamical plane are similar to Figure 8(A) with the pieces of the basins of attraction going to the focal points.

    However, if one focal point has two preimages, then the preimages of δKa include closed and bounded curves that do not cut the focal points as they can go to the preimages of them, as it can be seen in Figure 7(B) and their dynamical plane are similar to Figure 8(B). In the following we consider the bifurcation case corresponding to one focal point with one preimage. As we can see in Figure 9(A), the preimages of δKa include closed and bounded curves that are tangent among themselves in the preimages of the focal point.

    Figure 9.  Sketch of the preimages and dynamical plane for a=322.

    In Figure 9(A) the curve δKa is colored in red, K1(δKa) in magenta, K2(δKa) in cyan and K3(δKa) is dashed and colored in blue. The corresponding dynamical plane can be seen in Figure 9(B).

    Additionally, if a is closed enough to one of these bifurcation values the preimages of δKa include closed and bounded curves isolated inside K1(δKa), (see Figure 10(A)) that give rise to bounded and isolated regions in the dynamical plane (see Figure 10(B)).

    Figure 10.  Sketch of the preimages and dynamical plane for a=27/5.

    These bounded curves approach each other until they are tangent at the bifurcation point. After this point, the curves drift apart until the bounded and isolated curves disappear. This type of bifurcation corresponds to the values of the parameter where K1(δKa) is tangent to the rational function LC.

    Finally, for a=0 and a=1 two fixed points collapse together with the focal points in the bifurcation points; in these cases all the borders pass through the fixed point, that is also a focal point (see Figures 11 and 12).

    Figure 11.  Sketch of the preimages and dynamical plane for a=0.
    Figure 12.  Sketch of the preimages and dynamical plane for a=1.

    Nevertheless, if we consider a small interval around a=0 or a=1, we observe that there are three attractive fixed points and two focal points and only one of the focal points have two preimages; so, the dynamics of the map does not change in a narrow interval of these bifurcations points, as we can observe in Figure 13.

    Figure 13.  Dynamical planes for a=0.99 and a=1.01.

    If one focal point is in the boundary of Z2, then it has one preimage. The dynamical plane is similar to the first case: there appear bounded and unbounded areas that do not have the focal points as limits and belong to the basins of attraction of all the fixed points. The difference is that bounded areas touch the immediate basin of R2 at a point which is the preimage of the focal point. The dynamical plane is similar to that of a=322, (see Figure 9).

    Therefore, all the possible performance of the Kurchatov method on a generic cubic polynomial is explained. We can summarize these results in the line of parameters shown in Figure 14, obtaining a bifurcation diagram where each color represents one type of dynamical plane: cyan corresponds to the first type, violet to the second one and magenta to the last type. The cases a=0 and a=1 correspond to dynamical planes where the focal points are not simple and have been studied separately.

    Figure 14.  Parameter line.

    A complete description of the dynamical planes for every value of the parameter has been carried out. In fact, we have obtain three different types of dynamical planes:

    1. If one focal point is inside Z2, then it has two preimages. There appear bounded areas that do not have the focal points as limits and belong to the basins of attraction of all the fixed points. The bounded areas touch the immediate basin of R2 at two points (which are the preimages of the focal point). The unbounded areas have the focal points as limits.

    2. If the focal points are inside Z0, but they are closed enough to the boundary of Z2, the bounded areas belonging to the basins of attraction of the fixed points still remain but they do not touch the immediate basin of R2. Moreover, there exist unbounded areas that do not reach the focal points.

    3. Finally, when the focal points are inside Z0 and not close to Z2, the bounded areas have disappear and all the areas are unbounded and have focal points as limits.

    We have represented these different dynamical behaviours for every value of the parameter in a bifurcation diagram, the parameter line.

    Along this paper we have shown that this iterative scheme is completely stable for any polynomial of degree three, since the only attractors that appear for any value of the parameter are the roots of the polynomial.

    This paper is supported by the MCIU grant PGC2018-095896-B-C22. The first and the last authors are also supported by University Jaume I grant UJI-B2019-18. Moreover, the authors would like to thank the anonymous reviewers for their comments and suggestions.

    All authors declare no conflicts of interest in this paper.



    [1] V. A. Kurchatov, On a method of linear interpolation for the solution of funcional equations (Russian), Dolk. Akad. Nauk SSSR, 198 (1971), 524–526. Translation in Soviet Math. Dolk. 12, 835–838.
    [2] M. Petković, B. Neta, L. Petković, J. Džunić, Multipoint Methods for Solving Nonlinear Equations, Boston: Academic Press, 2013.
    [3] A. Cordero, T. Lotfi, P. Bakhtiari, J. R. Torregrosa, An efficient two-parametric family with memory for nonlinear equations, Numer. Algorithms, 68 (2015), 323–335. https://doi.org/10.1016/j.worlddev.2014.11.009 doi: 10.1016/j.worlddev.2014.11.009
    [4] A. Cordero, T. Lotfi, J. R. Torregrosa, P. Assari, S. Taher-Khani, Some new bi-accelerator two-point method for solving nonlinear equations, J. Comput. Appl. Math., 35 (2016), 251–267. https://doi.org/10.1002/sim.6628 doi: 10.1002/sim.6628
    [5] X. Wang, T. Zhang, Y. Qin, Efficient two-step derivative-free iterative methods with memory and their dynamics, Int. J. Comput. Math., 93 (2016), 1423–1446. https://doi.org/10.1080/00207160.2015.1056168 doi: 10.1080/00207160.2015.1056168
    [6] P. Bakhtiari, A. Cordero, T. Lotfi, K. Mahdiani, J. R. Torregrosa, Widening basins of attraction of optimal iterative methods for solving nonlinear equations, Nonlinear Dynam., 87 (2017), 913–938. https://doi.org/10.1007/s11071-016-3089-2 doi: 10.1007/s11071-016-3089-2
    [7] C. L. Howk, J. L. Hueso, E. Martínez, C. Teruel, A class of efficient high-order iterative methods with memory for nonlinear equations and their dynamics, Math. Meth. Appl. Sci., 41 (2018), 7263–7282. https://doi.org/10.1002/mma.4821 doi: 10.1002/mma.4821
    [8] B. Campos, A. Cordero, J. R. Torregrosa, P. Vindel, A multidimensional dynamical approach to iterative methods with memory, Appl. Math. Comput., 271 (2015), 701–715. https://doi.org/10.1016/j.amc.2015.09.056 doi: 10.1016/j.amc.2015.09.056
    [9] B. Campos, A. Cordero, J. R. Torregrosa, P. Vindel, Stability of King's family of iterative methods with memory, Comput. Appl. Math., 318 (2017), 504–514. https://doi.org/10.1016/j.cam.2016.01.035 doi: 10.1016/j.cam.2016.01.035
    [10] N. Choubey, A. Cordero, J. P. Jaiswal, J. R. Torregrosa, Dynamical techniques for analyzing iterative schemes with memory, Complexity, 2018 (2018), Article ID 1232341, 13 pages.
    [11] F. I. Chicharro, A. Cordero, N. Garrido, J. R. Torregrosa, Stability and applicability of iterative methods with memory, J. Math. Chem., 57 (2019), 1282–1300. https://doi.org/10.1007/s10910-018-0952-z doi: 10.1007/s10910-018-0952-z
    [12] F. I. Chicharro, A. Cordero, N. Garrido, J. R. Torregrosa, On the choice of the best members of the Kim family and the improvement of its convergence, Math. Meth. Appl. Sci., 43 (2020), 8051–8066. https://doi.org/10.1002/mma.6014 doi: 10.1002/mma.6014
    [13] F. I. Chicharro, A. Cordero, N. Garrido, J. R. Torregrosa, Impact on stability by the use of memory in Traub-type schemes, Mathematics, 8 (2020), 274.
    [14] A. Cordero, F. Soleymani, J. R. Torregrosa, F. K. Haghani, A family of Kurchatov-type methods and its stability, Appl. Math. Comput., 294 (2017), 264–279. https://doi.org/10.1016/j.amc.2016.09.021 doi: 10.1016/j.amc.2016.09.021
    [15] R. C. Robinson, An Introduction to Dynamical Systems, Continous and Discrete, Providence: Americal Mathematical Society, 2012.
    [16] G. Bischi, L. Gardini, C. Mira, Plane maps with denomiator I. Some generic properties, Int. J. Bifurcations Chaos, 9 (1999), 119–153. https://doi.org/10.2307/605565 doi: 10.2307/605565
    [17] G. Bischi, L. Gardini, C. Mira, Plane maps with denomiator II. Non invertible maps with simple focal points, Int. J. Bifurcations Chaos, 13 (2003), 2253–2277. https://doi.org/10.1142/S021812740300793X doi: 10.1142/S021812740300793X
    [18] G. Bischi, L. Gardini, C. Mira, Plane maps with denomiator III. Non simple focal points and related bifurcations, Int. J. Bifurcations Chaos, 15 (2005), 451–496. https://doi.org/10.1142/S0218127405012314 doi: 10.1142/S0218127405012314
    [19] G. Bischi, L. Gardini, C. Mira, New phenomena related to the presence of focal points in two dimensional maps, J. Ann. Math. Salesiane, (special issue Proceedings ECIT98), 13 (1999), 81–90.
    [20] A. Garijo, X. Jarque, Global dynamics of the real secant method, Nonlinearity, 32 (2019), 4557–4578. https://doi.org/10.1088/1361-6544/ab2f55 doi: 10.1088/1361-6544/ab2f55
    [21] A. Garijo, X. Jarque, The secant map applied to a real polynomial with multiple roots, Discrete Cont. Dyn-A., 40 (2020), 6783–6794. https://doi.org/10.3934/dcds.2020133 doi: 10.3934/dcds.2020133
    [22] L. Gardini, G. Bischi, D. Fournier-Prunaret, Basin boundaries and focal points in a map coming from Bairstow's method, Chaos, 9 (1999), 367–380.
    [23] M. R. Ferchichi, I. Djellit, On some properties of focal points, Discrete Dyn. Nat. Soc., 2009 (2009), Article ID 646258, 11 pages.
    [24] G. Bischi, L. Gardini, C. Mira, Contact bifurcations related to critical sets and focal points in iterated maps of the plane, Proceedings of the International Workshop Future Directions in Difference Equations, (2011), 15–50.
    [25] N. Pecora, F. Tramontana, Maps with vanishing denominator and their applications, Front. Appl. Math. Stat., 2 (2016), 12 pages.
  • This article has been cited by:

    1. Beny Neta, Analysis of Traub’s Method for Cubic Polynomials, 2024, 13, 2075-1680, 87, 10.3390/axioms13020087
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2274) PDF downloads(76) Cited by(1)

Figures and Tables

Figures(14)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog