• Views 600
• Citations 0
• ePub 11
• PDF 189
`International Journal of Computational MathematicsVolume 2014, Article ID 321585, 16 pageshttp://dx.doi.org/10.1155/2014/321585`
Research Article

On the Dynamics of Laguerre’s Iteration Method for Finding the th Roots of Unity

1Mathematics Department, Augsburg College, 2211 Riverside Avenue, Minneapolis, MN 55454, USA
2Augsburg College, 2211 Riverside Avenue, Minneapolis, MN 55454, USA

Received 8 May 2014; Accepted 21 August 2014; Published 26 November 2014

Copyright © 2014 Pavel Bělík 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.

Abstract

Previous analyses of Laguerre’s iteration method have provided results on the behavior of this popular method when applied to the polynomials , . In this paper, we summarize known analytical results and provide new results. In particular, we study symmetry properties of the Laguerre iteration function and clarify the dynamics of the method. We show analytically and demonstrate computationally that for each the basin of attraction to the roots is a subset of an annulus that contains the unit circle and whose Lebesgue measure shrinks to zero as . We obtain a good estimate of the size of the bounding annulus. We show that the boundary of the basin of convergence exhibits fractal nature and quasi self-similarity. We also discuss the connectedness of the basin for large values of . We also numerically find some short finite cycles on the boundary of the basin of convergence for . Finally, we demonstrate that when using the floating point arithmetic and the general formulation of the method, convergence occurs even from starting values outside of the basin of convergence due to the loss of significance during the evaluation of the iteration function.

1. Introduction

Laguerre’s iteration method (also referred to as Laguerre’s method in this paper) for approximating roots of polynomials [1] is one of the least understood methods of numerical analysis. It exhibits cubic convergence to simple roots of (complex) polynomials and linear convergence to multiple roots, thus outperforming the well-known Newton’s method that exhibits quadratic convergence to simple roots [2] or even the widely used and globally convergent Jenkins-Traub method, which has the order of convergence of (at least) , where is the golden ratio [3, 4]. Although Laguerre’s method is implemented in Numerical Recipes [5], it is often overlooked in designing professional software. This is, perhaps, due to the lack of complete analytical understanding of the method. However, some of the known results make it an excellent candidate in many situations. For example, it is known that the method exhibits global convergence (convergence from any initial guess) for real polynomials with real roots [3, 6]. It also allows for automatic switching to the complex domain if there are no real roots; this is due to the appearance of a square root in the definition of the method (see (2) in the next section). In general, although convergence is not guaranteed for all complex starting values, the method seems to perform very well in many cases [2].

It is the goal of this paper to provide additional insights into the performance of Laguerre’s method when applied to simple polynomials of the form . We primarily follow the work of Ray [7] and Curry and Fiedler [8] but provide additional details and clear proofs of all results. In addition, we provide computational results that demonstrate the poor performance of the method when is large and exact arithmetic is used. This is due to the fact that the basin of convergence to the roots is contained in an annulus that shrinks towards the unit circle as increases. Points in the complement of the annulus converge to the two-cycle . We also show that the boundary of the basin of convergence has fractal characteristics and becomes quite interesting for large . Finally, we present some examples to demonstrate that in the floating-point arithmetic the method in its general formulation (2) eventually converges from seemingly any initial complex value due to the loss of significance. This thus ironically contributes to the practicality of the method in this case, and it remains to be seen whether this is also the case for general polynomials.

