Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-comparison-of-methods-for-accelerating-convergence-of-newton-s-POTUR0XQmd
References (22)
-
J. Stolan (1995)
An improved Sciljak's algorithm for solving polynomial equations converges quadratically to multiple zerosJournal of Computational and Applied Mathematics, 64
-
J. Traub (1982)
Iterative Methods for the Solution of Equations -
K. Madsen, J. Reid (1975)
Fortran Subroutines for Finding Polynomial Zeros -
A. Ostrowski (1973)
Solution of equations in Euclidean and Banach spaces -
M. Straeten, H. Vel (1992)
Multiple root-finding methodsJournal of Computational and Applied Mathematics, 40
-
J. McNamee (1993)
A bibliography on roots of polynomialsJournal of Computational and Applied Mathematics, 47
-
T. Miyakoda (1993)
Multiplicity estimating algorithm for zeros of a complex polynomial and its applicationsJournal of Computational and Applied Mathematics, 46
-
(1996)
A Second Supplementary Bibliography on Roots of Polynomials . Private communication -
L. Brugnano, D. Trigiante (1995)
Polynomial roots: The ultimate answer?Linear Algebra and its Applications, 225
-
M. Channabasappa (1979)
A note on the computation of multiple zeros of polynomials by Newton's methodBIT Numerical Mathematics, 19
-
E. Schröder (1870)
Ueber unendlich viele Algorithmen zur Auflösung der GleichungenMathematische Annalen, 2
-
D. Levin (1972)
Development of non-linear transformations for improving convergence of sequencesInternational Journal of Computer Mathematics, 3
-
T. Ypma (1983)
Finding a Multiple Zero by Transformations and Newton-Like MethodsSiam Review, 25
-
(1979)
A Note on the Computation of Multiple Zeros by Newton's Method -
(1870)
Uber unendlich viele Algorithmen zur Auflosung der Gleichungen . Math. Ann -
E. Hansen, M. Patrick (1976)
Estimating the multiplicity of a rootNumerische Mathematik, 27
-
(1870)
Uber unendlich viele Algorithmen zur Auflosung der Gleichun -
M. Igarashi, T. Ypma (1995)
Relationships between order and efficiency of a class of methods for multiple zeros of polynomialsJournal of Computational and Applied Mathematics, 60
-
J. McNamee (1997)
A supplementary bibliography On roots of polynomialsJournal of Computational and Applied Mathematics, 78
-
K. Madsen (1973)
A root-finding algorithm based on Newton's methodBIT Numerical Mathematics, 13
-
Q. Lin, J. Rokne (1995)
An interval iteration for multiple roots of transcendental equationsBIT Numerical Mathematics, 35
-
A. Aitken
XXV.—On Bernoulli's Numerical Solution of Algebraic Equations, 46
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1998 by ACM Inc.
- ISSN
- 0163-5778
- DOI
- 10.1145/290590.290592
- Publisher site
- See Article on Publisher Site
Abstract
Newton's method for solving polynomial equations converges only linearly to a multiple root. The speed of several methods for accelerating the convergence have been compared numerically. The Madsen-Reid method proved to be the fastest, with the Aitken and Ostrowsky methods close behind.
Journal
ACM SIGNUM Newsletter – Association for Computing Machinery
Published: Apr 1, 1998