Home Articles FAQs XREF Games Software Instant Books BBS About FOLDOC RFCs Feedback Sitemap

Newton-Raphson iteration

You are here: irt.org | FOLDOC | Newton-Raphson iteration

<algorithm> An iterative algorithm for solving equations. Given an equation,

	f x = 0

and an initial approximation, x(0), a better approximation is given by:

	x(i+1) = x(i) - f(x(i)) / f'(x(i))

where f'(x) is the first derivative of f, df/dx.

Newton-Raphson iteration is an example of an anytime algorithm in that each approximation is no worse than the previous one.


Nearby terms: new talk « New Testament « Newton « Newton-Raphson iteration » Newton's method » NewWave » NewYacc

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb