Convenient analytic recurrence algorithms for the Adomian polynomials (Q632864)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Convenient analytic recurrence algorithms for the Adomian polynomials
scientific article

    Statements

    Convenient analytic recurrence algorithms for the Adomian polynomials (English)
    0 references
    0 references
    28 March 2011
    0 references
    Four analytic recurrence algorithms for multivariable Adomian polynomials are presented. Four simplified results for one-variable Adomian polynomials are deduced as special cases. These algorithms are comprised of simple, orderly and recurrence formulas, which do not require time-intensive operations such as expanding, regrouping, parametrization, and so on. They are straightforward to implement in any symbolic software.
    0 references
    Adomian polynomials
    0 references
    Adomian decomposition method
    0 references
    nonlinear operator
    0 references
    differential equation
    0 references
    \texttt{MATHEMATICA}
    0 references
    recurrence algorithms
    0 references
    symbolic software
    0 references
    0 references
    0 references

    Identifiers