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 conv...

Full description

Saved in:
Bibliographic Details
Published in:Communications in nonlinear science & numerical simulation 2009-04, Vol.14 (4), p.1008-1012
Main Authors: Chowdhury, M.S.H., Hashim, I., Mawa, S.
Format: Article
Language:English
Subjects:
Adomian decomposition method
Algorithms
Approximation
Computer simulation
Exact solutions
Intervals
Mathematical analysis
Mathematical models
Multistage
Non-linear ODEs
Prey–predator problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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.
ISSN:1007-5704
1878-7274
DOI:10.1016/j.cnsns.2007.11.006