Scribd
Upload
4 views8 pages

Lecture 3

The document discusses the concepts of numerical, algebraic, and transcendental equations, defining polynomials and providing examples. It introduces the Bisection Method and the Method of Successive Approximation for finding roots of equations, detailing their processes and convergence criteria. Theorems related to the existence of roots and the conditions for convergence of approximations are also presented.

Uploaded by

Learn with Meaning
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
4 views8 pages

Lecture 3

The document discusses the concepts of numerical, algebraic, and transcendental equations, defining polynomials and providing examples. It introduces the Bisection Method and the Method of Successive Approximation for finding roots of equations, detailing their processes and convergence criteria. Theorems related to the existence of roots and the conditions for convergence of approximations are also presented.

Uploaded by

Learn with Meaning
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/ 8

Solution to Numerical,

Algebric and Transcendental


Equations
Course NO. EEE123
Course Title: Computing Method and Technique for Engineering Analysis
Introduction

• The expression of the form f ( x)  ao x n  a1 x n 1  ...  an 1 x  an


Where a’s are constants and n is a positive integer, is called a polynomial in x of degree n,
• The equation f(x) = 0 is called the algebraic equation of degree n.
• If f(x) contains some other functions like exponential, trigonometric, logarithmic etc., then
f(x) = 0 is called a transcendental equation.
For example,
x 3  3x  6  0, x 5  7 x 4  3x 2  36 x  7  0
are algebraic equations of third and fifth degree.
x 2  3 cos x  1  0, xe x  2  0, x log 10 x  1.2
are transcendental equations.
• If the coefficients are pure numbers, they are called numerical equations.

Adharaa Neelim Dewanjee, EEE, CUET 2


Introduction

• Theorem: If f(x) is continuous in a closed interval [a,b] and f(a), f(b) are of opposite signs,
then the equation f(x)=0 will have atleast one real root between a and b.

• Proof: This theorem can be verified easily by graphical method. If we draw the graph of
y=f(x) in [a,b], where f(a) and f(b) are of opposite signs, then the graph, must cut the x-axis
atleast once. Hence at C, f(x)=0, So there is a root of f(x)=0 in [a,b].

Adharaa Neelim Dewanjee, EEE, CUET 3


Bisection Method

• Let the function f(x) be continuous between a and b. For definiteness, let f(a) be negative and
f(b) be positive. Then there is a root of f(x)=0, lying between a and b. Let the first
approximation be x  1 (a  b)
1
2
• Now if f(x1)=0 then x1 is a root of f(x)=0.
• Otherwise, the root will be between a and x1 or x1 and b depending upon whether f(x1) is
positive or negative.
• Then, as before, we bisect the interval and continue the process till the root is found to the
desired accuracy.
• If f(x1) is positive, therefore the, the root lies between a and x1. the second approximation to
the root is now . x  1 (a  x )
2 1
2
• if f(x2) is negative, then the root lies between x2 and x1, so the third approximation
1
x3  ( x2  x1 )
2
• this method is simple but slowly convergent. It is also called as Bolzano method or
Interval halving method.
Adharaa Neelim Dewanjee, EEE, CUET 4
Method of Successive
Approximation
• This method is also known as Iteration method.
• Let f(x)=0 be the given equation whose roots are to be determined. This equation can be
written in the form x=Ø(x).
• Let x=xo be an initial approximation to the actual root, say, α of the equation.
• Then the first approximation is x1=Ø(xo) and the successive approximations are x2=Ø(x1),
x3=Ø(x2),……. xn=Ø(xn-1)
• If the sequence of approximate roots, x1,x2,…,xn, coverges to α, it is taken as the root of the
equation f(x)=0.
• For convergence purpose the initial approximation xo is to be done carefully.
• The choice of xo is determined according to the following theorem.

Adharaa Neelim Dewanjee, EEE, CUET 5


Method of Successive
Approximation
• Theorem: If α be a root of f(x)=0 which is equivalent to x=Ø(x), I, be any interval containing
the point x= α and |Øʹ(x)|<1 and x  I, then the sequence of approximations xo, x1, x2,….xn
will converge to the root α provided the initial approximation xo is chosen in I.
• Proof: Since α is a root of x=Ø(x), we have α =Ø(α)
• If xn 1 and xn be two successive approximations to α, we have
xn   ( xn 1 )
xn     ( xn 1 )   ( )

• By mean value theorem, [ ( x )   ( )] /[ x   ]   ( )


n 1 n 1

• Hence xn    ( xn 1   ) ( )
•

Adharaa Neelim Dewanjee, EEE, CUET 6


Method of Successive
Approximation
• Let k be the maximum absolute value of Øʹ(x) over the interval I. Then
xn    k ( xn 1   )
xn    k n ( xo   )
xn 1    k ( xn  2   )
xn    k 2 ( xn  2   )

• Now if k<1 over the entire interval, as


Lt Lt
xn    0, i.e. xn  
n n

• That is the sequence of approximations coverges to α if k<1,


|Øʹ(x)|<1 and x  I

Adharaa Neelim Dewanjee, EEE, CUET 7


Adharaa Neelim Dewanjee, EEE, 8
CUET

You might also like