Jump to content

Talk:Secant method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Mqudsi (talk | contribs) at 21:40, 26 May 2008 (Complex roots rate of convergence?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Convergence Rate for Repeated Roots?

Is there a fixed order of convergence for repeated roots with the secant method? For instance, with the Newton-Raphson method, R=2 (quadratic) for simple roots and R=1 for repeated roots. For the Secant Method, R=1.618.... for simple roots, but what about repeated/complex roots?