See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/326132436

INTEGER INTERVAL VALUE OF EULER'S METHOD FOR FIRST ORDER ODE

Article  in  International Journal of Pure and Applied Mathematics · July 2018

CITATIONS READS

2 380

1 author:

Veeramalai G Ganesan
M.Kumarasamy College of Engineering
16 PUBLICATIONS   34 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

interval analysis View project

All content following this page was uploaded by Veeramalai G Ganesan on 02 July 2018.

The user has requested enhancement of the downloaded file.

International Journal of Pure and Applied Mathematics
Volume 118 No. 20 2018, 2485-2490
ISSN: 1314-3395 (on-line version)
url: http://www.ijpam.eu
Special Issue
ijpam.eu

INTEGER INTERVAL VALUE OF EULER'S METHOD FOR

FIRST ORDER ODE
G.Veeramalai

Department of Mathematics, M. Kumarasamy College of Engineering, Karur-639113, India

Corresponding author: email- veeramalaig.snh@mkce.ac.in

Abstract: In this paper A new approaches to solve the approximate solution of the initial value problem for the first order
ordinary differential equations and the solution can be used to compute y numerically specified the value of [x ~
x ] near to
[ x0 ~
x0 ] in the interval analysis method and also used Euler method for interval. In interval method gives a more accurate the
approximate solution of life situation and numerical illustration are given.

Key words: Interval analysis, Euler’s method, first order differential equation, ect.

1. Introduction

In real life situations many problems can be cut down to the ODE’s enjoyable certain conditions is called
initial and boundary conditions. The analytical methods of solution are consistent only to a selected class of
first order ordinary differential equations. In general, the first order differential equations associated with the
whole of various physical systems do not posses solution in closed construct and hence it intends be
constrained to numerical techniques for solving a well known differential equation.

The Euler’s means is the oldest and simplest but besides easy manner geometrically, this way of doing
thing approximates the curve of solution by the tangent in each interval. It is the most basic kind of explicit
way of doing things for numerical integration of ordinary differential equations for a comprehensive
reexamination of these algorithms, some excellent text books are ready to be drawn in the printed material [1-
5]. In this paper , we make a new method for the interval value of Euler’s method derived.

2. Preliminaries: interval arithmetic

~  [a , a ] , b~  [b , b ]
Let a 1 2 1 2

(I). Addition
~
a~  b  [a1  b1 , a2  b2 ]

2485
International Journal of Pure and Applied Mathematics Special Issue

(II). Subtraction
~
a~  b  [a1  b2 , a2  b1 ]

(III). Multiplication
~
a~.b  [min(a1b1 , a1b2 , a2b1 , a2b2 ), max(a1b1 , a1b2 , a2b1 , a2b2 )]

(IV). Division

[i, j ] 1 1
 [i, j ].[ , ] If 0  [k , l ]
[k , l ] l k
~  [a , a ] for  0
(V). a 1 2

[a2 , a1 ] for  0

(VI). Inverse

1 1
[a1 , a2 ]1  [ , ], for0  [a1 , a2 ]
a2 a1

(VII). [a1 , a2 ]n  [a1 , a2 ], ifa1  0

n n

 [a2 , a1 ], ifa 2  0
n n

 [0, max{a1 , a2 }], otherwise

n n

3. Proposed Method

d~
y ~
Consider the interval integer first order ordinary differential equations ~  f ( x, y ) ....(1)
dx

Let us solve this differential equation under the initial conditions ~

y ( x0 )  ~
y0 .The solution of (1) gives
~ ~
y as a function x, which may be written as ~
y  f ( x) ....(2)

~ ~
The curve is in the X Y plane and a smooth curve is practically straight for a short distance
from any point on it.

~y
tan   ~
x
~
x tan   ~
y

2486
International Journal of Pure and Applied Mathematics Special Issue

 d~
y
~y  x  ~ 
 dx 
~ ~y
tan   ~
x
 y  y 
tan[  ]   . 
 x x 
[y  y ]

[x  x]
[ y  y ]  [ x  x] tan( )
~
y1  ~
y0  [ x  x] tan(  )
 d~y
[ y1 y1 ]  [ y 0 y 0 ]  [ x  x] ~ 
 
d x
 [ y0 y 0 ]  [h h][ f 0 f 0]
[ y2 y 2 ]  [ y1 y1 ]  [h h][ f1 f 1 ] And so on
In general
[ yn y n ]  [ yn1 y n1 ]  [h h][ f n ( x, y) f n ( x, y)]
~
By taking h small enough and proceeding in this manner. We could tabulate the expression
~
y  f ( x) as a set of corresponding values of ~
~ x and ~y .This is interval integer Euler’s method.

4. Numerical illustration

Problems 1. Using Euler’s method compute y in range [0 0]  [ x x]  [0.4 0.6] satisfying

dy
 [2 4] x  [1 1] y 2 , y[0 0]  [1 1] .
dx

Solution:


y1  [1 1]  [0 .1 0.1] [2 4][0 0]  [0 2][1 1]2 
 [1 1.2]  1.1


y2  [1 1.2]  [0.1 0.1] [2 4][ 0 0.2]  [0 2][1 1.2]2 
 [1 1.568]  1.284


y3  [1 1.568]  [0.1 0.1] [2 4][0.1 0.3]  [0 2][1 1.568]2 
 [1.02 2.18]  1.6

2487
International Journal of Pure and Applied Mathematics Special Issue


y4  [1.02 2.18]  [0.1 0.1] [2 4][0.2 0.4]  [0 2][1.02 2.18]2 
 [1.07 3.29048]  2.18