We organize the paper similarly as in [8]. In Section 2, we introduce the method, briefly summarize known results, and provide a simpler expression for the method when applied to the polynomials . In Section 3, we formulate and prove three propositions regarding the symmetry properties of the iteration function for that simplify the analysis in the following sections. Sets in the complex plane that will play a significant role in the study of the dynamics are defined in Section 4, and their algebraic characterization is provided in the same section. The dynamics of the method on the unit circle and in the neighborhood of the two-cycle is studied in Sections 5.1 and 5.2, respectively. In Section 5.3 we provide proofs of convergence to the roots of unity when the initial guess is in a relevant annulus containing the unit circle. The boundary of the basin of convergence is contained in two annuli shown as the “gray areas” in Figure 1, and some relevant numerical results pertinent to the boundary are shown in Section 6. We conclude with Section 7, in which we summarize some of the open questions, and demonstrate the “convergence” of the method even from the basins of attraction of the two-cycle .

Figure 1: Sets of significance for . The thick solid curves are , , and , and they divide into the regions , , , and . The dots indicate the positions of the roots, the thick dashed lines are , and the thin dotted lines are . The gray annuli are discussed in Remark 5.

2. Laguerre’s Iteration Method

In this section, we provide the basic details of Laguerre’s method, mention known results, and apply the method to the polynomials with and . We will denote by the set of the two solutions such that (unless, of course, , in which case ). We will use the notation for the principal square root of ; that is, if with and , then is the principal value for the square root with argument in the interval .

Laguerre’s iteration method for complex polynomials of degree is defined as [1, 3] where denotes the Laguerre iteration function [9] given by where and where the signs are chosen so as to maximize the modulus of the denominators.

2.1. Known Results

It is known that Laguerre’s method exhibits cubic convergence to a simple root and linear convergence to a multiple root [2, 3]. It is also known that for a real polynomial with real roots, the method converges to a root from any initial guess [3]. A particular feature of interest is that even if the initial guess is a real number, convergence to a complex root can occur due to the square root in the denominator of (2). In many cases, the method seems to converge to a root from any initial guess in the complex plane, although this is not the case in general [7]. For example, consider the polynomial with , for which both the first and the second derivative vanish at , and is undefined (in what follows, we will consider the extended complex plane so that and , and forms a two-cycle of the method). It is also known [10] that if is a polynomial of degree and , then there exists a root of such that .

The Laguerre iteration function (2) is sometimes claimed to be invariant under Möbius transformations [2, 11], although the correct, weaker statement is given and proved in [7]. For the classes of quadratics and cubics of the form and , respectively, with , the Laguerre iteration function (2) can be shown to not have any free critical points [11], and a generalization to all complex quadratics and cubics is suggested based on the invariance under Möbius transformations.

2.2. Roots of Unity

When applied to the polynomial , , the Laguerre iteration function (2) for simplifies to where again the sign is chosen to maximize the modulus of the denominator. Using the principal square root of , which will result in an expression with a nonnegative real part, we can rewrite as given by

We note that the roots of are exactly the fixed points of , and it is easy to check that the derivative of vanishes at the roots, so they are attracting fixed points, and each has an open neighborhood contained in its immediate basin of attraction.

It is straightforward to check that in the case the method converges in one iteration for any initial guess . If , or if and , then ; otherwise .

In the cases with , the method has a two-cycle consisting of and in the extended complex plane . Other than this two-cycle, the method is globally convergent for [7, 8].

The behavior of Laguerre’s method is quite different in the cases with and is the subject of our interest. In the following sections, we closely follow the analysis of Curry and Fiedler [8], which in turn is based on the work of Ray [7]. We provide additional insights and graphical illustrations for some of the results. While the main focus will be on the cases with , if a result applies more generally, we will state so.

For future reference, we note that for , we have [8]

3. Symmetry Properties of the Laguerre Iteration Function

When applied to the polynomials , , the Laguerre iteration function (5) has several symmetry properties that simplify the analysis of the method in the extended complex plane . In particular, the function possesses an -fold rotational symmetry around the origin, a symmetry with respect to the real axis, and also an inversion symmetry with respect to the unit circle. In Propositions 13 we provide the precise statements.

We will use the slightly imprecise notation of [8] and denote by and any of the following angles for : In addition, we define the rays Note that the roots of lie on the rays , while the rays divide the complex plane into congruent sectors bisected by the rays .

