Research Article
The Asymptotic Expansion Method via Symbolic Computation
Algorithm 6
Implementation of the algorithm. Step (4).
for (q=1; q<=order; q++) For each such that , do: | { | U=U*0.; Compute the quasipolynomial | for (k=0; k<=m; k++) | for (nu=0; nu<=k; nu++) | U = U + xdx [nu] [k-nu] [q-1] | *f [nu] [k-nu]; | xdx = U.solvePVI Calculate as the solution to (5.3), | (a1, a0, t0, 0., 0.); | xdx = xdx .der (); , | , | and . | for (i=2; i<=m; i++) Calculate, for each such that , | for (nu=0; nu<=q; nu++) { | xdx = xdx | + xdx | *xdx ; , | xdx = xdx | + xdx | *xdx ; . | } | for (i=1; i<=m; i++) For each such that , | for (j=1; j<=m; j++) compute | for (nu=0; nu<=q; nu++) | xdx = | xdx | + xdx . | *xdx ; |
}
|
|