Some modifications on RCAM for getting accurate closed-form approximate solutions of Duffing- and Lienard-type equations
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2019, Vol 16, Issue 0
Abstract
In this work, authors propose some modifications Adomian decomposition method to get some accurate closed form approximate or exact solutions of Duffing- and Li´enard-type nonlinear ordinary differential equations.Results obtained by the revised scheme have been exploited subsequently to derive constraints among parameters to get the solutions to be bounded. The present scheme appears to be efficient and may be regarded as the confluence of apparently different methods for getting exact solutions for a variety of nonlinear ordinary differential equations appearing as mathematical models in several physical processes.
Authors and Affiliations
Prakash Kumar Das, Debabrata Singh, Madan Mohan Panja
Keywords
Related Articles
- EP ID EP651837
- DOI 10.24297/jam.v16i0.8017
- Views 173
- Downloads 0
Existence results for Quasilinear Degenerated Equations in unbounded domains
In this paper, we study the existence of solutions for quasilinear degenerated elliptic operators Au + g(x,u, Vu) = f, in unbounded domains O, where A is a Lerray-Lions operator from the Weighted Sobolev space W0&nb...
Complexity Study in Gumowski-Mira Map : The Use of 0-1 Test
Gumowski-Mira map is a very interesting mathematical map which exhibits various kind of attractors-chaotic and regular. We study the behavior of some of the attractors of Gumowski-Mira map using 0-1 test used for disting...
For some boundary Value Problems in Distributions
In this paper we give a result concerning convergent sequences of functions that give convergent sequence of distributions in and find the analytic representation of the distribution obtained by their boundary valu...
Breaking Boundaries: Discovering the Impossible Counterproof of Beal’s Conjecture
This paper will attempt to logically differentiate between two types of fractions and discuss the idea of Zero as a neutral integer. This logic can then be followed to create a counterexample and a proof for Beal’s conje...
Geodetic Connected Domination Number of a graph
A pair x, y of vertices in a nontrivial connected graph is said to geodominate a vertex v of G if either v {x,y} or v lies an x - y geodesic of G. A set S of vertices of G is a geodetic set if every vertex of G is...