An efficient algorithm for the multivariable Adomian polynomials (Q606802)

From MaRDI portal
Revision as of 11:24, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient algorithm for the multivariable Adomian polynomials
scientific article

    Statements

    An efficient algorithm for the multivariable Adomian polynomials (English)
    0 references
    0 references
    18 November 2010
    0 references
    The Adomian decomposition methods are efficient techniques for solving nonlinear functional equations. This problem appears in coupled nonlinear differential equations \(Lu+Ru+Nu=g(t)\), where \(L+R\) is the linear part and \(N\) is a nonlinear operator. The method consists in the decomposition of \(Nu=f(u)\) in the series of Adomian polynomials \(A_n=\frac{1}{n!}\frac{d^n}{d\lambda_n}[f(\sum^\infty_{n=0}u_n\lambda^n)]_{\lambda=0}\) depending of certain initial solutions \(u_i\). The author gives an algorithm for rapid generation of the multivariable polynomials in question and tests it with a \texttt{MATHEMATICA} program.
    0 references
    Adomian decomposition method
    0 references
    nonlinear differential equation
    0 references
    multivariable function
    0 references
    algorithm
    0 references
    multivariable polynomials
    0 references
    \texttt{MATHEMATICA} program
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references