Secant method vs Newton's method
- From: Schizoid Man <schiz@xxxxxx>
- Date: Thu, 21 Sep 2006 22:29:08 +0100
Hi,
Under what circumstances would I prefer the secant method to Newton's method?
Newton's method converges much faster and the number of function calls seem to be the same (if we assume the derivative is a function call).
.
- Follow-Ups:
- Re: Secant method vs Newton's method
- From: dcorbit
- Re: Secant method vs Newton's method
- From: Jentje Goslinga
- Re: Secant method vs Newton's method
- From: Julian V. Noble
- Re: Secant method vs Newton's method
- From: arithmeticae
- Re: Secant method vs Newton's method
- From: Herman Rubin
- Re: Secant method vs Newton's method
- From: Bernard Danloy
- Re: Secant method vs Newton's method
- From: DP
- Re: Secant method vs Newton's method
- From: Robert Israel
- Re: Secant method vs Newton's method
- From: Richard Harter
- Re: Secant method vs Newton's method
- Prev by Date: Forurier analysis of data with jumps
- Next by Date: Iterative Methods Library (IML++ with SparseLib++)
- Previous by thread: Forurier analysis of data with jumps
- Next by thread: Re: Secant method vs Newton's method
- Index(es):