y5  [1.07 3.29]  [0.1 0.1] [2 4][0.3 0.5]  [0 2][1.07 3.29]2 
 [1.13 5.65482]  3.39

dy
Problems 2. Using Euler’s method  [0 2]x  [0 2] y  [0 2]xy , y[0 0]  [1 1] compute
dx
y[0 2] with [0.2 0.2]

Solution:

y1  [1 1]  [0.2 0.2][0 2][0 0]  [0 2][1 1]  [0 2][0 0][1 1]

 [1 1.4]  1.2

y2  [1 1.4]  [0.2 0.2][0 2][0 0.4]  [0 2][1 1.4]  [0 2][0 0.4][1 1.4]

 [1 2.344]  1.672

y3  [1 2.344]  [0.2 0.2][0 1.2]  [0 4.688]  [0 1.6128]

 [1 3.84416]  2.422

y4  [1 3.84416]  [0.2 0.2][0 1.6]  [0 7.68832]  [0 6.15]

 [1 6.932]  3.9659

y5  [1 6.932]  [0.2 0.2][0 2]  [0 13.864]  [0 13.864]

 [1 12.8776]  6.9388

5. Conclusion
The proposed interval valued Euler’s method is easy learn and understand and works
~
efficiently to obtain the solutions of real life situations. In this method is either to slow in case of h is
~
small or too inaccurate, in case of h is not small for real life situations.

References:
1. E. Hansan and G. W. Walster,“Global optimization using Interval Analysis”, Marcel Dekker, New York, 2003.
2. Karl Nickel, On the Newton method in Interval Analysis. Technical report 1136, Mathematical Research
Center, University of Wisconsion, Dec1971
3. Hansen E. R (1988), An overview of Global Optimization using interval analysis in Moore(1988) pp 289-307.

2488
International Journal of Pure and Applied Mathematics Special Issue

4. E. R. Hansen, “Global Optimization Using Interval Analysis”, Marcel Dekker, Inc., New York, 1992.
5. Helmut Ratschek and Jon G. Rlkne, New Computer Methods for Global Optimization, Wiley, New York, 1988
6. K. Ganesan and P. Veeramani, On Arithmetic Operations of Interval Numbers, International Journal of
Uncertainty, Fuzziness and Knowledge - Based Systems, 13 (6) (2005), 619 - 631
7. G.Veeramalai and R.J.Sundararaj, “Single Variable Unconstrained Optimization Techniques Using Interval
Analysis” IOSR Journal of Mathematics (IOSR-JM), ISSN: 2278-5728. Volume 3,Issue 3, (Sep-Oct. 2012), PP
30-34
8. G.Veeramalai, ”Unconstrained Optimization Techniques Using Fuzzy Non Linear Equations” Asian Academic
Research Journal of Multi-Disciplinary,ISSN: 2319- 2801.Volume 1, Issue 9, (May2013), PP 58-67
9. Eldon Hansen, Global optimization using interval analysis- Marcel Dekker, 1992
10. Hansen E. R (1979), “Global optimization using interval analysis-the one dimensional case, J.Optim, Theory
Application, 29, 314-331
11. G.Veeramalai and P.Gajendran, ”A New Approaches to Solving Fuzzy Linear System with Interval Valued
Triangular Fuzzy Number” Indian Scholar An International Multidisciplinary Research e-Journal , ISSN: 2350-
109X,.Volume 2, Issue 3, (Mar2016), PP 31-38
12. G.Veeramalai, “Eigen Values of an Interval Matrix” CLEAR IJRMST, Vol-02-No-03, Jan-June 2012, ISSN:
2249-3492.
13. Louis B. Rall, A Theory of interval iteration, proceeding of the American Mathematics Society, 86z:625-631,
1982.
14. Louis B. Rall, Application of interval integration to the solution of integral equations. Journal of Integral
equations 6: 127-141,1984.
15. Ramon E. Moore, R. Baker Kearfoth, Michael J. Cloud, Introduction to interval analysis, SIAM, 105-127,
Philadelphia, 2009.
16. Hansen E.R (1978a), “ Interval forms of Newton’s method, Computing 20, 153-163.
17. K. Ganesan, On Some Properties of Interval Matrices, International Journal of Computational and Mathematical
Sciences, 1 (2) (2007), 92-99.
18. E. R. Hansen and R. R. Smith, Interval arithmetic in matrix computations, Part 2, SIAM. journal of Numerical
Analysis, 4 (1967), 1 - 9.
19. E. R. Hansen, On the solution of linear algebraic equations with interval coefficients, Linear Algebra Appl, 2
(1969), 153 - 165 .
20. E. R. Hansen, Bounding the solution of interval linear Equations, SIAM Journal of Numerical Analysis, 29 (5)
(1992), 1493 - 1503.
21. P. Kahl, V. Kreinovich, A. Lakeyev and J. Rohn, Computational complexity and feasibility of data processing
and interval computations Kluwer Academic Publishers, Dordrecht (1998)
22. S. Ning and R. B. Kearfott, A comparison of some methods for solving linear interval Equations, SIAM Journal
of Numerical Analysis, 34 (1997),1289 - 1305.
23. R. E. Moore, Methods and Applications of Interval Analysis, SIAM, Philadelphia, 1979.
24. E. R. Hansen and R. R. Smith, “Interval arithmetic in matrix computations”, Part 2, SI AM. Journal of
Numerical Analysis, vol. 4, pp.1 – 9, 1967.
25. A. Neumaier, “Interval Methods for Systems of Equations”, Cambridge University Press, Cambridge, 1990.

2489
 2490

View publication stats