You are on page 1of 7

NEWTON’S METHODS

UNIVERSITY OF LUZON

October 02, 2018

NUMERICAL METHODS

NEWTON’S METHODS
INTRODUCTION

Newton’s Method also known as the Newton-Raphson method,


named after Isaac Newton and Joseph Raphson, is a method for
finding successively better approximations to the roots or zeroes of
a real-valued function. It is one example of root-finding algorithm.

NEWTON’S METHODS
if xn is an approximation a solution of f(x)=0 and if f 0 (xn ) 6= 0 the
next approximation is given by,

General Formula
f (x0 )
x1 = x0 −
f 0 (x0 )
in terms of sequence x0 , x1 , ..., then,

f (xn )
xn+1 = xn −
f 0 (xn )

NEWTON’S METHODS
CONVERGENCE

If the iterations are getting closer and closer to the correct answer
the method is said to converge. However, Newton’s method will
not converge if:
Conditions:
• if f 0 (xn = 0) for some n
•if limn→∞ does not exist

NEWTON’S METHODS
Failure of newton’s method due to bad starting points

NEWTON’S METHODS
Finding points of Intersection

Use Newton’s Method to determine an approximation to the


solution to f (x) = x 2 − 4

NEWTON’S METHODS
Examples

Use Newton’s Method to determine the root of the equation


cos x = x that lies in the interval [0,2]. Find the approximation to
six decimal places.

NEWTON’S METHODS