Scribd
Upload
20 views10 pages

Numerical Methods

The document introduces four numerical methods for finding the roots of equations: 1) The bisection method uses interval halving to bracket the root. 2) Newton's method approximates the root using tangent lines. 3) The secant method is similar but does not require derivatives. 4) Examples demonstrate applying each method to find the root of sample equations.

Uploaded by

Syed Zulqadar Hassan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
20 views10 pages

Numerical Methods

The document introduces four numerical methods for finding the roots of equations: 1) The bisection method uses interval halving to bracket the root. 2) Newton's method approximates the root using tangent lines. 3) The secant method is similar but does not require derivatives. 4) Examples demonstrate applying each method to find the root of sample equations.

Uploaded by

Syed Zulqadar Hassan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

INTRODUCTION TO

NUMERICAL ANALYSIS
Intermediate Value
Theorem

Bisection Method

Newton Raphson Method

Secant Method

Intermediate Value Theorem

If f ( x) is continuous on interval (a,b) and


f (a). f (b) 0 then equation f ( x) 0 has at
least one real root or an odd number of
roots on Interval (a,b).

If f c[a, b] and k is
any number between
f (a) and f (b) then
theree exists c in [a,b]
for which f (c) k

Bisection Method

Suppose f is continuous function


in the interval [a,b] with f (a) & f (b)
of opposite sign By intermediate
theorem there exists in (a,b) with
. f ( p) 0
If p is root then there is two
possibilities either f (a) and f ( p )
have opposite signs so we will
replace a by p root or f ( p )and
f (b) have opposite sign then we
will replace b by p for next
iteration until f ( p) 0

Bisection Method
Q1(b)... f ( x) x3 7 x 2 14 x 6
f (a) 2

[1,3.2]

f (b) 0.112
(an bn )
2

f ( pn )

an

bn

3.2

2.1

1.791

2.1

3.2

2.65

0.552125

2.65

3.2

2.925

.085828

2.925

3.2

3.0625

-0.05444

2.625

3.0625

2.84375

0.201263

2.84375

3.0625

2.953125

0.051167

2.953125

3.0625

3.007813

-0.00769

pn

Newton Raphson Method

This Method is used to


find the root most
accurately.

( x x ) 2 f ( x )
f ( x) ( x x ) f ( x )
2
f ( x) 0 at P
xf ( x) f ( x )
p
f ( x )
f (x )
px
f ( x )
General Form:

f ( pn 1 )
pn pn 1
f ( pn 1 )

Newton Raphson Method


Q1(a) f ( x) x3 2 x 2 5 0

[1, 4]
p0 2

f ( x) 3 x 2 4 x 0

f ( p0 ) 5
f ( pn 1 )
f ( pn 1 )

f ( pn 1 )

f ( pn 1 )

-5

3.25

8.2031

8.2031

18.6875

2.8110

1.4082

1.4087

12.461

2.69799

0.0797

0.0808

11.0455

2.69068

0.000357

0.0003586

10.9565

2.69064

-0.0000008

pn pn 1

f ( pn )

Secant Method

We have to remove
the derivative
because it is difficult
to solve the
derivative of high
order function.

General Form:

f ( pn 1 )
pn pn 1
f ( pn 1 )
f (b) f (a )
f ( x)
ba
f ( pn 1 ) f ( pn 2 )
f ( Pn 1 )
pn 1 pn 2
f ( pn 1 )( pn 1 Pn 2 )
pn pn 1
f ( pn 1 ) f ( pn 2 )

Secant Method
f ( x) x3 4 x 2 10 0

[a, b] [1, 2]

p0 1

p1 2

pn 1

pn 2

f ( pn 1 )

f ( pn 2 )

pn

14

-5

1.26316

-1.60227

1.26316

-1.60227

14

1.33883

-0.4306

1.33883

1.26316

-0.43036 -1.60227

1.36662

0.02291

1.3666

1.3883

0.02264

-0.43036

1.36521

-0.0003

1.36521

1.3666

-0.0003

0.02264

1.36523

-0.000007

f ( pn )

You might also like