Symbolic implementation of the algorithm for calculating Adomian polynomials

摘要

In this paper, a symbolic implementation code is developed of a technique proposed by Wazwaz [Appl. Math. Comput. 111 (2000) 53] for calculating Adomian polynomials for nonlinear operators. The algorithm proposed by him [Appl. Math. Comput. I 11 (2000) 53] offers a. promising approach for calculating Adomian polynomials for all forms of nonlinearity, but it is not easy to implement due to its huge size of algebraic calculations, complicated trigonometric terms, and unique summation rules. It is well known that the algebraic manipulation language such as Mathematica is useful to facilitate such a hard computational work. Pattern-matching capabilities peculiar feature of Mathematica are used in index regrouping which is a key role in constructing Adomian polynomials. The computer algebra software Mathematica is used to collect terms to their order and to simplify the terms. The symbolic implementation code author developed (appearing at appendix) has the flexibility that may easily cover any length of Adomian polynomial for many forms of nonlinear cases. A nonlinear evolution equation is investigated in order to justify the availability of symbolic implementation code. (C) 2002 Elsevier Inc. All rights reserved. [References: 10]