A Concise Introduction to Numerical Analysis by Faul A. C.;

Author:Faul, A. C.;
Language: eng
Format: epub
Publisher: CRC Press LLC
Published: 2016-03-15T00:00:00+00:00

In every iteration the algorithm overshoots the solution onto the other side further away than it was initially. The distance to the solution is doubled in each iteration.

There are also cases where Newton’s method converges, but the rate of convergence is not quadratic. For example take f(x) = x2. Then for every approximation x(n) the next approximation is

Thus the distance to the root is halved in every iteration comparable to the bisection method.

Newton’s method readily generalizes to higher dimensional problems. Given a function f: ℝm → ℝm, we consider f as a vector of m functions

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.