A reliable symbolic implementation of algorithm for calculating Adomian polynomials

DOI10.1016/j.amc.2005.02.040zbMath1088.65021OpenAlexW2002157873MaRDI QIDQ2369115

A. Pourdarvish

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.02.040

zbMATH Keywords

numerical examplessymbolic computationAdomian decomposition method

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Real polynomials: analytic properties, etc. (26C05)

Related Items (8)

Modeling of vibration for functionally graded beams ⋮ An efficient algorithm for the multivariable Adomian polynomials ⋮ Convenient analytic recurrence algorithms for the Adomian polynomials ⋮ A new algorithm for the decomposition solution of nonlinear differential equations ⋮ A reliable technique for solving third‐order dispersion equations ⋮ Recurrence triangle for Adomian polynomials ⋮ Comparison between Adomian's method and He's homotopy perturbation method ⋮ A new definition of the Adomian polynomials

Cites Work

• A review of the decomposition method in applied mathematics
• Solving frontier problems of physics: the decomposition method
• An alternate algorithm for computing Adomian polynomials in special cases
• Symbolic implementation of the algorithm for calculating Adomian polynomials.
• New ideas for proving convergence of decomposition methods

This page was built for publication: A reliable symbolic implementation of algorithm for calculating Adomian polynomials