Scribd
Upload
21 views2 pages

Newton Method of Solving Nonlinear Equations: Algorithm

The document describes the Newton Method for solving nonlinear equations. It provides the algorithm and steps to iteratively find the root of an equation starting with an initial guess using the Newton-Raphson formula. The method is based on drawing a tangent line to estimate an improved root at each iteration until the error is within a specified tolerance.

Uploaded by

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

Newton Method of Solving Nonlinear Equations: Algorithm

The document describes the Newton Method for solving nonlinear equations. It provides the algorithm and steps to iteratively find the root of an equation starting with an initial guess using the Newton-Raphson formula. The method is based on drawing a tangent line to estimate an improved root at each iteration until the error is within a specified tolerance.

Uploaded by

Hata
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Newton Method of Solving Nonlinear

Equations

In the Newton-Raphson method, the root is not bracketed. Only one initial
guess of the root is needed to get the iterative process started to find the root of an
equation. Hence, the method falls in the category of open methods.
Newton-Raphson method is based on the principle that if the initial guess
of the root of f(x)=0 is at xi, then if one draws the tangent to the curve at f(xi), the
point xi+1 where the tangent crosses the x-axis is an improved estimate of the root
(Figure 1).
Using the definition of the slope of a function, at

which gives

(1)

Equation (1) is called the Newton-Raphson formula for solving nonlinear


equations of the form . So starting with an initial guess, xi, one can find
the next guess, xi+1, by using equation (1). One can repeat this process until one
finds the root within a desirable tolerance.

Algorithm
The steps of the Newton-Raphson method to find the root of an equation f(x) = 0
are
1. Evaluate f(x) symbolically
2. Use an initial guess of the root, xi, to estimate the new value of the root xi+1
as

3. Find the absolute relative approximate error, as

4. Compare the absolute relative approximate error, with the pre-


specified relative error tolerance, . If > , then go to step 2,
else stop the algorithm. Also, check if the number of iterations has
exceeded the maximum number of iterations.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy