The Steffensen method for solving the equation f (x) = 0 uses the formula
in which g(x) = { f [x + f (x)] − f (x)}/ f (x). It is quadratically convergent, like Newton’s method. How many function evaluations are necessary per step? Using Taylor series, show that g(x) ≈ f ′(x) if f (x) is small and thus relate Steffensen’s iteration to Newton’s. What advantage does Steffensen’s have? Establish the quadratic convergence.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.