Adomian, G.; Rach, R.; Meyers, Ronald E. Numerical algorithms and decomposition. (English) Zbl 0728.65068 Comput. Math. Appl. 22, No. 8, 57-61 (1991). Summary: Relationships are explored between conventional one-step methods, a new one-step version resulting from a discretized decomposition, Runge-Kutta, and analytic continuation. Cited in 12 Documents MSC: 65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations 65L05 Numerical methods for initial value problems involving ordinary differential equations 34A34 Nonlinear ordinary differential equations and systems Keywords:decomposition method; Runge-Kutta method; one-step methods; analytic continuation PDF BibTeX XML Cite \textit{G. Adomian} et al., Comput. Math. Appl. 22, No. 8, 57--61 (1991; Zbl 0728.65068) Full Text: DOI References: [1] Adomian, G., On solution of complex dynamical system, Parts I and II, Simulation, 54, 5, 245-251 (May 1990) [2] Adomian, G., A review of the decomposition method and some recent results for nonlinear equations, Mathematical and Computer Modelling, 13, 7, 17-43 (1990) · Zbl 0713.65051 [3] Cherruault, Y., Convergence of Adomian’s method, Kybernetes, 18, 2, 31-38 (1989) · Zbl 0697.65051 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.