Table of Contents
Advances in Numerical Analysis
Volume 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

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

Correspondence should be addressed to Qinglong Huang; moc.361@881gnauhlq

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.

Linked References

  1. L. W. Ehrlich, “A modified Newton method for polynomials,” Communications of the ACM, vol. 10, no. 2, pp. 107–108, 1967. View at Publisher · View at Google Scholar
  2. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. 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. View at Google Scholar · View at MathSciNet
  4. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. 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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. 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. View at Google Scholar · View at MathSciNet
  8. C. Chun, “A method for obtaining iterative formulas of order three,” Applied Mathematics Letters, vol. 20, no. 11, pp. 1103–1109, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. 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. View at Publisher · View at Google Scholar · View at MathSciNet
  10. R. L. Burden and J. D. Faires, Numerical Analysis, Thomson Learning, 7th edition, 2001.