Professional Documents
Culture Documents
On Calculation of Adomian Polynomials by MATLAB
On Calculation of Adomian Polynomials by MATLAB
Abstract–Adomian Decomposition Method (ADM) is an codes, involve complexity, long programs and all are coded
elegant technique to handle an extensive class of linear or in Maple.
nonlinear differential and integral equations. However, in case The present paper, proposes a concise computer program
of nonlinear equations, ADM demands a special representation to rapidly compute Adomian polynomials in MATLAB, a
of each nonlinear term, namely, Adomian polynomials. The
present paper introduces a novel MATLAB code which
programming language interested especially by engineers,
computes Adomian polynomials associated with several types of getting its basic concept from a well-established technique
nonlinearities. The code exploits symbolic programming developed by Wazwaz [17]. Illustrative examples are
incorporated with a recently proposed alternative scheme to be provided to show the reliability of the program.
straightforward and fast. For the sake of exemplification,
Adomian polynomials of famous nonlinear operators, computed II. BASICS OF ADM IN BRIEF
by the code, are given.
Consider a very general differential equation as follows:
Keywords: Adomian decomposition, Adomian polynomials,
MATLAB, Nonlinear functionals, Differential equations. Lu + Nu + Ru = g (1)
where L is an easily invertible linear operator, N is a
I. INTRODUCTION nonlinear part and R stands for the remaining part. By
defining the inverse operator of L as L-1, it is directly
It is attributed to Albert Einstein to have said “True laws of concluded that:
nature cannot be linear”. Presumably true, mathematicians
are continually challenged with the nonlinear problems, L−1Lu + L−1 Nu + L−1 Ru = L−1 g (2)
particularly in form of partial differential equations, Taking L as an n-th order derivative operator into account,
appearing in Physics and engineering. Accordingly, any L-1 becomes an n-fold integration operator. Thus, it is
effort contributing to the world of nonlinear analysis would followed that L-1Lu=u+a, where a is emerged from the
be of fundamental importance and granted. Among a integrations. ADM proposes the final solution in form of
multitude of previously proposed approaches to tackle u = ∑ ∞n =0 un (that is why it is called decomposition).
nonlinear equations, Adomian Decompostion Method (ADM)
has gained astonishing popularity. Having been initially Identifying u0 as L-1 − ga, it yields:
developed and introduced by the acknowledged u = u0 − L−1 Nu − L−1 Ru (3)
mathematician George Adomian in 1984, ADM can provide
Furthermore, Nu shall be decomposed into an infinite
convenient solutions to a wide span of linear, as well as
series of Adominan polynomials as follows:
nonlinear, differential/integral equations [1-3]. ADM does
∞
not impose any linearization, perturbation or discretizations
and leads to convergent solutions rapidly. To get to know
Nu = ∑ An (4)
n =0
about ADM and its efficiency as well as the further
modifications thereof in detail, one is recommended to where An is classically suggested to be computed from
consult the literature [4-6]. Also, many illustrative examples [6]:
associated with the application of ADM in various areas of
1 ⎡ dn ⎛ ∞ i ⎞⎤
science and engineering are available [7-11]. An ( u0 , u1 ,… , un ) = ⎢ ∑ λ ui ⎟⎠ ⎥
n ! ⎣ d λ n ⎜⎝ i =0
N (5)
⎦ λ =0
As it will be discussed, ADM requires a particular series
Therefore, a recurrence can be established to calculate the
representation, viz. Adomian polynomials, for the
remnant solution terms as:
nonlinearities involved in the target equation. Several efforts
have been made to derive procedures for computing these ui +1 = − L−1 Ai − L−1 Rui ; i≥0 (6)
kinds of polynomials [12-16]. However, some of them are Wazwaz ingeniously found a characteristic which holds
restricted to only special cases of nonlinearity and many of true for Adomian polynomials: sum of subscripts of the
them, among those which have been converted into computer components of u in each term of the polynomial An is equal to
85
Mathematics Section
86
Journal of Applied Computer Science & Mathematics, no. 11 (5) /2011, Suceava
87
Mathematics Section
Hooman Fatoorehchi is pursuing his PhD in chemical engineering at University of Tehran, Iran. He has always maintained
a strong interest in applied mathematics, particularly functional analysis and mathematical modeling, as well as computer
programming. Each day more than before, he finds himself charmed by the beauty of mathematics.
Hossein Abolghasemi received his PhD in chemical engineering from University of Tehran in 2000. His primary areas of
interests include control theory, engineering mathematics and mathematical modeling. So far, he has published a textbook on
chemical process control and several scientific articles.
88