Newton-Raphson Method for Root Finding
Translated by
ScribdTranslationsNewton-Raphson Method for Root Finding
Translated by
ScribdTranslationsJose Luis Zuñiga Piña Group: 1351
Method
Newton-Raphson
Algorithmic procedure
that allows finding roots of functions, known
Definition a numerical value close to the root. It is a method
open and iterative, generally fast
convergence, very useful for root calculation
square and of higher degree.
Representation
Origin of the
graphic
equation
Taylor's theorem for a Xo (a,b) such that F'(Xo)
it is different from zero, then:
Equation
general
About the
convergence of the method
Error and tolerance.
There is no general criterion of
the relative error is taken as if the last convergence for the Newton-Raphson method.
approximation is outside the exact value. It stops the Its convergence depends on nature
iterative process when it is less than one of the function and of the accuracy of the
previously fixed amount. initial value
Calculation of the error:
Although in general the method of
Newton-Raphson is very efficient, there are situations
where it behaves poorly.
Reference:
Burden, R., Faires, D. and Burden, A. (2017). Numerical Analysis (10th ed.). Federal District: CENGAGE Learning.
Chapra, S. and Canale, R. (2007). Métodos numéricos para ingenieros (5a. ed.). Distrito Federal: McGraw-Hill
Inter-American.