A nonperturbative approximate analytical solution is derived for the Lane–Emden equation using the Adomian decomposition method. The solution is in the form of a power series with easily computable coefficients. The Padé approximants method is used to accelerate the convergence of the power series. Comparison with some known exact and numerical solutions shows that the present solution is highly accurate.
9 February 2014 in Discrete Dynamics in Nature and Society
A new kind of optimization technique, namely, continuous genetic algorithm, is presented in this paper for numerically approximating the solutions of Troesch’s and Bratu’s problems. The underlying idea of the method is to convert the two differential problems into discrete versions by replacing each of the second derivatives by an appropriate difference quotient approximation. The new method has the following characteristics. First, it should not resort to more advanced mathematical tools; that is, the algorithm should be simple to understand and implement and should be thus easily accepted in the mathematical and physical application fields. Second, the algorithm is of global nature in terms of the solutions obtained as well as its ability to solve other mathematical and physical problems. Third, the proposed methodology has an implicit parallel nature which points to its implementation on parallel machines. The algorithm is tested on different versions of Troesch’s and Bratu’s problems. Experimental results show that the proposed algorithm is effective, straightforward, and simple.
1 November 2006 in Applied Mathematics and Computation
Time-fractional partial differential equations describe different phenomena in statistical physics, applied mathematics, and engineering. In this article, we propose and analyze an efficient reproducing kernel algorithm for the numerical solutions of such equations in porous media with Dirichlet boundary conditions. The representation of the exact and the numerical solutions is given in the W (Ω) and H (Ω) inner product spaces, whereas the computation of the required grid points relies on the R(y;s) (x; t) and r(y;s) (x; t) reproducing kernel functions. To confirm the accuracy of the new approach, several numerical examples are implemented, including linear and nonlinear terms that are acquired by interrupting the n-term of the exact solutions. The convergence of the utilized algorithm is studied theoretically and numerically by comparing the exact solutions of the problems under investigation. Finally, the obtained results show the significant improvement of the algorithm while saving the convergence accuracy and time.