A study of accelerated Newton methods for multiple polynomial roots

Numerical Algorithms

Volumn 54, Issue 2, 2010, Pages 219-243

  Galántai, Aurél ^a   Hegedűs, Csaba J ^b  

^a OBUDA UNIVERSITY   (Hungary)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Convergence acceleration; Multiple zeros; Multiplicity estimates; Newton method; Polynomials

Indexed keywords

EID: 77952107147     PISSN: 10171398     EISSN: 15729265     Source Type: Journal    
DOI: 10.1007/s11075-009-9332-x     Document Type: Article

References (34)

1. Bodewig, E.: On types of convergence and behavior of approximations in the neighborhood of a multiple root of an equation. Q. Appl. Math. 7, 325-333 (1949).
2. Channabasappa, M.: A note on the computation of multiple zeros of polynomial by Newton's method. BIT 19, 134-135 (1979).
3. Crouse, J. E., Putt, C. W.: Roots of Polynomials by Ratio of Successive Derivatives. Technical Report, NASA TN D-6793, NASA, Washington (1972).
4. Delahaye, J.-P.: Sequence Transformations. Springer, New York (1988).
5. Hansen, E., Patrick, M.: Estimating the multiplicity of a root. Numer. Math. 27, 121-131 (1976).
6. Henrici, P.: Elements of Numerical Analysis. Wiley, New York (1964).
7. Hernández Verón, M. A.: A note on Halley's method. Numer. Math. 59, 273-276 (1991).
8. Hernández Verón, M. A.: Newton-Raphson's method and convexity. Univ. u Novom Sadu, Zb. Rad. Prirod. Mat. Fak., Ser. Mat. 22(1), 159-166 (1992).
9. Hernández M. A., Salanova, M. A.: Indices of convexity and concavity. Application to Halley method. Appl. Math. Comput. 103, 27-49 (1999).
10. Hull, T. E., Mathon, R.: The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence. ACM Trans. Math. Softw. 22, 261-280 (1996).
11. Igarashi, M., Ypma, T.: Relationships between order and efficiency of a class of methods for multiple zero of polynomials. J. Comput. Appl. Math. 60, 101-113 (1995).
12. Igarashi, M., Ypma, T.: Empirical versus asymptotic rate of convergence of a class of methods for solving polynomial equations. J. Comput. Appl. Math. 82, 229-237 (1997).
13. Jenkins, M., Traub, J.: Principles for testing polynomial zerofinding programs. ACM Trans. Math. Softw. 1, 26-34 (1975).
14. Kahan, W.: Lecture notes on real root-finding. http://www. cs. berkeley. edu/~wkahan/Math128/RealRoots. pdf (2004).
15. King, R.: Improving the van de Vel Root-Finding method. Computing 30, 373-378 (1983).
16. Kravanja, P., Haegemans, A.: A modification of Newton's method for analytic mappings having multiple zeros. Computing 62, 129-145 (1999).
17. Krishnamurty, E. V., Sen, S. K.: Computer Based Numerical Algorithms. Affiliated East-West Press Pvt. Ltd., New Delhi (1976).
18. Lang, M., Frenzel, B. C.: A New and Efficient Program for Finding All Polynomial Roots. Technical Report #9308, Rice University, Houston (1994).
19. Madsen, K.: A root-finding algorithm based on Newton's method. BIT 13, 71-75 (1973).
20. Madsen, K., Reid, J. K.: FORTRAN Subroutines for Finding Polynomial Zeros. Technical Report A. E. R. E. R. 7986, Computer Science and System Division, A. E. R. E. Harwell, Oxfordshire (1975).
21. Mathews, J. H.: An improved Newton's method. AMATYC Rev. 10, 9-14 (1989).
22. McNamee, J.: A comparison of methods for accelerating convergence of Newton's method for multiple polynomial roots. ACM SIGNUM Newsl. 33, 17-22 (1998).
23. McNamee, J. M.: Numerical Methods for Roots of Polynomials, Part I. Elsevier, Amsterdam (2007).
24. Osada, N.: Improving the order of convergence of iteration functions. J. Comput. Appl. Math. 98, 311-315 (1998).
25. Ostrowski, A.: Solution of Equations and Systems of Equations. Academic, London (1960).
26. Rall, L.: Convergence of the Newton process to multiple solutions. Numer. Math. 9, 23-37 (1966).
27. Schröder, E.: Über unendlich viele Algorithmen zur Auflösung der Gleichungen. Math. Ann. 2, 317-365 (1870). English translation by G. W. Stewart: On Infinitely Many Algorithms for Solving Equations. Technical Report TR-92-121, University of Maryland, Department of Computer Science (1992).
28. Steiglitz, K., Dickinson, B.: Phase unwrapping by factorization. IEEE Trans. Acoust. Speech Signal Process. 30, 984-991 (1982).
29. Stewart, G.: The behavior of a multiplicity independent root-finding scheme in the presence of error. BIT 20, 526-528 (1980).
30. Traub, J.: Iterative Methods for the Solution of Equations. Prentice-Hall, Englewood Cliffs (1964).
31. van de Vel, H.: A method for computing a root of a single nonlinear equation, including its multiplicity. Computing 14, 167-171 (1974).
32. Ypma, T.: Finding a multiple zero by transformations and Newton-like methods. SIAM Rev. 25, 365-378 (1983).
33. Zeng, Z.: Computing multiple roots of inexact polynomials. Math. Comput. 74, 869-903 (2004).
34. Zeng, Z.: Algorithm 835: MULTROOT-a Matlab package for computing polynomial roots and multiplicities. ACM Trans. Math. Softw. 30, 218-236 (2004).