the iteration is xn+1 = xn – f(xn)/f ′(xn), n = 0,1,2,…
where x0 is an approximation to the solution. For the system f(x) = 0, f = (f1,f2,…,fn)T, x = (x1,x2,…,xn)T,
the iteration takes the mathematical form xn+1 = xn – J(xn)–1f(xn), n = 0,1,2,…
where J(x) is the n×n matrix whose i,jth element is fi(x)/xj
In practice each iteration is carried out by solving a system of linear equations. Subject to appropriate conditions the iteration converges quadratically (ultimately an approximate squaring of the error occurs). The disadvantage of the method is that a constant recalculation of J may be too time-consuming and so the method is most often used in a modified form, e.g. with approximate derivatives. Since Newton's method is derived by a linearization of f(x), it is capable of generalization to other kinds of nonlinear problems, e.g. boundary-value problems (see ordinary differential equations).
"Newtons method." A Dictionary of Computing. . Encyclopedia.com. (August 14, 2018). http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/newtons-method
"Newtons method." A Dictionary of Computing. . Retrieved August 14, 2018 from Encyclopedia.com: http://www.encyclopedia.com/computing/dictionaries-thesauruses-pictures-and-press-releases/newtons-method