0% found this document useful (0 votes)
548 views3 pages

Chapter 2 - Solution of Nonlinear Equation PDF

The document describes three methods for solving nonlinear equations: 1) The bisection method iteratively divides the interval containing the root in half until finding the root to within some tolerance. 2) The Newton-Raphson method uses the tangent line to iteratively estimate better approximations to the root using the function value and derivative. 3) The simple fixed-point method rearranges the function to isolate x on the left side and iteratively applies the function to find the fixed point, which is the root.

Uploaded by

sam19961
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
0% found this document useful (0 votes)
548 views3 pages

Chapter 2 - Solution of Nonlinear Equation PDF

The document describes three methods for solving nonlinear equations: 1) The bisection method iteratively divides the interval containing the root in half until finding the root to within some tolerance. 2) The Newton-Raphson method uses the tangent line to iteratively estimate better approximations to the root using the function value and derivative. 3) The simple fixed-point method rearranges the function to isolate x on the left side and iteratively applies the function to find the fixed point, which is the root.

Uploaded by

sam19961
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/ 3

Chapter 2: Solution of nonlinear equation

2.1 Bisection method

In general, if a function f (x ) is real and continuous in the interval from x a to xb and


f ( xa ) and f ( xb ) have opposite signs, that is
f ( xa )  f ( xb )  0
then, there is at least one real root between x a and xb
Example:
x2  4x  4  0
( x  2) 2  0
x2
The bisection method is one type of incremental search method in which the interval is
always divided in half.

Steps of Bisection method.


1. Choose lower x a and upper xb guesses for the root.
x a  xb
2. An estimate of the root xm is determined by xm  .
2
3. Calculate the functions values of x a and xm .
4. Make the following evaluations to determine which subinterval the root lies:
a) If f ( xa )  f ( xm )  0 , therefore, xm  xb
b) If f ( xa )  f ( xm )  0 , therefore, xm  xa
c) If f ( xa )  f ( xm )  0 ,then the solution/root equals to xm
5. If the difference | xb  xm | ≤  , then accept xm as the solution/root.

Faculty of Engineering and Built Environment, SEGi University Kota Damansara


Prepared by: Fatin Nur Diana binti Abu Samah
2.2 Newton-Raphson Method

The Newton-Raphson method uses a straight line approximation to the function whose
zero we wish to find, in this case the line is the tangent to the curve. The approximation
to the zero is the value of x where the tangent crosses the x-axis requires additional about
the function. (its derivatives)

Given an initial estimate of the zero, x0 the value of the function x0 , y0  f ( x0 ) and the
value of the derivative at x0 , y '0  f ' ( x0 ) the x-intercept of the tangent line, which is the
new approximation to the zero is,

f ( x0 )
x1  x0 
f ' ( x0 )

The process continues until the | xi  xi 1 | ≤  , then accept xi1 .At the ith stage, we have

f ( xi )
xi 1  xi 
f ' ( xi )

Steps of the Newton-Raphson method:

1. Find the first derivative of the nonlinear function, f ' ( x)


2. Use an initial guess of the root, xi to estimate the new value of root, xi 1 as
f ( xi )
xi 1  xi 
f ' ( xi )
3. Calculate the difference, | xi 1  xi |.
4. STOP the process until the difference | xi 1  xi | ≤  , then accept xi as the root.

Faculty of Engineering and Built Environment, SEGi University Kota Damansara


Prepared by: Fatin Nur Diana binti Abu Samah
2.3 Simple Fixed-Point Method

In general, a new formula was developed for simple fixed-point iteration by rearranging
the function f ( x)  0 , so that x is on the left-hand side of equation.

x  g (x )

Steps of the Simple Fixed-Point method:

1. Develop new possible formulas from a given function, x  g (x )


2. Label the left-hand side as xi1 and the right-hand side as xi
3. Use an initial guess of the root, xi to estimate the new value of root, xi 1
4. Calculate the difference, | xi 1  xi |.
5. STOP the process until the difference | xi 1  xi | ≤  , then accept xi as the root.

Faculty of Engineering and Built Environment, SEGi University Kota Damansara


Prepared by: Fatin Nur Diana binti Abu Samah

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