New recurrence algorithms for the nonclassic Adomian polynomials

In this article, we present new algorithms for the nonclassic Adomian polynomials, which are valuable for solving a wide range of nonlinear functional equations by the Adomian decomposition method, and introduce their symbolic implementation in MATHEMATICA. Beginning with Rach’s new definition of the Adomian polynomials, we derive the explicit expression for each class of the Adomian polynomials, e.g. Am=∑k=1mf(k)(u0)Zm,k for the Class II, III and IV Adomian polynomials, where the Zm,kZm,k are called the reduced polynomials. These expressions provide a basis for developing improved algorithmic approaches. By introducing the index vectors, the recurrence algorithms for the reduced polynomials are suitably deduced, which naturally lead to new recurrence algorithms for the Class II and Class III Adomian polynomials. MATHEMATICA programs generating these classes of Adomian polynomials are subsequently presented. Computation shows that for computer generation of the Class III Adomian polynomials, the new algorithm reduces the running times compared with the definitional formula. We also consider the number of summands of these classes of Adomian polynomials and obtain the corresponding formulas. Finally, we demonstrate the versatility of the four classes of Adomian polynomials with several examples, which include the nonlinearity of the form f(t,u)f(t,u), explicitly depending on the argument tt.