Paper Infomation
The Adomian polynomials and the new modified decomposition method for BVPs of nonlinear ODEs
Full Text(PDF, 109KB)
Author: Junsheng Duan
Abstract: In this paper we consider the new algorithm for the Adomian polynomials and the new modified decomposition method for solving boundary value problems of nonlinear ordinary differential equations. In the new method, the recursion scheme does not involve undetermined coefficients. Thus we avoid the complications resulting from the necessity of evaluating such undetermined coefficients at each stage of approximation. Furthermore, the recursion scheme can embed a convergence parameter to efficiently calculate the sequence of the analytical approximate solutions.
Keywords: Adomian decomposition method; Adomian polynomials; boundary value problem; ordinary differential equation
References:
[1] G. Adomian, R. Rach. “Inversion of nonlinear stochastic operators.” J. Math. Anal. Appl. 91 (1983) 39–46
[2] G. Adomian. Stochastic Systems. New York: Academic, 1983
[3] G. Adomian. Nonlinear Stochastic Systems Theory and Applications to Physics. Dordrecht: Kluwer, 1989
[4] G. Adomian. Solving Frontier Problems of Physics: The Decomposition Method. Dordrecht: Kluwer, 1994
[5] R. Rach. “A new definition of the Adomian polynomials.” Kybernetes 37 (2008) 910–955
[6] A. M. Wazwaz. Partial Differential Equations and Solitary Waves Theory. Beijing: Higher Education, 2009
[7] G. Adomian, R. Rach. “Analytic solution of nonlinear boundary-value problems in several dimensions by decomposition.” J.
[8] Math. Anal. Appl. 174 (1993) 118–137
[8] G. Adomian, R. Rach. “A new algorithm for matching boundary conditions in decomposition solutions.” Appl. Math. Comput.
[10] 58 (1993) 61–68
[9] J. S. Duan, R. Rach. “A new modification of the Adomian decomposition method for solving boundary value problems for higher
[12] order nonlinear differential equations.” Appl. Math. Comput. 218 (2011) 4090–4118
[10] J. S. Duan. “Recurrence triangle for Adomian polynomials.” Appl. Math. Comput. 216 (2010) 1235–1241
[11] J. S. Duan, R. Rach, and Z. Wang. “On the effective region of convergence of the decomposition series solution.” J. Algorithms
[15] Comput. Tech. 7 (2013) 227–247
[12] Y. Cherruault. “Convergence of Adomian’s method.” Kybernetes 18 (1989) 31–38
[13] A. Abdelrazec, D. Pelinovsky. “Convergence of the Adomian decomposition method for initial-value problems.” Numer.
[18] Methods Partial Differential Equations 27 (2011) 749–766
[14] G. Adomian, R. Rach. “Modified Adomian polynomials.” Math. Comput. Modelling 24 (1996) 39–46
[15] J. S. Duan. “New recurrence algorithms for the nonclassic Adomian polynomials.” Comput. Math. Appl. 62 (2011) 2961–2977
[16] J. S. Duan. “New ideas for decomposing nonlinearities in differential equations.” Appl. Math. Comput. 218 (2011) 1774–1784
[17] C. Li, Y. Wang. “Numerical algorithm based on Adomian decomposition for fractional differential equations.” Comput. Math.
[23] Appl. 57 (2009) 1672–1681
[18] J. S. Duan, R. Rach. “New higher-order numerical one-step methods based on the Adomian and the modified decomposition
[25] methods.” Appl. Math. Comput. 218 (2011) 2810–2828
[19] R. Rach, J. S. Duan. “Near-field and far-field approximations by the Adomian and asymptotic decomposition methods.” Appl.
[27] Math. Comput. 217 (2011) 5910–5922
[20] X. Y. Qin, Y. P. Sun, “Approximate analytical solutions for a mathematical model of a tubular packed-bed catalytic reactor using
[29] an Adomian decomposition method.” Appl. Math. Comput. 218 (2011) 1990–1996
[21] R. Rach. “A convenient computational form for the Adomian polynomials.” J. Math. Anal. Appl. 102 (1984) 415–419
[22] A. M. Wazwaz. “A new algorithm for calculating Adomian polynomials for nonlinear operators.” Appl. Math. Comput. 111 (2000)
[32] 53–69
[23] F. Abdelwahid. “A mathematical model of Adomian polynomials.” Appl. Math. Comput. 141 (2003) 447–453
[24] W. Chen, Z. Lu. “An algorithm for Adomian decomposition method.” Appl. Math. Comput. 159 (2004) 221–235
[25] Y. Zhu, Q. Chang, and S. Wu. “A new algorithm for calculating Adomian polynomials.” Appl. Math. Comput. 169 (2005)
[36] 402–416
[26] J. Biazar, M. Ilie, and A. Khoshkenar. “An improvement to an alternate algorithm for computing Adomian polynomials in special
[38] cases.” Appl. Math. Comput. 173 (2006) 582–592
[27] M. Azreg-Ainou. “A developed new algorithm for evaluating Adomian polynomials.” CMES-Comput. Model. Eng. Sci. 42 (2009)
[40] 1–18
[28] J. S. Duan, A. P. Guo. “Reduced polynomials and their generation in Adomian decomposition methods.” CMES-Comput. Model.
[42] Eng. Sci. 60 (2010) 139–150
[43] - 6 -
[44] www.ivypub.org/mc
[29] J. S. Duan. “An efficient algorithm for the multivariable Adomian polynomials.” Appl. Math. Comput. 217 (2010) 2456–2467
[30] J. S. Duan. “Convenient analytic recurrence algorithms for the Adomian polynomials.” Appl. Math. Comput. 217 (2011)
[47] 6337–6348
[31] M. R. Scott, W. H. Vandevender. “A comparison of several invariant imbedding algorithms for the solution of two-point
[49] boundary-value problems.” Appl. Math. Comput. 1 (1975) 187–218