An algorithm for the systematic construction of solutions to perturbed problems (Q1299704): Difference between revisions

The paper is concerned with the development of a new algorithm for the integration of initial value problems for a perturbed differential equation of the form \[ f(t,\varepsilon,y,y', \ldots, y^{(m)})=0, \] where \(f\) is an analytic function and \(\varepsilon\) is a small parameter. The method of construction of a truncated solution \[ \sum_{j=0}^{n_0} c_j(t)\varepsilon^j \] is based on the finding of a sequence of functions \(N_0, N_1, \ldots, N_{n_0 -1}\) such that \(c_0\) is a solution of the unperturbed linear problem, and \[ c_1 =N_0(c_0), c_2 =N_1(c_0, c_1), \ldots, c_{n_0} =N_{n_0 -1}(c_0, \ldots, c_{n_0-1}), \] so that the coefficients can be computed recursively. The algorithm proposed by the authors is based on a convex-hull argument and on a change of variable such that each coefficient \(c_j\) is used in only one stage of the algorithm. They also develop dynamic truncation techniques which uses for the computation of a truncated solution only those terms that are required for this particular computation. A special Maple V package \({\mathcal P}er {\mathcal N}\)ewton is developed for the handling of the algorithm. The performance of the algorithm is checked by application to the classical Duffing oscillator and van der Pol equation, as well as to the system of four decoupled oscillators arising from an artificial satellite problem with perturbation in certain variables.