The following proposition implies that it suffices to study the behavior of in the sector , that is, between two consecutive rays , and the rest follows by rotational symmetry. This is a special case of the invariance of the method with respect to certain Möbius transformations [2, 7].

Proposition 1. For , the Laguerre iteration function defined in (5) commutes with the rotation by an angle about the origin.

Proof. Let denote the rotation by an angle about the origin; that is, . Since , substituting into (5), we get for any and the result follows.

The following proposition implies that the behavior of in the sector is symmetric with respect to the real axis. In the case when , Proposition 1 applies.

Proposition 2. For and with , the Laguerre iteration function defined in (5) commutes with the complex conjugation .

Proof. If , then . Consequently, , and the result follows.

Finally, the Laguerre iteration function (5) also exhibits inversion symmetry with respect to the unit circle as shown in the next proposition.

Proposition 3. For , the Laguerre iteration function defined in (5) commutes with the inversion with respect to the unit circle ; that is, .

Proof. Consider first with . Using the same conjugation properties as in the proof of Proposition 2, we have We can then check by direct substitution that the same result holds also when , and the conclusion of the proposition follows.

In summary, it is enough to study the behavior of the method in the set , since the rest follows by the symmetries above.

4. Significant Sets in the Complex Plane

Consider from now on the polynomial with and the corresponding Laguerre iteration function given by (5). Following [8], we start by defining several sets in the extended complex plane relevant to the study of the dynamics of Laguerre’s method. We will provide relevant results, some of which are proved in [8].

It is stated in [8] that the sets in (11) below “contain all the dynamics” of (5). This is not quite true, as will be shown in Section 6, although these sets are of significance in the analysis. They divide into disjoint subsets and are defined as Note that, due to the use of the principal square root in (5), is continuous everywhere in except across the rays ; however, is continuous across , so the notations and are justified, since and are the boundaries of and , respectively, in . For future reference we note that is “counter-clockwise” continuous across the rays . That is, if with , then . This is not the case in the “clockwise” direction.

As in [7, 8], we next focus on the algebraic characterization of and . This will lead to a definition and study of a “characteristic function” (14) below that will allow us to determine the shapes of the boundary curves as shown in Figure 1. The figure provides an illustration of the sets in (8) and (11) for ; the cases with other values of are similar. In the figure, the three thick solid curves correspond to the solutions of (13) below and are, in the order of increasing distance from the origin, , , and . They divide into four regions: , , , and (innermost to outermost). The dots indicate the positions of the roots of . The thick dashed lines are the rays , while the thin dotted lines are the rays . The thin dashed circles have radii as defined in (18) in Remark 5 below.

Writing , , we note that both and are characterized by the same equation: Using (6), (12) is equivalent to [7, 8] where the “characteristic function” is defined as

We summarize relevant results (some stated in [8]) in the following theorem.

Theorem 4. Let , with , and let be defined as in (14). One then has the following.(1)For every , (13) has exactly three positive zeroes, , 1, and , such that . In addition, , so the zeroes converge to 1 as .(2)Each of the sets in (11) corresponds to a particular sign of : (3)The boundaries and correspond to polar curves of the form and . The function is maximized at any and minimized at any , while the function is minimized at any and maximized at any . In addition, both and are monotonic between any two consecutive angles and (see Figure 1).

