Abstract
A superlinear procedure for finding a multiple root is presented. In it the secant method is applied to the given function divided by a divided difference whose increment shrinks toward zero as the root is approached. Two function evaluations per step are required, but no derivatives need be calculated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. F. Traub,Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, N.J. (1964).
L. B. Rall,Convergence of the Newton process to multiple solutions, Numerische Mathematik 9 (1966), 23–37.
T. O. Espelid,On the behavior of the secant method near a multiple root, BIT 11 (1972), 112–115.
N. Anderson and Å. Björck,A new high order method of regula falsi type for computing a root of an equation, BIT 13 (1975), 253–264.
G. W. Stewart,The convergence of multipoint iterations to multiple zeros, SIAM J. Numer. Anal. 11 (1974), 1105–1120.
H. Esser, Eine stets quadratisch konvergente Modifkation des Steffensen-Verfahrens, Computing 14 (1975), 367–369.
D. Woodhouse,A note on the secant method, BIT 15 (1975), 323–327.
H. Wozniakowski,Numerical stability for solving nonlinear equations, Numerische Mathematik 27 (1977), 373–390.
Author information
Authors and Affiliations
Additional information
Work supported by the U.S. Energy Research and Development Administration.
Rights and permissions
About this article
Cite this article
King, R.F. A secant method for multiple roots. BIT 17, 321–328 (1977). https://doi.org/10.1007/BF01932152
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932152