Adomian decomposition method with orthogonal polynomials: Legendre polynomials

This paper illustrates the using of orthogonal polynomials to modify the Adomian decomposition method. The method of employing Legendre polynomials to improve the Adomian decomposition method is presented here and compared to the method of using Chebyshev polynomials. The presented modified Adomian decomposition method is validated through an example and advantage as well as efficiency of this method is verified through investigating and comparing the results. In this paper, it is concluded that both orthogonal polynomials: Chebyshev and Legendre polynomials can be successfully used for the Adomian decomposition method and comparatively the Chebyshev expansion provides the better estimation.     

An auxiliary parameter method using Adomian polynomials and Laplace transformation for nonlinear differential equations

In this article, we proposed an auxiliary parameter method using Adomian polynomials and Laplace transformation for nonlinear differential equations. This method is called the Auxiliary Laplace Parameter Method (ALPM). The nonlinear terms can be easily handled by the use of Adomian polynomials. Comparison of the present solution is made with the existing solutions and excellent agreement is noted. The fact that the proposed technique solves nonlinear problems without any discretization or restrictive assumptions can be considered as a clear advantage of this algorithm over the numerical methods.     

An efficient algorithm for the multivariable Adomian polynomials

In this article the sum of the series of multivariable Adomian polynomials is demonstrated to be identical to a rearrangement of the multivariable Taylor expansion of an analytic function of the decomposition series of solutions u₁, u₂, … , u_m about the initial solution components u_1,0, u_2,0, … , u_m,0; of course the multivariable Adomian polynomials were developed and are eminently practical for the solution of coupled nonlinear differential equations. The index matrices and their simplified forms of the multivariable Adomian polynomials are introduced. We obtain the recurrence relations for the simplified index matrices, which provide a convenient algorithm for rapid generation of the multivariable Adomian polynomials. Another alternative algorithm for term recurrence is established. In these algorithms recurrence processes do not require complicated operations such as parametrization, expanding and regrouping, derivatives, etc. as practiced in prior art. The MATHEMATICA program generating the Adomian polynomials based on the algorithm in this article is designed.     

Adomian decomposition method by Legendre polynomials

In this paper, an efficient modification of the Adomian decomposition method by using Legendre polynomials is presented. Both linear and non-linear models are suited for the proposed method. Some examples here in are solved by using this method and this paper will demonstrate that the results are more reliable and efficient.     

Adomian polynomials: A powerful tool for iterative methods of series solution of nonlinear equations

In this article, we illustrate how the Adomian polynomials can be utilized with different types of iterative series solution methods for nonlinear equations. Two methods are considered here: the differential transform method that transforms a problem into a recurrence algebraic equation and the homotopy analysis method as a generalization of the methods that use inverse integral operator. The advantage of the proposed techniques is that equations with any analytic nonlinearity can be solved with less computational work due to the properties and available algorithms of the Adomian polynomials. Numerical examples of initial and boundary value problems for differential and integro-differential equations with different types of nonlinearities show good results.     

Fractional differential transform method combined with the Adomian polynomials

A modification of the fractional differential transform method (FDTM) for solving nonlinear fractional differential equations (FDEs) is presented. In this technique, the nonlinear term is replaced by its Adomian polynomial of index k. Then the dependent variable components are replaced in the recurrence relation by their corresponding differential transform components of the same index. Thus nonlinear FDEs can be easily solved with less computational work for any analytic nonlinearity due to the properties and available algorithms of the Adomian polynomials. Numerical examples with different types of nonlinearities are solved and good results are obtained.     

A convenient computational form for the Adomian polynomials