Proof. (1) Let , , and define . Note that is a differentiable function and It is easy to show that . This implies that has at least three positive zeroes. From (12) and Proposition 3 it follows that, other than , the zeroes of come in reciprocal pairs, so the actual number of zeroes is an odd number greater than or equal to . As in [7, 8], we will invoke Descartes’ rule of signs. When is even, is a polynomial, so the rule can be applied directly. When is odd, we can apply it to , which is a polynomial that also satisfies (16) with replaced by . Hence, we focus on with the understanding that is handled exactly the same way. Note that can be expanded to contain at most terms with different powers of ; hence, there are at most sign changes, and has at most positive zeroes. From (16) it now follows that if had zeroes, two of them would have to have multiplicity greater than and would have to have at least positive zeroes ( between the zeroes of and at least more from the multiple roots of ). This is, however, impossible, since is another polynomial with at most terms of different powers of ; hence Descartes’ rule of signs implies that has at most positive zeroes. Consequently, has exactly simple positive zeroes as stated in the theorem.
Finally, a straightforward computation with shows that so, since is negative for and positive for , we have that . Application of L’Hôpital’s rule shows that as .
(2) This part follows from the definition of the relevant sets in (11) and from replacing the equality in (12) by inequalities, which results in inequalities in (13) [8].
(3) Since for every there are unique values of and , we can think of and as polar curves. To prove all of the remaining statements in this part, it is enough to consider for , since the rest follows by the symmetries discussed earlier. Note that the cosine term in (14) is the largest for , so on the circle , as a function of , is the largest (and equal to ) exactly when . Thus, is negative on the circle for every , and it follows that for all . Similarly, the cosine term is the smallest when , and by a similar argument we get for all . Finally, to prove the last assertion, we implicitly differentiate (13) with respect to and observe that vanishes only when and does not exist only when , since the numerator contains a factor and the denominator is positive on as the proof of part (1) implies. This concludes the proof of the theorem.

Remark 5. As in [8], we define the values by The four circles with radii are shown in Figure 1 as dashed circles, and the annuli and are shaded gray.

5. Dynamics of the Laguerre Iteration Function

5.1. Dynamics on the Unit Circle

In this section, we study the dynamics on the unit circle, . As a consequence of Theorem 4, part (1), we have that the unit circle, , is invariant under the Laguerre iteration function (see also [8]). This follows from (13) and (12) with . However, more can be said about the behavior of on .

Proposition 6. Let . If , then the sequence of iterates of Laguerre’s method, , converges monotonically to the nearest root of in the sense that and the arguments of monotonically approach the argument of the nearest root as . If , then the iterates converge monotonically to the nearest root of in the clockwise direction.

Proof. Due to the symmetry properties of (Propositions 1 and 2), it is enough to assume with and show that with . Since the sequence of arguments generated by the method will then be a decreasing sequence bounded below by , it will converge, and the corresponding sequence of points on will converge to a fixed point of , that is, to a root of by the continuity of away from . The limiting root will have to be and both assertions of the proposition will follow.
To prove that , we first note that where the numerator and the denominator are conjugates of each other and . Thus the whole fraction results in an expression of the form with , where Consequently, and it remains to show that . Consider the function One can verify that and since we conclude that for .

5.2. Dynamics of the Two-Cycle

As we mentioned earlier, the Laguerre iteration function (5) has a two-cycle for . We now show that this two-cycle is attracting for and its basin of attraction contains a significant portion of . We will demonstrate later in Section 6 that the basin of attraction can be quite complicated and appears to have a fractal boundary. For the rest of Section 5 we assume .

The following proposition appears in [8]. It shows that the innermost and the outermost white regions in Figure 1 belong to the basin of attraction of the two-cycle. We provide our own proof for the second part of the proposition, as the original proof in [8] appears to assume the continuity of the Laguerre iteration function throughout the complex plane.

Proposition 7. Let be as defined in (18). Let and . Then and . Moreover, is contained in the basin of attraction of the two-cycle .

