Numerical solution of fractional-order logistic equations by fractional Euler’s method
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2016, Vol 4, Issue 3
Abstract
In this article, fractional descriptions of logistic equations are solved by using fractional Euler's formula. The fractional derivative in this problem is in the Caputo sense. Special attention is focused on the stability, existence and uniqueness of the fractional-order logistic equation. Illustrative examples are included to exhibit the efficiency of the proposed method.
Authors and Affiliations
D. Vivek, K. Kanagarajan, S. Harikrishnan
Keywords
Related Articles
- EP ID EP21798
- DOI -
- Views 210
- Downloads 4
Substation Automation System for Energy Monitoring and Control using SCADA
Inherent scarcity of thermal sources with a time varying temperature profile is the reason why the Thermo electricbased energy harvesting is not as prominent as its counter-part, thermoelectric generators, in the thermal...
Low Latency NoC Router Micro Architecture using Dynamic Virtual Channel Organization
The number of cores on a chip is rapidly increased the on chip need an efficient communication structure as network on chip (NoC). The channel buffer organization of NoC uses virtual channels (VCs) to improve data flow...
Wireless Controlled Sailing Robot for Oceanic Missions
Ocean exploration and navigational research by supporting expeditions with computer vision techniques have shown potential for sailing robots development to make measurements on the ocean surface. Sailing robots explore...
slugMULTI-METHOD APPROACH AND FORMAL MATHEMATICAL MODEL FOR OWNER SHIP SERVICE MANAGEMENT ON CLOUD COMPUTING COST
The use of Cloud Computing Services appears to offer significant cost advantages. Particularly start-up companies benefit from these advantages, since frequently they do not operate an internal IT infrastructure. We fou...
Divisor Cordial Labeling Of Cycle Related Graphs
A divisor cordial labeling of a graph G is a bijection f from V (G) to {1, 2, . . . , |V (G)|} such that an edge uv is assigned the label 1 if f (u)| f (v) or f (v)| f (u) and the label 0 otherwise, then the number of e...