Solution of prey–predator problem by numeric–analytic technique
In this paper, an analytical expression for the solution of the prey–predator problem by an adaptation of the classical Adomian decomposition method (ADM). The ADM is treated as an algorithm for approximating the solution of the problem in a sequence of time intervals, i.e. the classical ADM is co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2007
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/6654/ http://irep.iium.edu.my/6654/ http://irep.iium.edu.my/6654/1/Solution_of_prey%E2%80%93predator_problem_by_numeric%E2%80%93analytic_technique.pdf |
| Summary: | In this paper, an analytical expression for the solution of the prey–predator problem by an adaptation of the classical
Adomian decomposition method (ADM). The ADM is treated as an algorithm for approximating the solution of the problem
in a sequence of time intervals, i.e. the classical ADM is converted into a hybrid numeric–analytic method called the
multistage ADM (MADM). Numerical comparisons with the classical ADM, and the classical fourth-order Rungge–
Kutta (RK4) methods are presented. |
|---|