Advances in Numerical Analysis
Volume 2017 (2017), Article ID 4281684, 7 pages
https://doi.org/10.1155/2017/4281684

Research Article

The Convergence of a Class of Parallel Newton-Type Iterative Methods

Qinglong Huang

Huaide College of Changzhou University, Jingjiang, Jiangsu 214500, China

Correspondence should be addressed to Qinglong Huang; qlhuang188@163.com

Received 3 August 2016; Revised 8 December 2016; Accepted 13 December 2016; Published 5 March 2017

Academic Editor: Zhong-Zhi Bai

Copyright © 2017 Qinglong Huang. 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.

A general iterative process is proposed, from which a class of parallel Newton-type iterative methods can be derived. A unified convergence theorem for the general iterative process is established. The convergence of these Newton-type iterative methods is obtained from the unified convergence theorem. The results of efficiency analyses and numerical example are satisfactory.

1. Introduction

Attempts to improve Newton method are the subject of many papers [1–10].

Consider the following polynomial of degree :

with simple zeros .

In paper [1], a parallel iterative method for simultaneously finding all zeros of was suggested; that is,

where ; .

   are distinct initial approximations for zeros    of polynomial .

For appropriate starting values , method (2) is of convergence order three.

Suppose that is some iteration function and converges to zeros    of with convergence order .

From (2), we obtain the following parallel iterative process:

where ; .   is defined by (3). We call correction iterative function.

In particular, if , then (4) is process (2) derived in paper [1]. If Newton iterative function is chosen as , that is, and are defined by (3), then (4) is the method discussed in paper [3]. Because (2) is a modification of Newton method and (4) is an improvement to (2), so we call (4) modified Newton-type iteration method.

In this paper, a unified convergence theorem for the general modified process (4) is established in Section 2 (Theorem 2).

Moreover, in Section 3, three special iterative methods are derived from process (4) according to the choices of . These special methods are all modifications to process (2); their convergence and convergence order are obtained via the unified general convergence Theorem 2.

All these special modified methods are convergent with higher order and are more efficient than both Newton method and process (2).

In Section 4, the method is extended to find the multiple zeros of polynomial.

Finally, in Section 5, we give several numerical examples and the computation results are satisfactory.

2. General Convergence Theorem

In this section, we discuss the convergence of the general modified process (4).

Let , be the indices of iterations and

By some simple calculation, process (4) can also be expressed as follows:

where are defined by (7) and

Assume that the correction iteration function in (5) is locally convergent with convergence order for each root of ; that is, converges to root with convergence order for sufficiently good starting values   . Then we have the following Lemma 1.

Lemma 1. Let be defined by (5); then there exist constants and (independent of and ) such that

where ;  .

In fact, because converges to root with convergence order for sufficiently good starting values   , for every , there exist , , such that

Let

and then Lemma 1 holds.

In the following Theorem 2 and its proof, the constants and are defined in Lemma 1 and is the degree of .

Theorem 2. Suppose that initial approximations    satisfy . Then the iterative process (4) converges to the zeros    of , and the convergence order is .

Proof. Suppose that    satisfy the condition in Theorem 2.
Then there exists a positive constant such that

Hence from Lemma 1 we know that, for and ,

By (10), it follows that

Let

It is evident that .
Thus, from (9), we obtain that, for all ,

Generally, if   , then we can obtain analogously that

By mathematical induction, we know that (19) and (20) are valid for ;  .
From (20), we have

It is evident that (). That is,    for
Making use of (8) and (19), we have

Further, by (9) and , we have

Hence, the convergence order of method (4) with (5) is .

3. Some Special Modified Newton Methods Derived from Formula (4)

For the correction function in (5), we will make several kinds of choice and derive some special modified Newton methods from (4). Furthermore, by the convergence Theorem 2, we give the convergence and efficiency of these special modified methods.

Definition 3. For an iteration method, we define the efficiency

where is the convergence order; is the amount of computation required in every step of iteration.

