Abstract
In this article, we suggest the local analysis of a uni-parametric third and fourth order class of iterative algorithms for addressing nonlinear equations in Banach spaces. The proposed local convergence is established using an -continuity condition on the first Fréchet derivative. In this way, the utility of the discussed schemes is extended and the application of Taylor expansion in convergence analysis is removed. Furthermore, this study provides radii of convergence balls and the uniqueness of the solution along with the calculable error distances. The dynamical analysis of the discussed family is also presented. Finally, we provide numerical explanations that show the suggested analysis performs well in the situation where the earlier approach cannot be implemented.
1. Introduction
The primary objective of this research is to provide an approximate solution of:
where is a Fréchet derivable operator and is nonempty, open and convex. and are Banach spaces. The requirement for the solutions of nonlinear equations in the form (1) is present in many problems of applied sciences and engineering as a foundation to solve other complicated ones. It is not always possible to determine the exact solutions to this kind of equations, so scientists and researchers frequently use iterative algorithms to approximate the required solution. The most regularly used iterative procedure for addressing (1) is Newton’s scheme that converges quadratically. Over the past several years, numerous authors have developed and are currently improving higher order iterative approaches [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] for solving nonlinear equations.
Local convergence results for different iterative processes have been studied by many authors [18,19,20,21,22,23,24,25,26,27,28], and many important findings have been obtained. In these studies, essential results including convergence radii, measurements on error distances and the extended utility of efficient iterative procedures have been discussed.
In addition, analysis of dynamical characteristics of a class of iterative schemes applied on complex polynomials provides significant results about the stability and reliability of its elements. Researchers such as Amat et al. [29,30], Argyros and Magreñán [19,20], Cordero et al. [31,32,33,34] and others [27,35,36,37] have described complex dynamical behaviors of some famous classes of methods including Jarratt, King, Kim, Chebyshev–Halley, etc.
Recently, Argyros and Magreñán [19] studied the convergence analysis and dynamics of an optimal fourth order family given by:
where . Cordero et al. [34] developed a third and fourth order parametric class of nonlinear equation solvers and studied its stability analysis using a complex dynamics technique.
In this report, our primary aim is to analyze the local convergence and complex dynamical results for a third and fourth order convergent class of iterative procedures. Kou et al. [8] derived a family of iterative algorithms for addressing (1). This family is expressed as follows:
where , and . The authors [8] also proved that the convergence rate of (3) is at least three, and for the convergence order increases to four. Observe that only is involved in the iterative structure of (3). However, the convergence results of (3) were shown in [8] using conditions on the fourth order derivative. Such convergence criteria [8] restrict the usefulness of these solvers. As an example, we take a function defined on by:
For the above function , the third derivative is not bounded on its domain . The convergence theorem for the methods (3) derived in [8] does not work for this problem. Additionally, the authors proved the convergence theorem using the assumption that “if the initial estimation is sufficiently close to the solution , then the sequence of iterates converges to ”. But how close to the solution the initial guess should be? The earlier work [8] offers no answer to this question. In other words, no information about the distance between and was provided for ensuring the convergence of (3). The earlier convergence analysis was established to solve equations only in . Additionally, complex dynamical analysis was not studied by the authors [8] to extract the stable schemes of the family (3). In this study, we establish the local convergence for the class of methods (3) using a set of conditions only on in a general Banach space setting. More specifically, the -continuity of the first derivative is applied to eliminate the use of higher order derivatives in convergence study. The proposed analysis is useful to address the above discussed problem (4) as well as the problems where higher order derivatives of the involved operator do not exist. This analysis also enables us to apply the methods (3) for solving Banach space valued nonlinear operator equations. Hence, the utility of the family of methods (3) is expanded. This study also provides radii of convergence balls and the uniqueness of the solution along with the calculable error distances. Our technique is so general that it can be used to extend the applicability of other solvers [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37]. These are our motivations for this document. Furthermore, we analyze the dynamical properties of the parametric class (3). This analysis provides an idea to determine such values of the parameter whose corresponding iterative members are numerically stable. Additionally, various chaotic behaviors of the class, such as convergence to n-periodic orbits or attracting strange fixed points and divergence to ∞, are presented using the techniques described in [20,37]. These anomalies are demonstrated with the help of a parameter space and some dynamical planes.
2. Local Convergence Analysis of the Discussed Family of Iterative Algorithms
We establish, with the help of the -continuity of , the local convergence of the class of algorithms defined by (3). For and , we define the following notations:
and
Let and suppose there exists a non-decreasing and continuous function such that . Let the smallest positive solution of exist. Set . Suppose there exist continuous and non-decreasing functions such that and . We introduce the following functions on the interval .
and
Then, and as for . It is confirmed by applying the intermediate value theorem that the smallest zeros of the functions exist and lie in , where . Let us denote:
Hence, we have the following inequalities for each :
and
Furthermore, we assume that the following hold true for the Fréchet derivable operator :
and
Next, we discuss the local convergence theorem for the family (3).
Theorem 1.
Suppose is Fréchet derivable and . Let obey the conditions defined in (10)–(13) and:
Then, for any starter , the sequence of iterates constructed by the class of algorithms (3) is well defined, and . Moreover, the following items are true for all :
and
where the functions ‘’ are discussed in Equations (5) and (6). In addition, if there exist such that:
then satisfies Equation (1) uniquely in .
Proof.
Let . Using Equations (7) and (11), we obtain:
It also follows from Formula (3) for that is well defined. We also have from (3):
Then, we deduce using (3), (7), (8), (11), (19) (for ) and (20),
Hence, (15) holds for . Next, we find a bound for . We use Equations (12), (19) (for ) and (21) to obtain:
It follows from the above inequality that:
Additionally, is well defined by virtue of Equation (19). Next, we use (3), (6), (7), (9), (12), (19) (for ), (21), (22) and (23) to establish:
This validates the estimate (16) for . The induction for the estimates (15) and (16) is completed for . Assuming that (15) and (16) hold true for all and then by replacing the estimations, we show the items (15) and (16) are true for . From the estimation , we derive that and . Let there exist such that . Consider . From (11) and (17), we obtain:
and this confirms that . We obtain due to the invertability of and the identity . □
3. Complex Dynamics of the Discussed Class of Methods
In this section, the complex dynamical analysis of the class (3)is carried out. When analyzing an iterative formula, convergence analysis is not the only required matter to study. The effectiveness of an algorithm also depends on other components, such as verifying how it performs on the basis of the chosen starting points. That is, how large the set of starting points is for which the scheme converges to a solution. For this reason, a wide range of tools are required for a more extensive analysis.
In the research of iterative procedures, the dynamical analysis of a family of iterative algorithms is now gaining increasing interest because it enables separating different iterative approaches in terms of their rate of convergence. It also allows for evaluating their behavior depending on the chosen starting point. This analysis helps one to visualize the set of initial estimates that converge to a root of the equation or other points. Furthermore, it demonstrates the reliability and productiveness of the iterative process.
This research investigates the complex dynamical behavior of the class of methods (3) on a polynomial defined by . We discuss the detailed study of the fixed points and their stability employing MATHEMATICA software [19,20]. In addition, a parameter space and various dynamical planes were constructed and analyzed to show the chaotic nature of the considered family.
We applied the class of schemes (3) on the polynomial , where . Then, we considered the Möbius map with the properties , and to deduce the rational operator:
related to the class of algorithms (3).
3.1. Study of Fixed Points and Their Stability
The fixed points of the operator are obtained by solving the equation . The points and are superattracting fixed points of as they are related to and , respectively. According to the definition, is a strange fixed point. Moreover, depending on , there exist another four strange fixed points. These points can be expressed as follows:
- 1.
- 2.
- 3.
- 4.
These strange fixed points are presented in Figure 1 for , .
Figure 1.
Behavior of the strange fixed points.
The relations among () are discussed below.
Lemma 1.
The fixed point operator has five simple strange fixed points except in the following situations:
- (i)
- If , then has three strange fixed points.
- (ii)
- If , then and the number of strange fixed points is three.
- (iii)
- If , then and . Hence the number of strange fixed points of is three.
Furthermore, and for all values of the parameter θ.
To analyze the stability of these strange fixed points and obtain the critical points, we require the first order derivative of . The simplified expression of the differentiated operator is:
It is easy to observe from Equation (25) that the superattracting fixed points of are and . The stability analysis of and will be provided in a different approach. We begin with investigating the stability of . This fixed point is associated with the convergence to ∞. We denote the stability function of the fixed point by . Using Equation (25), we get:
Theorem 2.
The strange fixed point is categorized as follows:
- 1.
- If , then is attracting. In addition, it cannot be superattracting for any value of θ.
- 2.
- If , then is a parabolic fixed point.
- 3.
- is a repulsor when .
Therefore, the stability zone of is the region on where . This stability zone is presented graphically in Figure 2.
Figure 2.
Stability region of .
It is incredibly challenging to determine the stability of other fixed points () analytically. However, we have used the graphical tool MATHEMATICA to display the stability zones for these points. It is noticed that the stability of and is the same. The stability regions of the strange fixed points and are presented in the Figure 3a,b, respectively. For the fixed points and , corresponding stability functions are demonstrated in Figure 4a,b, respectively.
Figure 3.
Stability regions. (a) Stability region of and , (b) Stability region of and .
Figure 4.
Stability functions. (a) Stability function for , (b) Stability function for .
Considering the stability regions presented in the Figure 3 and Figure 4, the following results are established.
Theorem 3.
In terms of stability, the strange fixed points are characterized as follows:
- 1.
- The stability of and is the same. In detail,* If , then both fixed points are superattractive fixed points.* Additionally, these fixed points are attractors if θ lies in the oval or cardioid presented in Figure 3a,b, respectively.
- 2.
- The fixed points and are always repulsive in nature for any value of θ, and this can be observed in Figure 4a,b, respectively.
3.2. Study of Critical Points and Parameter Spaces
We next discuss the critical points of the class (3) with the parameter space. We obtained the critical points of by solving . It is clear from (25) that 0 and ∞ are critical points of that are associated with and , respectively. The point is a free critical point of . The other free critical points are represented by . The expressions of these free critical points are as follows:
- 1.
- 2.
The number of free critical points of depends on , as summarized below.
Lemma 2.
- (i)
- If , then the number of distinct free critical points of is one.
- (ii)
- For the rest of scenarios, the operator has three distinct free critical points.
We observe that . Hence, and are not independent. This is why we present the parameter plane related to . The behavior of and (when , ) is provided in Figure 5.
Figure 5.
Behavior of free critical points.
The dynamical properties of the considered family (3) were analyzed using the procedure discussed in [19,20]. The parameter space associated to is given in Figure 6. The detailed views of this parameter space are displayed in Figure 7a,b. The free critical point was considered as a stating estimation for the iterative processes of the class. We applied different colors on the initial choice according to the convergence of the corresponding sequence of iterates. Cyan is used to show the convergence of the iteration sequence to 0 (related to ) or ∞ (related to the ). We assigned the yellow color to to show the convergence to (related to ∞). We executed a maximum of 2000 iterations with as the error tolerance. Moreover, the magenta color indicates the convergence to . Convergences to n-periodic orbits for are displayed in other colors, including light green, orange, blue, dark orange, dark green, dark red and white, respectively. For the n-periodic orbits are shown in black. In the parameter plane, the points that are not painted with cyan colors are not the appropriate choices for from the numerical point of view. In these zones, the iteration converges to any of the or to attracting n-periodic orbits or even to ∞. In addition, one can find broad regions where the points are displayed in cyan. This verifies that some iterative procedures of the discussed family are numerically stable.
Figure 6.
Parameter plane associated with the free critical point .
Figure 7.
(a,b) Detailed views of the parameter plane associated with .
Next, we provide dynamical planes to display some of the detected anomalies. In these figures, we use cyan and red to demonstrate the convergence to 0 and ∞, respectively. Black indicates that the iterative member of the family (3) does not converge to either 0 or ∞ with the tolerance error and at most 1000 iterations. In the dynamical planes shown in Figure 8a,b, we have used yellow to present the convergence of the iterative member to the strange fixed point . In Figure 8c,d, attracting strange fixed points and appear, which are displayed in magenta and green, respectively.
Figure 8.
Dynamical Planes. (a) θ = 44.5, (b) θ = −22, (c) θ = −10, (d) θ = 0.249.
In Figure 9a, the dynamical plane related to a scheme of the discussed family (for ) shows the appearance of an attracting 2-cycle . Moreover, various attracting 2-periodic orbits are given in Figure 9b,c. In Figure 9b, the existence of two 2-periodic orbits and is seen. Additionally, the 2-cycles and are presented in Figure 9c. The occurrence of an attracting 3-cycle is provided in Figure 9d. The convergence to n-cycles is presented in black, since this convergence is not related to and .
Figure 9.
Dynamical Planes. (a) θ = 20, (b) θ = 15.5, (c) θ = −6.5, (d) θ = 25 − 26i.
At the end, we provide dynamical planes for , , and in Figure 10a–d, respectively. The attraction basins in these planes are related to or only; as a consequence, the corresponding elements of the considered family are numerically stable. Thus, these methods are preferable over other elements of the family in most numerical applications.
Figure 10.
Dynamical planes. (a) , (b) , (c) , (d) .
4. Numerical Examples
In this section, we discuss numerical problems to demonstrate the efficacy of our theoretical findings. In these examples, we apply the proposed results to calculate the convergence radius of four methods derived from the discussed family (3) by using , , and . Notice that no iterative method is used to find the radius . However, only Formula (7) is related to the solutions of scalar equations. Iterative method (3) is not used, since the solutions are known. The obtained radii show the degree of difficulty in choosing initial points.
Example 1.
[22] Let be defined on for by:
We have , and . The values of are presented in Table 1.
Table 1.
Radii of convergence balls for Example 1.
Example 2.
[22] We chose the nonlinear Hammerstein type integral equation given by:
where . We have , , and . The values of are provided in Table 2.
Table 2.
Radii of convergence balls for Example 2.
Example 3.
[25] Finally, we address the motivational problem discussed in the introduction part. Then , and . The values of are given in Table 3.
Table 3.
Radii of convergence balls for Example 3.
Author Contributions
Conceptualization, D.S. and I.K.A.; methodology, D.S., I.K.A., S.K.P. and S.K.S.; software, D.S. and I.K.A.; validation, D.S., I.K.A., S.K.P. and S.K.S.; formal analysis, D.S., I.K.A., S.K.P. and S.K.S.; investigation, D.S., I.K.A., S.K.P. and S.K.S.; resources, D.S., I.K.A., S.K.P. and S.K.S.; data curation, S.K.P. and S.K.S.; writing—original draft preparation, D.S., I.K.A., S.K.P. and S.K.S.; writing—review and editing, D.S. and I.K.A.; visualization, D.S., I.K.A., S.K.P. and S.K.S.; supervision, I.K.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research was supported by University Grants Commission of India grant number NOV2017-402662.
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
- Argyros, I.K. Convergence and Application of Newton-Type Iterations; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
- Argyros, I.K.; Cho, Y.J.; Hilout, S. Numerical Methods for Equations and Its Applications; Taylor & Francis, CRC Press: New York, NY, USA, 2012. [Google Scholar]
- Behl, R.; Cordero, A.; Motsa, S.S.; Torregrosa, J.R.; Kanwar, V. An optimal fourth-order family of methods for multiple roots and its dynamics. Appl. Math. Comput. 2016, 71, 775–796. [Google Scholar] [CrossRef]
- Candela, V.; Marquina, A. Recurrence relations for rational cubic methods I: The Halley method. Computing 1990, 44, 169–184. [Google Scholar] [CrossRef]
- Ezquerro, J.; Hernández, M.A. On Halley-type iteration with free second derivative. J. Comput. Appl. Math. 2004, 170, 455–459. [Google Scholar] [CrossRef][Green Version]
- Ezquerro, J.A.; González, D.; Hernández, M.A. Majorizing sequences for Newton’s method from initial value problems. J. Comput. Appl. Math. 2012, 2012 236, 2246–2258. [Google Scholar] [CrossRef]
- Grau, M.; Diaz-Barrero, J.L. An improvement of the Euler-Chebyshev iterative method. J. Math. Anal. Appl. 2006, 315, 1–7. [Google Scholar] [CrossRef]
- Kou, J.; Li, Y.; Wang, X. Fourth-order iterative methods free from second derivative. Appl. Math. Comput. 2007, 184, 880–885. [Google Scholar] [CrossRef]
- Maroju, P.; Magreñán, Á.A.; Motsa, S.S.; Sarría, Í. Second derivative free sixth order continuation method for solving nonlinear equations with applications. J. Math. Chem. 2018, 56, 2099–2116. [Google Scholar] [CrossRef]
- Neta, B.; Scott, M.; Chun, C. Basins of attraction for several methods to find simple roots of nonlinear equations. Appl. Math. Comput. 2012, 218, 10548–10556. [Google Scholar] [CrossRef]
- Özban, A.Y. Some new variants of Newton’s method. Appl. Math. Lett. 2004, 17, 677–682. [Google Scholar] [CrossRef]
- Petković, M.S.; Neta, B.; Petković, L.; Dz̃unić, D. Multipoint Methods for Solving Nonlinear Equations; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
- Rall, L.B. Computational Solution of Nonlinear Operator Equations; Robert E. Krieger: New York, NY, USA, 1979. [Google Scholar]
- Ren, H.; Wu, Q.; Bi, W. New variants of Jarratt method with sixth-order convergence. Numer. Algor. 2009, 52, 585–603. [Google Scholar] [CrossRef]
- Sharma, J.R.; Guna, R.K.; Sharma, R. Efficient Jarratt-like methods for solving systems of nonlinear equations. Calcolo 2014, 51, 193–210. [Google Scholar] [CrossRef]
- Traub, J.F. Iterative Methods for Solution of Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
- Weerakoon, S.; Fernando, T.G.I. A variant of Newton’s method with accelerated third-order convergence. Appl. Math. Lett. 2000, 13, 87–93. [Google Scholar] [CrossRef]
- Amat, S.; Argyros, I.K.; Busquier, S.; Hernández-Verón, M.A.; Martínez, E. On the local convergence study for an efficient k-step iterative method. J. Comput. Appl. Math. 2018, 343, 753–761. [Google Scholar] [CrossRef]
- Argyros, I.K.; Magreñán, Á.A. On the convergence of an optimal fourth-order family of methods and its dynamics. Appl. Math. Comput. 2015, 252, 336–346. [Google Scholar] [CrossRef]
- Argyros, I.K.; Magreñán, Á.A. A study on the local convergence and the dynamics of Chebyshev-Halley-type methods free from second derivative. Numer. Algor. 2015, 71, 1–23. [Google Scholar] [CrossRef]
- Argyros, I.K.; Cho, Y.J.; George, S. Local convergence for some third order iterative methods under weak conditions. J. Korean Math. Soc. 2016, 53, 781–793. [Google Scholar] [CrossRef]
- Argyros, I.K.; George, S. Local convergence for an almost sixth order method for solving equations under weak conditions. SeMA J. 2017, 75, 163–171. [Google Scholar] [CrossRef]
- Argyros, I.K.; Sharma, D.; Parhi, S.K. On the local convergence of Weerakoon-Fernando method with ω continuity condition in Banach spaces. SeMA J. 2020, 77, 291–304. [Google Scholar] [CrossRef]
- Argyros, I.K.; George, S. On the complexity of extending the convergence region for Traub’s method. J. Complex. 2020, 56, 101423. [Google Scholar] [CrossRef]
- Argyros, I.K.; Behl, R.; González, D.; Motsa, S.S. Ball convergence for combined three-step methods under generalized conditions in Banach space. Stud. Univ. Babes-Bolyai Math. 2020, 65, 127–137. [Google Scholar] [CrossRef]
- Maroju, P.; Magreñán, Á.A.; Sarría, Í.; Kumar, A. Local convergence of fourth and fifth order parametric family of iterative methods in Banach spaces. J. Math. Chem. 2020, 58, 686–705. [Google Scholar] [CrossRef]
- Sharma, D.; Parhi, S.K. Local Convergence and Complex Dynamics of a Uni-parametric Family of Iterative Schemes. Int. J. Appl. Comput. Math. 2020, 6, 1–16. [Google Scholar] [CrossRef]
- Singh, S.; Gupta, D.K.; Badoni, R.P.; Martínez, E.; Hueso, J.L. Local convergence of a parameter based iteration with Hölder continuous derivative in Banach spaces. Calcolo 2017, 54, 527–539. [Google Scholar] [CrossRef]
- Amat, S.; Busquier, S.; Plaza, S. Review of some iterative root-finding methods from a dynamical point of view. Sci. Ser. A Math. Sci. 2004, 10, 3–35. [Google Scholar]
- Amat, S.; Busquier, S.; Plaza, S. Dynamics of the King and Jarratt iterations. Aequationes Math. 2005, 69, 212–223. [Google Scholar] [CrossRef]
- Cordero, A.; García-Maimó, J.; Torregrosa, J.R.; Vassileva, M.P.; Vindel, P. Chaos in King’s iterative family. Appl. Math. Lett. 2013, 26, 842–848. [Google Scholar] [CrossRef]
- Cordero, A.; Torregrosa, J.R.; Vindel, P. Dynamics of a family of Chebyshev-Halley type methods. Appl. Math. Comput. 2013, 219, 8568–8583. [Google Scholar] [CrossRef]
- 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]
- Cordero, A.; Villalba, E.G.; Torregrosa, J.R.; Triguero-Navarro, P. Convergence and Stability of a Parametric Class of Iterative Schemes for Solving Nonlinear Systems. Mathematics 2021, 9, 86. [Google Scholar] [CrossRef]
- Chicharro, F.; Cordero, A.; Gutiérrez, J.M.; Torregrosa, J.R. Complex dynamics of derivative-free methods for nonlinear equations. Appl. Math. Comput. 2013, 2013 219, 7023–7035. [Google Scholar] [CrossRef]
- Chicharro, F.; Cordero, A.; Torregrosa, J.R. Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. 2013, 2013, 780153. [Google Scholar] [CrossRef] [PubMed]
- Magreñán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).