Proof. The proof of the first part follows that of [8]. Note first that Theorem 4 implies that and . Hence, if , then and . Similarly, if , then and .
To prove the second part, it is enough to show that the basin of attraction of the two-cycle contains . It follows from the previous part that if , then and , and, consequently, . Similarly, if , we have . We will show that for the even terms of the sequence converge to and the odd ones to . To this end, we observe that is a decreasing, bounded, and therefore convergent sequence. If its limit is , we are done, since and as .
Assume now that and, using the Bolzano-Weierstrass theorem, consider a convergent subsequence of and its limit, say, . We then have that if is not in , or if and approaches it counter-clockwise, then, by the continuity of and , we have a contradiction. The only remaining possibility is that and it is not possible to extract a subsequence approaching it counter-clockwise. In that case is (eventually) approached clockwise, and we can consider a sequence symmetric via a reflection through (Propositions 1 and 2). We then obtain a contradiction for this new sequence as in the previous case.

Remark 8. The regions and defined in Proposition 7 can be seen in Figure 1: is the open ball not containing bounded by the smaller gray annulus, while is the region on the outside of the larger gray annulus.

Although the basin of attraction of the two-cycle is significantly larger than (see Section 6), we can immediately extend it in the following sense.

Corollary 9. The sets and are contained in the basin of attraction of the two-cycle .

Proof. From the definitions of and in (11) it is clear that any point in or gets mapped into , and the claim follows.

We believe that the points and also converge to the two-cycle. Since these points belong to the set , their images under the Laguerre iteration map (5) lie on the circles with radii and , respectively, so it suffices to show that their arguments are different from . We have not been able to find a simple proof for this statement.

5.3. Dynamics of the Basins of Convergence

In Proposition 10 we state a result [8] that shows that the open annulus bounded by the gray annuli in Figure 1 belongs to the basin of attraction of the roots of . Again, it turns out that the basin is actually larger than the annulus (see Section 6). We provide an elementary proof of the final statement of Proposition 10, since in the proof in [8] a reference is made to [6], which does not appear relevant to the proof.

Proposition 10. Let be defined as in (18). Let and . Then , and the sequence with converges to a root of .

Proof. We provide a proof along the lines of [8]. First, if , then from the definition of . Using (6) and , we obtain (see [8] for details), so we can conclude that . In exactly the same fashion, for we obtain , and, again, . In view of Proposition 6, we can conclude that for any .
We know from Proposition 6 that if , then converges to a root of . It follows from the above inequalities that for we have and, consequently, the sequence is decreasing and convergent. This sequence converges to (and ), since otherwise we can consider a subsequence (not relabeled) such that , extract a further subsequence such that , and argue as in the proof of Proposition 7 that , contradicting the inequalities in (23).
Finally, for and the sequence , consider a convergent subsequence and its limit . If , then the sequence converges to a root of by Proposition 6. By the continuity of and the fact that converges to monotonically in the sense of Proposition 6, we have for any . This implies that there exist a large enough and a large enough such that is in the basin of attraction of the root , and, therefore, the whole sequence converges to . In particular, .
The remaining case with the limit of the subsequence satisfying can be treated as in the proof of Proposition 7 by considering further subsequences approaching clockwise or counter-clockwise; in either cases we obtain a contradiction, since arguing as in the previous paragraph we conclude that has to be a root of .

We again have an extension of the above proposition, arguing as in the proof of Corollary 9.

Corollary 11. The sets and are contained in the basin of attraction of the roots of unity.

However, the remaining points on the circles and form nontrivial, finite two-cycles [7, 8].

Proposition 12. For every , the set with defined in (18) is a two-cycle for the Laguerre iteration function (5).

Proof. By Proposition 1, we can assume . From (5) we have that maps real, positive numbers to real, positive numbers, so since . Similarly, since .

For completeness, we state the following result that completes the dynamics on .

Proposition 13. For every , the set belongs to the basin of attraction of the two-cycle for the Laguerre iteration function (5).

Proof. The proof is similar to the proof of the second part of Proposition 7. For , we get , so with . Now, if , we would have the contraction and we would also obtain by the continuity of . Therefore, , and the rest follows by the symmetry properties of the Laguerre iteration function.

Finally, the following result clearly demonstrates that Laguerre’s method is not suitable for finding roots of unity for large-degree polynomials [7].

