Return to search

Adomian Decomposition Method: Convergence Analysis and Numerical Approximations

We prove convergence of the Adomian Decomposition Method (ADM) by using the Cauchy-Kovalevskaya theorem for differential equations with analytic vector fields, and obtain a new result on the convergence rate of the ADM. Picard's iterative method is considered for the same class of equations in comparison with the decomposition method. We outline some substantial differences between the two methods and show that the decomposition method converges faster than the Picard method. Several nonlinear differential equations are considered for illustrative purposes and the numerical approximations of their solutions are obtained using MATLAB. The numerical results show how the decomposition method is more effective than the standard ODE solvers. Moreover, we prove convergence of the ADM for the partial differential equations and apply it to the cubic nonlinear Schrodinger equation with a localized potential. / Thesis / Master of Science (MSc)

Identiferoai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/21346
Date11 1900
CreatorsAbdelrazec, Ahmed
ContributorsPelinovsky, Dmitry, Mathematics
Source SetsMcMaster University
LanguageEnglish
Detected LanguageEnglish

Page generated in 0.0114 seconds