Scribd
Upload
89 views7 pages

Newton's Method

Newton's method is an iterative method for finding successively better approximations to the roots or zeroes of a real-valued function. It provides a general formula to calculate each next approximation (xn+1) from the current approximation (xn) and the derivative of the function (f'(xn)). The method converges if the iterations get closer to the correct answer, but may fail to converge if the derivative is zero at some point or if the limit does not exist. Examples are provided to find the intersection points of functions and approximate the root of an equation using Newton's method.

Uploaded by

Ricky Valenzuela
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views7 pages

Newton's Method

Newton's method is an iterative method for finding successively better approximations to the roots or zeroes of a real-valued function. It provides a general formula to calculate each next approximation (xn+1) from the current approximation (xn) and the derivative of the function (f'(xn)). The method converges if the iterations get closer to the correct answer, but may fail to converge if the derivative is zero at some point or if the limit does not exist. Examples are provided to find the intersection points of functions and approximate the root of an equation using Newton's method.

Uploaded by

Ricky Valenzuela
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 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

You might also like