Proposition 14. Let be as defined in (18). The set of all points in for which Laguerre’s method (1) converges to a root of , , is contained in the annulus , whose Lebesgue measure tends to as .

Proof. The claim follows from Proposition 7 and Theorem 4, part (1).

6. The Basins of Convergence and Their Boundaries

In this section we present primarily computational results that address the structure of the basins of attraction of Laguerre’s method (1) applied to with . All numerical results have been generated using the free software package GNU Octave [12, 13]. These results show that the basins of attraction do not coincide with the sets defined in (11), and they raise additional questions that we summarize in the next section.

We mentioned earlier that for it takes one iteration to get to a root of from any initial guess. It is also known that for and the method is globally convergent to a root of (except for when the initial guess ) [7, 8, 11]. However, from the above analysis it follows that for this is no longer true; more specifically, the basin of attraction for each is contained in the annulus with given in (18). Since is not easily computable, we can use the upper bound (see Theorem 4). In Figures 2 and 3, we present examples of the basins of attraction for (Figure 2) and , , , and (Figure 3). These are plotted on the squares and show that the upper bound is a good estimate of . Also plotted are the curves and and we see that the basins of attraction do not coincide with any of the sets of significance defined in (11). Also note how, in accordance with Theorem 4, the basin of convergence shrinks as increases. This is demonstrated in Figure 4, where the basins for , , , and are plotted on the same scale.

Figure 2: Numerically computed basins of attraction of Laguerre’s method applied to the polynomials with , , , and (row-wise, left to right). Each color corresponds to a basin of attraction of a root in the basin. The two black curves in each image are and , and the dots represent the roots of . Note how the boundary of the basin of attraction tracks but does not coincide with and appears fractal.
Figure 3: Numerically computed basins of attraction of Laguerre’s method applied to the polynomials with , , , and (row-wise, left to right).
Figure 4: Numerically computed basins of attraction of Laguerre’s method applied to the polynomials with , , , and (row-wise, left to right) shown on the same square.

The boundary of the basin of convergence appears fractal (see, e.g., [14] for more on fractals). We demonstrate this in Figure 5, where we show parts of the external boundary of the basins of convergence in the sectors with for , , , and . By the rotational symmetry, Proposition 1, the other parts of the external boundary are congruent to the displayed ones.

Figure 5: Parts of the basins of convergence to roots of for , , , and . They correspond to the sectors with and indicate that the boundaries of the basins of convergence are fractal.

The boundaries displayed in Figure 5 appear self-similar, but they are only quasi-self-similar (see, e.g., [14, 15] for more on quasi-self-similarity). We demonstrate this observation in Figure 6, where we can see slight changes of shape as we zoom in and also as we more carefully examine the shapes within each figure.

Figure 6: Three consecutive zoom levels into a part of the boundary for clearly demonstrate that the boundary of the basin of convergence is not self-similar only quasi-self-similar.

In addition, it came to us as quite a surprise; it seems that the basins of convergence as shown in color in Figures 2 and 3 are not, in general, (disregarding the “hole” in the middle) simply connected or even connected! In Figures 7 and 8 we present results with and , respectively, and several consecutive zooms into the “gray area” shown in Figure 1. Note the intricate structure that becomes more prominent for larger values of . Both figures clearly demonstrate the disconnectedness of the basin of attraction of the roots of . We chose the values of and since the “holes’’ become detectable with a naked eye around and we could zoom into them, and the larger value to demonstrate how much more the structure develops as increases.

Figure 7: Several consecutive zooms into two parts of the boundary for . Note that the basin of convergence is not either connected or simply connected. In particular, it appears that the basin of attraction of the roots consists of infinitely many (quasi-) self-similar disconnected sets (zooms on the left) and infinitely many (quasi-) self-similar “holes” corresponding to basins of attraction of the two-cycle (zooms on the right).
Figure 8: Several consecutive zooms into two parts of the boundary for . Much more structure and disconnectedness becomes visible compared to the case with (Figure 7). Note how the basins of convergence to the two-cycle (in white) extend through the “gray areas” and also note the (quasi-) self-similarity throughout.