Since are all polynomials, computational efficiency requires that the evaluation of these functions be done by Horner’s method [8]. Then only multiplications and additions will be required to evaluate an arbitrary polynomial of degree . Since defined by (1) is a polynomial of degree , we take multiplications or divisions as a unit of the amount of computation and take no count of additions in the following. As a consequence, the evaluation of and require approximately one unit, respectively. Now the convergence and efficiency analyses of these special modified methods can be given as follows.

(i) Newton iterative function is chosen as ; that is,

We obtain the iterative method (4) with (25) which has been considered in [3].

Because Newton iterative function is second-order convergent (), the convergence and convergence order of method (4) with (25) can be concluded from Theorem 2 directly.

Corollary 4. Suppose that initial approximations    satisfy . Then the iterative process (4) with (25) converges to the zeros    of , and the convergence order is 4; the efficiency .

(ii) Let be the Halley iterative function; that is,

Halley iterative function is of convergence order 3; therefore we have the following conclusion from Theorem 2.

Corollary 5. Suppose that initial approximations    satisfy . Then the iterative process (4) with (26) converges to the zeros    of , and the convergence order is 5; the efficiency .

(iii) Let

where .

From Corollary 4, we know (27) is 4th-order convergent, so we obtain the following conclusion from Theorem 2.

Corollary 6. Suppose that initial approximations    satisfy . Then the iterative process (4) with (27) converges to the zeros    of , and the convergence order is 6; the efficiency .

In particular, if we let , then (4) is the modified Newton method (2) (see [1]). The convergence of (2) was not proven in [1], but now its convergence follows directly from Theorem 2, and the convergence order is 3; therefore the efficiency .

By the way, according to our definition, the computational efficiency of Newton iterative method is .

For simultaneously finding polynomial zeros, it is evident that these modified Newton-type methods discussed in Corollaries 4–6 are convergent with higher order and are more efficient than both Newton method and process (2).

4. Extending the Iterative Method (4) to Find Multiple Zeros

In complex number field polynomial of degree can be factored as

are multiple zeros of polynomial .

Here    and .

By logarithmic derivation, we know that

So we get the iterative method for simultaneously finding all zeros of .

where ;  .     were distinct initial approximations for zeros    of .

When for all , the iterative method (30) shall be the iterative method (2) in Section 1.

Using the same technique as in formula (4), we obtain

Here,

For appropriate starting values , we suppose that converges to zeros    of with convergence order .

By some simple calculation, formula (31) can be expressed as follows:

where

Lemma 7. Let be defined by (32); then there exist constants and (independent of and ), such that

The proof is similar to Lemma 1.

In the following Theorem 8 and its proof, the constants and are defined in Lemma 7 and is the degree of .

Take the constant and ; we have the following Theorem 8.

Theorem 8. Suppose that initial approximations satisfy , and converges to zeros with convergence order . Then the iterative process (31) with (32) converges to zeros    with convergence order .

Proof. Suppose that    satisfy the condition in Theorem 8. Then

Therefore

Further,

Note that and ; we have

Let

Then

Generally, we can obtain analogously that

By mathematical induction, we know that (43) is valid for ;  .
From (43), we get (when ).
Let , and from (42) it is inferred that

Because , .
Hence, the convergence order of method (31) is . The proof is completed.

Let

Combine (31) and (45); we have the following Corollary 9.

Corollary 9. Suppose that initial approximations    satisfy   . Then the iterative process (31) with (45) converges to the zeros   of , and the convergence order is 4.

5. Numerical Example

In this section, we will report on three numerical examples. The computations were performed on Lenovo computer using MATLAB.

Example 1. As in [5], we consider complex polynomial of degree 10 ():

We want to find the zeros of by method (4) with (25).
The zeros of are .
In our computation, we take error (in paper [5], error ) and choose the starting values just as paper [5]; that is,

The numerical results of method (4) with (25) are listed as follows.
Numerical Results of Example 1

We see from (48) that, for method (4) with (25), after two iterations the numerical results attain the precision.

Example 2. Given a polynomial