Recent important generalizations by G. Adomian (“Stochastic Systems”, Academic Press 1983) have extended the scope of his decomposition method for nonlinear stochastic operator equations (see also iterative method, inverse operator method, symmetrized method, or stochastic Green's function method) very considerably so that they are now applicable to differential, partial differential, delay, and coupled equations which may be strongly nonlinear and/or strongly stochastic (or linear or deterministic as subcases). Thus, for equations modeling physical problems, solutions are obtained rapidly, easily, and accurately. The methodology involves an analytic parametrization in which certain polynomials A_n, dependent on the nonlinearity, are derived. This paper establishes simple symmetry rules which yield Adomian's polynomials quickly to high orders.     

Improving the differential transform method: A novel technique to obtain the differential transforms of nonlinearities by the Adomian polynomials

Although being powerful, the differential transform method (DTM) yet suffers from a drawback which is the lack of a systematic methodology for derivation of the differential transforms for nonlinear expressions. In the current paper, it is shown that this defect can be overcome with the help of the Adomian polynomials perfectly. The application of the proposed technique in treatment of nonlinear differential equations is well illustrated by a number of examples. In addition, the transformed analogues of some frequent nonlinearities are presented.     

A comparison between the reduced differential transform method and the Adomian decomposition method for the Newell–Whitehead–Segel equation

In this paper, we will carry out a comparative study between the reduced differential transform method and the Adomian decomposition method. This is been achieved by handling the Newell–Whitehead–Segel equation. Two numerical examples have also been carried out to validate and demonstrate efficiency of the two methods. Furthermost, it is shown that the reduced differential transform method has an advantage over the Adomian decomposition method that it takes less time to solve the nonlinear problems without using the Adomian polynomials.     

Application of Laplace decomposition method on semi-infinite domain

In this article, Laplace decomposition method (LDM) is applied to obtain series solutions of classical Blasius equation. The technique is based on the application of Laplace transform to nonlinear Blasius flow equation. The nonlinear term can easily be handled with the help of Adomian polynomials. The results of the present technique have closed agreement with series solutions obtained with the help of Adomian decomposition method (ADM), variational iterative method (VIM) and homotopy perturbation method (HPM).     

Heat polynomials and Lie point symmetries

The classical heat polynomials are polynomial solutions of the heat equation. We demonstrate the generation of such polynomials through the medium of the group theoretical properties of the equation. A generalised procedure for the generation of polynomial solutions is presented and this is extended to the construction of related polynomials.     

Approximate solutions to the conformable Rosenau-Hyman equation using the two-step Adomian decomposition method with Padé approximation

This paper adopts the Adomian decomposition method and the Padé approximation techniques to derive the approximate solutions of a conformable Rosenau-Hyman equation by considering the new definition of the Adomian polynomials. The Padé approximate solutions are derived along with interesting figures showing both the analytic and approximate solutions.     

Biorthogonal polynomials and the bordering method for linear systems

First, the problem of solving a system of linear equations is shown to be equivalent to the computation of biorthogonal polynomials. The bordering method is a procedure for solving recursively a sequence of linear systems with increasing dimensions and it gave rise to a recurrence relationship between two adjacent families of biorthogonal polynomials. Of course, one relation is not sufficient for computing two families. However, in some particular cases, a second recurrence relationship exists between these biorthogonal polynomials thus leading to procedures for solving recursively such linear systems with increasing dimensions. The cases of Hankel and Toeplitz matrices are treated in details. Conferenza tenuta da C. Brezinski il 12 ottobre 1993     

Modified decomposition solution of nonlinear partial differential equations

Solutions of nonlinear partial differential equations are found using an extended Maclaurin series form of the decomposition method and the Adomian polynomials.     

An efficient method for analyzing the solutions of the Korteweg-de Vries equation

A new iterative method is applied to study the solutions of the Korteweg-de Vries (KdV) equation. The method is a modified form of the well known Adomian decomposition method (ADM), where it avoids the difficulty of computing the Adomian polynomials. We prove the existence of a unique solution of the KdV equation. And then, we show that the new method generates an infinite series which converges uniformly to the exact solution of the problem. Soliton solutions of the KdV equation are obtained by the new method. Numerical calculations indicate the effectiveness of the new method where the obtained results are very accurate and better than the ones obtained by the ADM.     

Matrix polynomials,roots and spectral factors

This paper discusses some properties of matrix polynomials and a computational procedure for finding the matrix roots of such polynomials and their relationship to spectral factorization. Polynomials of order n with square matrix coefficients of order N are considered. The computational procedure is of interest in the analysis and design of multivariable control systems.     

Optimization via Chebyshev polynomials

This paper presents for the first time a robust exact line-search method based on a full pseudospectral (PS) numerical scheme employing orthogonal polynomials. The proposed method takes on an adaptive search procedure and combines the superior accuracy of Chebyshev PS approximations with the high-order approximations obtained through Chebyshev PS differentiation matrices. In addition, the method exhibits quadratic convergence rate by enforcing an adaptive Newton search iterative scheme. A rigorous error analysis of the proposed method is presented along with a detailed set of pseudocodes for the established computational algorithms. Several numerical experiments are conducted on one- and multi-dimensional optimization test problems to illustrate the advantages of the proposed strategy.     

Recurrence relation for biorthogonal polynomials

We use a geometric approach to obtain a recurrence relation for two families of biorthogonal polynomials associated to a nonsingular, strongly regular matrix M. We propose a “look-ahead procedure” for computing the biorthogonal polynomials when M has singular or ill-conditioned leading principal submatrices. These polynomials lead to two recursive triangular factorizations for the inverse of a nonsingular matrix M which is not necessarily strongly regular.     

Schur and Schubert polynomials as Thom polynomials—cohomology of moduli spaces

The theory of Schur and Schubert polynomials is revisited in this paper from the point of view of generalized Thom polynomials. When we apply a general method to compute Thom polynomials for this case we obtain a new definition for (double versions of) Schur and Schubert polynomials: they will be solutions of interpolation problems.     

Generating functions for generalized Hermite polynomials associated with parabolic cylinder functions

ABSTRACT

In this article, we first give some basic properties of generalized Hermite polynomials associated with parabolic cylinder functions. We next use Weisner? group theoretic method and operational rules method to establish new generating functions for these generalized Hermite polynomials. The operational methods we use allow us to obtain unilateral, bilinear and bilateral generating functions by using the same procedure. Applications of generating functions obtained by Weisner? group theoretic method are discussed.