Numerical Solution of Ordinary Differential Equations

2,507 views 39 slides May 04, 2020
Slide 1
Slide 1 of 39
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22
Slide 23
23
Slide 24
24
Slide 25
25
Slide 26
26
Slide 27
27
Slide 28
28
Slide 29
29
Slide 30
30
Slide 31
31
Slide 32
32
Slide 33
33
Slide 34
34
Slide 35
35
Slide 36
36
Slide 37
37
Slide 38
38
Slide 39
39

About This Presentation

Presentation on Numerical Solution of Ordinary Differential Equations


Slide Content

NUMERICAL METHODS
(06CT42)
Dr. N. Meenakshi Sundaram
Asst. Prof. of Physics
Vivekananda College
TiruvedakamWest -Madurai

NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS
CONTENTS
PowerSeriesapproximations
SolutionbyTaylorseries(Type1)
Euler’s Method
Runge-KuttaMethod

Substitutingthesederivativesandtruncatingtheseriesin(1)givetheapproximatesolutionatx.

Euler’s Method
In solving a first order differential equation by numerical methods, we come across two types of solutions:
• A series solution of y in terms of x, which will yield the value of y at a particular value of x by direct substitution in
the series solution.
• Values of y at specified values of x.

Runge-KuttaMethod
Theuseofthepreviousmethodstosolvethedifferentialequationnumericallyisrestrictedduetoeitherslow
convergenceorduetolabourinvolved,especiallyinTaylorseriesmethod.But,inRunge-Kuttamethods,thederivatives
ofhigherorderarenotrequiredandwerequireonlythegivenfunctionvaluesatdifferentpoints.Sincethederivationof
fourthorderRunge-Kuttamethodistedious,wewillderiveRunge-kuttamethodofsecondorder.
Second order Runge-Kuttamethod (for first order O.D.E.)
By Taylor series

where a, b and m are constants to be determined to get the better accuracy of where ℎ=∆??????.
Second order R.K. algorithm

Since the derivation of third and fourth order Runge-Kuttaalgorithms are tedious, we state them below for use.
The third order Runge-Kuttamethod algorithm is given below:
Third order
R.K. algorithm
The fourth order Runge-Kuttamethod algorithm is mostly used in problem unless other mentioned. It is

By Taylor Series Method,

By Taylor Series Method,

=0.3486875+(0.1)(4.012887)+0.01/2 (11.341286)+(0.001/6)(25.99808)+⋯
=0.8110156≈0.811 (three digits)
The exact value of y (0.1) = 0.3486955
and y (0.2) = 0.8112658.
Solution.h=0.2, ,
,
By Euler algorithm

Solution.
=(0.1)f(0.1,0.9005)=-0.0982.

By Taylor series method,

=0.1+0.01+0.00033+0.00000833+0.000000166+⋯
y(1.1)=0.11033847
By Taylor series

=0.11033847+0.121033847+2.21033847(0.005+0.0016666+⋯)
=0.24280160.

By Taylor series.

=0.194752003 + 0.18441984 -0.0151668737 -0.00451341243 + 0.00039360239
=0.35988515

=1 + (0.01) (-1) = 1-0.01=0.99.
=0.99 +(0.01) (-0.99) = 0.9801

x 0 0.01 0.02 0.03 0.04
Y 1 0.9900 0.9801 0.9703 0.9606
Exact y 1 0.9900 0.9802 0.9704 0.9608
Tabular values (step values) are
since y=e-x is the exact solution.
By fourth order Runge-Kuttamethod,

=(0.1) f (0.05,1.055)
=(0.1)(0.05+1.055)=0.1105
=(0.1) f (0.1,1.1105) = 0.12105

Now starting from
=0.144298048

=1.110342+1/6(0.794781008)=1.2428055
y(0.2)=1.2428055
Correct to four decimal places, y (0.2) =1.2428.

=(0.1)f(0.65,1.8071)
=0.1385
=(0.1)f(0.7,1.8764)
=0.1386

By Runge-Kuttamethod of fourth order,
=(0.1)f(0.75,1.9455)
=0.1383

2. What is Truncation error?
Truncation errors are the errors that result from using an approximation in place of an exact mathematical
procedure.

Reference Text Book: Numerical Methods –P.Kandasamy, K.Thilagavathy& K.Gunavathi,
S.Chand& Company Ltd., New Delhi, 2014.

Thank you