An efficient algorithm for the multivariable Adomian polynomials

From MaRDI portal





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.



Cites work


Cited in
(71)


Describes a project that uses

Uses Software






This page was built for publication: An efficient algorithm for the multivariable Adomian polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606802)