- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 726701, 10 pages
Reducing Chaos and Bifurcations in Newton-Type Methods
1Departamento de Matemática Aplicada y Estadística, Universidad de Cartagena, 30202 Cartagena, Spain
2Departamento de Matemáticas y Computación, Universidad de La Rioja, 26004 Logroño, Spain
Received 15 October 2012; Revised 25 February 2013; Accepted 16 April 2013
Academic Editor: Shukai Duan
Copyright © 2013 S. Amat et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We study the dynamics of some Newton-type iterative methods when they are applied of polynomials degrees two and three. The methods are free of high-order derivatives which are the main limitation of the classical high-order iterative schemes. The iterative schemes consist of several steps of damped Newton's method with the same derivative. We introduce a damping factor in order to reduce the bad zones of convergence. The conclusion is that the damped schemes become real alternative to the classical Newton-type method since both chaos and bifurcations of the original schemes are reduced. Therefore, the new schemes can be utilized to obtain good starting points for the original schemes.
One of the most important and usual problems in numerical analysis is finding the solutions of a nonlinear equation: where is a function, with . To approximate the solutions of these equations, iterative methods can be used. There are many iterative methods with different properties but the most commonly used is Newton’s iterative method:
This method and its variants have been studied by many authors since it was proposed by Newton in 1669. It is well known that under certain assumptions related to the starting point and to the function the method provides a sequence that converges quadratically to a solution of (1).
The classical third-order schemes, such as Halley or Chebyshev methods, evaluate second-order Fréchet derivatives. These evaluations are very time consuming for systems of equations. Indeed, let us observe that, for a nonlinear system of equations and unknowns, the second Fréchet derivative has entries. In particular, these methods are hardly used in practice. For that reason, we are interested in the study of methods that increase the order but evaluating only first-order Fréchet derivatives. The methods consist of two (or more) steps of the Newton method having the same derivative, other main advantage of these methods relays on the fact that if we consider a system of equations only one decomposition is necessary in each iteration. Because of these two properties the schemes are considered a real alternative to the classical Newton method.
On the other hand, we can find a rigorous and useful procedure to find the best scheme in families of Newton-type methods with frozen derivatives in . For most of the cases, the most efficient candidate of the family is the two-step iterative method. We will study all this family but with special attention to the two-step scheme.
In this paper, our main purpose is to study the dynamics of the discrete system defined by the methods but introducing a damping factor . We are interested to search chaos or sensitive dependence on initial conditions for this discrete dynamical system. In , Hurley and Martin showed that the classical Newton iterative method exhibits chaos for a large class of functions (see also ). The introduction of the damping factor not only reduces the order of convergence but also reduces the chaos and the bifurcations as we will see in Sections 3 and 4. In particular, we can utilize these schemes as starting points for the classical Newton schemes. We conclude this paper by comparing the damped method with the original one and the successive damped high-order methods that come from using more Newton’s steps.
The paper is organized as follows. In Section 2 we introduce our new scheme and present the associated scaling theorem. The scaling theorem allows up to suitable change of coordinates, to reduce the study of the dynamics of iterations of general maps, to the study of specific families of iterations of simpler maps. The dynamics for polynomials of degree-two and three, having chaotic dynamics in some cases, are presented in Sections 3 and 4, respectively. In these sections, we observe that the inclusion of the damping factor reduces the bad zone of convergence. In Section 5 we give the main conclusions drawn from the study and we summarize the benefits to include the damping factor. Finally, we propose the use of damped methods in order to find good starting points for the original methods.
2. A Damped Newton-Type Iterative Method
Our first goal is to analyze the dynamics of a modification of the following third-order iterative root-finding method :
This iterative root-finding algorithm is defined by the following iterative function: where and . In other words, . The dynamics of this method were studied in . Now, we introduce a damping factor and we analyze its influence on the dynamics in the iterative method (4). By introducing the damping factor the root-finding algorithm has the following form:
Thus the following iterative function describes the root-finding algorithm: where .
Notice that it is easy to proof that the roots of the function are fixed points of . Moreover, we have that
In particular, if is a simple root of , that is, and , then . Thus every simple root of is an attracting point of and for a superattracting fixed point. If is a multiple root of multiplicity of , then it is an attracting fixed point for every value of . There are fixed points of different from the roots. These points are called extraneous fixed points. In , Amat et al. showed that this method for (without damping factor) presents chaos and bifurcations when it is applied to a one-parameter family of cubic polynomials. Chaos behavior are related to the existence of points such that and .
When we apply the iterative method to a polynomial, we may have some problems, since we obtain a rational map, say , where and , are polynomials, that we may suppose without common factors. The difficulty arises at those points where the evaluation of numerator is nonzero and the denominator is zero, one such points correspond to the poles of the iterative method.
In order to study the dynamics of by means of graphical analysis we consider it as a map on . For this, let be given by . This map is an homeomorphism from into . Define the maps by , where is the iterative root-finding method introduced above for a map . We may extend to maps from into itself. We use the same notation for this extension. Note that the extended function has fixed points at and at and that these fixed points are repelling.
Now we have the following useful result.
Theorem 1 (the scaling theorem). Let be an analytic function, and let , with , be an affine map. Let . Then ; that is, and are affine conjugated by .
Proof. We have
On the other hand, since and , then , and by an easy induction process it follows that . Hence, .
Substituting these quantities in we obtain
Finally, by a comparison of Taylor series expansions of and , we obtain
This ends the proof.
The theorem remains valid for any nonzero constant such that .
The Scaling Theorem allows up to suitable change of coordinates, to reduce the study of the dynamics of iterations , to the study of specific families of iterations of simpler maps. For example, each quadratic polynomial , with , that we suppose that is monic, by an affine change of variables reduces to one of the following polynomials: (i), (ii), (iii),
depending on the number of real roots of (two, one (double), or not real roots). Therefore the study of the dynamics of , when it is applied to a quadratic polynomial, reduces to the study of the dynamics of where , up to affine change of variables. On the other hand, the study of the dynamics of the iterative method reduces to the study of the dynamics of the interval map . Similarly, any cubic polynomial reduces to one of the simplest cubic polynomials:(I),(II), (III), (IV).
The last one is an appropriate rescaling that puts inside the conjugacy class.
3. Quadratic Polynomials
Following the analysis of Section 2, we have to study three cases.
Case 1 (). In this case form (6) we have This function for is a linear contraction. The unique fixed point are , which is a global attractor, but not super-attracting. Therefore, its dynamics is trivial.
Case 2 (). For from (6) and (7) we have that Now the fixed points of are and . The points are the roots of , and we have that ; thus are attracting fixed points for , and superattracting for . On the other hand, we have that . Thus, the extraneous fixed points are repelling. Note that has a vertical asymptote at .
It is clear that restricted to the interval has an invariant Cantor set of zero Lebesgue measure of nonescaping points; that is, is the set of points whose orbits remain in the interval under iteration by . In other words, these points are not attracted to one of the superattracting fixed points of (note that when the fixed points are superattracting).
From the above analysis, we have that the orbit of any point is attracted to one of the superattracting fixed points of . Consequently, the orbit of any point in is attracted to one of the fixed points of .
Thus we can define the “bad zone” as since if , then it is not attracted by any of the attracting points of .
Lemma 2. The “bad zone” of the damping two-step Newton-like method defined in (6) applied to quadratic polynomials with two different roots decreases with the damping parameter .
Proof. We begin by calculating
So we have that
Thus is an interval centered in and width . It is easy to see that decreases when decreases. Taking into account that the functions and are increasing functions, it follows that decreases as so with smaller we have smaller .
4. Cubic Polynomials
In this section we consider cubic polynomials. As we have seen in Section 2, by an affine change of coordinates, every cubic polynomial reduces to one of the simplest or to a member of the one-parameter family of cubic polynomials . Therefore, we analyze the dynamics of these simpler cubic polynomials.
Case 4 (). In this case, has only one real root at , and the method (6) has the following form:
Since for all , it follows that has no critical points; hence, is a global homeomorphism from into itself and its dynamics is trivial.
Case 5 (). In this case has 3 real roots, , and . is given by (6) Notice that has two asymptotes at the points and . We have that when , then , and when , then . If we now calculate the fixed points of , there exist 9 fixed points which are the three roots of and the following extraneous fixed points:
where and . Evaluating all these points in (7), we obtain that the first 3 ones (the roots of ) are attracting fixed points for every and superattracting for . The extraneous fixed points are repelling ones since : In particular, the dynamics is trivial.
Case 6 (). The function only has one triple root at . We have that (6) has the following form: which is a linear contraction for every value of . The only fixed point is attracting, but not superattracting and the dynamics of is trivial.
Case 7 (). We have from (6) that We are going to analyze in this section the dynamics of depending on the two parameters and . Our main purpose is to compare the results by fixing the parameter for different values of the damping parameter and to study how it changes the dynamics.
We begin by studying the case . In this case, our function has two critical points: . Let be . Notice that has a double root at the positive critical point . Hence, this value of the parameter will be very significant in the study of the dynamics.
We have three different possibilities. (i)If , the polynomial has three real roots. (ii)If , the polynomial has one positive double real root and a simple one which is negative. (iii)If , the polynomial has only one real root.
For the iterative method has two vertical asymptotes. has 7 fixed points, the 3 real roots of the polynomial (attracting fixed points), and the extraneous fixed points (repelling). See Figure 9 as an example. As we can observe in Figures 10, and 11 if the damping factor decreases, then extraneous fixed points tend to be closer to the asymptotes.
For the iterative method has two vertical asymptotes at and , as we can see in Figure 12. Notice that and . has 3 fixed points, the one which corresponds to the real solution of the polynomial is attracting and two repelling extraneous fixed points. Again we obtain that when the damping factor decreases the chaotic zone also decreases.
Now we are going to consider the simplest case which corresponds to , and we have This map has one attracting point at which corresponds to the root of . Moreover it has another two extraneous fixed points which are the real solutions of the equation: As we see in Figure 13 both extraneous fixed points are repelling.
Now if we focus our attention on the damping factor, we obtain that when decreases, the extraneous fixed points tend to be closer to the asymptote . This behavior can be observed in Figures 14 and 15. Notice that is the critical point of .
The last study is related with . Notice that for, every value of , presents a maximum which increases when decreases. Moreover there exists a value that depends on the value of the damping factor, such that, for each , has only one fixed point (the root of the function) and the dynamics is trivial. In Table 1, it shows the different approximations of for some values of . Figure 16 illustrates this case.
When , presents another fixed point which is a saddle node (as Amat et al. showed in ) and when the parameter decreases, it appears bifurcations. If we now see Figures 17, 18, 19, and 20, it is clear that the problems decrease with ; even for small values () they seem they disappear.
Finally, we conclude with the following conjecture: if with , then has only three fixed points.
5. Concluding Remarks
In this work we have analyzed the dynamics of a new damped third-order Newton-like method. We have stated the following conclusions drawn from the study (i)The connected component of the basin of attraction increases when the damping factor decreases. (ii)The sizes of the chaotic and the bifurcation zones decrease when the damping factor decreases. (iii)The nonconvergence zone decreases when the damping factor decreases.
In addition, we have performed a similar study including more Newton’s steps. The conclusions remain valid. Figures 21, 22, 23, and 24 show examples of the behavior with more Newton’s steps. Therefore, we can propose the use of damped methods in order to find good starting points for the original methods. We would like to analyze these hybrid methods in a forthcoming paper. We are also interested to analyze the situation of nonfixed damping factors.
The authors would like to thank the referees and the editor of AAA for their suggestions in the first draft of this paper. Research of the first two authors is supported in part by FEDER MTM 2010-17508 and 08662/PI/08. Research of the third author is supported in part by MTM2011-28636-C02-01.
- S. Amat, S. Busquier, Á. Grau, and M. Grau-Sánchez, “Maximum efficiency for a family of Newton-like methods with frozen derivatives and some applications,” Applied Mathematics and Computation, vol. 219, no. 15, pp. 7954–7963, 2013.
- M. Hurley and C. Martin, “Newton's algorithm and chaotic dynamical systems,” SIAM Journal on Mathematical Analysis, vol. 15, no. 2, pp. 238–252, 1984.
- M. Hurley, “Attracting orbits in Newton's method,” Transactions of the American Mathematical Society, vol. 297, no. 1, pp. 143–158, 1986.
- A. Cordero, J. R. Torregrosa, and P. Vindel, “Dynamics of a family of Chebyshev-Halleytype methods,” Applied Mathematics and Computation, vol. 219, no. 16, pp. 8568–8583, 2013.
- J. M. Gutiérrez, M. A. Hernández, and N. Romero, “Dynamics of a new family of iterative processes for quadratic polynomials,” Journal of Computational and Applied Mathematics, vol. 233, no. 10, pp. 2688–2695, 2010.
- G. Honorato, S. Plaza, and N. Romero, “Dynamics of a higher-order family of iterative methods,” Journal of Complexity, vol. 27, no. 2, pp. 221–229, 2011.
- S. Plaza and N. Romero, “Attracting cycles for the relaxed Newton's method,” Journal of Computational and Applied Mathematics, vol. 235, no. 10, pp. 3238–3244, 2011.
- W. Yang, “Symmetries of the Julia sets of Newton's method for multiple root,” Applied Mathematics and Computation, vol. 217, no. 6, pp. 2490–2494, 2010.
- F. A. Potra and V. Pták, Nondiscrete Induction and Iterative Processes, vol. 103 of Research Notes in Mathematics, Pitman, Boston, Mass, USA, 1984.
- S. Amat, S. Busquier, and S. Plaza, “Chaotic dynamics of a third-order Newton-type method,” Journal of Mathematical Analysis and Applications, vol. 366, no. 1, pp. 24–32, 2010.