7. Conclusions and Outstanding Questions

In the previous sections we have analyzed the behavior of Laguerre’s method applied to the polynomials in the extended complex plane and provided computational results demonstrating the interesting behavior of the method. We now have an almost complete understanding of the behavior of the method outside of the two gray areas that contain the boundary of the basin of convergence. We concluded that for initial guesses in the method converges to a root of (Proposition 10), and for initial guesses in the method converges to the two-cycle (Proposition 7).

The numerical results indicate that the basin of attraction of the roots and the basin of attraction of the two-cycle share a common boundary, which should then be an invariant set under the Laguerre iteration function (5) and consist only of finite cycles and infinite orbits. We have not pursued this direction in great depth, as it would likely require extending the theory of Julia and Fatou sets [16] to functions that are not rational. Note that the Laguerre iteration function (5) is not rational even if is even due to the choice of sign in the denominator of the method. We have, however, attempted to find some short cycles, other than those given in Proposition 12, numerically in the following way. First, we used the computational software program Mathematica to generate the contour plots of and in the sector (recall the symmetries in Propositions 13), and used the visually discovered points of intersection as initial guesses for the command  FindRoot in Mathematica applied to . This way we have been able to find some -, -, and -cycles for polynomials of low degrees. In particular, it appears that -cycles in the sector only exist for with having one such -cycle each; having two; having three, and so forth. Regarding -cycles, we found two for ; four for ; eight for ; nine for ; ten for and , and so forth. Finally, -cycles appear to start at ; we found ten of them for , twelve for , and twenty-three for . Not surprisingly, we have not found any short odd-cycles, which seems reasonable due to the expected behavior of points near getting mapped close to and vice versa. We list the found - and -cycles for in Table 1, where all numbers have been computed to significant digits accuracy.

Table 1: Period four and period six cycles in the sectors for . All numbers computed to -significant-digit accuracy.

Many questions remain. What is the shape of the boundary of the basin of convergence? We see in Figures 2 and 3 that the boundary appears to track and , but it does not coincide with these sets. The boundary is fractal (Figures 5 and 6) and, moreover, has many other components in the annuli determined by and (Figures 7 and 8). It may be of interest to see whether a fractal dimension of the boundary has a simple dependence on . We speculate that the dimension might grow from to as increases from to , but we have not pursued this idea further.

It would also be interesting to see if other families of polynomials exhibit similar features to those observed for . In particular, what determines the size and shape of the basins of convergence to the roots? Is it due to the symmetry of the roots that the measure of the basins of convergence tends to zero? If so, would other symmetric arrangements of the roots yield similar results? Perhaps the questions should be reversed. Are there families of polynomials for which Laguerre’s method converges to a root except if starting from a set of zero measure? If so, what are they? We intend to look into some of these questions in future work.

We conclude with the following interesting observation. The fact that the method theoretically converges only in the small annulus in the neighborhood of the unit circle suggests that Laguerre’s method is unsuitable practically and raises a valid concern for general polynomials. On the other hand, when the method is implemented in its general formulation (2) and applied to polynomials , the resulting image of the basins of attraction may look like Figure 9, in which the basin of attraction of the roots of is shown as computed on a grid of points. Note that visually the method appears to converge from any point in the displayed squares, which is not the case when the mathematically equivalent formulation (5) is used. We allow the iterations to run to convergence (or a prescribed maximum number of iterations, in this computation) and observe convergence to apparently random roots even for initial guesses in the set of theoretical convergence to the two-cycle (compare to Figure 2(c), where the basin of attraction of is colored white). The reason for this peculiar behavior is the loss of significance in the computation of the expression in the denominator of (2). Note that both terms in the difference have leading terms , and the actual difference should be equal to . We therefore see that, for large , significant errors will occur in the computation of the square root in (2). In fact, the relative error in the computation of the square root is roughly proportional to , where is the machine epsilon, so, for example, with and the usual -bit double precision, the relative error is on the order of with as small as . Such errors then lead to the subsequent iterates attaining values from which convergence occurs. We also note that such loss of significance will occur for any polynomial of degree and large enough, since for a general polynomial of degree the difference will have a leading term of order , two orders of magnitude smaller than the leading terms of and . Perhaps this observation helps explain the popular notion that Laguerre’s method seems to converge to a root from almost any initial guess.