is the so-called equation in theory of earthquake.
The exact roots of the equation or the zeros of are .
We want to find the zeros of by Newton method, process (2), and the three modified methods discussed in Corollaries 4–6. We choose starting values , and we take error .
The numerical results of process (2), method (4) with (25), method (4) with (26), and method (4) with (27) are listed in Table 1, but for Newton method we only give the final numerical results.
From Table 1, we see that, for Newton method, after eight iterations, the iteration approximations attain the precision; for method (2) with (3), after five iterations, the iteration approximations attain the precision; for method in Corollary 4, after four step iterations, the iteration approximations attain the precision; for methods in Corollary 5 and in Corollary 6, after three iterations, all the iteration approximations attain the precision. Hence, these modified Newton-type methods converge faster than both Newton method and iterative method (2).

Table 1: Numerical results of Example 2.

Iterative method
Number of iterations
Results

Method (2)
1
0.200000000000
0.375000000000
1.176470588235

2
0.243808087597
0.323805689748
1.183011463275

3
0.249955665119
0.317035707337
1.183012701892

4
0.249999999979
0.316987298131
1.183012701892

5
0.250000000000
0.316987298108
1.183012701892

Method (4) with (25)
1
0.217105263158
0.345588235294
1.184859154930

2
0.249398039932
0.317688644132
1.183012708464

3
0.249999999474
0.316987298719
1.183012701892

4
0.250000000000
0.316987298108
1.183012701892

Method (4) with (26)
1
0.231729055258
0.346042471043
1.183941605839

2
0.249920728625
0.317052319337
1.183012700566

3
0.250000000000
0.316987298108
1.183012701892

Method (4) with (27)
1
0.234609565063
0.331231334248
1.182746284452

2
0.249997316046
0.316989331975
1.183012701890

3
0.250000000000
0.316987298108
1.183012701892

Newton method
8
0.250000000000
0.316987298108
1.183012701892

Example 3. We consider polynomial . We want to find the zeros of by iterative process (31) with (45). The exact zeros of are ; the corresponding multiplicities are . We choose starting values , and , and we take error . The numerical results of the first three iterations by iterative process (31) with (45) are listed as follows.
Numerical Results of Example 3

From (50) we see that, for iterative method (31) with (45), after three iterations, all the iteration approximations attain the precision .

The numerical results computed by these new parallel Newton-type iterative methods are satisfactory.

Competing Interests

The author declares that there are no competing interests.

Authors’ Contributions

The author read and approved the final manuscript.

Acknowledgments

This paper was supported by a grant from Technology Bureau of Jingjiang City and Changzhou University (CDHJZ1509008).

References

L. W. Ehrlich, “A modified Newton method for polynomials,” Communications of the ACM, vol. 10, no. 2, pp. 107–108, 1967.

G. Alefeld and J. Herzberger, “On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots,” SIAM Journal on Numerical Analysis, vol. 11, pp. 237–243, 1974.

A. W. Nourein, “An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial,” International Journal of Computer Mathematics, vol. 6, no. 3, pp. 241–252, 1977.

G. V. Milovanović and M. S. Petković, “On the convergence order of a modified method for simultaneous finding polynomial zeros,” Computing, vol. 30, no. 2, pp. 171–178, 1983.

D. R. Wang and Y. J. Wu, “Some modifications of the parallel Halley iteration method and their convergence,” Computing, vol. 38, no. 1, pp. 75–87, 1987.

C. Carstensen, “On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials,” BIT Numerical Mathematics, vol. 33, no. 1, pp. 64–73, 1993.

X. H. Wang and X. P. Guo, “On the unified determination for the convergence of Newton's method and its deformations,” Numerical Mathematies A Journal of Chinese Universities, vol. 21, no. 4, pp. 363–368, 1999.

C. Chun, “A method for obtaining iterative formulas of order three,” Applied Mathematics Letters, vol. 20, no. 11, pp. 1103–1109, 2007.

I. Păvăloiu and E. Cătinaş, “On a robust Aitken—Newton method based on the Hermite polynomial,” Applied Mathematics and Computation, vol. 287-288, pp. 224–231, 2016.

R. L. Burden and J. D. Faires, Numerical Analysis, Thomson Learning, 7th edition, 2001.