10
IV
https://doi.org/10.22214/ijraset.2022.41358
April 2022
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com
Application of Runge – Kutta Method to Population Equations Arunachalam Sundaram Department of Mathematics, Rizvi College of Arts, Science and Commerce, University of Mumbai, Mumbai, Maharashtra, India. Abstract: In this paper, we implement the second order Runge – Kutta method for three different population initial value problems. The Runge – Kutta method is a numerical technique used to solve the approximate solution for initial value problems for ordinary differential equations. Runge – Kutta method is implemented to linear population equation, non-linear population equation and non-linear population equation with an oscillation. The method of solving three initial value problems is implemented using Python Programming. Keywords: Differential equation, Runge – Kutta method, Discrete interval, Population equation, Non-linear population equation, Oscillation, Python. I. INTRODUCTION In Numerical Methods, the Runge –Kutta methods are an important family of implicit and explicit iterative methods which are used in discretization for the approximation of solutions of ordinary differential equations [9]. These techniques were developed around 1900 by the German mathematicians Carle Runge and Martin Kutta. Runge –Kutta methods are applied to Simulation and games, Fuzzy differential equations, linear differential equations, non-linear differential equations, stochastic differential equations, uncertain differential equations and Schrodinger equations. Xiangfeng Yang and Shen investigated the effectiveness of the Runge –Kutta method when calculating uncertainity distribution, expected value, extreme value and time integral solution of uncertain differential equations [1]. Qinghe Ming et al. presented the numerical results in the integration of Schrodinger equation to show the high efficiency of the new method [2]. J.T. Day developed a Runge –Kutta method for the numerical solution of hyperbolic partial differential equations [3]. G.U. Agebobah et al. developed the method of solving intial value problems in ordinary differential equations. Their results of Runge –Kutta formula generated through a FORTRAN program [4]. Faranak Rabiei et al. proposed the Runge –Kutta method for solving Volterra Integro differential equation [5]. Zhao Wenbo et al. developed to solve transient neutron diffusion equation using Euler’s method and Runge –Kutta method. Their numerical evaluation shows that Runge –Kutta method is more accurate and efficient than Euler’s method [6]. Andreas Robler introduced second order Runge –Kutta method for the weak approximation of the solution of Ito Stochastic differential equation systems with a multi-dimentional Wienner process [7]. This paper proposes the application of second order Runge –Kutta method for three different population initial value problems. The paper is organized as follows: Section II presents Second Order Runge – Kutta Method, Section III discusses the Population Equation, Section IV focuses on Implementation and Results and finally the Conclusion is presented in Section V. II. SECOND ORDER RUNGE – KUTTA METHOD The Runge –Kutta methods are designed to give greater accuracy and they possess the advantage of requiring only the function values at some selected points on the subinterval [10]. The general second order Runge – Kutta method for the first order differential equation = ( , ) with the initial condition ( ) = … … … … … . . (1) is given by the formula = where
+ [ = ( ,
= ( +ℎ,
]
+
= 0,1,2, … … … ,
− 1 … … … … … … (2)
) + ℎ ) and ℎ =
ℎ
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
719
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com III. POPULATION EQUATION The general form of population growth differential equation is =
… … … … . . (3) , where
The initial population at time
is the growth rate.
is ( ) = ,
≤ ≤ =
Integrating equation (3) gives the analytic solution Kutta method.
. We will use this equation to illustrate the application of the Runge –
The general form of the non-linear sigmoidal population growth differential equation is =
… … … … … … . (4)
−
and the non-linear sigmoidal population growth differential equation with oscillation is = where
ℎ
ℎ
ℎ
+ sin(2 ) … … … … … … . (5)
− ℎ
. The initial population at time
is ( ) = ,
≤ ≤
1) Specific Non-linear Population Equation: Given the growth rate, = 0.2 ℎ = 0.01, giving the specific nonlinear population differential equation = (0.2) − (0.01) and the specific non-linear population differential equation with oscillation = (0.2) − (0.01) + sin(2 ). The initial population at time 2000 is (2000) = 6, we are interested in the time period 2000 ≤ ≤ 2020. 2) Initial Condition: To obtain a specific solution to a first order initial value problem, the initial population is 6 billion people and therefore the initial condition is considered as (2000) = 6. In the year 2000, the world population was 6.1143 billion. Let us consider three initial value problems to apply the second order Runge – Kutta method. a) Linear Population Equation Consider the linear population differential equation = (0.1) , (2000 ≤ ≤ 2020) with the initial condition (2000) = 6. b) Non-linear Population Equation Consider the non-linear population differential equation = (0.2) − (0.01) , (2000 ≤ ≤ 2020) with the initial condition (2000) = 6. c) Non-linear Population Equation with an Oscillation Consider the non-linear population differential equation with an oscillation = (0.2) − (0.01) + (2 ), (2000 ≤ ≤ 2020) with the initial condition (2000) = 6. 3) Discrete Interval: The continuous time interval ℎ=
≤ ≤
. Here the interval is 2000 ≤ ≤ 2020 with ∴ℎ=
is discretized into N intervals separated by a constant step size
= 200. 2020 − 2000 = 0.1 200
This gives 201 discrete points with step size ℎ = 0.1 = 2000, = 2000.1, … … … , = 2020. This is generalized to = 2000 + (0.1) , = 0,1,2, … … … … . . ,200. The Figure 1 below shows the discrete time points for ℎ = 0.1
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
720
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com
Fig. 1 Discrete time points for ℎ = 0.1 IV. IMPLEMENTATION AND RESULTS A. Runge – Kutta Method to Linear Population Equation The linear population differential equation = (0.1) , (2000 ≤ ≤ 2020) … … … (6) with the initial condition (2000) = 6 has analytic solution
=6
( . )(
)
To write the specific second order Runge – Kutta method for the linear population equation ( , ) = (0.1) … … … (7) = ( ,
which gives
) = (0.1)
= ( +ℎ,
+ ℎ ) = (0.1)(
+ℎ )
and the difference equation =
+ [
+
]
= 0,1,2, … … … ,199 … … … (8)
where is the numerical approximation of at time with step size ℎ and the initial condition = 6. The Figure 2 below shows the exact solution, (squares) and the second order Runge – Kutta method numerical approximation (circles) for the linear population equation.
Fig. 2 Exact solution and Runge – Kutta approximation for Linear Population equation
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
721
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com Table 1 below shows the time, the second order Runge – Kutta numerical approximation | ( ) − | for the linear population equation.
, the exact solution
and the exact error
Table 1.Runge – Kutta approximation to linear population equation B. Runge – Kutta Method to Non-Linear Population Equation Consider the non-linear population differential equation = (0.2) − (0.01)
,
(2000 ≤ ≤ 2020)
with the initial condition (2000) = 6. To write the specific second order Runge – Kutta method for the initial value problem we need ( , ) = (0.2) − (0.01) This gives
= ( ,
) = (0.2)
− (0.01) = ( +ℎ, = (0.2)(
+ℎ )
+ ℎ ) − 0.01(
+ℎ )
and the difference equation =
+ [
+
]
= 0,1,2, … … … ,199
where is the numerical approximation of at time with step size ℎ and the initial condition = 6. The Figure 3 below shows the second order Runge – Kutta method numerical approximation (circles) for the non-linear population equation.
Fig. 3 Runge – Kutta approximation for non-linear population equation
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
722
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com The Table 2 below shows the time and the second order Runge – Kutta numerical approximation for the non-linear population equation.
Table 2 Runge – Kutta approximation to non-linear population equation C. Runge – Kutta Method to Non-Linear Population Equation with an Oscillation Consider the non-linear population differential equation with an oscillation = (0.2) − (0.01)
+
(2 ),
(2000 ≤ ≤ 2020)
with the initial condition (2000) = 6. To write the specific second order Runge – Kutta method for the initial value problem we need ( , ) = (0.2) − (0.01) + sin(2 ), This gives
= ( ,
) = (0.2)
− (0.01)
+ sin(2
)
= ( +ℎ, = (0.2)(
+ ℎ ) − 0.01(
+ℎ ) + ℎ ) + sin(2 ( + ℎ))
and the difference equation =
+ [
+
]
= 0,1,2, … … … ,199
where is the numerical approximation of at time with step size ℎ and the initial condition = 6. The Figure 4 below shows the second order Runge – Kutta method numerical approximation (circles) for the non-linear population equation with an oscillation.
Fig. 4 Runge – Kutta approximation for non-linear population equation with oscillation
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
723
International Journal for Research in Applied Science & Engineering Technology (IJRASET) ISSN: 2321-9653; IC Value: 45.98; SJ Impact Factor: 7.538 Volume 10 Issue IV Apr 2022- Available at www.ijraset.com The Table 3 below shows the time and the second order Runge – Kutta numerical approximation for the non-linear population equation with oscillation.
Table 3.Runge – Kutta approximation to non-linear population equation with an oscillation V. CONCLUSION We first introduced the second order Runge – Kutta method to the first order differential equation to obtain the numerical approximation of y at time t. We have proposed three different population initial value problems for linear population equation, nonlinear population equation and non-linear population equation with an oscillation. To obtain the exact solution for the population equations, we have presented specific second order Runge – Kutta difference equation for the initial value problem. The time interval is discretized into N points by a constant step size. The solution is obtained by implementing Python programming for three initial value problems. The results are shown in Figure 2 for linear population equation and Table 1 shows the exact solution. Figure 3 and Table 2 shows the solution for non-linear population equation. Figure 4 and Table 3 shows the solution for non-linear population equation with an oscillation. In all three initial value problems, we observe that for Runge – Kutta approximation at time t shows the different population. The difference between population for linear population equation and non-linear population equation is 0.216989 billion approximately and that of linear population equation and non-linear population equation with an oscillation is 0.257269 billion approximately. The difference between population for non-linear population equation and non-linear population equation with an oscillation is 0.040280 billion approximately. REFERENCES [1] [2]
Xiangfeng Yang and Shen, “Runge – Kutta Method for Solving Uncertain Differential Equations”, Springer, Vol.3, Issue 17 (2015), pp. 01-12. Qinghe Ming et al., “An Optimized Runge – Kutta Method for the Numerical Solution of Schrodinger equation”, Mathematical Problems in Engineering, Hindawi Publishing Corporation, Volume 2012, pp 01-12. [3] J.T.Day, “A Runge – Kutta Method for the Numerical Solution of the Goursat Problem in Hyperbolic Partial Differential Equations”, The Computer Journal, Vol. 9, Issue 1, May 1966, pp. 81-83. [4] G.U. Agebeboh et al., “Implementation of New Fourth Order Runge – Kutta Formula for Solving Initial Value Problems”, International Journal of Physical Sciences, Vol. 2(4), April 2017, pp. 89-98. [5] Faranak Rabiei et al., “Numerical Simulation of Fuzzy Volterra Integro – Differential Equation using Improved Runge – Kutta Method”, Journal of Applied and computational Mechanics, Vol. XX(X), 2021, pp. 01-11. [6] Zhao Wenbo et al., “Application of Runge – Kutta Method to Solve Trancient Neutron Diffusion equation”, Atomic Energy Science and Technology,Vol. 47 (1), 2013, pp. 89-96. [7] Andreas Robler, “Second Order Runge – Kutta Method for Ito Stochastic Differential Equation”, Society for Industrial and Applied Mathematics Journal on Numerical Analysis, Vol. 47, Issue 3, 2009, pp.1713-1738. [8] S. S. Sastry, “Introductory Methods of Numerical Analysis” Third Edition, Prentice Hall of India, New Delhi. [9] M. K. Jain et al., “Numerical Methods for Scientific and Engineering computation”, New Age International Publishers, Sixth Edition, 2014. [10] Kendall E. Atkinson, “An Introduction to Numerical Analysis”, John Wiley & Sons.(1989). [11] Stoer, J. and Bulirsch, R., “Introduction to Numerical Analysis”, Springer-Verlag (1980).
©IJRASET: All Rights are Reserved | SJ Impact Factor 7.538 | ISRA Journal Impact Factor 7.894 |
724