| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4636241 | Applied Mathematics and Computation | 2006 | 7 Pages |
Abstract
In this paper, we present a reliable combination of Adomian decomposition algorithm and Padé approximants to investigate the Flierl-Petviashivili (FP) equation and its variants. The approach introduces an alternative framework designed to overcome the difficulty of the singular point at x = 0. We also investigate two generalized variants of the FP equation. The proposed framework reveals quite a number of remarkable features of the combination of the two algorithms.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Abdul-Majid Wazwaz,