Search results

The purpose of this paper is to provide a comparison of the Adomian decomposition method (ADM) with the variational iteration method (VIM) for solving the Lane‐Emden equations of the first and second kinds.

The paper examines the theoretical framework of the Adomian decomposition method and compares it with the variational iteration method. The paper seeks to determine the relative merits and computational benefits of both the Adomian decomposition method and the variational iteration method in the context of the important physical models of the Lane‐Emden equations of the first and second kinds.

The Adomian decomposition method is shown to readily solve the Lane‐Emden equations of both the first and second kinds for all positive real values of the system coefficient α and for all positive real values of the nonlinear exponent m. The decomposition series solution of these nonlinear differential equations requires the calculation of the Adomian polynomials appropriate to the particular system nonlinearity. The paper shows that the variational iteration method works effectively to solve the Lane‐Emden equation of the first kind for system coefficient values α=1, 2, 3, 4 but only for positive integer values of the nonlinear exponent m. The successive approximations of the solution of these nonlinear differential equations require the determination of the appropriate Lagrange multipliers, which are established in this paper. These two methodologies overcome the singular behavior at the origin x=0. The paper shows that the variational iteration method is impractical for solving either the Lane‐Emden equation of the first kind for non‐integer values of the system exponent m or the Lane‐Emden equations of the second kind. Indeed the Adomian decomposition method is shown to solve even the generalized Lane‐Emden equation for any analytic nonlinearity and all positive values of the system coefficient α in a practical and straightforward manner. The conclusions are supported by several numerical examples.

This paper presents an accurate comparison of the Adomian decomposition method with the variational iteration method for solving the Lane‐Emden equations of the first and second kinds. The paper presents a new solution algorithm for the generalized Lane‐Emden equation for any analytic system nonlinearity and for any model geometry as characterized by all possible positive real values of the system coefficient α.

The main purpose of this paper is to implement the piecewise spectral-variational iteration method (PSVIM) to solve the nonlinear Lane-Emden equations arising in mathematical physics and astrophysics.

This method is based on a combination of Chebyshev interpolation and standard variational iteration method (VIM) and matching it to a sequence of subintervals. Unlike the spectral method and the VIM, the proposed PSVIM does not require the solution of any linear or nonlinear system of equations and analytical integration.

Some well-known classes of Lane-Emden type equations are solved as examples to demonstrate the accuracy and easy implementation of this technique.

In this paper, a new and efficient technique is proposed to solve the nonlinear Lane-Emden equations. The proposed method overcomes the difficulties arising in calculating complicated and time-consuming integrals and terms that are not needed in the standard VIM.

This paper aims to design new finite difference schemes for the Lane–Emden type equations. In particular, the authors show that the schemes are stable with respect to the properties of the equation. The authors prove the uniqueness of the schemes and provide numerical simulations to support the findings.

The Lane–Emden equation is a well-known highly nonlinear ordinary differential equation in mathematical physics. Exact solutions are known for a few parameter ranges and it is important that any approximation captures the properties of the equation it represent. For this reason, designing schemes requires a careful consideration of these properties. The authors apply the well-known nonstandard finite difference methods.

Several interesting results are provided in this work. The authors list these as follows. Two new schemes are designed. Mathematical proofs are provided to show the existence and uniqueness of the solution of the discrete schemes. The authors show that the proposed method can be extended to singularly perturbed equations.

The value of this work can be measured as follows. It is the first time such schemes have been designed for the kind of equations.

The purpose of this paper is to describe the Lane–Emden equation by the fractal derivative and establish its variational principle by using the semi-inverse method. The variational principle is helpful to research the structure of the solution. The approximate analytical solution of the fractal Lane–Emden equation is obtained by the variational iteration method. The example illustrates that the suggested scheme is efficient and accurate for fractal models.

The author establishes the variational principle for fractal Lane–Emden equation, and its approximate analytical solution is obtained by the variational iteration method.

The variational iteration method is very fascinating in solving fractal differential equation.

The author first proposes the variational iteration method for solving fractal differential equation. The example shows the efficiency and accuracy of the proposed method. The variational iteration method is valid for other nonlinear fractal models as well.

The purpose of this paper is to obtain the highly accurate numerical solution of Lane–Emden-type equations using modified Adomian decomposition method (MADM) for unequal step-size partitions.

First, the authors describe the standard Adomian decomposition scheme and the Adomian polynomials for solving nonlinear differential equations. After that, for the fast calculation of the Adomian polynomials, an algorithm is presented based on Duan’s corollary and Rach’s rule. Then, MADM is discussed for the unequal step-size partitions of the domain, to obtain the numerical solution of Lane–Emden-type equations. Moreover, convergence analysis and an error bound for the approximate solution are discussed.

The proposed method removes the singular behaviour of the problems and provides the high precision numerical solution in the large effective region of convergence in comparison to the other existing methods, as shown in the tested examples.

Unlike the other methods, the proposed method does not require linearization or perturbation to obtain an analytical and numerical solution of singular differential equations, and the obtained results are more physically realistic.

The purpose of this paper is to propose an efficient computational technique, which uses Haar wavelets collocation approach coupled with the Newton-Raphson method and solves the following class of system of Lane–Emden equations:

To deal with singularity, Haar wavelets are used, and to deal with the nonlinear system of equations that arise during computation, the Newton-Raphson method is used. The convergence of these methods is also established and the results are compared with existing techniques.

The authors propose three methods based on uniform Haar wavelets approximation coupled with the Newton-Raphson method. The authors obtain quadratic convergence for the Haar wavelets collocation method. Test problems are solved to validate various computational aspects of the Haar wavelets approach. The authors observe that with only a few spatial divisions the authors can obtain highly accurate solutions for both initial value problems and boundary value problems.

The results presented in this paper do not exist in the literature. The system of nonlinear singular differential equations is not easy to handle as they are singular, as well as nonlinear. To the best of the knowledge, these are the first results for a system of nonlinear singular differential equations, by using the Haar wavelets collocation approach coupled with the Newton-Raphson method. The results developed in this paper can be used to solve problems arising in different branches of science and engineering.

The numerical methods are of great importance for approximating the solutions of a system of nonlinear singular ordinary differential equations. In this paper, the authors present the biorthogonal flatlet multiwavelet collocation method (BFMCM) as a numerical scheme for a class of system of Lane–Emden equations with initial or boundary or four-point boundary conditions.

The approach is involved in combining the biorthogonal flatlet multiwavelet (BFM) with the collocation method. The authors investigate the properties and procedure of the BFMCM for first time on this class of equations. By using the BFM and the collocation points, the method is constructed and it transforms the nonlinear differential equations problem into a system of nonlinear algebraic equations. The unknown coefficients of the assuming solution are determined by solving the obtained system. Additionally, convergence analysis and numerical stability of the suggested method are provided.

According to the attained results, the proposed BFMCM has more accurate results in comparison with results of other methods. The maximum absolute errors are calculated by using the BFMCM for comparison purposes provided.

The key desirable properties of BFMCM are its efficiency, simple applicability and minimizes errors. Therefore, the proposed method can be used to solve nonlinear problems or problems with singular points.

In this paper the authors aim to show the advantages of using the decomposition method introduced by Adomian to solve Emden's equation, a classical non‐linear equation that appears in the study of the thermal behaviour of a spherical cloud and of the gravitational potential of a polytropic fluid at hydrostatic equilibrium.

In their work, the authors first review Emden's equation and its possible solutions using the Frobenius and power series methods; then, Adomian polynomials are introduced. Afterwards, Emden's equation is solved using Adomian's decomposition method and, finally, they conclude with a comparison of the solution given by Adomian's method with the solution obtained by the other methods, for certain cases where the exact solution is known.

Solving Emden's equation for n in the interval [0, 5] is very interesting for several scientific applications, such as astronomy. However, the exact solution is known only for n=0, n=1 and n=5. The experiments show that Adomian's method achieves an approximate solution which overlaps with the exact solution when n=0, and that coincides with the Taylor expansion of the exact solutions for n=1 and n=5. As a result, the authors obtained quite satisfactory results from their proposal.

The main classical methods for obtaining approximate solutions of Emden's equation have serious computational drawbacks. The authors make a new, efficient numerical implementation for solving this equation, constructing iteratively the Adomian polynomials, which leads to a solution of Emden's equation that extends the range of variation of parameter n compared to the solutions given by both the Frobenius and the power series methods.

To provide a new proof of convergence of the Adomian decomposition series for solving nonlinear ordinary and partial differential equations based upon a thorough examination of the historical milieu preceding the Adomian decomposition method.

Develops a theoretical background of the Adomian decomposition method under the auspices of the Cauchy‐Kovalevskaya theorem of existence and uniqueness for solution of differential equations. Beginning from the concepts of a parametrized Taylor expansion series as previously introduced in the Murray‐Miller theorem based on analytic parameters, and the Banach‐space analog of the Taylor expansion series about a function instead of a constant as briefly discussed by Cherruault et al., the Adomian decompositions series and the series of Adomian polynomials are found to be a uniformly convergent series of analytic functions for the solution u and the nonlinear composite function f(u). To derive the unifying formula for the family of classes of Adomian polynomials, the author develops the novel notion of a sequence of parametrized partial sums as defined by truncation operators, acting upon infinite series, which induce these parametrized sums for simple discard rules and appropriate decomposition parameters. Thus, the defining algorithm of the Adomian polynomials is the difference of these consecutive parametrized partial sums.

The four classes of Adomian polynomials are shown to belong to a common family of decomposition series, which admit solution by recursion, and are derived from one unifying formula. The series of Adomian polynomials and hence the solution as computed as an Adomian decomposition series are shown to be uniformly convergent. Furthermore, the limiting value of the mth Adomian polynomial approaches zero as the index m approaches infinity for the prerequisites of the Cauchy‐Kovalevskaya theorem. The novel truncation operators as governed by discard rules are analogous to an ideal low‐pass filter, where the decomposition parameters represent the cut‐off frequency for rearranging a uniformly convergent series so as to induce the parametrized partial sums.

This paper unifies the notion of the family of Adomian polynomials for solving nonlinear differential equations. Further it presents the new notion of parametrized partial sums as a tool for rearranging a uniformly convergent series. It offers a deeper understanding of the elegant and powerful Adomian decomposition method for solving nonlinear ordinary and partial differential equations, which are of paramount importance in modeling natural phenomena and man‐made device performance parameters.