A reliable symbolic implementation of algorithm for calculating Adomian polynomials. (English) Zbl 1088.65021

Summary: We introduce a reliable symbolic implementation of the algorithm for calculating Adomian polynomials and present some examples to show the simplicity and efficiency of the new method.


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


[1] Abboui, K.; Cherruault, Y., New ideas for proving convergence of decomposition methods, Comput. appl. math., 29, 7, 103-105, (1995) · Zbl 0832.47051
[2] Adomian, G., Solving frontier problems of physics: the decomposition method, (1994), Kluwer · Zbl 0802.65122
[3] Adomian, G., A review of the decomposition method in applied mathematics, Math. anal. appl., 135, 501-544, (1988) · Zbl 0671.34053
[4] Biazar, J.; Babolian, E.; Kember, G.; Nouri, A.; Islam, R., An alternate algorithm for computing Adomian polynomials in special cases, Appl. math. comput., 138, 523-529, (2003) · Zbl 1027.65076
[5] Choi, H.W.; Shin, J.G., Symbolic implementation of the algorithm for calculating Adomian polynomials, Appl. math. comput., 146, 1, 257-271, (2003) · Zbl 1033.65036
[6] Wazwaz, A.M., A new algorithm for calculating Adomian polynomials for nonlinear operators, Appl. math. comput., 111, 33-51, (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.