/* nag_ode_ivp_rk_onestep (d02pdc) Example Program. * * Copyright 1992 Numerical Algorithms Group. * * Mark 3, 1992. * Mark 7 revised, 2001. * Mark 8 revised, 2004. * */ #include #include #include #include #include #include #include #ifdef __cplusplus extern "C" { #endif static void NAG_CALL f(Integer neq, double t1, double y[], double yp[], Nag_User *comm); #ifdef __cplusplus } #endif #define NEQ 2 #define ZERO 0.0 #define ONE 1.0 #define TWO 2.0 #define FOUR 4.0 int main(int argc, char *argv[]) { FILE *fpout; Integer exit_status = 0, i, neq; NagError fail; Nag_ErrorAssess errass; Nag_ODE_RK opt; Nag_RK_method method; Nag_User comm; double hstart, pi, tend, *thres = 0, tnow, tol, tstart, *ynow = 0, *ypnow = 0; double *ystart = 0; INIT_FAIL(fail); /* Check for command-line IO options */ fpout = nag_example_file_io(argc, argv, "-results", NULL); fprintf(fpout, "nag_ode_ivp_rk_onestep (d02pdc) Example Program Results\n"); /* Set initial conditions and input for nag_ode_ivp_rk_setup (d02pvc) */ neq = NEQ; if (neq >= 1) { if (!(thres = NAG_ALLOC(neq, double)) || !(ynow = NAG_ALLOC(neq, double)) || !(ypnow = NAG_ALLOC(neq, double)) || !(ystart = NAG_ALLOC(neq, double))) { fprintf(fpout, "Allocation failure\n"); exit_status = -1; goto END; } } else { exit_status = 1; return exit_status; } /* nag_pi (x01aac). * pi */ pi = nag_pi; tstart = ZERO; ystart[0] = ZERO; ystart[1] = ONE; tend = TWO*pi; for (i = 0; i < neq; i++) thres[i] = 1.0e-8; errass = Nag_ErrorAssess_off; hstart = ZERO; method = Nag_RK_4_5; for (i = 1; i <= 2; i++) { if (i == 1) tol = 1.0e-4; else tol = 1.0e-5; /* nag_ode_ivp_rk_setup (d02pvc). * Setup function for use with nag_ode_ivp_rk_range (d02pcc) * and/or nag_ode_ivp_rk_onestep (d02pdc) */ nag_ode_ivp_rk_setup(neq, tstart, ystart, tend, tol, thres, method, Nag_RK_onestep, errass, hstart, &opt, &fail); if (fail.code != NE_NOERROR) { fprintf(fpout, "Error from nag_ode_ivp_rk_setup (d02pvc).\n%s\n", fail.message); exit_status = 1; goto END; } fprintf(fpout, "\nCalculation with tol = %10.1e\n\n", tol); fprintf(fpout, " t y1 y2\n\n"); fprintf(fpout, "%8.3f %8.3f %8.3f\n", tstart, ystart[0], ystart[1]); do { /* nag_ode_ivp_rk_onestep (d02pdc). * Ordinary differential equations solver, initial value * problems, one time step using Runge-Kutta methods */ nag_ode_ivp_rk_onestep(neq, f, &tnow, ynow, ypnow, &opt, &comm, &fail); if (fail.code != NE_NOERROR) { fprintf(fpout, "Error from nag_ode_ivp_rk_onestep (d02pdc).\n%s\n", fail.message); exit_status = 1; goto END; } fprintf(fpout, "%8.3f %8.3f %8.3f\n", tnow, ynow[0], ynow[1]); } while (tnow < tend); fprintf(fpout, "\nCost of the integration in evaluations of f is" " %ld\n\n", opt.totfcn); /* nag_ode_ivp_rk_free (d02ppc). * Freeing function for use with the Runge-Kutta suite (d02p * functions) */ nag_ode_ivp_rk_free(&opt); } END: if (fpout != stdout) fclose(fpout); if (thres) NAG_FREE(thres); if (ynow) NAG_FREE(ynow); if (ypnow) NAG_FREE(ypnow); if (ystart) NAG_FREE(ystart); return exit_status; } static void NAG_CALL f(Integer neq, double t, double y[], double yp[], Nag_User *comm) { yp[0] = y[1]; yp[1] = -y[0]; }