Figure 9: Three levels of zoom into the computed basin of attraction for using the general formulation of the method (2). (b) corresponds to Figure 2(c), (a) is a zoom into the center part of (b), and (c) is a zoom out to a square.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work was supported in part by the National Science Foundation Grant DMS-0802959 and in part by The Office of Undergraduate Research and Graduate Opportunity at Augsburg College. The authors would also like to thank an anonymous reviewer, whose careful reading of the paper and thoughtful suggestions have improved the exposition of the paper.

References

1. E. Laguerre, “Sur une méthode pour obtenir par approximation les racines d'une équation algébrique qui a toutes ses racines réelles,” Oeuvres de Laguerre, vol. 1, pp. 87–103, 1898.
2. B. Parlett, “Laguerre's method applied to the matrix eigenvalue problem,” Mathematics of Computation, vol. 18, pp. 464–485, 1964.
3. A. Ralston and P. Rabinowitz, A First Course in Numerical Analysis, Dover Publications, Mineola, NY, USA, 2nd edition, 2001.
4. J. A. Ford, “A generalization of the Jenkins-Traub method,” Mathematics of Computation, vol. 31, no. 137, pp. 193–203, 1977.
5. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical recipes. The Art of Scientific Computing, Cambridge University Press, Cambridge, UK, 3rd edition, 2007.
6. E. Bodewig, “Sur la méthode Laguerre pour l'approximation des racines de certaines équations algébriques et sur la critique d'Hermite,” Indagationes Mathematicae, vol. 49, pp. 570–580, 1946.
7. T. L. Ray, Laguerre's method for finding complex roots [Ph.D. thesis], Stevens Institute of Technology, Hoboken, NJ, USA, 1966.
8. J. H. Curry and S. L. Fiedler, “On the dynamics of Laguerre's iteration: ${Z}^{n}-1$,” Physica D, vol. 30, no. 1-2, pp. 124–134, 1988.
9. P. Henrici, Applied and Computational Complex Analysis, vol. 1, Wiley- Interscience, New York, NY, USA, 1974.
10. W. Kahan, “Laguere's method and a circle which contains at least one zero of a polynomial,” SIAM Journal on Numerical Analysis, vol. 4, no. 3, pp. 474–482, 1967.
11. V. Drakopoulos, “Are there any Julia sets for the Laguerre iteration function?” Computers & Mathematics with Applications, vol. 46, no. 8-9, pp. 1201–1210, 2003.
12. Octave Community, “GNU Octave 3.8.1,” 2014, http://www.gnu.org/software/octave/.
13. J. W. Eaton, D. Bateman, and S. Hauberg, Gnu Octave Version 3.0.1 Manual: A High-Level Interactive Language for Numerical Computations, CreateSpace Independent Publishing Platform, 2009, http://www.gnu.org/software/octave/doc/interpreter.
14. K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, John Wiley & Sons, 2nd edition, 2003.
15. J. McLaughlin, “A note on Hausdorff measures of quasi-self-similar sets,” Proceedings of the American Mathematical Society, vol. 100, no. 1, pp. 183–186, 1987.
16. J. Milnor, Dynamics in One Complex Variable, Princeton University Press, 3rd edition, 2006.