|\^/|     Maple 12 (IBM INTEL LINUX)
._|\|   |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2008
 \  MAPLE  /  All rights reserved. Maple is a trademark of
 <____ ____>  Waterloo Maple Inc.
      |       Type ? for help.
>  #BEGIN OUTFILE1
>  
>  # Begin Function number 3
>  display_alot := proc(iter)
>  global
>  DEBUGMASSIVE,
>  glob_max_terms,
>  DEBUGL,
>  ALWAYS,
>  INFO,
>  glob_iolevel,
>  #Top Generate Globals Decl
>  glob_log10abserr,
>  glob_curr_iter_when_opt,
>  glob_small_float,
>  glob_dump_analytic,
>  djd_debug,
>  glob_dump,
>  glob_max_minutes,
>  glob_start,
>  glob_look_poles,
>  glob_percent_done,
>  glob_reached_optimal_h,
>  min_in_hour,
>  glob_max_opt_iter,
>  glob_html_log,
>  glob_max_rel_trunc_err,
>  glob_max_iter,
>  glob_disp_incr,
>  hours_in_day,
>  sec_in_min,
>  glob_display_flag,
>  djd_debug2,
>  glob_iter,
>  glob_optimal_start,
>  glob_relerr,
>  glob_abserr,
>  glob_large_float,
>  glob_hmin,
>  glob_h,
>  glob_optimal_expect_sec,
>  glob_normmax,
>  glob_current_iter,
>  glob_unchanged_h_cnt,
>  glob_no_eqs,
>  glob_max_order,
>  glob_log10_abserr,
>  glob_hmin_init,
>  glob_optimal_done,
>  glob_not_yet_finished,
>  glob_clock_sec,
>  glob_almost_1,
>  years_in_century,
>  days_in_year,
>  glob_orig_start_sec,
>  glob_warned2,
>  glob_warned,
>  glob_smallish_float,
>  glob_max_hours,
>  glob_last_good_h,
>  glob_not_yet_start_msg,
>  centuries_in_millinium,
>  glob_log10_relerr,
>  glob_initial_pass,
>  glob_clock_start_sec,
>  glob_log10normmin,
>  glob_optimal_clock_start_sec,
>  glob_hmax,
>  glob_log10relerr,
>  MAX_UNCHANGED,
>  glob_max_sec,
>  glob_max_trunc_err,
>  #Bottom Generate Globals Decl
>  #BEGIN CONST
>  array_const_2D0,
>  array_const_4D0,
>  array_const_1,
>  array_const_3D0,
>  array_const_2,
>  array_const_0D0,
>  #END CONST
>  array_type_pole,
>  array_last_rel_error,
>  array_x1_init,
>  array_m1,
>  array_x2,
>  array_x1,
>  array_1st_rel_error,
>  array_x2_init,
>  array_t,
>  array_norms,
>  array_tmp0,
>  array_tmp1,
>  array_tmp2,
>  array_tmp3,
>  array_tmp4,
>  array_tmp5,
>  array_tmp6,
>  array_tmp7,
>  array_tmp8,
>  array_tmp9,
>  array_tmp10,
>  array_tmp11,
>  array_tmp12,
>  array_tmp13,
>  array_tmp14,
>  array_tmp15,
>  array_tmp16,
>  array_tmp17,
>  array_pole,
>  array_real_pole,
>  array_x1_higher_work2,
>  array_poles,
>  array_x1_higher_work,
>  array_x2_higher_work,
>  array_x2_higher_work2,
>  array_x2_higher,
>  array_x1_higher,
>  array_complex_pole,
>  glob_last;
>  
>  local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no;
>  #TOP DISPLAY ALOT
>  if (iter >= 0)  then # if number 1
>   ind_var := array_t[1];
>   omniout_float(ALWAYS,"t[1]                             ",33,ind_var,20," ");
>   analytic_val_y := exact_soln_x2(ind_var);
>   omniout_float(ALWAYS,"x2[1] (analytic)                 ",33,analytic_val_y,20," ");
>   term_no   :=  1;
>   numeric_val := array_x2[term_no];
>   abserr := abs(numeric_val - analytic_val_y);
>   omniout_float(ALWAYS,"x2[1] (numeric)                  ",33,numeric_val,20," ");
>   if (abs(analytic_val_y) <> 0.0)  then # if number 2
>     relerr := abserr*100.0/abs(analytic_val_y);
>     else
>     relerr :=  -1.0  ;
>     fi;# end if 2
>   ;
>   if glob_iter  = 1 then # if number 2
>     array_1st_rel_error[1] := relerr;
>     else
>     array_last_rel_error[1] := relerr;
>     fi;# end if 2
>   ;
>   omniout_float(ALWAYS,"absolute error                   ",4,abserr,20," ");
>   omniout_float(ALWAYS,"relative error                   ",4,relerr,20,"%");
>   omniout_float(ALWAYS,"h                                ",4,glob_h,20," ");
>   ;
>   analytic_val_y := exact_soln_x1(ind_var);
>   omniout_float(ALWAYS,"x1[1] (analytic)                 ",33,analytic_val_y,20," ");
>   term_no   :=  1;
>   numeric_val := array_x1[term_no];
>   abserr := abs(numeric_val - analytic_val_y);
>   omniout_float(ALWAYS,"x1[1] (numeric)                  ",33,numeric_val,20," ");
>   if (abs(analytic_val_y) <> 0.0)  then # if number 2
>     relerr := abserr*100.0/abs(analytic_val_y);
>     else
>     relerr :=  -1.0  ;
>     fi;# end if 2
>   ;
>   if glob_iter  = 1 then # if number 2
>     array_1st_rel_error[2] := relerr;
>     else
>     array_last_rel_error[2] := relerr;
>     fi;# end if 2
>   ;
>   omniout_float(ALWAYS,"absolute error                   ",4,abserr,20," ");
>   omniout_float(ALWAYS,"relative error                   ",4,relerr,20,"%");
>   omniout_float(ALWAYS,"h                                ",4,glob_h,20," ");
>   #BOTTOM DISPLAY ALOT
>   fi;# end if 1
>  ;
>  # End Function number 3
>  end;
display_alot := proc(iter)
local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    if 0 <= iter then
        ind_var := array_t[1];
        omniout_float(ALWAYS, "t[1]                             ", 33,
            ind_var, 20, " ");
        analytic_val_y := exact_soln_x2(ind_var);
        omniout_float(ALWAYS, "x2[1] (analytic)                 ", 33,
            analytic_val_y, 20, " ");
        term_no := 1;
        numeric_val := array_x2[term_no];
        abserr := abs(numeric_val - analytic_val_y);
        omniout_float(ALWAYS, "x2[1] (numeric)                  ", 33,
            numeric_val, 20, " ");
        if abs(analytic_val_y) <> 0. then
            relerr := abserr*100.0/abs(analytic_val_y)
        else relerr := -1.0
        end if;
        if glob_iter = 1 then array_1st_rel_error[1] := relerr
        else array_last_rel_error[1] := relerr
        end if;
        omniout_float(ALWAYS, "absolute error                   ", 4,
            abserr, 20, " ");
        omniout_float(ALWAYS, "relative error                   ", 4,
            relerr, 20, "%");
        omniout_float(ALWAYS, "h                                ", 4,
            glob_h, 20, " ");
        analytic_val_y := exact_soln_x1(ind_var);
        omniout_float(ALWAYS, "x1[1] (analytic)                 ", 33,
            analytic_val_y, 20, " ");
        term_no := 1;
        numeric_val := array_x1[term_no];
        abserr := abs(numeric_val - analytic_val_y);
        omniout_float(ALWAYS, "x1[1] (numeric)                  ", 33,
            numeric_val, 20, " ");
        if abs(analytic_val_y) <> 0. then
            relerr := abserr*100.0/abs(analytic_val_y)
        else relerr := -1.0
        end if;
        if glob_iter = 1 then array_1st_rel_error[2] := relerr
        else array_last_rel_error[2] := relerr
        end if;
        omniout_float(ALWAYS, "absolute error                   ", 4,
            abserr, 20, " ");
        omniout_float(ALWAYS, "relative error                   ", 4,
            relerr, 20, "%");
        omniout_float(ALWAYS, "h                                ", 4,
            glob_h, 20, " ")
    end if
end proc

>   # Begin Function number 4
>  adjust_for_pole := proc(h_param)
>  global
>  DEBUGMASSIVE,
>  glob_max_terms,
>  DEBUGL,
>  ALWAYS,
>  INFO,
>  glob_iolevel,
>  #Top Generate Globals Decl
>  glob_log10abserr,
>  glob_curr_iter_when_opt,
>  glob_small_float,
>  glob_dump_analytic,
>  djd_debug,
>  glob_dump,
>  glob_max_minutes,
>  glob_start,
>  glob_look_poles,
>  glob_percent_done,
>  glob_reached_optimal_h,
>  min_in_hour,
>  glob_max_opt_iter,
>  glob_html_log,
>  glob_max_rel_trunc_err,
>  glob_max_iter,
>  glob_disp_incr,
>  hours_in_day,
>  sec_in_min,
>  glob_display_flag,
>  djd_debug2,
>  glob_iter,
>  glob_optimal_start,
>  glob_relerr,
>  glob_abserr,
>  glob_large_float,
>  glob_hmin,
>  glob_h,
>  glob_optimal_expect_sec,
>  glob_normmax,
>  glob_current_iter,
>  glob_unchanged_h_cnt,
>  glob_no_eqs,
>  glob_max_order,
>  glob_log10_abserr,
>  glob_hmin_init,
>  glob_optimal_done,
>  glob_not_yet_finished,
>  glob_clock_sec,
>  glob_almost_1,
>  years_in_century,
>  days_in_year,
>  glob_orig_start_sec,
>  glob_warned2,
>  glob_warned,
>  glob_smallish_float,
>  glob_max_hours,
>  glob_last_good_h,
>  glob_not_yet_start_msg,
>  centuries_in_millinium,
>  glob_log10_relerr,
>  glob_initial_pass,
>  glob_clock_start_sec,
>  glob_log10normmin,
>  glob_optimal_clock_start_sec,
>  glob_hmax,
>  glob_log10relerr,
>  MAX_UNCHANGED,
>  glob_max_sec,
>  glob_max_trunc_err,
>  #Bottom Generate Globals Decl
>  #BEGIN CONST
>  array_const_2D0,
>  array_const_4D0,
>  array_const_1,
>  array_const_3D0,
>  array_const_2,
>  array_const_0D0,
>  #END CONST
>  array_type_pole,
>  array_last_rel_error,
>  array_x1_init,
>  array_m1,
>  array_x2,
>  array_x1,
>  array_1st_rel_error,
>  array_x2_init,
>  array_t,
>  array_norms,
>  array_tmp0,
>  array_tmp1,
>  array_tmp2,
>  array_tmp3,
>  array_tmp4,
>  array_tmp5,
>  array_tmp6,
>  array_tmp7,
>  array_tmp8,
>  array_tmp9,
>  array_tmp10,
>  array_tmp11,
>  array_tmp12,
>  array_tmp13,
>  array_tmp14,
>  array_tmp15,
>  array_tmp16,
>  array_tmp17,
>  array_pole,
>  array_real_pole,
>  array_x1_higher_work2,
>  array_poles,
>  array_x1_higher_work,
>  array_x2_higher_work,
>  array_x2_higher_work2,
>  array_x2_higher,
>  array_x1_higher,
>  array_complex_pole,
>  glob_last;
>  
>  local hnew, sz2, tmp;
>  #TOP ADJUST FOR POLE
>  
>  hnew   :=  h_param;
>  glob_normmax   :=  glob_small_float;
>  if (abs(array_x2_higher[1,1]) > glob_small_float)  then # if number 1
>   tmp   :=  abs(array_x2_higher[1,1]);
>   if (tmp < glob_normmax)  then # if number 2
>     glob_normmax   :=  tmp;
>     fi;# end if 2
>   fi;# end if 1
>  ;
>  if (abs(array_x1_higher[1,1]) > glob_small_float)  then # if number 1
>   tmp   :=  abs(array_x1_higher[1,1]);
>   if (tmp < glob_normmax)  then # if number 2
>     glob_normmax   :=  tmp;
>     fi;# end if 2
>   fi;# end if 1
>  ;
>  if (glob_look_poles and (abs(array_pole[1]) > glob_small_float) and (array_pole[1] <> glob_large_float))  then # if number 1
>   sz2   :=  array_pole[1]/10.0;
>   if (sz2 < hnew)  then # if number 2
>     omniout_float(INFO,"glob_h adjusted to ",20,h_param,12,"due to singularity.");
>     omniout_str(INFO,"Reached Optimal");
>     newline();
>     return(hnew);
>     fi;# end if 2
>   fi;# end if 1
>  ;
>  if (not glob_reached_optimal_h)  then # if number 1
>   glob_reached_optimal_h   :=  true;
>   glob_curr_iter_when_opt   :=  glob_current_iter;
>   glob_optimal_clock_start_sec   := elapsed_time_seconds();
>   glob_optimal_start    := array_t[1];
>   fi;# end if 1
>  ;
>  hnew   :=  sz2;
>  #END block
>  #BOTTOM ADJUST FOR POLE
>  # End Function number 4
>  end;
adjust_for_pole := proc(h_param)
local hnew, sz2, tmp;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    hnew := h_param;
    glob_normmax := glob_small_float;
    if glob_small_float < abs(array_x2_higher[1, 1]) then
        tmp := abs(array_x2_higher[1, 1]);
        if tmp < glob_normmax then glob_normmax := tmp end if
    end if;
    if glob_small_float < abs(array_x1_higher[1, 1]) then
        tmp := abs(array_x1_higher[1, 1]);
        if tmp < glob_normmax then glob_normmax := tmp end if
    end if;
    if glob_look_poles and glob_small_float < abs(array_pole[1]) and
    array_pole[1] <> glob_large_float then
        sz2 := array_pole[1]/10.0;
        if sz2 < hnew then
            omniout_float(INFO, "glob_h adjusted to ", 20, h_param, 12,
                "due to singularity.");
            omniout_str(INFO, "Reached Optimal");
            newline();
            return hnew
        end if
    end if;
    if not glob_reached_optimal_h then
        glob_reached_optimal_h := true;
        glob_curr_iter_when_opt := glob_current_iter;
        glob_optimal_clock_start_sec := elapsed_time_seconds();
        glob_optimal_start := array_t[1]
    end if;
    hnew := sz2
end proc

>   # Begin Function number 5
>  prog_report := proc(t_start,t_end)
>  global
>  DEBUGMASSIVE,
>  glob_max_terms,
>  DEBUGL,
>  ALWAYS,
>  INFO,
>  glob_iolevel,
>  #Top Generate Globals Decl
>  glob_log10abserr,
>  glob_curr_iter_when_opt,
>  glob_small_float,
>  glob_dump_analytic,
>  djd_debug,
>  glob_dump,
>  glob_max_minutes,
>  glob_start,
>  glob_look_poles,
>  glob_percent_done,
>  glob_reached_optimal_h,
>  min_in_hour,
>  glob_max_opt_iter,
>  glob_html_log,
>  glob_max_rel_trunc_err,
>  glob_max_iter,
>  glob_disp_incr,
>  hours_in_day,
>  sec_in_min,
>  glob_display_flag,
>  djd_debug2,
>  glob_iter,
>  glob_optimal_start,
>  glob_relerr,
>  glob_abserr,
>  glob_large_float,
>  glob_hmin,
>  glob_h,
>  glob_optimal_expect_sec,
>  glob_normmax,
>  glob_current_iter,
>  glob_unchanged_h_cnt,
>  glob_no_eqs,
>  glob_max_order,
>  glob_log10_abserr,
>  glob_hmin_init,
>  glob_optimal_done,
>  glob_not_yet_finished,
>  glob_clock_sec,
>  glob_almost_1,
>  years_in_century,
>  days_in_year,
>  glob_orig_start_sec,
>  glob_warned2,
>  glob_warned,
>  glob_smallish_float,
>  glob_max_hours,
>  glob_last_good_h,
>  glob_not_yet_start_msg,
>  centuries_in_millinium,
>  glob_log10_relerr,
>  glob_initial_pass,
>  glob_clock_start_sec,
>  glob_log10normmin,
>  glob_optimal_clock_start_sec,
>  glob_hmax,
>  glob_log10relerr,
>  MAX_UNCHANGED,
>  glob_max_sec,
>  glob_max_trunc_err,
>  #Bottom Generate Globals Decl
>  #BEGIN CONST
>  array_const_2D0,
>  array_const_4D0,
>  array_const_1,
>  array_const_3D0,
>  array_const_2,
>  array_const_0D0,
>  #END CONST
>  array_type_pole,
>  array_last_rel_error,
>  array_x1_init,
>  array_m1,
>  array_x2,
>  array_x1,
>  array_1st_rel_error,
>  array_x2_init,
>  array_t,
>  array_norms,
>  array_tmp0,
>  array_tmp1,
>  array_tmp2,
>  array_tmp3,
>  array_tmp4,
>  array_tmp5,
>  array_tmp6,
>  array_tmp7,
>  array_tmp8,
>  array_tmp9,
>  array_tmp10,
>  array_tmp11,
>  array_tmp12,
>  array_tmp13,
>  array_tmp14,
>  array_tmp15,
>  array_tmp16,
>  array_tmp17,
>  array_pole,
>  array_real_pole,
>  array_x1_higher_work2,
>  array_poles,
>  array_x1_higher_work,
>  array_x2_higher_work,
>  array_x2_higher_work2,
>  array_x2_higher,
>  array_x1_higher,
>  array_complex_pole,
>  glob_last;
>  
>  local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec;
>  #TOP PROGRESS REPORT
>  clock_sec1   := elapsed_time_seconds();
>  total_clock_sec   :=  convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
>  glob_clock_sec   :=  convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
>  left_sec   :=  convfloat(glob_max_sec) + convfloat(glob_orig_start_sec) - convfloat(clock_sec1);
>  expect_sec   :=  comp_expect_sec(convfloat(t_end),convfloat(t_start),convfloat(array_t[1]) + convfloat(glob_h)  ,convfloat( clock_sec1) - convfloat(glob_orig_start_sec));
>  opt_clock_sec   := convfloat( clock_sec1) - convfloat(glob_optimal_clock_start_sec);
>  glob_optimal_expect_sec   :=  comp_expect_sec(convfloat(t_end),convfloat(t_start),convfloat(array_t[1]) +convfloat( glob_h) ,convfloat( opt_clock_sec));
>  percent_done   :=  comp_percent(convfloat(t_end),convfloat(t_start),convfloat(array_t[1]) + convfloat(glob_h));
>  glob_percent_done := percent_done;
>  omniout_str_noeol(INFO,"Total Elapsed Time              ");
>  omniout_timestr(convfloat(total_clock_sec));
>  omniout_str_noeol(INFO,"Elapsed Time(since restart)     ");
>  omniout_timestr(convfloat(glob_clock_sec));
>  if convfloat(percent_done) < convfloat(100.0)  then # if number 1
>   omniout_str_noeol(INFO,"Expected Time Remaining         ");
>   omniout_timestr(convfloat(expect_sec));
>   omniout_str_noeol(INFO,"Optimized Time Remaining        ");
>   omniout_timestr(convfloat(glob_optimal_expect_sec));
>   fi;# end if 1
>  ;
>  omniout_str_noeol(INFO,"Time to Timeout                 ");
>  omniout_timestr(convfloat(left_sec));
>  omniout_float(INFO,    "Percent Done                    ",33,percent_done,4,"%");
>  #BOTTOM PROGRESS REPORT
>  # End Function number 5
>  end;
prog_report := proc(t_start, t_end)
local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec,
percent_done, total_clock_sec;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    clock_sec1 := elapsed_time_seconds();
    total_clock_sec :=
        convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
    glob_clock_sec :=
        convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
    left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec)
         - convfloat(clock_sec1);
    expect_sec := comp_expect_sec(convfloat(t_end), convfloat(t_start),
        convfloat(array_t[1]) + convfloat(glob_h),
        convfloat(clock_sec1) - convfloat(glob_orig_start_sec));
    opt_clock_sec :=
        convfloat(clock_sec1) - convfloat(glob_optimal_clock_start_sec);
    glob_optimal_expect_sec := comp_expect_sec(convfloat(t_end),
        convfloat(t_start), convfloat(array_t[1]) + convfloat(glob_h),
        convfloat(opt_clock_sec));
    percent_done := comp_percent(convfloat(t_end), convfloat(t_start),
        convfloat(array_t[1]) + convfloat(glob_h));
    glob_percent_done := percent_done;
    omniout_str_noeol(INFO, "Total Elapsed Time              ");
    omniout_timestr(convfloat(total_clock_sec));
    omniout_str_noeol(INFO, "Elapsed Time(since restart)     ");
    omniout_timestr(convfloat(glob_clock_sec));
    if convfloat(percent_done) < convfloat(100.0) then
        omniout_str_noeol(INFO, "Expected Time Remaining         ");
        omniout_timestr(convfloat(expect_sec));
        omniout_str_noeol(INFO, "Optimized Time Remaining        ");
        omniout_timestr(convfloat(glob_optimal_expect_sec))
    end if;
    omniout_str_noeol(INFO, "Time to Timeout                 ");
    omniout_timestr(convfloat(left_sec));
    omniout_float(INFO, "Percent Done                    ", 33,
        percent_done, 4, "%")
end proc

>   # Begin Function number 6
>  check_for_pole := proc()
>  global
>  DEBUGMASSIVE,
>  glob_max_terms,
>  DEBUGL,
>  ALWAYS,
>  INFO,
>  glob_iolevel,
>  #Top Generate Globals Decl
>  glob_log10abserr,
>  glob_curr_iter_when_opt,
>  glob_small_float,
>  glob_dump_analytic,
>  djd_debug,
>  glob_dump,
>  glob_max_minutes,
>  glob_start,
>  glob_look_poles,
>  glob_percent_done,
>  glob_reached_optimal_h,
>  min_in_hour,
>  glob_max_opt_iter,
>  glob_html_log,
>  glob_max_rel_trunc_err,
>  glob_max_iter,
>  glob_disp_incr,
>  hours_in_day,
>  sec_in_min,
>  glob_display_flag,
>  djd_debug2,
>  glob_iter,
>  glob_optimal_start,
>  glob_relerr,
>  glob_abserr,
>  glob_large_float,
>  glob_hmin,
>  glob_h,
>  glob_optimal_expect_sec,
>  glob_normmax,
>  glob_current_iter,
>  glob_unchanged_h_cnt,
>  glob_no_eqs,
>  glob_max_order,
>  glob_log10_abserr,
>  glob_hmin_init,
>  glob_optimal_done,
>  glob_not_yet_finished,
>  glob_clock_sec,
>  glob_almost_1,
>  years_in_century,
>  days_in_year,
>  glob_orig_start_sec,
>  glob_warned2,
>  glob_warned,
>  glob_smallish_float,
>  glob_max_hours,
>  glob_last_good_h,
>  glob_not_yet_start_msg,
>  centuries_in_millinium,
>  glob_log10_relerr,
>  glob_initial_pass,
>  glob_clock_start_sec,
>  glob_log10normmin,
>  glob_optimal_clock_start_sec,
>  glob_hmax,
>  glob_log10relerr,
>  MAX_UNCHANGED,
>  glob_max_sec,
>  glob_max_trunc_err,
>  #Bottom Generate Globals Decl
>  #BEGIN CONST
>  array_const_2D0,
>  array_const_4D0,
>  array_const_1,
>  array_const_3D0,
>  array_const_2,
>  array_const_0D0,
>  #END CONST
>  array_type_pole,
>  array_last_rel_error,
>  array_x1_init,
>  array_m1,
>  array_x2,
>  array_x1,
>  array_1st_rel_error,
>  array_x2_init,
>  array_t,
>  array_norms,
>  array_tmp0,
>  array_tmp1,
>  array_tmp2,
>  array_tmp3,
>  array_tmp4,
>  array_tmp5,
>  array_tmp6,
>  array_tmp7,
>  array_tmp8,
>  array_tmp9,
>  array_tmp10,
>  array_tmp11,
>  array_tmp12,
>  array_tmp13,
>  array_tmp14,
>  array_tmp15,
>  array_tmp16,
>  array_tmp17,
>  array_pole,
>  array_real_pole,
>  array_x1_higher_work2,
>  array_poles,
>  array_x1_higher_work,
>  array_x2_higher_work,
>  array_x2_higher_work2,
>  array_x2_higher,
>  array_x1_higher,
>  array_complex_pole,
>  glob_last;
>  
>  local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found;
>  #TOP CHECK FOR POLE
>  #IN RADII REAL EQ = 1
>  #Computes radius of convergence and r_order of pole from 3 adjacent Taylor series terms. EQUATUON NUMBER 1
>  #Applies to pole of arbitrary r_order on the real axis,
>  #Due to Prof. George Corliss.
>  n  :=  glob_max_terms;
>  m  :=  n - 2 - 1;
>  while ((m >= 10) and ((abs(array_x2_higher[1,m]) < glob_small_float) or (abs(array_x2_higher[1,m-1]) < glob_small_float) or (abs(array_x2_higher[1,m-2]) < glob_small_float )))  do # do number 2
>   m  :=  m - 1;
>   od;# end do number 2
>  ;
>  if (m > 10)  then # if number 1
>   rm0  := array_x2_higher[1,m]/array_x2_higher[1,m-1];
>   rm1  := array_x2_higher[1,m-1]/array_x2_higher[1,m-2];
>   hdrc  := convfloat(m-1)*rm0-convfloat(m-2)*rm1;
>   if (abs(hdrc) > glob_small_float)   then # if number 2
>     rcs  :=  glob_h/hdrc;
>     ord_no  :=  convfloat(m-1)*rm0/hdrc - convfloat(m) + 2.0;
>     array_real_pole[1,1] :=  rcs;
>     array_real_pole[1,2] :=   ord_no;
>     else
>     array_real_pole[1,1] :=  glob_large_float;
>     array_real_pole[1,2] :=  glob_large_float;
>     fi;# end if 2
>   else
>   array_real_pole[1,1] :=  glob_large_float;
>   array_real_pole[1,2] :=  glob_large_float;
>   fi;# end if 1
>  ;
>  #BOTTOM RADII REAL EQ = 1
>  #IN RADII REAL EQ = 2
>  #Computes radius of convergence and r_order of pole from 3 adjacent Taylor series terms. EQUATUON NUMBER 2
>  #Applies to pole of arbitrary r_order on the real axis,
>  #Due to Prof. George Corliss.
>  n  :=  glob_max_terms;
>  m  :=  n - 1 - 1;
>  while ((m >= 10) and ((abs(array_x1_higher[1,m]) < glob_small_float) or (abs(array_x1_higher[1,m-1]) < glob_small_float) or (abs(array_x1_higher[1,m-2]) < glob_small_float )))  do # do number 2
>   m  :=  m - 1;
>   od;# end do number 2
>  ;
>  if (m > 10)  then # if number 1
>   rm0  := array_x1_higher[1,m]/array_x1_higher[1,m-1];
>   rm1  := array_x1_higher[1,m-1]/array_x1_higher[1,m-2];
>   hdrc  := convfloat(m-1)*rm0-convfloat(m-2)*rm1;
>   if (abs(hdrc) > glob_small_float)   then # if number 2
>     rcs  :=  glob_h/hdrc;
>     ord_no  :=  convfloat(m-1)*rm0/hdrc - convfloat(m) + 2.0;
>     array_real_pole[2,1] :=  rcs;
>     array_real_pole[2,2] :=   ord_no;
>     else
>     array_real_pole[2,1] :=  glob_large_float;
>     array_real_pole[2,2] :=  glob_large_float;
>     fi;# end if 2
>   else
>   array_real_pole[2,1] :=  glob_large_float;
>   array_real_pole[2,2] :=  glob_large_float;
>   fi;# end if 1
>  ;
>  #BOTTOM RADII REAL EQ = 2
>  #TOP RADII COMPLEX EQ = 1
>  #Computes radius of convergence for complex conjugate pair of poles.
>  #from 6 adjacent Taylor series terms
>  #Also computes r_order of poles.
>  #Due to Manuel Prieto.
>  #With a correction by Dennis J. Darland
>  n  :=  glob_max_terms - 2 - 1;
>  cnt  :=  0;
>  while ((cnt < 5)  and (n >= 10))  do # do number 2
>   if (abs(array_x2_higher[1,n]) > glob_small_float)  then # if number 1
>     cnt  :=  cnt + 1;
>     else
>     cnt  :=  0;
>     fi;# end if 1
>   ;
>   n  :=  n - 1;
>   od;# end do number 2
>  ;
>  m  :=  n + cnt;
>  if (m <= 10)  then # if number 1
>   array_complex_pole[1,1] :=  glob_large_float;
>   array_complex_pole[1,2] :=  glob_large_float;
>   elif (abs(array_x2_higher[1,m]) >= (glob_large_float)) or (abs(array_x2_higher[1,m-1]) >=(glob_large_float)) or (abs(array_x2_higher[1,m-2]) >= (glob_large_float)) or (abs(array_x2_higher[1,m-3]) >= (glob_large_float)) or (abs(array_x2_higher[1,m-4]) >= (glob_large_float)) or (abs(array_x2_higher[1,m-5]) >= (glob_large_float))  then # if number 2
>     array_complex_pole[1,1] :=  glob_large_float;
>     array_complex_pole[1,2] :=  glob_large_float;
>     else
>     rm0  :=  (array_x2_higher[1,m])/(array_x2_higher[1,m-1]);
>     rm1  :=  (array_x2_higher[1,m-1])/(array_x2_higher[1,m-2]);
>     rm2  :=  (array_x2_higher[1,m-2])/(array_x2_higher[1,m-3]);
>     rm3  :=  (array_x2_higher[1,m-3])/(array_x2_higher[1,m-4]);
>     rm4  :=  (array_x2_higher[1,m-4])/(array_x2_higher[1,m-5]);
>     nr1  :=  convfloat(m-1)*rm0 - 2.0*convfloat(m-2)*rm1 + convfloat(m-3)*rm2;
>     nr2  :=  convfloat(m-2)*rm1 - 2.0*convfloat(m-3)*rm2 + convfloat(m-4)*rm3;
>     dr1  :=  (-1.0)/rm1 + 2.0/rm2 - 1.0/rm3;
>     dr2  :=  (-1.0)/rm2 + 2.0/rm3 - 1.0/rm4;
>     ds1  :=  3.0/rm1 - 8.0/rm2 + 5.0/rm3;
>     ds2  :=  3.0/rm2 - 8.0/rm3 + 5.0/rm4;
>     if ((abs(nr1 * dr2 - nr2 * dr1) <= glob_small_float) or (abs(dr1) <= glob_small_float))  then # if number 3
>       array_complex_pole[1,1] :=  glob_large_float;
>       array_complex_pole[1,2] :=  glob_large_float;
>       else
>       if (abs(nr1*dr2 - nr2 * dr1) > glob_small_float)  then # if number 4
>         rcs  :=  ((ds1*dr2 - ds2*dr1 +dr1*dr2)/(nr1*dr2 - nr2 * dr1));
>         #(Manuels)  rcs  :=  (ds1*dr2 - ds2*dr1)/(nr1*dr2 - nr2 * dr1)
>         ord_no  :=  (rcs*nr1 - ds1)/(2.0*dr1) -convfloat(m)/2.0;
>         if (abs(rcs) > glob_small_float)  then # if number 5
>           if (rcs > 0.0)  then # if number 6
>             rad_c  :=  sqrt(rcs) * glob_h;
>             else
>             rad_c  :=  glob_large_float;
>             fi;# end if 6
>           else
>           rad_c  :=  glob_large_float;
>           ord_no  :=  glob_large_float;
>           fi;# end if 5
>         else
>         rad_c  :=  glob_large_float;
>         ord_no  :=  glob_large_float;
>         fi;# end if 4
>       fi;# end if 3
>     ;
>     array_complex_pole[1,1] :=  rad_c;
>     array_complex_pole[1,2] :=  ord_no;
>     fi;# end if 2
>   ;
>   #BOTTOM RADII COMPLEX EQ = 1
>   #TOP RADII COMPLEX EQ = 2
>   #Computes radius of convergence for complex conjugate pair of poles.
>   #from 6 adjacent Taylor series terms
>   #Also computes r_order of poles.
>   #Due to Manuel Prieto.
>   #With a correction by Dennis J. Darland
>   n  :=  glob_max_terms - 1 - 1;
>   cnt  :=  0;
>   while ((cnt < 5)  and (n >= 10))  do # do number 2
>     if (abs(array_x1_higher[1,n]) > glob_small_float)  then # if number 2
>       cnt  :=  cnt + 1;
>       else
>       cnt  :=  0;
>       fi;# end if 2
>     ;
>     n  :=  n - 1;
>     od;# end do number 2
>   ;
>   m  :=  n + cnt;
>   if (m <= 10)  then # if number 2
>     array_complex_pole[2,1] :=  glob_large_float;
>     array_complex_pole[2,2] :=  glob_large_float;
>     elif (abs(array_x1_higher[1,m]) >= (glob_large_float)) or (abs(array_x1_higher[1,m-1]) >=(glob_large_float)) or (abs(array_x1_higher[1,m-2]) >= (glob_large_float)) or (abs(array_x1_higher[1,m-3]) >= (glob_large_float)) or (abs(array_x1_higher[1,m-4]) >= (glob_large_float)) or (abs(array_x1_higher[1,m-5]) >= (glob_large_float))  then # if number 3
>       array_complex_pole[2,1] :=  glob_large_float;
>       array_complex_pole[2,2] :=  glob_large_float;
>       else
>       rm0  :=  (array_x1_higher[1,m])/(array_x1_higher[1,m-1]);
>       rm1  :=  (array_x1_higher[1,m-1])/(array_x1_higher[1,m-2]);
>       rm2  :=  (array_x1_higher[1,m-2])/(array_x1_higher[1,m-3]);
>       rm3  :=  (array_x1_higher[1,m-3])/(array_x1_higher[1,m-4]);
>       rm4  :=  (array_x1_higher[1,m-4])/(array_x1_higher[1,m-5]);
>       nr1  :=  convfloat(m-1)*rm0 - 2.0*convfloat(m-2)*rm1 + convfloat(m-3)*rm2;
>       nr2  :=  convfloat(m-2)*rm1 - 2.0*convfloat(m-3)*rm2 + convfloat(m-4)*rm3;
>       dr1  :=  (-1.0)/rm1 + 2.0/rm2 - 1.0/rm3;
>       dr2  :=  (-1.0)/rm2 + 2.0/rm3 - 1.0/rm4;
>       ds1  :=  3.0/rm1 - 8.0/rm2 + 5.0/rm3;
>       ds2  :=  3.0/rm2 - 8.0/rm3 + 5.0/rm4;
>       if ((abs(nr1 * dr2 - nr2 * dr1) <= glob_small_float) or (abs(dr1) <= glob_small_float))  then # if number 4
>         array_complex_pole[2,1] :=  glob_large_float;
>         array_complex_pole[2,2] :=  glob_large_float;
>         else
>         if (abs(nr1*dr2 - nr2 * dr1) > glob_small_float)  then # if number 5
>           rcs  :=  ((ds1*dr2 - ds2*dr1 +dr1*dr2)/(nr1*dr2 - nr2 * dr1));
>           #(Manuels)  rcs  :=  (ds1*dr2 - ds2*dr1)/(nr1*dr2 - nr2 * dr1)
>           ord_no  :=  (rcs*nr1 - ds1)/(2.0*dr1) -convfloat(m)/2.0;
>           if (abs(rcs) > glob_small_float)  then # if number 6
>             if (rcs > 0.0)  then # if number 7
>               rad_c  :=  sqrt(rcs) * glob_h;
>               else
>               rad_c  :=  glob_large_float;
>               fi;# end if 7
>             else
>             rad_c  :=  glob_large_float;
>             ord_no  :=  glob_large_float;
>             fi;# end if 6
>           else
>           rad_c  :=  glob_large_float;
>           ord_no  :=  glob_large_float;
>           fi;# end if 5
>         fi;# end if 4
>       ;
>       array_complex_pole[2,1] :=  rad_c;
>       array_complex_pole[2,2] :=  ord_no;
>       fi;# end if 3
>     ;
>     #BOTTOM RADII COMPLEX EQ = 2
>     found := false;
>     #TOP WHICH RADII EQ = 1
>     if not found and ((array_real_pole[1,1] =  glob_large_float) or (array_real_pole[1,2] =  glob_large_float)) and ((array_complex_pole[1,1] <>  glob_large_float) and (array_complex_pole[1,2] <>  glob_large_float)) and ((array_complex_pole[1,1] > 0.0) and (array_complex_pole[1,2] > 0.0))   then # if number 3
>       array_poles[1,1] :=  array_complex_pole[1,1];
>       array_poles[1,2] :=  array_complex_pole[1,2];
>       found := true;
>       array_type_pole[1] := 2;
>       if (glob_display_flag)   then # if number 4
>         omniout_str(ALWAYS,"Complex estimate of poles used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if  not found and ((array_real_pole[1,1] <>  glob_large_float) and (array_real_pole[1,2] <>  glob_large_float) and (array_real_pole[1,1] > 0.0) and (array_real_pole[1,2] > 0.0) and ((array_complex_pole[1,1] =  glob_large_float) or (array_complex_pole[1,2] =  glob_large_float) or (array_complex_pole[1,1] <= 0.0 ) or (array_complex_pole[1,2] <= 0.0)))  then # if number 3
>       array_poles[1,1] :=  array_real_pole[1,1];
>       array_poles[1,2] :=  array_real_pole[1,2];
>       found := true;
>       array_type_pole[1] := 1;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"Real estimate of pole used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and (((array_real_pole[1,1] =  glob_large_float) or (array_real_pole[1,2] =  glob_large_float)) and ((array_complex_pole[1,1] =  glob_large_float) or (array_complex_pole[1,2] =  glob_large_float)))  then # if number 3
>       array_poles[1,1] :=  glob_large_float;
>       array_poles[1,2] :=  glob_large_float;
>       found := true;
>       array_type_pole[1] := 3;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"NO POLE");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and ((array_real_pole[1,1] < array_complex_pole[1,1]) and (array_real_pole[1,1] > 0.0) and (array_real_pole[1,2] > 0.0))  then # if number 3
>       array_poles[1,1] :=  array_real_pole[1,1];
>       array_poles[1,2] :=  array_real_pole[1,2];
>       found := true;
>       array_type_pole[1] := 1;
>       if (glob_display_flag)   then # if number 4
>         omniout_str(ALWAYS,"Real estimate of pole used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and ((array_complex_pole[1,1] <>  glob_large_float) and (array_complex_pole[1,2] <>  glob_large_float) and (array_complex_pole[1,1] > 0.0) and (array_complex_pole[1,2] > 0.0))  then # if number 3
>       array_poles[1,1] :=  array_complex_pole[1,1];
>       array_poles[1,2] :=  array_complex_pole[1,2];
>       array_type_pole[1] := 2;
>       found := true;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"Complex estimate of poles used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found  then # if number 3
>       array_poles[1,1] :=  glob_large_float;
>       array_poles[1,2] :=  glob_large_float;
>       array_type_pole[1] := 3;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"NO POLE");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     #BOTTOM WHICH RADII EQ = 1
>     found := false;
>     #TOP WHICH RADII EQ = 2
>     if not found and ((array_real_pole[2,1] =  glob_large_float) or (array_real_pole[2,2] =  glob_large_float)) and ((array_complex_pole[2,1] <>  glob_large_float) and (array_complex_pole[2,2] <>  glob_large_float)) and ((array_complex_pole[2,1] > 0.0) and (array_complex_pole[2,2] > 0.0))   then # if number 3
>       array_poles[2,1] :=  array_complex_pole[2,1];
>       array_poles[2,2] :=  array_complex_pole[2,2];
>       found := true;
>       array_type_pole[2] := 2;
>       if (glob_display_flag)   then # if number 4
>         omniout_str(ALWAYS,"Complex estimate of poles used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if  not found and ((array_real_pole[2,1] <>  glob_large_float) and (array_real_pole[2,2] <>  glob_large_float) and (array_real_pole[2,1] > 0.0) and (array_real_pole[2,2] > 0.0) and ((array_complex_pole[2,1] =  glob_large_float) or (array_complex_pole[2,2] =  glob_large_float) or (array_complex_pole[2,1] <= 0.0 ) or (array_complex_pole[2,2] <= 0.0)))  then # if number 3
>       array_poles[2,1] :=  array_real_pole[2,1];
>       array_poles[2,2] :=  array_real_pole[2,2];
>       found := true;
>       array_type_pole[2] := 1;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"Real estimate of pole used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and (((array_real_pole[2,1] =  glob_large_float) or (array_real_pole[2,2] =  glob_large_float)) and ((array_complex_pole[2,1] =  glob_large_float) or (array_complex_pole[2,2] =  glob_large_float)))  then # if number 3
>       array_poles[2,1] :=  glob_large_float;
>       array_poles[2,2] :=  glob_large_float;
>       found := true;
>       array_type_pole[2] := 3;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"NO POLE");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and ((array_real_pole[2,1] < array_complex_pole[2,1]) and (array_real_pole[2,1] > 0.0) and (array_real_pole[2,2] > 0.0))  then # if number 3
>       array_poles[2,1] :=  array_real_pole[2,1];
>       array_poles[2,2] :=  array_real_pole[2,2];
>       found := true;
>       array_type_pole[2] := 1;
>       if (glob_display_flag)   then # if number 4
>         omniout_str(ALWAYS,"Real estimate of pole used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found and ((array_complex_pole[2,1] <>  glob_large_float) and (array_complex_pole[2,2] <>  glob_large_float) and (array_complex_pole[2,1] > 0.0) and (array_complex_pole[2,2] > 0.0))  then # if number 3
>       array_poles[2,1] :=  array_complex_pole[2,1];
>       array_poles[2,2] :=  array_complex_pole[2,2];
>       array_type_pole[2] := 2;
>       found := true;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"Complex estimate of poles used");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     if not found  then # if number 3
>       array_poles[2,1] :=  glob_large_float;
>       array_poles[2,2] :=  glob_large_float;
>       array_type_pole[2] := 3;
>       if (glob_display_flag)  then # if number 4
>         omniout_str(ALWAYS,"NO POLE");
>         fi;# end if 4
>       ;
>       fi;# end if 3
>     ;
>     #BOTTOM WHICH RADII EQ = 2
>     array_pole[1] :=  glob_large_float;
>     array_pole[2] :=  glob_large_float;
>     #TOP WHICH RADIUS EQ = 1
>     if array_pole[1] > array_poles[1,1] then # if number 3
>       array_pole[1] := array_poles[1,1];
>       array_pole[2] := array_poles[1,2];
>       fi;# end if 3
>     ;
>     #BOTTOM WHICH RADIUS EQ = 1
>     #TOP WHICH RADIUS EQ = 2
>     if array_pole[1] > array_poles[2,1] then # if number 3
>       array_pole[1] := array_poles[2,1];
>       array_pole[2] := array_poles[2,2];
>       fi;# end if 3
>     ;
>     #BOTTOM WHICH RADIUS EQ = 2
>     #BOTTOM CHECK FOR POLE
>     display_pole();
>     # End Function number 6
>     end;
check_for_pole := proc()
local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs,
rm0, rm1, rm2, rm3, rm4, found;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    n := glob_max_terms;
    m := n - 3;
    while 10 <= m and (abs(array_x2_higher[1, m]) < glob_small_float or
    abs(array_x2_higher[1, m - 1]) < glob_small_float or
    abs(array_x2_higher[1, m - 2]) < glob_small_float) do m := m - 1
    end do;
    if 10 < m then
        rm0 := array_x2_higher[1, m]/array_x2_higher[1, m - 1];
        rm1 := array_x2_higher[1, m - 1]/array_x2_higher[1, m - 2];
        hdrc := convfloat(m - 1)*rm0 - convfloat(m - 2)*rm1;
        if glob_small_float < abs(hdrc) then
            rcs := glob_h/hdrc;
            ord_no := convfloat(m - 1)*rm0/hdrc - convfloat(m) + 2.0;
            array_real_pole[1, 1] := rcs;
            array_real_pole[1, 2] := ord_no
        else
            array_real_pole[1, 1] := glob_large_float;
            array_real_pole[1, 2] := glob_large_float
        end if
    else
        array_real_pole[1, 1] := glob_large_float;
        array_real_pole[1, 2] := glob_large_float
    end if;
    n := glob_max_terms;
    m := n - 2;
    while 10 <= m and (abs(array_x1_higher[1, m]) < glob_small_float or
    abs(array_x1_higher[1, m - 1]) < glob_small_float or
    abs(array_x1_higher[1, m - 2]) < glob_small_float) do m := m - 1
    end do;
    if 10 < m then
        rm0 := array_x1_higher[1, m]/array_x1_higher[1, m - 1];
        rm1 := array_x1_higher[1, m - 1]/array_x1_higher[1, m - 2];
        hdrc := convfloat(m - 1)*rm0 - convfloat(m - 2)*rm1;
        if glob_small_float < abs(hdrc) then
            rcs := glob_h/hdrc;
            ord_no := convfloat(m - 1)*rm0/hdrc - convfloat(m) + 2.0;
            array_real_pole[2, 1] := rcs;
            array_real_pole[2, 2] := ord_no
        else
            array_real_pole[2, 1] := glob_large_float;
            array_real_pole[2, 2] := glob_large_float
        end if
    else
        array_real_pole[2, 1] := glob_large_float;
        array_real_pole[2, 2] := glob_large_float
    end if;
    n := glob_max_terms - 3;
    cnt := 0;
    while cnt < 5 and 10 <= n do
        if glob_small_float < abs(array_x2_higher[1, n]) then
            cnt := cnt + 1
        else cnt := 0
        end if;
        n := n - 1
    end do;
    m := n + cnt;
    if m <= 10 then
        array_complex_pole[1, 1] := glob_large_float;
        array_complex_pole[1, 2] := glob_large_float
    elif glob_large_float <= abs(array_x2_higher[1, m]) or
    glob_large_float <= abs(array_x2_higher[1, m - 1]) or
    glob_large_float <= abs(array_x2_higher[1, m - 2]) or
    glob_large_float <= abs(array_x2_higher[1, m - 3]) or
    glob_large_float <= abs(array_x2_higher[1, m - 4]) or
    glob_large_float <= abs(array_x2_higher[1, m - 5]) then
        array_complex_pole[1, 1] := glob_large_float;
        array_complex_pole[1, 2] := glob_large_float
    else
        rm0 := array_x2_higher[1, m]/array_x2_higher[1, m - 1];
        rm1 := array_x2_higher[1, m - 1]/array_x2_higher[1, m - 2];
        rm2 := array_x2_higher[1, m - 2]/array_x2_higher[1, m - 3];
        rm3 := array_x2_higher[1, m - 3]/array_x2_higher[1, m - 4];
        rm4 := array_x2_higher[1, m - 4]/array_x2_higher[1, m - 5];
        nr1 := convfloat(m - 1)*rm0 - 2.0*convfloat(m - 2)*rm1
             + convfloat(m - 3)*rm2;
        nr2 := convfloat(m - 2)*rm1 - 2.0*convfloat(m - 3)*rm2
             + convfloat(m - 4)*rm3;
        dr1 := (-1)*(1.0)/rm1 + 2.0/rm2 - 1.0/rm3;
        dr2 := (-1)*(1.0)/rm2 + 2.0/rm3 - 1.0/rm4;
        ds1 := 3.0/rm1 - 8.0/rm2 + 5.0/rm3;
        ds2 := 3.0/rm2 - 8.0/rm3 + 5.0/rm4;
        if abs(nr1*dr2 - nr2*dr1) <= glob_small_float or
        abs(dr1) <= glob_small_float then
            array_complex_pole[1, 1] := glob_large_float;
            array_complex_pole[1, 2] := glob_large_float
        else
            if glob_small_float < abs(nr1*dr2 - nr2*dr1) then
                rcs := (ds1*dr2 - ds2*dr1 + dr1*dr2)/(nr1*dr2 - nr2*dr1);
                ord_no := (rcs*nr1 - ds1)/(2.0*dr1) - convfloat(m)/2.0;
                if glob_small_float < abs(rcs) then
                    if 0. < rcs then rad_c := sqrt(rcs)*glob_h
                    else rad_c := glob_large_float
                    end if
                else rad_c := glob_large_float; ord_no := glob_large_float
                end if
            else rad_c := glob_large_float; ord_no := glob_large_float
            end if
        end if;
        array_complex_pole[1, 1] := rad_c;
        array_complex_pole[1, 2] := ord_no
    end if;
    n := glob_max_terms - 2;
    cnt := 0;
    while cnt < 5 and 10 <= n do
        if glob_small_float < abs(array_x1_higher[1, n]) then
            cnt := cnt + 1
        else cnt := 0
        end if;
        n := n - 1
    end do;
    m := n + cnt;
    if m <= 10 then
        array_complex_pole[2, 1] := glob_large_float;
        array_complex_pole[2, 2] := glob_large_float
    elif glob_large_float <= abs(array_x1_higher[1, m]) or
    glob_large_float <= abs(array_x1_higher[1, m - 1]) or
    glob_large_float <= abs(array_x1_higher[1, m - 2]) or
    glob_large_float <= abs(array_x1_higher[1, m - 3]) or
    glob_large_float <= abs(array_x1_higher[1, m - 4]) or
    glob_large_float <= abs(array_x1_higher[1, m - 5]) then
        array_complex_pole[2, 1] := glob_large_float;
        array_complex_pole[2, 2] := glob_large_float
    else
        rm0 := array_x1_higher[1, m]/array_x1_higher[1, m - 1];
        rm1 := array_x1_higher[1, m - 1]/array_x1_higher[1, m - 2];
        rm2 := array_x1_higher[1, m - 2]/array_x1_higher[1, m - 3];
        rm3 := array_x1_higher[1, m - 3]/array_x1_higher[1, m - 4];
        rm4 := array_x1_higher[1, m - 4]/array_x1_higher[1, m - 5];
        nr1 := convfloat(m - 1)*rm0 - 2.0*convfloat(m - 2)*rm1
             + convfloat(m - 3)*rm2;
        nr2 := convfloat(m - 2)*rm1 - 2.0*convfloat(m - 3)*rm2
             + convfloat(m - 4)*rm3;
        dr1 := (-1)*(1.0)/rm1 + 2.0/rm2 - 1.0/rm3;
        dr2 := (-1)*(1.0)/rm2 + 2.0/rm3 - 1.0/rm4;
        ds1 := 3.0/rm1 - 8.0/rm2 + 5.0/rm3;
        ds2 := 3.0/rm2 - 8.0/rm3 + 5.0/rm4;
        if abs(nr1*dr2 - nr2*dr1) <= glob_small_float or
        abs(dr1) <= glob_small_float then
            array_complex_pole[2, 1] := glob_large_float;
            array_complex_pole[2, 2] := glob_large_float
        else
            if glob_small_float < abs(nr1*dr2 - nr2*dr1) then
                rcs := (ds1*dr2 - ds2*dr1 + dr1*dr2)/(nr1*dr2 - nr2*dr1);
                ord_no := (rcs*nr1 - ds1)/(2.0*dr1) - convfloat(m)/2.0;
                if glob_small_float < abs(rcs) then
                    if 0. < rcs then rad_c := sqrt(rcs)*glob_h
                    else rad_c := glob_large_float
                    end if
                else rad_c := glob_large_float; ord_no := glob_large_float
                end if
            else rad_c := glob_large_float; ord_no := glob_large_float
            end if
        end if;
        array_complex_pole[2, 1] := rad_c;
        array_complex_pole[2, 2] := ord_no
    end if;
    found := false;
    if not found and (array_real_pole[1, 1] = glob_large_float or
    array_real_pole[1, 2] = glob_large_float) and
    array_complex_pole[1, 1] <> glob_large_float and
    array_complex_pole[1, 2] <> glob_large_float and
    0. < array_complex_pole[1, 1] and 0. < array_complex_pole[1, 2] then
        array_poles[1, 1] := array_complex_pole[1, 1];
        array_poles[1, 2] := array_complex_pole[1, 2];
        found := true;
        array_type_pole[1] := 2;
        if glob_display_flag then
            omniout_str(ALWAYS, "Complex estimate of poles used")
        end if
    end if;
    if not found and array_real_pole[1, 1] <> glob_large_float and
    array_real_pole[1, 2] <> glob_large_float and
    0. < array_real_pole[1, 1] and 0. < array_real_pole[1, 2] and (
    array_complex_pole[1, 1] = glob_large_float or
    array_complex_pole[1, 2] = glob_large_float or
    array_complex_pole[1, 1] <= 0. or array_complex_pole[1, 2] <= 0.) then
        array_poles[1, 1] := array_real_pole[1, 1];
        array_poles[1, 2] := array_real_pole[1, 2];
        found := true;
        array_type_pole[1] := 1;
        if glob_display_flag then
            omniout_str(ALWAYS, "Real estimate of pole used")
        end if
    end if;
    if not found and (array_real_pole[1, 1] = glob_large_float or
    array_real_pole[1, 2] = glob_large_float) and (
    array_complex_pole[1, 1] = glob_large_float or
    array_complex_pole[1, 2] = glob_large_float) then
        array_poles[1, 1] := glob_large_float;
        array_poles[1, 2] := glob_large_float;
        found := true;
        array_type_pole[1] := 3;
        if glob_display_flag then omniout_str(ALWAYS, "NO POLE") end if
    end if;
    if not found and array_real_pole[1, 1] < array_complex_pole[1, 1] and
    0. < array_real_pole[1, 1] and 0. < array_real_pole[1, 2] then
        array_poles[1, 1] := array_real_pole[1, 1];
        array_poles[1, 2] := array_real_pole[1, 2];
        found := true;
        array_type_pole[1] := 1;
        if glob_display_flag then
            omniout_str(ALWAYS, "Real estimate of pole used")
        end if
    end if;
    if not found and array_complex_pole[1, 1] <> glob_large_float and
    array_complex_pole[1, 2] <> glob_large_float and
    0. < array_complex_pole[1, 1] and 0. < array_complex_pole[1, 2] then
        array_poles[1, 1] := array_complex_pole[1, 1];
        array_poles[1, 2] := array_complex_pole[1, 2];
        array_type_pole[1] := 2;
        found := true;
        if glob_display_flag then
            omniout_str(ALWAYS, "Complex estimate of poles used")
        end if
    end if;
    if not found then
        array_poles[1, 1] := glob_large_float;
        array_poles[1, 2] := glob_large_float;
        array_type_pole[1] := 3;
        if glob_display_flag then omniout_str(ALWAYS, "NO POLE") end if
    end if;
    found := false;
    if not found and (array_real_pole[2, 1] = glob_large_float or
    array_real_pole[2, 2] = glob_large_float) and
    array_complex_pole[2, 1] <> glob_large_float and
    array_complex_pole[2, 2] <> glob_large_float and
    0. < array_complex_pole[2, 1] and 0. < array_complex_pole[2, 2] then
        array_poles[2, 1] := array_complex_pole[2, 1];
        array_poles[2, 2] := array_complex_pole[2, 2];
        found := true;
        array_type_pole[2] := 2;
        if glob_display_flag then
            omniout_str(ALWAYS, "Complex estimate of poles used")
        end if
    end if;
    if not found and array_real_pole[2, 1] <> glob_large_float and
    array_real_pole[2, 2] <> glob_large_float and
    0. < array_real_pole[2, 1] and 0. < array_real_pole[2, 2] and (
    array_complex_pole[2, 1] = glob_large_float or
    array_complex_pole[2, 2] = glob_large_float or
    array_complex_pole[2, 1] <= 0. or array_complex_pole[2, 2] <= 0.) then
        array_poles[2, 1] := array_real_pole[2, 1];
        array_poles[2, 2] := array_real_pole[2, 2];
        found := true;
        array_type_pole[2] := 1;
        if glob_display_flag then
            omniout_str(ALWAYS, "Real estimate of pole used")
        end if
    end if;
    if not found and (array_real_pole[2, 1] = glob_large_float or
    array_real_pole[2, 2] = glob_large_float) and (
    array_complex_pole[2, 1] = glob_large_float or
    array_complex_pole[2, 2] = glob_large_float) then
        array_poles[2, 1] := glob_large_float;
        array_poles[2, 2] := glob_large_float;
        found := true;
        array_type_pole[2] := 3;
        if glob_display_flag then omniout_str(ALWAYS, "NO POLE") end if
    end if;
    if not found and array_real_pole[2, 1] < array_complex_pole[2, 1] and
    0. < array_real_pole[2, 1] and 0. < array_real_pole[2, 2] then
        array_poles[2, 1] := array_real_pole[2, 1];
        array_poles[2, 2] := array_real_pole[2, 2];
        found := true;
        array_type_pole[2] := 1;
        if glob_display_flag then
            omniout_str(ALWAYS, "Real estimate of pole used")
        end if
    end if;
    if not found and array_complex_pole[2, 1] <> glob_large_float and
    array_complex_pole[2, 2] <> glob_large_float and
    0. < array_complex_pole[2, 1] and 0. < array_complex_pole[2, 2] then
        array_poles[2, 1] := array_complex_pole[2, 1];
        array_poles[2, 2] := array_complex_pole[2, 2];
        array_type_pole[2] := 2;
        found := true;
        if glob_display_flag then
            omniout_str(ALWAYS, "Complex estimate of poles used")
        end if
    end if;
    if not found then
        array_poles[2, 1] := glob_large_float;
        array_poles[2, 2] := glob_large_float;
        array_type_pole[2] := 3;
        if glob_display_flag then omniout_str(ALWAYS, "NO POLE") end if
    end if;
    array_pole[1] := glob_large_float;
    array_pole[2] := glob_large_float;
    if array_poles[1, 1] < array_pole[1] then
        array_pole[1] := array_poles[1, 1];
        array_pole[2] := array_poles[1, 2]
    end if;
    if array_poles[2, 1] < array_pole[1] then
        array_pole[1] := array_poles[2, 1];
        array_pole[2] := array_poles[2, 2]
    end if;
    display_pole()
end proc

>   # Begin Function number 7
>     get_norms := proc()
>     global
>     DEBUGMASSIVE,
>     glob_max_terms,
>     DEBUGL,
>     ALWAYS,
>     INFO,
>     glob_iolevel,
>     #Top Generate Globals Decl
>     glob_log10abserr,
>     glob_curr_iter_when_opt,
>     glob_small_float,
>     glob_dump_analytic,
>     djd_debug,
>     glob_dump,
>     glob_max_minutes,
>     glob_start,
>     glob_look_poles,
>     glob_percent_done,
>     glob_reached_optimal_h,
>     min_in_hour,
>     glob_max_opt_iter,
>     glob_html_log,
>     glob_max_rel_trunc_err,
>     glob_max_iter,
>     glob_disp_incr,
>     hours_in_day,
>     sec_in_min,
>     glob_display_flag,
>     djd_debug2,
>     glob_iter,
>     glob_optimal_start,
>     glob_relerr,
>     glob_abserr,
>     glob_large_float,
>     glob_hmin,
>     glob_h,
>     glob_optimal_expect_sec,
>     glob_normmax,
>     glob_current_iter,
>     glob_unchanged_h_cnt,
>     glob_no_eqs,
>     glob_max_order,
>     glob_log10_abserr,
>     glob_hmin_init,
>     glob_optimal_done,
>     glob_not_yet_finished,
>     glob_clock_sec,
>     glob_almost_1,
>     years_in_century,
>     days_in_year,
>     glob_orig_start_sec,
>     glob_warned2,
>     glob_warned,
>     glob_smallish_float,
>     glob_max_hours,
>     glob_last_good_h,
>     glob_not_yet_start_msg,
>     centuries_in_millinium,
>     glob_log10_relerr,
>     glob_initial_pass,
>     glob_clock_start_sec,
>     glob_log10normmin,
>     glob_optimal_clock_start_sec,
>     glob_hmax,
>     glob_log10relerr,
>     MAX_UNCHANGED,
>     glob_max_sec,
>     glob_max_trunc_err,
>     #Bottom Generate Globals Decl
>     #BEGIN CONST
>     array_const_2D0,
>     array_const_4D0,
>     array_const_1,
>     array_const_3D0,
>     array_const_2,
>     array_const_0D0,
>     #END CONST
>     array_type_pole,
>     array_last_rel_error,
>     array_x1_init,
>     array_m1,
>     array_x2,
>     array_x1,
>     array_1st_rel_error,
>     array_x2_init,
>     array_t,
>     array_norms,
>     array_tmp0,
>     array_tmp1,
>     array_tmp2,
>     array_tmp3,
>     array_tmp4,
>     array_tmp5,
>     array_tmp6,
>     array_tmp7,
>     array_tmp8,
>     array_tmp9,
>     array_tmp10,
>     array_tmp11,
>     array_tmp12,
>     array_tmp13,
>     array_tmp14,
>     array_tmp15,
>     array_tmp16,
>     array_tmp17,
>     array_pole,
>     array_real_pole,
>     array_x1_higher_work2,
>     array_poles,
>     array_x1_higher_work,
>     array_x2_higher_work,
>     array_x2_higher_work2,
>     array_x2_higher,
>     array_x1_higher,
>     array_complex_pole,
>     glob_last;
>     
>     local iii;
>     if (not glob_initial_pass)  then # if number 3
>       set_z(array_norms,glob_max_terms+1);
>       #TOP GET NORMS
>       iii   :=  1;
>       while (iii <= glob_max_terms)  do # do number 2
>         if (abs(array_x2[iii]) > array_norms[iii]) then # if number 4
>           array_norms[iii] := abs(array_x2[iii]);
>           fi;# end if 4
>         ;
>         iii   :=  iii + 1;
>         od;# end do number 2
>       ;
>       iii   :=  1;
>       while (iii <= glob_max_terms)  do # do number 2
>         if (abs(array_x1[iii]) > array_norms[iii]) then # if number 4
>           array_norms[iii] := abs(array_x1[iii]);
>           fi;# end if 4
>         ;
>         iii   :=  iii + 1;
>         od;# end do number 2
>       #GET NORMS
>       ;
>       fi;# end if 3
>     ;
>     # End Function number 7
>     end;
get_norms := proc()
local iii;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    if not glob_initial_pass then
        set_z(array_norms, glob_max_terms + 1);
        iii := 1;
        while iii <= glob_max_terms do
            if array_norms[iii] < abs(array_x2[iii]) then
                array_norms[iii] := abs(array_x2[iii])
            end if;
            iii := iii + 1
        end do;
        iii := 1;
        while iii <= glob_max_terms do
            if array_norms[iii] < abs(array_x1[iii]) then
                array_norms[iii] := abs(array_x1[iii])
            end if;
            iii := iii + 1
        end do
    end if
end proc

>   # Begin Function number 8
>     atomall := proc()
>     global
>     DEBUGMASSIVE,
>     glob_max_terms,
>     DEBUGL,
>     ALWAYS,
>     INFO,
>     glob_iolevel,
>     #Top Generate Globals Decl
>     glob_log10abserr,
>     glob_curr_iter_when_opt,
>     glob_small_float,
>     glob_dump_analytic,
>     djd_debug,
>     glob_dump,
>     glob_max_minutes,
>     glob_start,
>     glob_look_poles,
>     glob_percent_done,
>     glob_reached_optimal_h,
>     min_in_hour,
>     glob_max_opt_iter,
>     glob_html_log,
>     glob_max_rel_trunc_err,
>     glob_max_iter,
>     glob_disp_incr,
>     hours_in_day,
>     sec_in_min,
>     glob_display_flag,
>     djd_debug2,
>     glob_iter,
>     glob_optimal_start,
>     glob_relerr,
>     glob_abserr,
>     glob_large_float,
>     glob_hmin,
>     glob_h,
>     glob_optimal_expect_sec,
>     glob_normmax,
>     glob_current_iter,
>     glob_unchanged_h_cnt,
>     glob_no_eqs,
>     glob_max_order,
>     glob_log10_abserr,
>     glob_hmin_init,
>     glob_optimal_done,
>     glob_not_yet_finished,
>     glob_clock_sec,
>     glob_almost_1,
>     years_in_century,
>     days_in_year,
>     glob_orig_start_sec,
>     glob_warned2,
>     glob_warned,
>     glob_smallish_float,
>     glob_max_hours,
>     glob_last_good_h,
>     glob_not_yet_start_msg,
>     centuries_in_millinium,
>     glob_log10_relerr,
>     glob_initial_pass,
>     glob_clock_start_sec,
>     glob_log10normmin,
>     glob_optimal_clock_start_sec,
>     glob_hmax,
>     glob_log10relerr,
>     MAX_UNCHANGED,
>     glob_max_sec,
>     glob_max_trunc_err,
>     #Bottom Generate Globals Decl
>     #BEGIN CONST
>     array_const_2D0,
>     array_const_4D0,
>     array_const_1,
>     array_const_3D0,
>     array_const_2,
>     array_const_0D0,
>     #END CONST
>     array_type_pole,
>     array_last_rel_error,
>     array_x1_init,
>     array_m1,
>     array_x2,
>     array_x1,
>     array_1st_rel_error,
>     array_x2_init,
>     array_t,
>     array_norms,
>     array_tmp0,
>     array_tmp1,
>     array_tmp2,
>     array_tmp3,
>     array_tmp4,
>     array_tmp5,
>     array_tmp6,
>     array_tmp7,
>     array_tmp8,
>     array_tmp9,
>     array_tmp10,
>     array_tmp11,
>     array_tmp12,
>     array_tmp13,
>     array_tmp14,
>     array_tmp15,
>     array_tmp16,
>     array_tmp17,
>     array_pole,
>     array_real_pole,
>     array_x1_higher_work2,
>     array_poles,
>     array_x1_higher_work,
>     array_x2_higher_work,
>     array_x2_higher_work2,
>     array_x2_higher,
>     array_x1_higher,
>     array_complex_pole,
>     glob_last;
>     
>     local kkk, order_d, adj2, temporary, term;
>     #TOP ATOMALL
>     #END OUTFILE1
>     #BEGIN ATOMHDR1
>     #emit pre diff $eq_no = 1 i = 1
>     array_tmp1[1] := array_x2_higher[2,1];
>     # emit pre mult $eq_no = 1 i = 1
>     array_tmp2[1] :=  (array_const_3D0[1] * (array_tmp1[1]));
>     #emit pre add $eq_no = 1 i = 1
>     array_tmp3[1] := array_const_0D0[1] + array_tmp2[1];
>     # emit pre mult $eq_no = 1 i = 1
>     array_tmp4[1] :=  (array_const_2D0[1] * (array_x2[1]));
>     #emit pre sub $eq_no = 1 i = 1
>     array_tmp5[1] :=   (array_tmp3[1] - (array_tmp4[1]));
>     #emit pre diff $eq_no = 1 i = 1
>     array_tmp6[1] := array_x1_higher[3,1];
>     #emit pre sub $eq_no = 1 i = 1
>     array_tmp7[1] :=   (array_tmp5[1] - (array_tmp6[1]));
>     #emit pre diff $eq_no = 1 i = 1
>     array_tmp8[1] := array_x1_higher[2,1];
>     #emit pre sub $eq_no = 1 i = 1
>     array_tmp9[1] :=   (array_tmp7[1] - (array_tmp8[1]));
>     #emit pre add $eq_no = 1 i = 1
>     array_tmp10[1] := array_tmp9[1] + array_x1[1];
>     #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5
>     if (1 <= glob_max_terms) then # if number 1
>   temporary := array_tmp10[1] * (glob_h ^ (2)) * factorial_3(0,2);
>   array_x2[3] := temporary;
>   array_x2_higher[1,3] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x2_higher[2,2] := temporary
>   ;
>   temporary := temporary / glob_h * (3.0);
>   array_x2_higher[3,1] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 2;
>     # emit pre mult $eq_no = 2 i = 1
>     array_tmp12[1] :=  (array_const_4D0[1] * (array_x2[1]));
>     #emit pre diff $eq_no = 2 i = 1
>     array_tmp13[1] := array_x2_higher[2,1];
>     # emit pre mult $eq_no = 2 i = 1
>     array_tmp14[1] :=  (array_const_2D0[1] * (array_tmp13[1]));
>     #emit pre sub $eq_no = 2 i = 1
>     array_tmp15[1] :=   (array_tmp12[1] - (array_tmp14[1]));
>     # emit pre mult $eq_no = 2 i = 1
>     array_tmp16[1] :=  (array_const_2D0[1] * (array_x1[1]));
>     #emit pre sub $eq_no = 2 i = 1
>     array_tmp17[1] :=   (array_tmp15[1] - (array_tmp16[1]));
>     #emit pre assign xxx $eq_no = 2 i = 1 $min_hdrs = 5
>     if (1 <= glob_max_terms) then # if number 1
>   temporary := array_tmp17[1] * (glob_h ^ (1)) * factorial_3(0,1);
>   array_x1[2] := temporary;
>   array_x1_higher[1,2] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x1_higher[2,1] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 2;
>     #END ATOMHDR1
>     #BEGIN ATOMHDR2
>     #emit pre diff $eq_no = 1 i = 2
>     array_tmp1[2] := array_x2_higher[2,2];
>     # emit pre mult $eq_no = 1 i = 2
>     array_tmp2[2] :=  ats(2,array_const_3D0,array_tmp1,1);
>     #emit pre add $eq_no = 1 i = 2
>     array_tmp3[2] := array_const_0D0[2] + array_tmp2[2];
>     # emit pre mult $eq_no = 1 i = 2
>     array_tmp4[2] :=  ats(2,array_const_2D0,array_x2,1);
>     #emit pre sub $eq_no = 1 i = 2
>     array_tmp5[2] :=   (array_tmp3[2] - (array_tmp4[2]));
>     #emit pre diff $eq_no = 1 i = 2
>     array_tmp6[2] := array_x1_higher[3,2];
>     #emit pre sub $eq_no = 1 i = 2
>     array_tmp7[2] :=   (array_tmp5[2] - (array_tmp6[2]));
>     #emit pre diff $eq_no = 1 i = 2
>     array_tmp8[2] := array_x1_higher[2,2];
>     #emit pre sub $eq_no = 1 i = 2
>     array_tmp9[2] :=   (array_tmp7[2] - (array_tmp8[2]));
>     #emit pre add $eq_no = 1 i = 2
>     array_tmp10[2] := array_tmp9[2] + array_x1[2];
>     #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5
>     if (2 <= glob_max_terms) then # if number 1
>   temporary := array_tmp10[2] * (glob_h ^ (2)) * factorial_3(1,3);
>   array_x2[4] := temporary;
>   array_x2_higher[1,4] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x2_higher[2,3] := temporary
>   ;
>   temporary := temporary / glob_h * (3.0);
>   array_x2_higher[3,2] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 3;
>     # emit pre mult $eq_no = 2 i = 2
>     array_tmp12[2] :=  ats(2,array_const_4D0,array_x2,1);
>     #emit pre diff $eq_no = 2 i = 2
>     array_tmp13[2] := array_x2_higher[2,2];
>     # emit pre mult $eq_no = 2 i = 2
>     array_tmp14[2] :=  ats(2,array_const_2D0,array_tmp13,1);
>     #emit pre sub $eq_no = 2 i = 2
>     array_tmp15[2] :=   (array_tmp12[2] - (array_tmp14[2]));
>     # emit pre mult $eq_no = 2 i = 2
>     array_tmp16[2] :=  ats(2,array_const_2D0,array_x1,1);
>     #emit pre sub $eq_no = 2 i = 2
>     array_tmp17[2] :=   (array_tmp15[2] - (array_tmp16[2]));
>     #emit pre assign xxx $eq_no = 2 i = 2 $min_hdrs = 5
>     if (2 <= glob_max_terms) then # if number 1
>   temporary := array_tmp17[2] * (glob_h ^ (1)) * factorial_3(1,2);
>   array_x1[3] := temporary;
>   array_x1_higher[1,3] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x1_higher[2,2] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 3;
>     #END ATOMHDR2
>     #BEGIN ATOMHDR3
>     #emit pre diff $eq_no = 1 i = 3
>     array_tmp1[3] := array_x2_higher[2,3];
>     # emit pre mult $eq_no = 1 i = 3
>     array_tmp2[3] :=  ats(3,array_const_3D0,array_tmp1,1);
>     #emit pre add $eq_no = 1 i = 3
>     array_tmp3[3] := array_const_0D0[3] + array_tmp2[3];
>     # emit pre mult $eq_no = 1 i = 3
>     array_tmp4[3] :=  ats(3,array_const_2D0,array_x2,1);
>     #emit pre sub $eq_no = 1 i = 3
>     array_tmp5[3] :=   (array_tmp3[3] - (array_tmp4[3]));
>     #emit pre diff $eq_no = 1 i = 3
>     array_tmp6[3] := array_x1_higher[3,3];
>     #emit pre sub $eq_no = 1 i = 3
>     array_tmp7[3] :=   (array_tmp5[3] - (array_tmp6[3]));
>     #emit pre diff $eq_no = 1 i = 3
>     array_tmp8[3] := array_x1_higher[2,3];
>     #emit pre sub $eq_no = 1 i = 3
>     array_tmp9[3] :=   (array_tmp7[3] - (array_tmp8[3]));
>     #emit pre add $eq_no = 1 i = 3
>     array_tmp10[3] := array_tmp9[3] + array_x1[3];
>     #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5
>     if (3 <= glob_max_terms) then # if number 1
>   temporary := array_tmp10[3] * (glob_h ^ (2)) * factorial_3(2,4);
>   array_x2[5] := temporary;
>   array_x2_higher[1,5] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x2_higher[2,4] := temporary
>   ;
>   temporary := temporary / glob_h * (3.0);
>   array_x2_higher[3,3] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 4;
>     # emit pre mult $eq_no = 2 i = 3
>     array_tmp12[3] :=  ats(3,array_const_4D0,array_x2,1);
>     #emit pre diff $eq_no = 2 i = 3
>     array_tmp13[3] := array_x2_higher[2,3];
>     # emit pre mult $eq_no = 2 i = 3
>     array_tmp14[3] :=  ats(3,array_const_2D0,array_tmp13,1);
>     #emit pre sub $eq_no = 2 i = 3
>     array_tmp15[3] :=   (array_tmp12[3] - (array_tmp14[3]));
>     # emit pre mult $eq_no = 2 i = 3
>     array_tmp16[3] :=  ats(3,array_const_2D0,array_x1,1);
>     #emit pre sub $eq_no = 2 i = 3
>     array_tmp17[3] :=   (array_tmp15[3] - (array_tmp16[3]));
>     #emit pre assign xxx $eq_no = 2 i = 3 $min_hdrs = 5
>     if (3 <= glob_max_terms) then # if number 1
>   temporary := array_tmp17[3] * (glob_h ^ (1)) * factorial_3(2,3);
>   array_x1[4] := temporary;
>   array_x1_higher[1,4] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x1_higher[2,3] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 4;
>     #END ATOMHDR3
>     #BEGIN ATOMHDR4
>     #emit pre diff $eq_no = 1 i = 4
>     array_tmp1[4] := array_x2_higher[2,4];
>     # emit pre mult $eq_no = 1 i = 4
>     array_tmp2[4] :=  ats(4,array_const_3D0,array_tmp1,1);
>     #emit pre add $eq_no = 1 i = 4
>     array_tmp3[4] := array_const_0D0[4] + array_tmp2[4];
>     # emit pre mult $eq_no = 1 i = 4
>     array_tmp4[4] :=  ats(4,array_const_2D0,array_x2,1);
>     #emit pre sub $eq_no = 1 i = 4
>     array_tmp5[4] :=   (array_tmp3[4] - (array_tmp4[4]));
>     #emit pre diff $eq_no = 1 i = 4
>     array_tmp6[4] := array_x1_higher[3,4];
>     #emit pre sub $eq_no = 1 i = 4
>     array_tmp7[4] :=   (array_tmp5[4] - (array_tmp6[4]));
>     #emit pre diff $eq_no = 1 i = 4
>     array_tmp8[4] := array_x1_higher[2,4];
>     #emit pre sub $eq_no = 1 i = 4
>     array_tmp9[4] :=   (array_tmp7[4] - (array_tmp8[4]));
>     #emit pre add $eq_no = 1 i = 4
>     array_tmp10[4] := array_tmp9[4] + array_x1[4];
>     #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5
>     if (4 <= glob_max_terms) then # if number 1
>   temporary := array_tmp10[4] * (glob_h ^ (2)) * factorial_3(3,5);
>   array_x2[6] := temporary;
>   array_x2_higher[1,6] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x2_higher[2,5] := temporary
>   ;
>   temporary := temporary / glob_h * (3.0);
>   array_x2_higher[3,4] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 5;
>     # emit pre mult $eq_no = 2 i = 4
>     array_tmp12[4] :=  ats(4,array_const_4D0,array_x2,1);
>     #emit pre diff $eq_no = 2 i = 4
>     array_tmp13[4] := array_x2_higher[2,4];
>     # emit pre mult $eq_no = 2 i = 4
>     array_tmp14[4] :=  ats(4,array_const_2D0,array_tmp13,1);
>     #emit pre sub $eq_no = 2 i = 4
>     array_tmp15[4] :=   (array_tmp12[4] - (array_tmp14[4]));
>     # emit pre mult $eq_no = 2 i = 4
>     array_tmp16[4] :=  ats(4,array_const_2D0,array_x1,1);
>     #emit pre sub $eq_no = 2 i = 4
>     array_tmp17[4] :=   (array_tmp15[4] - (array_tmp16[4]));
>     #emit pre assign xxx $eq_no = 2 i = 4 $min_hdrs = 5
>     if (4 <= glob_max_terms) then # if number 1
>   temporary := array_tmp17[4] * (glob_h ^ (1)) * factorial_3(3,4);
>   array_x1[5] := temporary;
>   array_x1_higher[1,5] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x1_higher[2,4] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 5;
>     #END ATOMHDR4
>     #BEGIN ATOMHDR5
>     #emit pre diff $eq_no = 1 i = 5
>     array_tmp1[5] := array_x2_higher[2,5];
>     # emit pre mult $eq_no = 1 i = 5
>     array_tmp2[5] :=  ats(5,array_const_3D0,array_tmp1,1);
>     #emit pre add $eq_no = 1 i = 5
>     array_tmp3[5] := array_const_0D0[5] + array_tmp2[5];
>     # emit pre mult $eq_no = 1 i = 5
>     array_tmp4[5] :=  ats(5,array_const_2D0,array_x2,1);
>     #emit pre sub $eq_no = 1 i = 5
>     array_tmp5[5] :=   (array_tmp3[5] - (array_tmp4[5]));
>     #emit pre diff $eq_no = 1 i = 5
>     array_tmp6[5] := array_x1_higher[3,5];
>     #emit pre sub $eq_no = 1 i = 5
>     array_tmp7[5] :=   (array_tmp5[5] - (array_tmp6[5]));
>     #emit pre diff $eq_no = 1 i = 5
>     array_tmp8[5] := array_x1_higher[2,5];
>     #emit pre sub $eq_no = 1 i = 5
>     array_tmp9[5] :=   (array_tmp7[5] - (array_tmp8[5]));
>     #emit pre add $eq_no = 1 i = 5
>     array_tmp10[5] := array_tmp9[5] + array_x1[5];
>     #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5
>     if (5 <= glob_max_terms) then # if number 1
>   temporary := array_tmp10[5] * (glob_h ^ (2)) * factorial_3(4,6);
>   array_x2[7] := temporary;
>   array_x2_higher[1,7] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x2_higher[2,6] := temporary
>   ;
>   temporary := temporary / glob_h * (3.0);
>   array_x2_higher[3,5] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 6;
>     # emit pre mult $eq_no = 2 i = 5
>     array_tmp12[5] :=  ats(5,array_const_4D0,array_x2,1);
>     #emit pre diff $eq_no = 2 i = 5
>     array_tmp13[5] := array_x2_higher[2,5];
>     # emit pre mult $eq_no = 2 i = 5
>     array_tmp14[5] :=  ats(5,array_const_2D0,array_tmp13,1);
>     #emit pre sub $eq_no = 2 i = 5
>     array_tmp15[5] :=   (array_tmp12[5] - (array_tmp14[5]));
>     # emit pre mult $eq_no = 2 i = 5
>     array_tmp16[5] :=  ats(5,array_const_2D0,array_x1,1);
>     #emit pre sub $eq_no = 2 i = 5
>     array_tmp17[5] :=   (array_tmp15[5] - (array_tmp16[5]));
>     #emit pre assign xxx $eq_no = 2 i = 5 $min_hdrs = 5
>     if (5 <= glob_max_terms) then # if number 1
>   temporary := array_tmp17[5] * (glob_h ^ (1)) * factorial_3(4,5);
>   array_x1[6] := temporary;
>   array_x1_higher[1,6] := temporary;
>   temporary := temporary / glob_h * (2.0);
>   array_x1_higher[2,5] := temporary
>   ;
>   fi;# end if 1
>     ;
>     kkk := 6;
>     #END ATOMHDR5
>     #BEGIN OUTFILE3
>     #Top Atomall While Loop-- outfile3
>     while (kkk <= glob_max_terms) do # do number 1
>     #END OUTFILE3
>     #BEGIN OUTFILE4
>     #emit diff $eq_no = 1
>     array_tmp1[kkk] :=  array_x2_higher[2,kkk];
>     #emit mult $eq_no = 1
>     array_tmp2[kkk] :=  ats(kkk,array_const_3D0,array_tmp1,1);
>     #emit add $eq_no = 1
>     array_tmp3[kkk] := array_const_0D0[kkk] + array_tmp2[kkk];
>     #emit mult $eq_no = 1
>     array_tmp4[kkk] :=  ats(kkk,array_const_2D0,array_x2,1);
>     #emit sub $eq_no = 1
>     array_tmp5[kkk] :=   (array_tmp3[kkk] - (array_tmp4[kkk]));
>     #emit diff $eq_no = 1
>     array_tmp6[kkk] :=  array_x1_higher[3,kkk];
>     #emit sub $eq_no = 1
>     array_tmp7[kkk] :=   (array_tmp5[kkk] - (array_tmp6[kkk]));
>     #emit diff $eq_no = 1
>     array_tmp8[kkk] :=  array_x1_higher[2,kkk];
>     #emit sub $eq_no = 1
>     array_tmp9[kkk] :=   (array_tmp7[kkk] - (array_tmp8[kkk]));
>     #emit add $eq_no = 1
>     array_tmp10[kkk] := array_tmp9[kkk] + array_x1[kkk];
>     #emit assign $eq_no = 1
>     order_d  := 2;
>     if (kkk + order_d + 1 <= glob_max_terms) then # if number 1
>   temporary :=  array_tmp10[kkk] * (glob_h ^ (order_d))  / factorial_3((kkk - 1),(kkk + order_d - 1));
>   array_x2[kkk + order_d] := temporary;
>   array_x2_higher[1,kkk + order_d] := temporary;
>   term := kkk + order_d - 1;
>   adj2 := 2;
>   while (adj2 <= order_d + 1) and (term >= 1) do # do number 2
>  temporary := temporary / glob_h * convfp(adj2);
>  array_x2_higher[adj2,term] := temporary;
>  adj2 := adj2 + 1;
>  term  := term - 1;
>  od;# end do number 2
>   fi;# end if 1
>     ;
>     #emit mult $eq_no = 2
>     array_tmp12[kkk] :=  ats(kkk,array_const_4D0,array_x2,1);
>     #emit diff $eq_no = 2
>     array_tmp13[kkk] :=  array_x2_higher[2,kkk];
>     #emit mult $eq_no = 2
>     array_tmp14[kkk] :=  ats(kkk,array_const_2D0,array_tmp13,1);
>     #emit sub $eq_no = 2
>     array_tmp15[kkk] :=   (array_tmp12[kkk] - (array_tmp14[kkk]));
>     #emit mult $eq_no = 2
>     array_tmp16[kkk] :=  ats(kkk,array_const_2D0,array_x1,1);
>     #emit sub $eq_no = 2
>     array_tmp17[kkk] :=   (array_tmp15[kkk] - (array_tmp16[kkk]));
>     #emit assign $eq_no = 2
>     order_d  := 1;
>     if (kkk + order_d + 1 <= glob_max_terms) then # if number 1
>   temporary :=  array_tmp17[kkk] * (glob_h ^ (order_d))  / factorial_3((kkk - 1),(kkk + order_d - 1));
>   array_x1[kkk + order_d] := temporary;
>   array_x1_higher[1,kkk + order_d] := temporary;
>   term := kkk + order_d - 1;
>   adj2 := 2;
>   while (adj2 <= order_d + 1) and (term >= 1) do # do number 2
>  temporary := temporary / glob_h * convfp(adj2);
>  array_x1_higher[adj2,term] := temporary;
>  adj2 := adj2 + 1;
>  term  := term - 1;
>  od;# end do number 2
>   fi;# end if 1
>     ;
>     kkk   :=  kkk + 1;
>     od;# end do number 1
>  ;
>  #BOTTOM ATOMALL
>  #END OUTFILE4
>  #BEGIN OUTFILE5
>  # End Function number 8
>  end;
atomall := proc()
local kkk, order_d, adj2, temporary, term;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    array_tmp1[1] := array_x2_higher[2, 1];
    array_tmp2[1] := array_const_3D0[1]*array_tmp1[1];
    array_tmp3[1] := array_const_0D0[1] + array_tmp2[1];
    array_tmp4[1] := array_const_2D0[1]*array_x2[1];
    array_tmp5[1] := array_tmp3[1] - array_tmp4[1];
    array_tmp6[1] := array_x1_higher[3, 1];
    array_tmp7[1] := array_tmp5[1] - array_tmp6[1];
    array_tmp8[1] := array_x1_higher[2, 1];
    array_tmp9[1] := array_tmp7[1] - array_tmp8[1];
    array_tmp10[1] := array_tmp9[1] + array_x1[1];
    if 1 <= glob_max_terms then
        temporary := array_tmp10[1]*glob_h^2*factorial_3(0, 2);
        array_x2[3] := temporary;
        array_x2_higher[1, 3] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x2_higher[2, 2] := temporary;
        temporary := temporary*3.0/glob_h;
        array_x2_higher[3, 1] := temporary
    end if;
    kkk := 2;
    array_tmp12[1] := array_const_4D0[1]*array_x2[1];
    array_tmp13[1] := array_x2_higher[2, 1];
    array_tmp14[1] := array_const_2D0[1]*array_tmp13[1];
    array_tmp15[1] := array_tmp12[1] - array_tmp14[1];
    array_tmp16[1] := array_const_2D0[1]*array_x1[1];
    array_tmp17[1] := array_tmp15[1] - array_tmp16[1];
    if 1 <= glob_max_terms then
        temporary := array_tmp17[1]*glob_h*factorial_3(0, 1);
        array_x1[2] := temporary;
        array_x1_higher[1, 2] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x1_higher[2, 1] := temporary
    end if;
    kkk := 2;
    array_tmp1[2] := array_x2_higher[2, 2];
    array_tmp2[2] := ats(2, array_const_3D0, array_tmp1, 1);
    array_tmp3[2] := array_const_0D0[2] + array_tmp2[2];
    array_tmp4[2] := ats(2, array_const_2D0, array_x2, 1);
    array_tmp5[2] := array_tmp3[2] - array_tmp4[2];
    array_tmp6[2] := array_x1_higher[3, 2];
    array_tmp7[2] := array_tmp5[2] - array_tmp6[2];
    array_tmp8[2] := array_x1_higher[2, 2];
    array_tmp9[2] := array_tmp7[2] - array_tmp8[2];
    array_tmp10[2] := array_tmp9[2] + array_x1[2];
    if 2 <= glob_max_terms then
        temporary := array_tmp10[2]*glob_h^2*factorial_3(1, 3);
        array_x2[4] := temporary;
        array_x2_higher[1, 4] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x2_higher[2, 3] := temporary;
        temporary := temporary*3.0/glob_h;
        array_x2_higher[3, 2] := temporary
    end if;
    kkk := 3;
    array_tmp12[2] := ats(2, array_const_4D0, array_x2, 1);
    array_tmp13[2] := array_x2_higher[2, 2];
    array_tmp14[2] := ats(2, array_const_2D0, array_tmp13, 1);
    array_tmp15[2] := array_tmp12[2] - array_tmp14[2];
    array_tmp16[2] := ats(2, array_const_2D0, array_x1, 1);
    array_tmp17[2] := array_tmp15[2] - array_tmp16[2];
    if 2 <= glob_max_terms then
        temporary := array_tmp17[2]*glob_h*factorial_3(1, 2);
        array_x1[3] := temporary;
        array_x1_higher[1, 3] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x1_higher[2, 2] := temporary
    end if;
    kkk := 3;
    array_tmp1[3] := array_x2_higher[2, 3];
    array_tmp2[3] := ats(3, array_const_3D0, array_tmp1, 1);
    array_tmp3[3] := array_const_0D0[3] + array_tmp2[3];
    array_tmp4[3] := ats(3, array_const_2D0, array_x2, 1);
    array_tmp5[3] := array_tmp3[3] - array_tmp4[3];
    array_tmp6[3] := array_x1_higher[3, 3];
    array_tmp7[3] := array_tmp5[3] - array_tmp6[3];
    array_tmp8[3] := array_x1_higher[2, 3];
    array_tmp9[3] := array_tmp7[3] - array_tmp8[3];
    array_tmp10[3] := array_tmp9[3] + array_x1[3];
    if 3 <= glob_max_terms then
        temporary := array_tmp10[3]*glob_h^2*factorial_3(2, 4);
        array_x2[5] := temporary;
        array_x2_higher[1, 5] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x2_higher[2, 4] := temporary;
        temporary := temporary*3.0/glob_h;
        array_x2_higher[3, 3] := temporary
    end if;
    kkk := 4;
    array_tmp12[3] := ats(3, array_const_4D0, array_x2, 1);
    array_tmp13[3] := array_x2_higher[2, 3];
    array_tmp14[3] := ats(3, array_const_2D0, array_tmp13, 1);
    array_tmp15[3] := array_tmp12[3] - array_tmp14[3];
    array_tmp16[3] := ats(3, array_const_2D0, array_x1, 1);
    array_tmp17[3] := array_tmp15[3] - array_tmp16[3];
    if 3 <= glob_max_terms then
        temporary := array_tmp17[3]*glob_h*factorial_3(2, 3);
        array_x1[4] := temporary;
        array_x1_higher[1, 4] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x1_higher[2, 3] := temporary
    end if;
    kkk := 4;
    array_tmp1[4] := array_x2_higher[2, 4];
    array_tmp2[4] := ats(4, array_const_3D0, array_tmp1, 1);
    array_tmp3[4] := array_const_0D0[4] + array_tmp2[4];
    array_tmp4[4] := ats(4, array_const_2D0, array_x2, 1);
    array_tmp5[4] := array_tmp3[4] - array_tmp4[4];
    array_tmp6[4] := array_x1_higher[3, 4];
    array_tmp7[4] := array_tmp5[4] - array_tmp6[4];
    array_tmp8[4] := array_x1_higher[2, 4];
    array_tmp9[4] := array_tmp7[4] - array_tmp8[4];
    array_tmp10[4] := array_tmp9[4] + array_x1[4];
    if 4 <= glob_max_terms then
        temporary := array_tmp10[4]*glob_h^2*factorial_3(3, 5);
        array_x2[6] := temporary;
        array_x2_higher[1, 6] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x2_higher[2, 5] := temporary;
        temporary := temporary*3.0/glob_h;
        array_x2_higher[3, 4] := temporary
    end if;
    kkk := 5;
    array_tmp12[4] := ats(4, array_const_4D0, array_x2, 1);
    array_tmp13[4] := array_x2_higher[2, 4];
    array_tmp14[4] := ats(4, array_const_2D0, array_tmp13, 1);
    array_tmp15[4] := array_tmp12[4] - array_tmp14[4];
    array_tmp16[4] := ats(4, array_const_2D0, array_x1, 1);
    array_tmp17[4] := array_tmp15[4] - array_tmp16[4];
    if 4 <= glob_max_terms then
        temporary := array_tmp17[4]*glob_h*factorial_3(3, 4);
        array_x1[5] := temporary;
        array_x1_higher[1, 5] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x1_higher[2, 4] := temporary
    end if;
    kkk := 5;
    array_tmp1[5] := array_x2_higher[2, 5];
    array_tmp2[5] := ats(5, array_const_3D0, array_tmp1, 1);
    array_tmp3[5] := array_const_0D0[5] + array_tmp2[5];
    array_tmp4[5] := ats(5, array_const_2D0, array_x2, 1);
    array_tmp5[5] := array_tmp3[5] - array_tmp4[5];
    array_tmp6[5] := array_x1_higher[3, 5];
    array_tmp7[5] := array_tmp5[5] - array_tmp6[5];
    array_tmp8[5] := array_x1_higher[2, 5];
    array_tmp9[5] := array_tmp7[5] - array_tmp8[5];
    array_tmp10[5] := array_tmp9[5] + array_x1[5];
    if 5 <= glob_max_terms then
        temporary := array_tmp10[5]*glob_h^2*factorial_3(4, 6);
        array_x2[7] := temporary;
        array_x2_higher[1, 7] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x2_higher[2, 6] := temporary;
        temporary := temporary*3.0/glob_h;
        array_x2_higher[3, 5] := temporary
    end if;
    kkk := 6;
    array_tmp12[5] := ats(5, array_const_4D0, array_x2, 1);
    array_tmp13[5] := array_x2_higher[2, 5];
    array_tmp14[5] := ats(5, array_const_2D0, array_tmp13, 1);
    array_tmp15[5] := array_tmp12[5] - array_tmp14[5];
    array_tmp16[5] := ats(5, array_const_2D0, array_x1, 1);
    array_tmp17[5] := array_tmp15[5] - array_tmp16[5];
    if 5 <= glob_max_terms then
        temporary := array_tmp17[5]*glob_h*factorial_3(4, 5);
        array_x1[6] := temporary;
        array_x1_higher[1, 6] := temporary;
        temporary := temporary*2.0/glob_h;
        array_x1_higher[2, 5] := temporary
    end if;
    kkk := 6;
    while kkk <= glob_max_terms do
        array_tmp1[kkk] := array_x2_higher[2, kkk];
        array_tmp2[kkk] := ats(kkk, array_const_3D0, array_tmp1, 1);
        array_tmp3[kkk] := array_const_0D0[kkk] + array_tmp2[kkk];
        array_tmp4[kkk] := ats(kkk, array_const_2D0, array_x2, 1);
        array_tmp5[kkk] := array_tmp3[kkk] - array_tmp4[kkk];
        array_tmp6[kkk] := array_x1_higher[3, kkk];
        array_tmp7[kkk] := array_tmp5[kkk] - array_tmp6[kkk];
        array_tmp8[kkk] := array_x1_higher[2, kkk];
        array_tmp9[kkk] := array_tmp7[kkk] - array_tmp8[kkk];
        array_tmp10[kkk] := array_tmp9[kkk] + array_x1[kkk];
        order_d := 2;
        if kkk + order_d + 1 <= glob_max_terms then
            temporary := array_tmp10[kkk]*glob_h^order_d/
                factorial_3(kkk - 1, kkk + order_d - 1);
            array_x2[kkk + order_d] := temporary;
            array_x2_higher[1, kkk + order_d] := temporary;
            term := kkk + order_d - 1;
            adj2 := 2;
            while adj2 <= order_d + 1 and 1 <= term do
                temporary := temporary*convfp(adj2)/glob_h;
                array_x2_higher[adj2, term] := temporary;
                adj2 := adj2 + 1;
                term := term - 1
            end do
        end if;
        array_tmp12[kkk] := ats(kkk, array_const_4D0, array_x2, 1);
        array_tmp13[kkk] := array_x2_higher[2, kkk];
        array_tmp14[kkk] := ats(kkk, array_const_2D0, array_tmp13, 1);
        array_tmp15[kkk] := array_tmp12[kkk] - array_tmp14[kkk];
        array_tmp16[kkk] := ats(kkk, array_const_2D0, array_x1, 1);
        array_tmp17[kkk] := array_tmp15[kkk] - array_tmp16[kkk];
        order_d := 1;
        if kkk + order_d + 1 <= glob_max_terms then
            temporary := array_tmp17[kkk]*glob_h^order_d/
                factorial_3(kkk - 1, kkk + order_d - 1);
            array_x1[kkk + order_d] := temporary;
            array_x1_higher[1, kkk + order_d] := temporary;
            term := kkk + order_d - 1;
            adj2 := 2;
            while adj2 <= order_d + 1 and 1 <= term do
                temporary := temporary*convfp(adj2)/glob_h;
                array_x1_higher[adj2, term] := temporary;
                adj2 := adj2 + 1;
                term := term - 1
            end do
        end if;
        kkk := kkk + 1
    end do
end proc

>   #BEGIN ATS LIBRARY BLOCK
>   omniout_str := proc(iolevel,str)
>   global glob_iolevel;
>   if (glob_iolevel >= iolevel) then
>   printf("%s\n",str);
>   fi;
>   # End Function number 1
>   end;
omniout_str := proc(iolevel, str)
global glob_iolevel;
    if iolevel <= glob_iolevel then printf("%s\n", str) end if
end proc

>         omniout_str_noeol := proc(iolevel,str)
>         global glob_iolevel;
>         if (glob_iolevel >= iolevel) then
>         printf("%s",str);
>         fi;
>         # End Function number 1
>         end;
omniout_str_noeol := proc(iolevel, str)
global glob_iolevel;
    if iolevel <= glob_iolevel then printf("%s", str) end if
end proc

>           omniout_labstr := proc(iolevel,label,str)
>           global glob_iolevel;
>           if (glob_iolevel >= iolevel) then
>           print(label,str);
>           fi;
>           # End Function number 1
>           end;
omniout_labstr := proc(iolevel, label, str)
global glob_iolevel;
    if iolevel <= glob_iolevel then print(label, str) end if
end proc

>             omniout_float := proc(iolevel,prelabel,prelen,value,vallen,postlabel)
>             global glob_iolevel;
>             if (glob_iolevel >= iolevel) then
>             if vallen = 4 then
>             printf("%-30s = %-42.4g %s \n",prelabel,value, postlabel);
>             else
>             printf("%-30s = %-42.32g %s \n",prelabel,value, postlabel);
>             fi;
>             fi;
>             # End Function number 1
>             end;
omniout_float := proc(iolevel, prelabel, prelen, value, vallen, postlabel)
global glob_iolevel;
    if iolevel <= glob_iolevel then
        if vallen = 4 then
            printf("%-30s = %-42.4g %s \n", prelabel, value, postlabel)
        else printf("%-30s = %-42.32g %s \n", prelabel, value, postlabel)
        end if
    end if
end proc

>               omniout_int := proc(iolevel,prelabel,prelen,value,vallen,postlabel)
>               global glob_iolevel;
>               if (glob_iolevel >= iolevel) then
>               if vallen = 5 then
>               printf("%-30s = %-32d  %s\n",prelabel,value, postlabel);
>               else
>               printf("%-30s = %-32d  %s \n",prelabel,value, postlabel);
>               fi;
>               fi;
>               # End Function number 1
>               end;
omniout_int := proc(iolevel, prelabel, prelen, value, vallen, postlabel)
global glob_iolevel;
    if iolevel <= glob_iolevel then
        if vallen = 5 then
            printf("%-30s = %-32d  %s\n", prelabel, value, postlabel)
        else printf("%-30s = %-32d  %s \n", prelabel, value, postlabel)
        end if
    end if
end proc

>                 omniout_float_arr := proc(iolevel,prelabel,elemnt,prelen,value,vallen,postlabel)
>                 global glob_iolevel;
>                 if (glob_iolevel >= iolevel) then
>                 print(prelabel,"[",elemnt,"]",value, postlabel);
>                 fi;
>                 # End Function number 1
>                 end;
omniout_float_arr := proc(
iolevel, prelabel, elemnt, prelen, value, vallen, postlabel)
global glob_iolevel;
    if iolevel <= glob_iolevel then
        print(prelabel, "[", elemnt, "]", value, postlabel)
    end if
end proc

>                   dump_series := proc(iolevel,dump_label,series_name,
>                   array_series,numb)
>                   global glob_iolevel;
>                   local i;
>                   if (glob_iolevel >= iolevel) then
>                   i := 1;
>                   while (i <= numb) do
>                   print(dump_label,series_name
>                   ,i,array_series[i]);
>                   i := i + 1;
>                   od;
>                   fi;
>                   # End Function number 1
>                   end;
dump_series := proc(iolevel, dump_label, series_name, array_series, numb)
local i;
global glob_iolevel;
    if iolevel <= glob_iolevel then
        i := 1;
        while i <= numb do
            print(dump_label, series_name, i, array_series[i]); i := i + 1
        end do
    end if
end proc

>                     dump_series_2 := proc(iolevel,dump_label,series_name2,
>                     array_series2,numb,subnum,array_x)
>                     global glob_iolevel;
>                     local i,sub,ts_term;
>                     if (glob_iolevel >= iolevel) then
>                     sub := 1;
>                     while (sub <= subnum) do
>                     i :=  1;
>                     while (i <= numb) do
>                     print(dump_label,series_name2,sub,i,array_series2[sub,i]);
>                     od;
>                     sub :=  sub + 1;
>                     od;
>                     fi;
>                     # End Function number 1
>                     end;
dump_series_2 := proc(
iolevel, dump_label, series_name2, array_series2, numb, subnum, array_x)
local i, sub, ts_term;
global glob_iolevel;
    if iolevel <= glob_iolevel then
        sub := 1;
        while sub <= subnum do
            i := 1;
            while i <= numb do print(dump_label, series_name2, sub, i,
                array_series2[sub, i])
            end do;
            sub := sub + 1
        end do
    end if
end proc

>                       cs_info := proc(iolevel,str)
>                       global glob_iolevel,glob_correct_start_flag,glob_h,glob_reached_optimal_h;
>                       if (glob_iolevel >= iolevel) then
>                       print("cs_info " , str , " glob_correct_start_flag = " , glob_correct_start_flag , "glob_h := " , glob_h , "glob_reached_optimal_h := " , glob_reached_optimal_h)
>                       fi;
>                       # End Function number 1
>                       end;
cs_info := proc(iolevel, str)
global
glob_iolevel, glob_correct_start_flag, glob_h, glob_reached_optimal_h;
    if iolevel <= glob_iolevel then print("cs_info ", str,
        " glob_correct_start_flag = ", glob_correct_start_flag,
        "glob_h := ", glob_h, "glob_reached_optimal_h := ",
        glob_reached_optimal_h)
    end if
end proc

>                         # Begin Function number 2
>                       logitem_time := proc(fd,secs_in)
>                       global  centuries_in_millinium, days_in_year, hours_in_day, min_in_hour, sec_in_min, years_in_century;
>                       local cent_int, centuries, days, days_int, hours, hours_int, millinium_int, milliniums, minutes, minutes_int, sec_in_millinium, sec_int, seconds, secs, years, years_int;
>                       secs  :=  (secs_in);
>                       if (secs > 0.0)  then # if number 1
>                     sec_in_millinium  :=   convfloat(sec_in_min *  min_in_hour * hours_in_day * days_in_year * years_in_century * centuries_in_millinium);
>                     milliniums  :=  convfloat(secs / sec_in_millinium);
>                     millinium_int  :=  floor(milliniums);
>                     centuries  :=  (milliniums - millinium_int)*centuries_in_millinium;
>                     cent_int  :=  floor(centuries);
>                     years  :=  (centuries - cent_int) * years_in_century;
>                     years_int  :=  floor(years);
>                     days  :=  (years - years_int) * days_in_year;
>                     days_int  :=  floor(days);
>                     hours  :=  (days - days_int) * hours_in_day;
>                     hours_int  :=  floor(hours);
>                     minutes  :=  (hours - hours_int) * min_in_hour;
>                     minutes_int  :=  floor(minutes);
>                     seconds  :=  (minutes - minutes_int) * sec_in_min;
>                     sec_int  :=  floor(seconds);
>                     fprintf(fd,"<td>");
>                     if (millinium_int > 0)  then # if number 2
>                   fprintf(fd,"%d Millinia %d Centuries %d Years %d Days %d Hours %d Minutes %d Seconds",millinium_int,cent_int,years_int,days_int,hours_int,minutes_int,sec_int);
>                   elif  (cent_int > 0)  then # if number 3
>                 fprintf(fd,"%d Centuries %d Years %d Days %d Hours %d Minutes %d Seconds",cent_int,years_int,days_int,hours_int,minutes_int,sec_int);
>                 elif  (years_int > 0)  then # if number 4
>               fprintf(fd,"%d Years %d Days %d Hours %d Minutes %d Seconds",years_int,days_int,hours_int,minutes_int,sec_int);
>               elif  (days_int > 0)  then # if number 5
>             fprintf(fd,"%d Days %d Hours %d Minutes %d Seconds",days_int,hours_int,minutes_int,sec_int);
>             elif  (hours_int > 0)  then # if number 6
>           fprintf(fd,"%d Hours %d Minutes %d Seconds",hours_int,minutes_int,sec_int);
>           elif  (minutes_int > 0)  then # if number 7
>         fprintf(fd,"%d Minutes %d Seconds",minutes_int,sec_int);
>         else
>         fprintf(fd,"%d Seconds",sec_int);
>         fi;# end if 7
>           else
>           fprintf(fd,"Unknown");
>           fi;# end if 6
>             fprintf(fd,"</td>");
>             # End Function number 2
>             end;
logitem_time := proc(fd, secs_in)
local cent_int, centuries, days, days_int, hours, hours_int, millinium_int,
milliniums, minutes, minutes_int, sec_in_millinium, sec_int, seconds, secs,
years, years_int;
global centuries_in_millinium, days_in_year, hours_in_day, min_in_hour,
sec_in_min, years_in_century;
    secs := secs_in;
    if 0. < secs then
        sec_in_millinium := convfloat(sec_in_min*min_in_hour*hours_in_day*
            days_in_year*years_in_century*centuries_in_millinium);
        milliniums := convfloat(secs/sec_in_millinium);
        millinium_int := floor(milliniums);
        centuries := (milliniums - millinium_int)*centuries_in_millinium;
        cent_int := floor(centuries);
        years := (centuries - cent_int)*years_in_century;
        years_int := floor(years);
        days := (years - years_int)*days_in_year;
        days_int := floor(days);
        hours := (days - days_int)*hours_in_day;
        hours_int := floor(hours);
        minutes := (hours - hours_int)*min_in_hour;
        minutes_int := floor(minutes);
        seconds := (minutes - minutes_int)*sec_in_min;
        sec_int := floor(seconds);
        fprintf(fd, "<td>");
        if 0 < millinium_int then fprintf(fd, "%d Millinia %d Centuries %\
            d Years %d Days %d Hours %d Minutes %d Seconds", millinium_int,
            cent_int, years_int, days_int, hours_int, minutes_int, sec_int)
        elif 0 < cent_int then fprintf(fd,
            "%d Centuries %d Years %d Days %d Hours %d Minutes %d Seconds",
            cent_int, years_int, days_int, hours_int, minutes_int, sec_int)
        elif 0 < years_int then fprintf(fd,
            "%d Years %d Days %d Hours %d Minutes %d Seconds", years_int,
            days_int, hours_int, minutes_int, sec_int)
        elif 0 < days_int then fprintf(fd,
            "%d Days %d Hours %d Minutes %d Seconds", days_int, hours_int,
            minutes_int, sec_int)
        elif 0 < hours_int then fprintf(fd,
            "%d Hours %d Minutes %d Seconds", hours_int, minutes_int,
            sec_int)
        elif 0 < minutes_int then
            fprintf(fd, "%d Minutes %d Seconds", minutes_int, sec_int)
        else fprintf(fd, "%d Seconds", sec_int)
        end if
    else fprintf(fd, "Unknown")
    end if;
    fprintf(fd, "</td>")
end proc

>               omniout_timestr := proc (secs_in)
>               global  centuries_in_millinium, days_in_year, hours_in_day, min_in_hour, sec_in_min, years_in_century;
>               local cent_int, centuries, days, days_int, hours, hours_int, millinium_int, milliniums, minutes, minutes_int, sec_in_millinium, sec_int, seconds, secs, years, years_int;
>               secs  :=  convfloat(secs_in);
>               if (secs > 0.0)  then # if number 6
>             sec_in_millinium  :=   convfloat(sec_in_min *  min_in_hour * hours_in_day * days_in_year * years_in_century * centuries_in_millinium);
>             milliniums  :=  convfloat(secs / sec_in_millinium);
>             millinium_int  :=  floor(milliniums);
>             centuries  :=  (milliniums - millinium_int)*centuries_in_millinium;
>             cent_int  :=  floor(centuries);
>             years  :=  (centuries - cent_int) * years_in_century;
>             years_int  :=  floor(years);
>             days  :=  (years - years_int) * days_in_year;
>             days_int  :=  floor(days);
>             hours  :=  (days - days_int) * hours_in_day;
>             hours_int  :=  floor(hours);
>             minutes  :=  (hours - hours_int) * min_in_hour;
>             minutes_int  :=  floor(minutes);
>             seconds  :=  (minutes - minutes_int) * sec_in_min;
>             sec_int  :=  floor(seconds);
>             
>             if (millinium_int > 0)  then # if number 7
>           printf(" = %d Millinia %d Centuries %d Years %d Days %d Hours %d Minutes %d Seconds\n",millinium_int,cent_int,years_int,days_int,hours_int,minutes_int,sec_int);
>           elif  (cent_int > 0)  then # if number 8
>         printf(" = %d Centuries %d Years %d Days %d Hours %d Minutes %d Seconds\n",cent_int,years_int,days_int,hours_int,minutes_int,sec_int);
>         elif  (years_int > 0)  then # if number 9
>       printf(" = %d Years %d Days %d Hours %d Minutes %d Seconds\n",years_int,days_int,hours_int,minutes_int,sec_int);
>       elif  (days_int > 0)  then # if number 10
>     printf(" = %d Days %d Hours %d Minutes %d Seconds\n",days_int,hours_int,minutes_int,sec_int);
>     elif  (hours_int > 0)  then # if number 11
>   printf(" = %d Hours %d Minutes %d Seconds\n",hours_int,minutes_int,sec_int);
>   elif  (minutes_int > 0)  then # if number 12
>  printf(" = %d Minutes %d Seconds\n",minutes_int,sec_int);
>  else
>  printf(" = %d Seconds\n",sec_int);
>  fi;# end if 12
>   else
>   printf(" Unknown\n");
>   fi;# end if 11
>     # End Function number 2
>     end;
omniout_timestr := proc(secs_in)
local cent_int, centuries, days, days_int, hours, hours_int, millinium_int,
milliniums, minutes, minutes_int, sec_in_millinium, sec_int, seconds, secs,
years, years_int;
global centuries_in_millinium, days_in_year, hours_in_day, min_in_hour,
sec_in_min, years_in_century;
    secs := convfloat(secs_in);
    if 0. < secs then
        sec_in_millinium := convfloat(sec_in_min*min_in_hour*hours_in_day*
            days_in_year*years_in_century*centuries_in_millinium);
        milliniums := convfloat(secs/sec_in_millinium);
        millinium_int := floor(milliniums);
        centuries := (milliniums - millinium_int)*centuries_in_millinium;
        cent_int := floor(centuries);
        years := (centuries - cent_int)*years_in_century;
        years_int := floor(years);
        days := (years - years_int)*days_in_year;
        days_int := floor(days);
        hours := (days - days_int)*hours_in_day;
        hours_int := floor(hours);
        minutes := (hours - hours_int)*min_in_hour;
        minutes_int := floor(minutes);
        seconds := (minutes - minutes_int)*sec_in_min;
        sec_int := floor(seconds);
        if 0 < millinium_int then printf(" = %d Millinia %d Centuries %d\
             Years %d Days %d Hours %d Minutes %d Seconds\n", millinium_int,
            cent_int, years_int, days_int, hours_int, minutes_int, sec_int)
        elif 0 < cent_int then printf(" = %d Centuries %d Years %d Days \
            %d Hours %d Minutes %d Seconds\n", cent_int, years_int,
            days_int, hours_int, minutes_int, sec_int)
        elif 0 < years_int then printf(
            " = %d Years %d Days %d Hours %d Minutes %d Seconds\n",
            years_int, days_int, hours_int, minutes_int, sec_int)
        elif 0 < days_int then printf(
            " = %d Days %d Hours %d Minutes %d Seconds\n", days_int,
            hours_int, minutes_int, sec_int)
        elif 0 < hours_int then printf(
            " = %d Hours %d Minutes %d Seconds\n", hours_int, minutes_int,
            sec_int)
        elif 0 < minutes_int then
            printf(" = %d Minutes %d Seconds\n", minutes_int, sec_int)
        else printf(" = %d Seconds\n", sec_int)
        end if
    else printf(" Unknown\n")
    end if
end proc

>       
>       # Begin Function number 3
>     ats := proc(
>     mmm_ats,array_a,array_b,jjj_ats)
>     local iii_ats, lll_ats,ma_ats, ret_ats;
>     ret_ats  :=  0.0;
>     if (jjj_ats <=  mmm_ats)  then # if number 11
>   ma_ats  :=  mmm_ats + 1;
>   iii_ats  :=  jjj_ats;
>   while (iii_ats <= mmm_ats)  do # do number 1
>  lll_ats  :=  ma_ats - iii_ats;
>  ret_ats  :=  ret_ats + array_a[iii_ats]*array_b[lll_ats];
>  iii_ats  :=  iii_ats + 1;
>  od;# end do number 1
>   fi;# end if 11
>     ;
>     ret_ats
>     # End Function number 3
>     end;
ats := proc(mmm_ats, array_a, array_b, jjj_ats)
local iii_ats, lll_ats, ma_ats, ret_ats;
    ret_ats := 0.;
    if jjj_ats <= mmm_ats then
        ma_ats := mmm_ats + 1;
        iii_ats := jjj_ats;
        while iii_ats <= mmm_ats do
            lll_ats := ma_ats - iii_ats;
            ret_ats := ret_ats + array_a[iii_ats]*array_b[lll_ats];
            iii_ats := iii_ats + 1
        end do
    end if;
    ret_ats
end proc

>       
>       # Begin Function number 4
>     att := proc(
>     mmm_att,array_aa,array_bb,jjj_att)
>     global glob_max_terms;
>     local al_att, iii_att,lll_att, ma_att, ret_att;
>     ret_att  :=  0.0;
>     if (jjj_att <= mmm_att)  then # if number 11
>   ma_att  :=  mmm_att + 2;
>   iii_att  :=  jjj_att;
>   while (iii_att <= mmm_att)   do # do number 1
>  lll_att  :=  ma_att - iii_att;
>  al_att  :=  (lll_att - 1);
>  if (lll_att <= glob_max_terms)  then # if number 12
>   ret_att  :=   ret_att + array_aa[iii_att]*array_bb[lll_att]* convfp(al_att);
>   fi;# end if 12
>  ;
>  iii_att  :=  iii_att + 1;
>  od;# end do number 1
>   ;
>   ret_att  :=  ret_att / convfp(mmm_att) ;
>   fi;# end if 11
>     ;
>     ret_att;
>     # End Function number 4
>     end;
att := proc(mmm_att, array_aa, array_bb, jjj_att)
local al_att, iii_att, lll_att, ma_att, ret_att;
global glob_max_terms;
    ret_att := 0.;
    if jjj_att <= mmm_att then
        ma_att := mmm_att + 2;
        iii_att := jjj_att;
        while iii_att <= mmm_att do
            lll_att := ma_att - iii_att;
            al_att := lll_att - 1;
            if lll_att <= glob_max_terms then ret_att := ret_att
                 + array_aa[iii_att]*array_bb[lll_att]*convfp(al_att)
            end if;
            iii_att := iii_att + 1
        end do;
        ret_att := ret_att/convfp(mmm_att)
    end if;
    ret_att
end proc

>       # Begin Function number 5
>     display_pole := proc()
>     global ALWAYS,glob_display_flag, glob_large_float, array_pole;
>     if ((array_pole[1] <>  glob_large_float) and (array_pole[1] > 0.0) and (array_pole[2] <>  glob_large_float) and (array_pole[2]> 0.0) and glob_display_flag)   then # if number 11
>   omniout_float(ALWAYS,"Radius of convergence            ",4, array_pole[1],4," ");
>   omniout_float(ALWAYS,"Order of pole                    ",4, array_pole[2],4," ");
>   fi;# end if 11
>     # End Function number 5
>     end;
display_pole := proc()
global ALWAYS, glob_display_flag, glob_large_float, array_pole;
    if array_pole[1] <> glob_large_float and 0. < array_pole[1] and
    array_pole[2] <> glob_large_float and 0. < array_pole[2] and
    glob_display_flag then
        omniout_float(ALWAYS, "Radius of convergence            ", 4,
            array_pole[1], 4, " ");
        omniout_float(ALWAYS, "Order of pole                    ", 4,
            array_pole[2], 4, " ")
    end if
end proc

>       # Begin Function number 6
>     logditto := proc(file)
>     fprintf(file,"<td>");
>     fprintf(file,"ditto");
>     fprintf(file,"</td>");
>     # End Function number 6
>     end;
logditto := proc(file)
    fprintf(file, "<td>"); fprintf(file, "ditto"); fprintf(file, "</td>")
end proc

>       # Begin Function number 7
>     logitem_integer := proc(file,n)
>     fprintf(file,"<td>");
>     fprintf(file,"%d",n);
>     fprintf(file,"</td>");
>     # End Function number 7
>     end;
logitem_integer := proc(file, n)
    fprintf(file, "<td>"); fprintf(file, "%d", n); fprintf(file, "</td>")
end proc

>       # Begin Function number 8
>     logitem_str := proc(file,str)
>     fprintf(file,"<td>");
>     fprintf(file,str);
>     fprintf(file,"</td>");
>     # End Function number 8
>     end;
logitem_str := proc(file, str)
    fprintf(file, "<td>"); fprintf(file, str); fprintf(file, "</td>")
end proc

>       # Begin Function number 9
>     log_revs := proc(file,revs)
>     fprintf(file,revs);
>     # End Function number 9
>     end;
           log_revs := proc(file, revs) fprintf(file, revs) end proc

>       # Begin Function number 10
>     logitem_float := proc(file,x)
>     fprintf(file,"<td>");
>     fprintf(file,"%g",x);
>     fprintf(file,"</td>");
>     # End Function number 10
>     end;
logitem_float := proc(file, x)
    fprintf(file, "<td>"); fprintf(file, "%g", x); fprintf(file, "</td>")
end proc

>       # Begin Function number 11
>     logitem_pole := proc(file,pole)
>     fprintf(file,"<td>");
>     if pole  = 0 then # if number 11
>   fprintf(file,"NA");
>   elif pole = 1 then # if number 12
>  fprintf(file,"Real");
>  elif pole = 2 then # if number 13
>   fprintf(file,"Complex");
>   else
>   fprintf(file,"No Pole");
>   fi;# end if 13
>  fprintf(file,"</td>");
>  # End Function number 11
>  end;
logitem_pole := proc(file, pole)
    fprintf(file, "<td>");
    if pole = 0 then fprintf(file, "NA")
    elif pole = 1 then fprintf(file, "Real")
    elif pole = 2 then fprintf(file, "Complex")
    else fprintf(file, "No Pole")
    end if;
    fprintf(file, "</td>")
end proc

>   # Begin Function number 12
>  logstart := proc(file)
>  fprintf(file,"<tr>");
>  # End Function number 12
>  end;
             logstart := proc(file) fprintf(file, "<tr>") end proc

>   # Begin Function number 13
>  logend := proc(file)
>  fprintf(file,"</tr>\n");
>  # End Function number 13
>  end;
             logend := proc(file) fprintf(file, "</tr>\n") end proc

>   # Begin Function number 14
>  chk_data := proc()
>  global glob_max_iter,ALWAYS, glob_max_terms;
>  local  errflag;
>  errflag  :=  false;
>  
>  if ((glob_max_terms < 15) or (glob_max_terms > 512))  then # if number 13
>   omniout_str(ALWAYS,"Illegal max_terms =  -- Using 30");
>   glob_max_terms  :=  30;
>   fi;# end if 13
>  ;
>  if (glob_max_iter < 2)  then # if number 13
>   omniout_str(ALWAYS,"Illegal max_iter");
>   errflag  :=  true;
>   fi;# end if 13
>  ;
>  if (errflag)   then # if number 13
>   
>   quit;
>   fi;# end if 13
>  # End Function number 14
>  end;
chk_data := proc()
local errflag;
global glob_max_iter, ALWAYS, glob_max_terms;
    errflag := false;
    if glob_max_terms < 15 or 512 < glob_max_terms then
        omniout_str(ALWAYS, "Illegal max_terms =  -- Using 30");
        glob_max_terms := 30
    end if;
    if glob_max_iter < 2 then
        omniout_str(ALWAYS, "Illegal max_iter"); errflag := true
    end if;
    if errflag then quit end if
end proc

>   
>   # Begin Function number 15
>  comp_expect_sec := proc(t_end2,t_start2,t2,clock_sec)
>  global glob_small_float;
>  local ms2, rrr, sec_left, sub1, sub2;
>  ;
>  ms2  :=   clock_sec;
>  sub1  :=   (t_end2-t_start2);
>  sub2  :=   (t2-t_start2);
>  if (sub1  =  0.0)  then # if number 13
>   sec_left  :=  0.0;
>   else
>   if (abs(sub2) > 0.0)  then # if number 14
>     rrr  :=  (sub1/sub2);
>     sec_left  :=  rrr * ms2 - ms2;
>     else
>     sec_left  :=  0.0;
>     fi;# end if 14
>   fi;# end if 13
>  ;
>  sec_left;
>  # End Function number 15
>  end;
comp_expect_sec := proc(t_end2, t_start2, t2, clock_sec)
local ms2, rrr, sec_left, sub1, sub2;
global glob_small_float;
    ms2 := clock_sec;
    sub1 := t_end2 - t_start2;
    sub2 := t2 - t_start2;
    if sub1 = 0. then sec_left := 0.
    else
        if 0. < abs(sub2) then rrr := sub1/sub2; sec_left := rrr*ms2 - ms2
        else sec_left := 0.
        end if
    end if;
    sec_left
end proc

>   
>   # Begin Function number 16
>  comp_percent := proc(t_end2,t_start2,t2)
>  global glob_small_float;
>  local rrr, sub1, sub2;
>  sub1  :=  (t_end2-t_start2);
>  sub2  :=  (t2-t_start2);
>  if (abs(sub2) > glob_small_float)  then # if number 13
>   rrr  :=  (100.0*sub2)/sub1;
>   else
>   rrr  :=  0.0;
>   fi;# end if 13
>  ;
>  rrr
>  # End Function number 16
>  end;
comp_percent := proc(t_end2, t_start2, t2)
local rrr, sub1, sub2;
global glob_small_float;
    sub1 := t_end2 - t_start2;
    sub2 := t2 - t_start2;
    if glob_small_float < abs(sub2) then rrr := 100.0*sub2/sub1
    else rrr := 0.
    end if;
    rrr
end proc

>   
>   # Begin Function number 17
>  factorial_1 := proc(nnn)
>  nnn!;
>  
>  # End Function number 17
>  end;
                     factorial_1 := proc(nnn) nnn! end proc

>   
>   # Begin Function number 18
>  factorial_3 := proc(mmm2,nnn2)
>  (mmm2!)/(nnn2!);
>  
>  # End Function number 18
>  end;
              factorial_3 := proc(mmm2, nnn2) mmm2!/nnn2! end proc

>   # Begin Function number 19
>  convfp := proc(mmm)
>  (mmm);
>  
>  # End Function number 19
>  end;
                        convfp := proc(mmm) mmm end proc

>   # Begin Function number 20
>  convfloat := proc(mmm)
>  (mmm);
>  
>  # End Function number 20
>  end;
                      convfloat := proc(mmm) mmm end proc

>   elapsed_time_seconds := proc()
>   time();
>   end;
                 elapsed_time_seconds := proc() time() end proc

>   
>   
>   
>   #END ATS LIBRARY BLOCK
>   #BEGIN USER DEF BLOCK
>   #BEGIN USER DEF BLOCK
>   exact_soln_x1 := proc(t)
>   local c1,c2,c3;
>   c1 := 0.0001;
>   c2 := 0.0002;
>   c3 := 0.0003;
>   2.0 * c1 + 6.0 * c3 * exp(-t);
>   end;
exact_soln_x1 := proc(t)
local c1, c2, c3;
    c1 := 0.0001; c2 := 0.0002; c3 := 0.0003; 2.0*c1 + 6.0*c3*exp(-t)
end proc

>   exact_soln_x2 := proc(t)
>   local c1,c2,c3;
>   c1 := 0.0001;
>   c2 := 0.0002;
>   c3 := 0.0003;
>   c1 + c2 * exp(2.0 * t) + c3 * exp(-t);
>   end;
exact_soln_x2 := proc(t)
local c1, c2, c3;
    c1 := 0.0001;
    c2 := 0.0002;
    c3 := 0.0003;
    c1 + c2*exp(2.0*t) + c3*exp(-t)
end proc

>   exact_soln_x2p := proc(t)
>   local c1,c2,c3;
>   c1 := 0.0001;
>   c2 := 0.0002;
>   c3 := 0.0003;
>   2.0 * c2 * exp(2.0 * t) - c3 * exp(-t);
>   end;
exact_soln_x2p := proc(t)
local c1, c2, c3;
    c1 := 0.0001;
    c2 := 0.0002;
    c3 := 0.0003;
    2.0*c2*exp(2.0*t) - c3*exp(-t)
end proc

>   #END USER DEF BLOCK
>   #END USER DEF BLOCK
>   #END OUTFILE5
>   # Begin Function number 2
>   mainprog := proc()
>   #BEGIN OUTFIEMAIN
>   local d1,d2,d3,d4,est_err_2,niii,done_once,
>   term,ord,order_diff,term_no,html_log_file,
>   rows,r_order,sub_iter,calc_term,iii,temp_sum,current_iter,
>   t_start,t_end
>   ,it, log10norm, max_terms, opt_iter, tmp;
>   #Top Generate Globals Definition
>   #Bottom Generate Globals Deninition
>   global
>   DEBUGMASSIVE,
>   glob_max_terms,
>   DEBUGL,
>   ALWAYS,
>   INFO,
>   glob_iolevel,
>   #Top Generate Globals Decl
>   glob_log10abserr,
>   glob_curr_iter_when_opt,
>   glob_small_float,
>   glob_dump_analytic,
>   djd_debug,
>   glob_dump,
>   glob_max_minutes,
>   glob_start,
>   glob_look_poles,
>   glob_percent_done,
>   glob_reached_optimal_h,
>   min_in_hour,
>   glob_max_opt_iter,
>   glob_html_log,
>   glob_max_rel_trunc_err,
>   glob_max_iter,
>   glob_disp_incr,
>   hours_in_day,
>   sec_in_min,
>   glob_display_flag,
>   djd_debug2,
>   glob_iter,
>   glob_optimal_start,
>   glob_relerr,
>   glob_abserr,
>   glob_large_float,
>   glob_hmin,
>   glob_h,
>   glob_optimal_expect_sec,
>   glob_normmax,
>   glob_current_iter,
>   glob_unchanged_h_cnt,
>   glob_no_eqs,
>   glob_max_order,
>   glob_log10_abserr,
>   glob_hmin_init,
>   glob_optimal_done,
>   glob_not_yet_finished,
>   glob_clock_sec,
>   glob_almost_1,
>   years_in_century,
>   days_in_year,
>   glob_orig_start_sec,
>   glob_warned2,
>   glob_warned,
>   glob_smallish_float,
>   glob_max_hours,
>   glob_last_good_h,
>   glob_not_yet_start_msg,
>   centuries_in_millinium,
>   glob_log10_relerr,
>   glob_initial_pass,
>   glob_clock_start_sec,
>   glob_log10normmin,
>   glob_optimal_clock_start_sec,
>   glob_hmax,
>   glob_log10relerr,
>   MAX_UNCHANGED,
>   glob_max_sec,
>   glob_max_trunc_err,
>   #Bottom Generate Globals Decl
>   #BEGIN CONST
>   array_const_2D0,
>   array_const_4D0,
>   array_const_1,
>   array_const_3D0,
>   array_const_2,
>   array_const_0D0,
>   #END CONST
>   array_type_pole,
>   array_last_rel_error,
>   array_x1_init,
>   array_m1,
>   array_x2,
>   array_x1,
>   array_1st_rel_error,
>   array_x2_init,
>   array_t,
>   array_norms,
>   array_tmp0,
>   array_tmp1,
>   array_tmp2,
>   array_tmp3,
>   array_tmp4,
>   array_tmp5,
>   array_tmp6,
>   array_tmp7,
>   array_tmp8,
>   array_tmp9,
>   array_tmp10,
>   array_tmp11,
>   array_tmp12,
>   array_tmp13,
>   array_tmp14,
>   array_tmp15,
>   array_tmp16,
>   array_tmp17,
>   array_pole,
>   array_real_pole,
>   array_x1_higher_work2,
>   array_poles,
>   array_x1_higher_work,
>   array_x2_higher_work,
>   array_x2_higher_work2,
>   array_x2_higher,
>   array_x1_higher,
>   array_complex_pole,
>   glob_last;
>   glob_last;
>   ALWAYS := 1;
>   INFO := 2;
>   DEBUGL := 3;
>   DEBUGMASSIVE := 4;
>   glob_iolevel := INFO;
>   DEBUGMASSIVE := 4;
>   glob_max_terms := 30;
>   DEBUGL := 3;
>   ALWAYS := 1;
>   INFO := 2;
>   glob_iolevel := 5;
>   glob_log10abserr := 0.0;
>   glob_curr_iter_when_opt := 0;
>   glob_small_float := 0.1e-50;
>   glob_dump_analytic := false;
>   djd_debug := true;
>   glob_dump := false;
>   glob_max_minutes := 0.0;
>   glob_start := 0;
>   glob_look_poles := false;
>   glob_percent_done := 0.0;
>   glob_reached_optimal_h := false;
>   min_in_hour := 60.0;
>   glob_max_opt_iter := 10;
>   glob_html_log := true;
>   glob_max_rel_trunc_err := 0.1e-10;
>   glob_max_iter := 1000;
>   glob_disp_incr := 0.1;
>   hours_in_day := 24.0;
>   sec_in_min := 60.0;
>   glob_display_flag := true;
>   djd_debug2 := true;
>   glob_iter := 0;
>   glob_optimal_start := 0.0;
>   glob_relerr := 0.1e-10;
>   glob_abserr := 0.1e-10;
>   glob_large_float := 9.0e100;
>   glob_hmin := 0.00000000001;
>   glob_h := 0.1;
>   glob_optimal_expect_sec := 0.1;
>   glob_normmax := 0.0;
>   glob_current_iter := 0;
>   glob_unchanged_h_cnt := 0;
>   glob_no_eqs := 0;
>   glob_max_order := 30;
>   glob_log10_abserr := 0.1e-10;
>   glob_hmin_init := 0.001;
>   glob_optimal_done := false;
>   glob_not_yet_finished := true;
>   glob_clock_sec := 0.0;
>   glob_almost_1 := 0.9990;
>   years_in_century := 100.0;
>   days_in_year := 365.0;
>   glob_orig_start_sec := 0.0;
>   glob_warned2 := false;
>   glob_warned := false;
>   glob_smallish_float := 0.1e-100;
>   glob_max_hours := 0.0;
>   glob_last_good_h := 0.1;
>   glob_not_yet_start_msg := true;
>   centuries_in_millinium := 10.0;
>   glob_log10_relerr := 0.1e-10;
>   glob_initial_pass := true;
>   glob_clock_start_sec := 0.0;
>   glob_log10normmin := 0.1;
>   glob_optimal_clock_start_sec := 0.0;
>   glob_hmax := 1.0;
>   glob_log10relerr := 0.0;
>   MAX_UNCHANGED := 10;
>   glob_max_sec := 10000.0;
>   glob_max_trunc_err := 0.1e-10;
>   #Write Set Defaults
>   glob_orig_start_sec   :=  elapsed_time_seconds();
>   MAX_UNCHANGED   := 10;
>   glob_curr_iter_when_opt   :=  0;
>   glob_display_flag   :=   true;
>   glob_max_order   := 2;
>   glob_no_eqs   := 2;
>   glob_iter   :=  -1;
>   opt_iter   :=  -1;
>   glob_max_iter   :=  50000;
>   glob_max_hours   :=  0.0;
>   glob_max_minutes   :=  15.0;
>   omniout_str(ALWAYS,"##############ECHO OF PROBLEM#################");
>   omniout_str(ALWAYS,"##############temp/complicatedrev2postode.ode#################");
>   omniout_str(ALWAYS,"diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;");
>   omniout_str(ALWAYS,"diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;");
>   omniout_str(ALWAYS,"!");
>   omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
>   omniout_str(ALWAYS,"Digits := 32;");
>   omniout_str(ALWAYS,"max_terms := 30;");
>   omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
>   omniout_str(ALWAYS,"!");
>   omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
>   omniout_str(ALWAYS,"t_start := 0.5;");
>   omniout_str(ALWAYS,"t_end := 5.0;");
>   omniout_str(ALWAYS,"array_x1_init[1] := exact_soln_x1(t_start);");
>   omniout_str(ALWAYS,"array_x2_init[1] := exact_soln_x2(t_start);");
>   omniout_str(ALWAYS,"array_x2_init[2] := exact_soln_x2p(t_start);");
>   omniout_str(ALWAYS,"glob_h := 0.00001 ;");
>   omniout_str(ALWAYS,"glob_look_poles := true;");
>   omniout_str(ALWAYS,"glob_max_iter := 10;");
>   omniout_str(ALWAYS,"#END SECOND INPUT BLOCK");
>   omniout_str(ALWAYS,"#BEGIN OVERRIDE  BLOCK");
>   omniout_str(ALWAYS,"glob_h := 0.0005 ;");
>   omniout_str(ALWAYS,"glob_look_poles := true;");
>   omniout_str(ALWAYS,"glob_max_iter := 100;");
>   omniout_str(ALWAYS,"glob_max_minutes := 15;");
>   omniout_str(ALWAYS,"#END OVERRIDE BLOCK");
>   omniout_str(ALWAYS,"!");
>   omniout_str(ALWAYS,"#BEGIN USER DEF BLOCK");
>   omniout_str(ALWAYS,"exact_soln_x1 := proc(t)");
>   omniout_str(ALWAYS,"local c1,c2,c3;");
>   omniout_str(ALWAYS,"c1 := 0.0001;");
>   omniout_str(ALWAYS,"c2 := 0.0002;");
>   omniout_str(ALWAYS,"c3 := 0.0003;");
>   omniout_str(ALWAYS,"2.0 * c1 + 6.0 * c3 * exp(-t);");
>   omniout_str(ALWAYS,"end;");
>   omniout_str(ALWAYS,"exact_soln_x2 := proc(t)");
>   omniout_str(ALWAYS,"local c1,c2,c3;");
>   omniout_str(ALWAYS,"c1 := 0.0001;");
>   omniout_str(ALWAYS,"c2 := 0.0002;");
>   omniout_str(ALWAYS,"c3 := 0.0003;");
>   omniout_str(ALWAYS,"c1 + c2 * exp(2.0 * t) + c3 * exp(-t);");
>   omniout_str(ALWAYS,"end;");
>   omniout_str(ALWAYS,"exact_soln_x2p := proc(t)");
>   omniout_str(ALWAYS,"local c1,c2,c3;");
>   omniout_str(ALWAYS,"c1 := 0.0001;");
>   omniout_str(ALWAYS,"c2 := 0.0002;");
>   omniout_str(ALWAYS,"c3 := 0.0003;");
>   omniout_str(ALWAYS,"2.0 * c2 * exp(2.0 * t) - c3 * exp(-t);");
>   omniout_str(ALWAYS,"end;");
>   omniout_str(ALWAYS,"#END USER DEF BLOCK");
>   omniout_str(ALWAYS,"#######END OF ECHO OF PROBLEM#################");
>   glob_unchanged_h_cnt   :=  0;
>   glob_warned   :=  false;
>   glob_warned2   :=  false;
>   glob_small_float   :=  1.0e-200;
>   glob_smallish_float   :=  1.0e-64;
>   glob_large_float   :=  1.0e100;
>   glob_almost_1   :=  0.99;
>   glob_log10_abserr   :=  -8.0;
>   glob_log10_relerr   :=  -8.0;
>   glob_hmax   :=  0.01;
>   #BEGIN FIRST INPUT BLOCK
>   #BEGIN FIRST INPUT BLOCK
>   Digits := 32;
>   max_terms := 30;
>   #END FIRST INPUT BLOCK
>   #END FIRST INPUT BLOCK
>   #START OF INITS AFTER INPUT BLOCK
>   glob_max_terms := max_terms;
>   glob_html_log := true;
>   #END OF INITS AFTER INPUT BLOCK
>   array_type_pole:= Array(1..(max_terms + 1),[]);
>   array_last_rel_error:= Array(1..(max_terms + 1),[]);
>   array_x1_init:= Array(1..(max_terms + 1),[]);
>   array_m1:= Array(1..(max_terms + 1),[]);
>   array_x2:= Array(1..(max_terms + 1),[]);
>   array_x1:= Array(1..(max_terms + 1),[]);
>   array_1st_rel_error:= Array(1..(max_terms + 1),[]);
>   array_x2_init:= Array(1..(max_terms + 1),[]);
>   array_t:= Array(1..(max_terms + 1),[]);
>   array_norms:= Array(1..(max_terms + 1),[]);
>   array_tmp0:= Array(1..(max_terms + 1),[]);
>   array_tmp1:= Array(1..(max_terms + 1),[]);
>   array_tmp2:= Array(1..(max_terms + 1),[]);
>   array_tmp3:= Array(1..(max_terms + 1),[]);
>   array_tmp4:= Array(1..(max_terms + 1),[]);
>   array_tmp5:= Array(1..(max_terms + 1),[]);
>   array_tmp6:= Array(1..(max_terms + 1),[]);
>   array_tmp7:= Array(1..(max_terms + 1),[]);
>   array_tmp8:= Array(1..(max_terms + 1),[]);
>   array_tmp9:= Array(1..(max_terms + 1),[]);
>   array_tmp10:= Array(1..(max_terms + 1),[]);
>   array_tmp11:= Array(1..(max_terms + 1),[]);
>   array_tmp12:= Array(1..(max_terms + 1),[]);
>   array_tmp13:= Array(1..(max_terms + 1),[]);
>   array_tmp14:= Array(1..(max_terms + 1),[]);
>   array_tmp15:= Array(1..(max_terms + 1),[]);
>   array_tmp16:= Array(1..(max_terms + 1),[]);
>   array_tmp17:= Array(1..(max_terms + 1),[]);
>   array_pole:= Array(1..(max_terms + 1),[]);
>   array_real_pole := Array(1..(2+ 1) ,(1..3+ 1),[]);
>   array_x1_higher_work2 := Array(1..(2+ 1) ,(1..max_terms+ 1),[]);
>   array_poles := Array(1..(2+ 1) ,(1..3+ 1),[]);
>   array_x1_higher_work := Array(1..(2+ 1) ,(1..max_terms+ 1),[]);
>   array_x2_higher_work := Array(1..(3+ 1) ,(1..max_terms+ 1),[]);
>   array_x2_higher_work2 := Array(1..(3+ 1) ,(1..max_terms+ 1),[]);
>   array_x2_higher := Array(1..(3+ 1) ,(1..max_terms+ 1),[]);
>   array_x1_higher := Array(1..(2+ 1) ,(1..max_terms+ 1),[]);
>   array_complex_pole := Array(1..(2+ 1) ,(1..3+ 1),[]);
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_type_pole[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_last_rel_error[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_x1_init[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_m1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_x2[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_x1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_1st_rel_error[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_x2_init[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_t[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_norms[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp2[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp3[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp4[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp5[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp6[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp7[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp8[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp9[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp10[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp11[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp12[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp13[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp14[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp15[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp16[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_tmp17[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_pole[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= 3 do # do number 3
>   array_real_pole[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x1_higher_work2[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= 3 do # do number 3
>   array_poles[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x1_higher_work[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=3 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x2_higher_work[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=3 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x2_higher_work2[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=3 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x2_higher[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= max_terms do # do number 3
>   array_x1_higher[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   ord := 1;
>   while ord <=2 do # do number 2
>  term := 1;
>  while term <= 3 do # do number 3
>   array_complex_pole[ord,term] := 0.0;
>   term := term + 1;
>   od;# end do number 3
>  ;
>  ord := ord + 1;
>  od;# end do number 2
>   ;
>   #BEGIN ARRAYS DEFINED AND INITIALIZATED
>   array_x1 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_x1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_x2 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_x2[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_t := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_t[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp17 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp17[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp16 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp16[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp15 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp15[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp14 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp14[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp13 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp13[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp12 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp12[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp11 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp11[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp10 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp10[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp9 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp9[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp8 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp8[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp7 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp7[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp6 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp6[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp5 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp5[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp4 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp4[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp3 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp3[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp2 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp2[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp1 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_tmp0 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_tmp0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_2D0 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_2D0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_2D0[1]   := 2.0;
>   array_const_4D0 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_4D0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_4D0[1]   := 4.0;
>   array_const_1 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_1[1]   := 1;
>   array_const_3D0 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_3D0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_3D0[1]   := 3.0;
>   array_const_2 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_2[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_2[1]   := 2;
>   array_const_0D0 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms + 1 do # do number 2
>  array_const_0D0[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_const_0D0[1]   := 0.0;
>   array_m1 := Array(1..(max_terms+1 + 1),[]);
>   term := 1;
>   while term <= max_terms do # do number 2
>  array_m1[term] := 0.0;
>  term := term + 1;
>  od;# end do number 2
>   ;
>   array_m1[1]   :=  -1.0;
>   #END ARRAYS DEFINED AND INITIALIZATED
>   #TOP SECOND INPUT BLOCK
>   #BEGIN SECOND INPUT BLOCK
>   #BEGIN SECOND INPUT BLOCK
>   t_start := 0.5;
>   t_end := 5.0;
>   array_x1_init[1] := exact_soln_x1(t_start);
>   array_x2_init[1] := exact_soln_x2(t_start);
>   array_x2_init[2] := exact_soln_x2p(t_start);
>   glob_h := 0.00001 ;
>   glob_look_poles := true;
>   glob_max_iter := 10;
>   #END SECOND INPUT BLOCK
>   #BEGIN OVERRIDE  BLOCK
>   glob_h := 0.0005 ;
>   glob_look_poles := true;
>   glob_max_iter := 100;
>   glob_max_minutes := 15;
>   #END OVERRIDE BLOCK
>   #END SECOND INPUT BLOCK
>   #BEGIN INITS AFTER SECOND INPUT BLOCK
>   glob_last_good_h := glob_h;
>   glob_max_terms   := max_terms;
>   glob_max_sec   := convfloat(60.0) * convfloat(glob_max_minutes) + convfloat(3600.0) * convfloat(glob_max_hours);
>   glob_abserr   :=  10.0 ^ (glob_log10_abserr);
>   glob_relerr   :=  10.0 ^ (glob_log10_relerr);
>   chk_data();
>   #AFTER INITS AFTER SECOND INPUT BLOCK
>   if glob_html_log  then # if number 3
>       html_log_file := fopen("html/entry.html",WRITE,TEXT);
>       fi;# end if 3
>     ;
>     #BEGIN SOLUTION CODE
>     omniout_str(ALWAYS,"START of Soultion");
>     #Start Series -- INITIALIZE FOR SOLUTION
>     array_t[1]   := t_start;
>     array_t[2]   :=  glob_h;
>     order_diff := 2;
>     #Start Series array_x2
>     term_no   :=  1;
>     while (term_no <= order_diff) do # do number 2
>       array_x2[term_no] := array_x2_init[term_no] * glob_h ^ (term_no - 1) / factorial_1(term_no - 1);
>       term_no   :=  term_no + 1;
>       od;# end do number 2
>     ;
>     rows   :=  order_diff;
>     r_order   :=  1;
>     while (r_order <= rows) do # do number 2
>       term_no   :=  1;
>       while (term_no <= (rows - r_order + 1)) do # do number 3
>         it  := term_no + r_order - 1;
>         array_x2_higher[r_order,term_no] := array_x2_init[it]* (glob_h ^ (term_no - 1)) / ((factorial_1(term_no - 1)));
>         term_no   :=  term_no + 1;
>         od;# end do number 3
>       ;
>       r_order   :=  r_order + 1;
>       od;# end do number 2
>     ;
>     order_diff := 1;
>     #Start Series array_x1
>     term_no   :=  1;
>     while (term_no <= order_diff) do # do number 2
>       array_x1[term_no] := array_x1_init[term_no] * glob_h ^ (term_no - 1) / factorial_1(term_no - 1);
>       term_no   :=  term_no + 1;
>       od;# end do number 2
>     ;
>     rows   :=  order_diff;
>     r_order   :=  1;
>     while (r_order <= rows) do # do number 2
>       term_no   :=  1;
>       while (term_no <= (rows - r_order + 1)) do # do number 3
>         it  := term_no + r_order - 1;
>         array_x1_higher[r_order,term_no] := array_x1_init[it]* (glob_h ^ (term_no - 1)) / ((factorial_1(term_no - 1)));
>         term_no   :=  term_no + 1;
>         od;# end do number 3
>       ;
>       r_order   :=  r_order + 1;
>       od;# end do number 2
>     ;
>     current_iter   :=  1;
>     glob_clock_start_sec   := elapsed_time_seconds();
>     start_array_x2();
>     if (abs(array_x2_higher[1,1]) > glob_small_float)  then # if number 3
>       tmp   :=  abs(array_x2_higher[1,1]);
>       log10norm   :=  (log10(tmp));
>       if (log10norm < glob_log10normmin)  then # if number 4
>         glob_log10normmin   :=  log10norm;
>         fi;# end if 4
>       fi;# end if 3
>     ;
>     display_alot(current_iter)
>     ;
>     start_array_x1();
>     if (abs(array_x1_higher[1,1]) > glob_small_float)  then # if number 3
>       tmp   :=  abs(array_x1_higher[1,1]);
>       log10norm   :=  (log10(tmp));
>       if (log10norm < glob_log10normmin)  then # if number 4
>         glob_log10normmin   :=  log10norm;
>         fi;# end if 4
>       fi;# end if 3
>     ;
>     display_alot(current_iter)
>     ;
>     glob_clock_sec   :=  elapsed_time_seconds();
>     glob_current_iter   :=  0;
>     glob_iter   :=  0;
>     omniout_str(DEBUGL," ");
>     glob_reached_optimal_h   :=  true;
>     glob_optimal_clock_start_sec := elapsed_time_seconds();
>     while ((glob_current_iter < glob_max_iter) and (array_t[1] <= t_end ) and ((convfloat(glob_clock_sec) - convfloat(glob_orig_start_sec)) < convfloat(glob_max_sec))) do # do number 2
>       #left paren 0001C
>       omniout_str(INFO," ");
>       omniout_str(INFO,"TOP MAIN SOLVE Loop");
>       glob_iter   :=  glob_iter + 1;
>       glob_clock_sec   := elapsed_time_seconds();
>       glob_current_iter   :=  glob_current_iter + 1;
>       sub_iter := 1;
>       while sub_iter <= 3 do # do number 3
>         atomall()
>         ;
>         sub_iter := sub_iter + 1;
>         od;# end do number 3
>       ;
>       if (glob_look_poles)  then # if number 3
>         #left paren 0004C
>         check_for_pole();
>         fi;# end if 3
>       ;#was right paren 0004C
>       array_t[1]   := array_t[1] + glob_h;
>       array_t[2]   :=  glob_h;
>       order_diff := 2;
>       #Jump Series array_x2
>       #START PART 1  SUM AND ADJUST
>       #START SUM AND ADJUST EQ =1
>       #sum_and_adjust array_x2
>       order_diff := 2;
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 3;
>       calc_term := 1;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[3,iii] := array_x2_higher[3,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 3;
>       calc_term := 1;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 2;
>       calc_term := 2;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[2,iii] := array_x2_higher[2,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 2;
>       calc_term := 2;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 2;
>       calc_term := 1;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[2,iii] := array_x2_higher[2,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 2;
>       calc_term := 1;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 1;
>       calc_term := 3;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[1,iii] := array_x2_higher[1,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 1;
>       calc_term := 3;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 1;
>       calc_term := 2;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[1,iii] := array_x2_higher[1,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 1;
>       calc_term := 2;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #BEFORE ADJUST SUBSERIES EQ =1
>       order_diff := 2;
>       ord := 1;
>       calc_term := 1;
>       #adjust_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x2_higher_work[1,iii] := array_x2_higher[1,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =1
>       #BEFORE SUM SUBSERIES EQ =1
>       order_diff := 2;
>       temp_sum := 0.0;
>       ord := 1;
>       calc_term := 1;
>       #sum_subseriesarray_x2
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x2_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x2_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =1
>       #END SUM AND ADJUST EQ =1
>       #END PART 1
>       #START PART 2  MOVE TERMS to REGULAR Array
>       term_no := glob_max_terms;
>       while (term_no >= 1) do # do number 3
>         array_x2[term_no] := array_x2_higher_work2[1,term_no];
>         ord := 1;
>         while ord <= order_diff  do # do number 4
>           array_x2_higher[ord,term_no] := array_x2_higher_work2[ord,term_no];
>           ord := ord + 1;
>           od;# end do number 4
>         ;
>         term_no   :=  term_no - 1;
>         od;# end do number 3
>       ;
>       #END PART 2 HEVE MOVED TERMS to REGULAR Array
>       order_diff := 1;
>       #Jump Series array_x1
>       #START PART 1  SUM AND ADJUST
>       #START SUM AND ADJUST EQ =2
>       #sum_and_adjust array_x1
>       order_diff := 1;
>       #BEFORE ADJUST SUBSERIES EQ =2
>       order_diff := 1;
>       ord := 2;
>       calc_term := 1;
>       #adjust_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x1_higher_work[2,iii] := array_x1_higher[2,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =2
>       #BEFORE SUM SUBSERIES EQ =2
>       order_diff := 1;
>       temp_sum := 0.0;
>       ord := 2;
>       calc_term := 1;
>       #sum_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x1_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x1_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =2
>       #BEFORE ADJUST SUBSERIES EQ =2
>       order_diff := 1;
>       ord := 1;
>       calc_term := 2;
>       #adjust_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x1_higher_work[1,iii] := array_x1_higher[1,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =2
>       #BEFORE SUM SUBSERIES EQ =2
>       order_diff := 1;
>       temp_sum := 0.0;
>       ord := 1;
>       calc_term := 2;
>       #sum_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x1_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x1_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =2
>       #BEFORE ADJUST SUBSERIES EQ =2
>       order_diff := 1;
>       ord := 1;
>       calc_term := 1;
>       #adjust_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         array_x1_higher_work[1,iii] := array_x1_higher[1,iii] / (glob_h ^ (calc_term - 1)) / factorial_3(iii - calc_term , iii  - 1);
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       #AFTER ADJUST SUBSERIES EQ =2
>       #BEFORE SUM SUBSERIES EQ =2
>       order_diff := 1;
>       temp_sum := 0.0;
>       ord := 1;
>       calc_term := 1;
>       #sum_subseriesarray_x1
>       iii  := glob_max_terms;
>       while (iii >= calc_term)   do # do number 3
>         temp_sum := temp_sum + array_x1_higher_work[ord,iii];
>         iii  := iii - 1;
>         od;# end do number 3
>       ;
>       array_x1_higher_work2[ord,calc_term] := temp_sum * (glob_h ^ (calc_term - 1)) / (convfp(calc_term - 1)!);
>       #AFTER SUM SUBSERIES EQ =2
>       #END SUM AND ADJUST EQ =2
>       #END PART 1
>       #START PART 2  MOVE TERMS to REGULAR Array
>       term_no := glob_max_terms;
>       while (term_no >= 1) do # do number 3
>         array_x1[term_no] := array_x1_higher_work2[1,term_no];
>         ord := 1;
>         while ord <= order_diff  do # do number 4
>           array_x1_higher[ord,term_no] := array_x1_higher_work2[ord,term_no];
>           ord := ord + 1;
>           od;# end do number 4
>         ;
>         term_no   :=  term_no - 1;
>         od;# end do number 3
>       ;
>       #END PART 2 HEVE MOVED TERMS to REGULAR Array
>       display_alot(current_iter)
>       ;
>       od;# end do number 2
>     ;#right paren 0001C
>     omniout_str(ALWAYS,"Finished!");
>     if (glob_iter >= glob_max_iter)  then # if number 3
>       omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!")
>       fi;# end if 3
>     ;
>     if (elapsed_time_seconds() - convfloat(glob_orig_start_sec) >= convfloat(glob_max_sec  )) then # if number 3
>       omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!")
>       fi;# end if 3
>     ;
>     glob_clock_sec   := elapsed_time_seconds();
>     omniout_str(INFO,"diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;");
>     omniout_str(INFO,"diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;");
>     omniout_int(INFO,"Iterations                       ",32,glob_iter,4," ")
>     ;
>     prog_report(t_start,t_end);
>     if glob_html_log  then # if number 3
>       logstart(html_log_file);
>       logitem_str(html_log_file,"2012-06-02T01:57:00-05:00")
>       ;
>       logitem_str(html_log_file,"Maple")
>       ;
>       logitem_str(html_log_file,"<a href=\"complicatedrev2.ode.txt\">complicatedrev2</a>")
>       ;
>       logitem_str(html_log_file,"diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;")
>       ;
>       logitem_float(html_log_file,t_start)
>       ;
>       logitem_float(html_log_file,t_end)
>       ;
>       logitem_float(html_log_file,array_t[1])
>       ;
>       logitem_float(html_log_file,glob_h)
>       ;
>       logitem_integer(html_log_file,Digits)
>       ;
>       ;
>       logitem_integer(html_log_file,glob_max_terms)
>       ;
>       logitem_float(html_log_file,array_1st_rel_error[1])
>       ;
>       logitem_float(html_log_file,array_last_rel_error[1])
>       ;
>       logitem_integer(html_log_file,glob_iter)
>       ;
>       logitem_pole(html_log_file,array_type_pole[1])
>       ;
>       if array_type_pole[1] = 1 or array_type_pole[1] = 2 then # if number 4
>         logitem_float(html_log_file,array_pole[1])
>         ;
>         logitem_float(html_log_file,array_pole[2])
>         ;
>         0;
>         else
>         logitem_str(html_log_file,"NA")
>         ;
>         logitem_str(html_log_file,"NA")
>         ;
>         0;
>         fi;# end if 4
>       ;
>       logitem_time(html_log_file,convfloat(glob_clock_sec))
>       ;
>       if glob_percent_done < 100.0  then # if number 4
>         logitem_time(html_log_file,convfloat(glob_optimal_expect_sec))
>         ;
>         0
>         else
>         logitem_str(html_log_file,"Done")
>         ;
>         0
>         fi;# end if 4
>       ;
>       log_revs(html_log_file,"<td> 076 </td>")
>       ;
>       logitem_str(html_log_file,"<a href=\"diffeq.complicatedrev2.mxt.txt\">complicatedrev2 diffeq.mxt</a>")
>       ;
>       logitem_str(html_log_file,"<a href=\"results.complicatedrev2.mxt.txt\">complicatedrev2 maple results</a>")
>       ;
>       logitem_str(html_log_file,"sub iter tot order eqs reversed")
>       ;
>       logend(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logitem_str(html_log_file,"diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;")
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       ;
>       logditto(html_log_file)
>       ;
>       logitem_float(html_log_file,array_1st_rel_error[2])
>       ;
>       logitem_float(html_log_file,array_last_rel_error[2])
>       ;
>       logditto(html_log_file)
>       ;
>       logitem_pole(html_log_file,array_type_pole[2])
>       ;
>       if array_type_pole[2] = 1 or array_type_pole[2] = 2 then # if number 4
>         logitem_float(html_log_file,array_pole[1])
>         ;
>         logitem_float(html_log_file,array_pole[2])
>         ;
>         0;
>         else
>         logitem_str(html_log_file,"NA")
>         ;
>         logitem_str(html_log_file,"NA")
>         ;
>         0;
>         fi;# end if 4
>       ;
>       logditto(html_log_file)
>       ;
>       if glob_percent_done < 100.0  then # if number 4
>         logditto(html_log_file)
>         ;
>         0
>         else
>         logditto(html_log_file)
>         ;
>         0
>         fi;# end if 4
>       ;
>       logditto(html_log_file);
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logditto(html_log_file)
>       ;
>       logend(html_log_file)
>       ;
>       ;
>       fi;# end if 3
>     ;
>     if glob_html_log  then # if number 3
>       fclose(html_log_file);
>       fi;# end if 3
>     ;
>     ;;
>     #END OUTFILEMAIN
>     # End Function number 8
>     end;
mainprog := proc()
local d1, d2, d3, d4, est_err_2, niii, done_once, term, ord, order_diff,
term_no, html_log_file, rows, r_order, sub_iter, calc_term, iii, temp_sum,
current_iter, t_start, t_end, it, log10norm, max_terms, opt_iter, tmp;
global DEBUGMASSIVE, glob_max_terms, DEBUGL, ALWAYS, INFO, glob_iolevel,
glob_log10abserr, glob_curr_iter_when_opt, glob_small_float,
glob_dump_analytic, djd_debug, glob_dump, glob_max_minutes, glob_start,
glob_look_poles, glob_percent_done, glob_reached_optimal_h, min_in_hour,
glob_max_opt_iter, glob_html_log, glob_max_rel_trunc_err, glob_max_iter,
glob_disp_incr, hours_in_day, sec_in_min, glob_display_flag, djd_debug2,
glob_iter, glob_optimal_start, glob_relerr, glob_abserr, glob_large_float,
glob_hmin, glob_h, glob_optimal_expect_sec, glob_normmax, glob_current_iter,
glob_unchanged_h_cnt, glob_no_eqs, glob_max_order, glob_log10_abserr,
glob_hmin_init, glob_optimal_done, glob_not_yet_finished, glob_clock_sec,
glob_almost_1, years_in_century, days_in_year, glob_orig_start_sec,
glob_warned2, glob_warned, glob_smallish_float, glob_max_hours,
glob_last_good_h, glob_not_yet_start_msg, centuries_in_millinium,
glob_log10_relerr, glob_initial_pass, glob_clock_start_sec,
glob_log10normmin, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, MAX_UNCHANGED, glob_max_sec, glob_max_trunc_err,
array_const_2D0, array_const_4D0, array_const_1, array_const_3D0,
array_const_2, array_const_0D0, array_type_pole, array_last_rel_error,
array_x1_init, array_m1, array_x2, array_x1, array_1st_rel_error,
array_x2_init, array_t, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_tmp5, array_tmp6, array_tmp7, array_tmp8,
array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14,
array_tmp15, array_tmp16, array_tmp17, array_pole, array_real_pole,
array_x1_higher_work2, array_poles, array_x1_higher_work,
array_x2_higher_work, array_x2_higher_work2, array_x2_higher,
array_x1_higher, array_complex_pole, glob_last;
    glob_last;
    ALWAYS := 1;
    INFO := 2;
    DEBUGL := 3;
    DEBUGMASSIVE := 4;
    glob_iolevel := INFO;
    DEBUGMASSIVE := 4;
    glob_max_terms := 30;
    DEBUGL := 3;
    ALWAYS := 1;
    INFO := 2;
    glob_iolevel := 5;
    glob_log10abserr := 0.;
    glob_curr_iter_when_opt := 0;
    glob_small_float := 0.1*10^(-50);
    glob_dump_analytic := false;
    djd_debug := true;
    glob_dump := false;
    glob_max_minutes := 0.;
    glob_start := 0;
    glob_look_poles := false;
    glob_percent_done := 0.;
    glob_reached_optimal_h := false;
    min_in_hour := 60.0;
    glob_max_opt_iter := 10;
    glob_html_log := true;
    glob_max_rel_trunc_err := 0.1*10^(-10);
    glob_max_iter := 1000;
    glob_disp_incr := 0.1;
    hours_in_day := 24.0;
    sec_in_min := 60.0;
    glob_display_flag := true;
    djd_debug2 := true;
    glob_iter := 0;
    glob_optimal_start := 0.;
    glob_relerr := 0.1*10^(-10);
    glob_abserr := 0.1*10^(-10);
    glob_large_float := 0.90*10^101;
    glob_hmin := 0.1*10^(-10);
    glob_h := 0.1;
    glob_optimal_expect_sec := 0.1;
    glob_normmax := 0.;
    glob_current_iter := 0;
    glob_unchanged_h_cnt := 0;
    glob_no_eqs := 0;
    glob_max_order := 30;
    glob_log10_abserr := 0.1*10^(-10);
    glob_hmin_init := 0.001;
    glob_optimal_done := false;
    glob_not_yet_finished := true;
    glob_clock_sec := 0.;
    glob_almost_1 := 0.9990;
    years_in_century := 100.0;
    days_in_year := 365.0;
    glob_orig_start_sec := 0.;
    glob_warned2 := false;
    glob_warned := false;
    glob_smallish_float := 0.1*10^(-100);
    glob_max_hours := 0.;
    glob_last_good_h := 0.1;
    glob_not_yet_start_msg := true;
    centuries_in_millinium := 10.0;
    glob_log10_relerr := 0.1*10^(-10);
    glob_initial_pass := true;
    glob_clock_start_sec := 0.;
    glob_log10normmin := 0.1;
    glob_optimal_clock_start_sec := 0.;
    glob_hmax := 1.0;
    glob_log10relerr := 0.;
    MAX_UNCHANGED := 10;
    glob_max_sec := 10000.0;
    glob_max_trunc_err := 0.1*10^(-10);
    glob_orig_start_sec := elapsed_time_seconds();
    MAX_UNCHANGED := 10;
    glob_curr_iter_when_opt := 0;
    glob_display_flag := true;
    glob_max_order := 2;
    glob_no_eqs := 2;
    glob_iter := -1;
    opt_iter := -1;
    glob_max_iter := 50000;
    glob_max_hours := 0.;
    glob_max_minutes := 15.0;
    omniout_str(ALWAYS, "##############ECHO OF PROBLEM#################");
    omniout_str(ALWAYS,
        "##############temp/complicatedrev2postode.ode#################");
    omniout_str(ALWAYS, "diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - \
        diff(x1,t,2) - diff (x1,t,1) + x1;");
    omniout_str(ALWAYS,
        "diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;");
    omniout_str(ALWAYS, "!");
    omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
    omniout_str(ALWAYS, "Digits := 32;");
    omniout_str(ALWAYS, "max_terms := 30;");
    omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
    omniout_str(ALWAYS, "!");
    omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
    omniout_str(ALWAYS, "t_start := 0.5;");
    omniout_str(ALWAYS, "t_end := 5.0;");
    omniout_str(ALWAYS, "array_x1_init[1] := exact_soln_x1(t_start);");
    omniout_str(ALWAYS, "array_x2_init[1] := exact_soln_x2(t_start);");
    omniout_str(ALWAYS, "array_x2_init[2] := exact_soln_x2p(t_start);");
    omniout_str(ALWAYS, "glob_h := 0.00001 ;");
    omniout_str(ALWAYS, "glob_look_poles := true;");
    omniout_str(ALWAYS, "glob_max_iter := 10;");
    omniout_str(ALWAYS, "#END SECOND INPUT BLOCK");
    omniout_str(ALWAYS, "#BEGIN OVERRIDE  BLOCK");
    omniout_str(ALWAYS, "glob_h := 0.0005 ;");
    omniout_str(ALWAYS, "glob_look_poles := true;");
    omniout_str(ALWAYS, "glob_max_iter := 100;");
    omniout_str(ALWAYS, "glob_max_minutes := 15;");
    omniout_str(ALWAYS, "#END OVERRIDE BLOCK");
    omniout_str(ALWAYS, "!");
    omniout_str(ALWAYS, "#BEGIN USER DEF BLOCK");
    omniout_str(ALWAYS, "exact_soln_x1 := proc(t)");
    omniout_str(ALWAYS, "local c1,c2,c3;");
    omniout_str(ALWAYS, "c1 := 0.0001;");
    omniout_str(ALWAYS, "c2 := 0.0002;");
    omniout_str(ALWAYS, "c3 := 0.0003;");
    omniout_str(ALWAYS, "2.0 * c1 + 6.0 * c3 * exp(-t);");
    omniout_str(ALWAYS, "end;");
    omniout_str(ALWAYS, "exact_soln_x2 := proc(t)");
    omniout_str(ALWAYS, "local c1,c2,c3;");
    omniout_str(ALWAYS, "c1 := 0.0001;");
    omniout_str(ALWAYS, "c2 := 0.0002;");
    omniout_str(ALWAYS, "c3 := 0.0003;");
    omniout_str(ALWAYS, "c1 + c2 * exp(2.0 * t) + c3 * exp(-t);");
    omniout_str(ALWAYS, "end;");
    omniout_str(ALWAYS, "exact_soln_x2p := proc(t)");
    omniout_str(ALWAYS, "local c1,c2,c3;");
    omniout_str(ALWAYS, "c1 := 0.0001;");
    omniout_str(ALWAYS, "c2 := 0.0002;");
    omniout_str(ALWAYS, "c3 := 0.0003;");
    omniout_str(ALWAYS, "2.0 * c2 * exp(2.0 * t) - c3 * exp(-t);");
    omniout_str(ALWAYS, "end;");
    omniout_str(ALWAYS, "#END USER DEF BLOCK");
    omniout_str(ALWAYS, "#######END OF ECHO OF PROBLEM#################");
    glob_unchanged_h_cnt := 0;
    glob_warned := false;
    glob_warned2 := false;
    glob_small_float := 0.10*10^(-199);
    glob_smallish_float := 0.10*10^(-63);
    glob_large_float := 0.10*10^101;
    glob_almost_1 := 0.99;
    glob_log10_abserr := -8.0;
    glob_log10_relerr := -8.0;
    glob_hmax := 0.01;
    Digits := 32;
    max_terms := 30;
    glob_max_terms := max_terms;
    glob_html_log := true;
    array_type_pole := Array(1 .. max_terms + 1, []);
    array_last_rel_error := Array(1 .. max_terms + 1, []);
    array_x1_init := Array(1 .. max_terms + 1, []);
    array_m1 := Array(1 .. max_terms + 1, []);
    array_x2 := Array(1 .. max_terms + 1, []);
    array_x1 := Array(1 .. max_terms + 1, []);
    array_1st_rel_error := Array(1 .. max_terms + 1, []);
    array_x2_init := Array(1 .. max_terms + 1, []);
    array_t := Array(1 .. max_terms + 1, []);
    array_norms := Array(1 .. max_terms + 1, []);
    array_tmp0 := Array(1 .. max_terms + 1, []);
    array_tmp1 := Array(1 .. max_terms + 1, []);
    array_tmp2 := Array(1 .. max_terms + 1, []);
    array_tmp3 := Array(1 .. max_terms + 1, []);
    array_tmp4 := Array(1 .. max_terms + 1, []);
    array_tmp5 := Array(1 .. max_terms + 1, []);
    array_tmp6 := Array(1 .. max_terms + 1, []);
    array_tmp7 := Array(1 .. max_terms + 1, []);
    array_tmp8 := Array(1 .. max_terms + 1, []);
    array_tmp9 := Array(1 .. max_terms + 1, []);
    array_tmp10 := Array(1 .. max_terms + 1, []);
    array_tmp11 := Array(1 .. max_terms + 1, []);
    array_tmp12 := Array(1 .. max_terms + 1, []);
    array_tmp13 := Array(1 .. max_terms + 1, []);
    array_tmp14 := Array(1 .. max_terms + 1, []);
    array_tmp15 := Array(1 .. max_terms + 1, []);
    array_tmp16 := Array(1 .. max_terms + 1, []);
    array_tmp17 := Array(1 .. max_terms + 1, []);
    array_pole := Array(1 .. max_terms + 1, []);
    array_real_pole := Array(1 .. 3, 1 .. 4, []);
    array_x1_higher_work2 := Array(1 .. 3, 1 .. max_terms + 1, []);
    array_poles := Array(1 .. 3, 1 .. 4, []);
    array_x1_higher_work := Array(1 .. 3, 1 .. max_terms + 1, []);
    array_x2_higher_work := Array(1 .. 4, 1 .. max_terms + 1, []);
    array_x2_higher_work2 := Array(1 .. 4, 1 .. max_terms + 1, []);
    array_x2_higher := Array(1 .. 4, 1 .. max_terms + 1, []);
    array_x1_higher := Array(1 .. 3, 1 .. max_terms + 1, []);
    array_complex_pole := Array(1 .. 3, 1 .. 4, []);
    term := 1;
    while term <= max_terms do
        array_type_pole[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do
        array_last_rel_error[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_x1_init[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_m1[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_x2[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_x1[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do
        array_1st_rel_error[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_x2_init[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_t[term] := 0.; term := term + 1 end do
    ;
    term := 1;
    while term <= max_terms do array_norms[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp0[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp1[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp2[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp3[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp4[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp5[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp6[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp7[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp8[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp9[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp10[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp11[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp12[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp13[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp14[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp15[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp16[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_tmp17[term] := 0.; term := term + 1
    end do;
    term := 1;
    while term <= max_terms do array_pole[term] := 0.; term := term + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= 3 do
            array_real_pole[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= max_terms do
            array_x1_higher_work2[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= 3 do array_poles[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= max_terms do
            array_x1_higher_work[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 3 do
        term := 1;
        while term <= max_terms do
            array_x2_higher_work[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 3 do
        term := 1;
        while term <= max_terms do
            array_x2_higher_work2[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 3 do
        term := 1;
        while term <= max_terms do
            array_x2_higher[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= max_terms do
            array_x1_higher[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    ord := 1;
    while ord <= 2 do
        term := 1;
        while term <= 3 do
            array_complex_pole[ord, term] := 0.; term := term + 1
        end do;
        ord := ord + 1
    end do;
    array_x1 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_x1[term] := 0.; term := term + 1
    end do;
    array_x2 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_x2[term] := 0.; term := term + 1
    end do;
    array_t := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_t[term] := 0.; term := term + 1
    end do;
    array_tmp17 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp17[term] := 0.; term := term + 1
    end do;
    array_tmp16 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp16[term] := 0.; term := term + 1
    end do;
    array_tmp15 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp15[term] := 0.; term := term + 1
    end do;
    array_tmp14 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp14[term] := 0.; term := term + 1
    end do;
    array_tmp13 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp13[term] := 0.; term := term + 1
    end do;
    array_tmp12 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp12[term] := 0.; term := term + 1
    end do;
    array_tmp11 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp11[term] := 0.; term := term + 1
    end do;
    array_tmp10 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_tmp10[term] := 0.; term := term + 1
    end do;
    array_tmp9 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp9[term] := 0.; term := term + 1
    end do;
    array_tmp8 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp8[term] := 0.; term := term + 1
    end do;
    array_tmp7 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp7[term] := 0.; term := term + 1
    end do;
    array_tmp6 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp6[term] := 0.; term := term + 1
    end do;
    array_tmp5 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp5[term] := 0.; term := term + 1
    end do;
    array_tmp4 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp4[term] := 0.; term := term + 1
    end do;
    array_tmp3 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp3[term] := 0.; term := term + 1
    end do;
    array_tmp2 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp2[term] := 0.; term := term + 1
    end do;
    array_tmp1 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp1[term] := 0.; term := term + 1
    end do;
    array_tmp0 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do array_tmp0[term] := 0.; term := term + 1
    end do;
    array_const_2D0 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_2D0[term] := 0.; term := term + 1
    end do;
    array_const_2D0[1] := 2.0;
    array_const_4D0 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_4D0[term] := 0.; term := term + 1
    end do;
    array_const_4D0[1] := 4.0;
    array_const_1 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_1[term] := 0.; term := term + 1
    end do;
    array_const_1[1] := 1;
    array_const_3D0 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_3D0[term] := 0.; term := term + 1
    end do;
    array_const_3D0[1] := 3.0;
    array_const_2 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_2[term] := 0.; term := term + 1
    end do;
    array_const_2[1] := 2;
    array_const_0D0 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms + 1 do
        array_const_0D0[term] := 0.; term := term + 1
    end do;
    array_const_0D0[1] := 0.;
    array_m1 := Array(1 .. max_terms + 2, []);
    term := 1;
    while term <= max_terms do array_m1[term] := 0.; term := term + 1
    end do;
    array_m1[1] := -1.0;
    t_start := 0.5;
    t_end := 5.0;
    array_x1_init[1] := exact_soln_x1(t_start);
    array_x2_init[1] := exact_soln_x2(t_start);
    array_x2_init[2] := exact_soln_x2p(t_start);
    glob_h := 0.00001;
    glob_look_poles := true;
    glob_max_iter := 10;
    glob_h := 0.0005;
    glob_look_poles := true;
    glob_max_iter := 100;
    glob_max_minutes := 15;
    glob_last_good_h := glob_h;
    glob_max_terms := max_terms;
    glob_max_sec := convfloat(60.0)*convfloat(glob_max_minutes)
         + convfloat(3600.0)*convfloat(glob_max_hours);
    glob_abserr := 10.0^glob_log10_abserr;
    glob_relerr := 10.0^glob_log10_relerr;
    chk_data();
    if glob_html_log then
        html_log_file := fopen("html/entry.html", WRITE, TEXT)
    end if;
    omniout_str(ALWAYS, "START of Soultion");
    array_t[1] := t_start;
    array_t[2] := glob_h;
    order_diff := 2;
    term_no := 1;
    while term_no <= order_diff do
        array_x2[term_no] := array_x2_init[term_no]*glob_h^(term_no - 1)/
            factorial_1(term_no - 1);
        term_no := term_no + 1
    end do;
    rows := order_diff;
    r_order := 1;
    while r_order <= rows do
        term_no := 1;
        while term_no <= rows - r_order + 1 do
            it := term_no + r_order - 1;
            array_x2_higher[r_order, term_no] := array_x2_init[it]*
                glob_h^(term_no - 1)/factorial_1(term_no - 1);
            term_no := term_no + 1
        end do;
        r_order := r_order + 1
    end do;
    order_diff := 1;
    term_no := 1;
    while term_no <= order_diff do
        array_x1[term_no] := array_x1_init[term_no]*glob_h^(term_no - 1)/
            factorial_1(term_no - 1);
        term_no := term_no + 1
    end do;
    rows := order_diff;
    r_order := 1;
    while r_order <= rows do
        term_no := 1;
        while term_no <= rows - r_order + 1 do
            it := term_no + r_order - 1;
            array_x1_higher[r_order, term_no] := array_x1_init[it]*
                glob_h^(term_no - 1)/factorial_1(term_no - 1);
            term_no := term_no + 1
        end do;
        r_order := r_order + 1
    end do;
    current_iter := 1;
    glob_clock_start_sec := elapsed_time_seconds();
    start_array_x2();
    if glob_small_float < abs(array_x2_higher[1, 1]) then
        tmp := abs(array_x2_higher[1, 1]);
        log10norm := log10(tmp);
        if log10norm < glob_log10normmin then
            glob_log10normmin := log10norm
        end if
    end if;
    display_alot(current_iter);
    start_array_x1();
    if glob_small_float < abs(array_x1_higher[1, 1]) then
        tmp := abs(array_x1_higher[1, 1]);
        log10norm := log10(tmp);
        if log10norm < glob_log10normmin then
            glob_log10normmin := log10norm
        end if
    end if;
    display_alot(current_iter);
    glob_clock_sec := elapsed_time_seconds();
    glob_current_iter := 0;
    glob_iter := 0;
    omniout_str(DEBUGL, " ");
    glob_reached_optimal_h := true;
    glob_optimal_clock_start_sec := elapsed_time_seconds();
    while glob_current_iter < glob_max_iter and array_t[1] <= t_end and
    convfloat(glob_clock_sec) - convfloat(glob_orig_start_sec) <
    convfloat(glob_max_sec) do
        omniout_str(INFO, " ");
        omniout_str(INFO, "TOP MAIN SOLVE Loop");
        glob_iter := glob_iter + 1;
        glob_clock_sec := elapsed_time_seconds();
        glob_current_iter := glob_current_iter + 1;
        sub_iter := 1;
        while sub_iter <= 3 do atomall(); sub_iter := sub_iter + 1 end do;
        if glob_look_poles then check_for_pole() end if;
        array_t[1] := array_t[1] + glob_h;
        array_t[2] := glob_h;
        order_diff := 2;
        order_diff := 2;
        order_diff := 2;
        ord := 3;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[3, iii] := array_x2_higher[3, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 3;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 2;
        ord := 2;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[2, iii] := array_x2_higher[2, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 2;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 2;
        ord := 2;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[2, iii] := array_x2_higher[2, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 2;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 2;
        ord := 1;
        calc_term := 3;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[1, iii] := array_x2_higher[1, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 1;
        calc_term := 3;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 2;
        ord := 1;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[1, iii] := array_x2_higher[1, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 1;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 2;
        ord := 1;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x2_higher_work[1, iii] := array_x2_higher[1, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 2;
        temp_sum := 0.;
        ord := 1;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x2_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x2_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        term_no := glob_max_terms;
        while 1 <= term_no do
            array_x2[term_no] := array_x2_higher_work2[1, term_no];
            ord := 1;
            while ord <= order_diff do
                array_x2_higher[ord, term_no] :=
                    array_x2_higher_work2[ord, term_no];
                ord := ord + 1
            end do;
            term_no := term_no - 1
        end do;
        order_diff := 1;
        order_diff := 1;
        order_diff := 1;
        ord := 2;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x1_higher_work[2, iii] := array_x1_higher[2, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 1;
        temp_sum := 0.;
        ord := 2;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x1_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x1_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 1;
        ord := 1;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x1_higher_work[1, iii] := array_x1_higher[1, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 1;
        temp_sum := 0.;
        ord := 1;
        calc_term := 2;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x1_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x1_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        order_diff := 1;
        ord := 1;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            array_x1_higher_work[1, iii] := array_x1_higher[1, iii]/(
                glob_h^(calc_term - 1)*
                factorial_3(iii - calc_term, iii - 1));
            iii := iii - 1
        end do;
        order_diff := 1;
        temp_sum := 0.;
        ord := 1;
        calc_term := 1;
        iii := glob_max_terms;
        while calc_term <= iii do
            temp_sum := temp_sum + array_x1_higher_work[ord, iii];
            iii := iii - 1
        end do;
        array_x1_higher_work2[ord, calc_term] :=
            temp_sum*glob_h^(calc_term - 1)/convfp(calc_term - 1)!;
        term_no := glob_max_terms;
        while 1 <= term_no do
            array_x1[term_no] := array_x1_higher_work2[1, term_no];
            ord := 1;
            while ord <= order_diff do
                array_x1_higher[ord, term_no] :=
                    array_x1_higher_work2[ord, term_no];
                ord := ord + 1
            end do;
            term_no := term_no - 1
        end do;
        display_alot(current_iter)
    end do;
    omniout_str(ALWAYS, "Finished!");
    if glob_max_iter <= glob_iter then omniout_str(ALWAYS,
        "Maximum Iterations Reached before Solution Completed!")
    end if;
    if convfloat(glob_max_sec) <=
    elapsed_time_seconds() - convfloat(glob_orig_start_sec) then
        omniout_str(ALWAYS,
        "Maximum Time Reached before Solution Completed!")
    end if;
    glob_clock_sec := elapsed_time_seconds();
    omniout_str(INFO, "diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - di\
        ff(x1,t,2) - diff (x1,t,1) + x1;");
    omniout_str(INFO,
        "diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;");
    omniout_int(INFO, "Iterations                       ", 32, glob_iter, 4,
        " ");
    prog_report(t_start, t_end);
    if glob_html_log then
        logstart(html_log_file);
        logitem_str(html_log_file, "2012-06-02T01:57:00-05:00");
        logitem_str(html_log_file, "Maple");
        logitem_str(html_log_file,
            "<a href=\"complicatedrev2.ode.txt\">complicatedrev2</a>");
        logitem_str(html_log_file, "diff (x2,t,2) = 3.0 * diff(x2,t,1) - \
            2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;");
        logitem_float(html_log_file, t_start);
        logitem_float(html_log_file, t_end);
        logitem_float(html_log_file, array_t[1]);
        logitem_float(html_log_file, glob_h);
        logitem_integer(html_log_file, Digits);
        logitem_integer(html_log_file, glob_max_terms);
        logitem_float(html_log_file, array_1st_rel_error[1]);
        logitem_float(html_log_file, array_last_rel_error[1]);
        logitem_integer(html_log_file, glob_iter);
        logitem_pole(html_log_file, array_type_pole[1]);
        if array_type_pole[1] = 1 or array_type_pole[1] = 2 then
            logitem_float(html_log_file, array_pole[1]);
            logitem_float(html_log_file, array_pole[2]);
            0
        else
            logitem_str(html_log_file, "NA");
            logitem_str(html_log_file, "NA");
            0
        end if;
        logitem_time(html_log_file, convfloat(glob_clock_sec));
        if glob_percent_done < 100.0 then
            logitem_time(html_log_file, convfloat(glob_optimal_expect_sec))
                ;
            0
        else logitem_str(html_log_file, "Done"); 0
        end if;
        log_revs(html_log_file, "<td> 076 </td>");
        logitem_str(html_log_file, "<a href=\"diffeq.complicatedrev2.mxt.\
            txt\">complicatedrev2 diffeq.mxt</a>");
        logitem_str(html_log_file, "<a href=\"results.complicatedrev2.mxt\
            .txt\">complicatedrev2 maple results</a>");
        logitem_str(html_log_file, "sub iter tot order eqs reversed");
        logend(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logitem_str(html_log_file,
            "diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;")
            ;
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logitem_float(html_log_file, array_1st_rel_error[2]);
        logitem_float(html_log_file, array_last_rel_error[2]);
        logditto(html_log_file);
        logitem_pole(html_log_file, array_type_pole[2]);
        if array_type_pole[2] = 1 or array_type_pole[2] = 2 then
            logitem_float(html_log_file, array_pole[1]);
            logitem_float(html_log_file, array_pole[2]);
            0
        else
            logitem_str(html_log_file, "NA");
            logitem_str(html_log_file, "NA");
            0
        end if;
        logditto(html_log_file);
        if glob_percent_done < 100.0 then logditto(html_log_file); 0
        else logditto(html_log_file); 0
        end if;
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logditto(html_log_file);
        logend(html_log_file)
    end if;
    if glob_html_log then fclose(html_log_file) end if
end proc

>   mainprog();
##############ECHO OF PROBLEM#################
##############temp/complicatedrev2postode.ode#################
diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;
diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;
!
#BEGIN FIRST INPUT BLOCK
Digits := 32;
max_terms := 30;
#END FIRST INPUT BLOCK
!
#BEGIN SECOND INPUT BLOCK
t_start := 0.5;
t_end := 5.0;
array_x1_init[1] := exact_soln_x1(t_start);
array_x2_init[1] := exact_soln_x2(t_start);
array_x2_init[2] := exact_soln_x2p(t_start);
glob_h := 0.00001 ;
glob_look_poles := true;
glob_max_iter := 10;
#END SECOND INPUT BLOCK
#BEGIN OVERRIDE  BLOCK
glob_h := 0.0005 ;
glob_look_poles := true;
glob_max_iter := 100;
glob_max_minutes := 15;
#END OVERRIDE BLOCK
!
#BEGIN USER DEF BLOCK
exact_soln_x1 := proc(t)
local c1,c2,c3;
c1 := 0.0001;
c2 := 0.0002;
c3 := 0.0003;
2.0 * c1 + 6.0 * c3 * exp(-t);
end;
exact_soln_x2 := proc(t)
local c1,c2,c3;
c1 := 0.0001;
c2 := 0.0002;
c3 := 0.0003;
c1 + c2 * exp(2.0 * t) + c3 * exp(-t);
end;
exact_soln_x2p := proc(t)
local c1,c2,c3;
c1 := 0.0001;
c2 := 0.0002;
c3 := 0.0003;
2.0 * c2 * exp(2.0 * t) - c3 * exp(-t);
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
t[1]                              = 0.5                                          
x2[1] (analytic)                  = 0.00082561556360559907415319735476789        
x2[1] (numeric)                   = 0.00082561556360559907415319735476789        
absolute error                    = 0                                            
relative error                    = 0                                          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012917551874827401624868391629841         
x1[1] (numeric)                   = 0.0012917551874827401624868391629841         
absolute error                    = 0                                            
relative error                    = 0                                          % 
h                                 = 0.0005                                       
t[1]                              = 0.5                                          
x2[1] (analytic)                  = 0.00082561556360559907415319735476789        
x2[1] (numeric)                   = 0.00082561556360559907415319735476789        
absolute error                    = 0                                            
relative error                    = 0                                          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012917551874827401624868391629841         
x1[1] (numeric)                   = 0.0012917551874827401624868391629841         
absolute error                    = 0                                            
relative error                    = 0                                          % 
h                                 = 0.0005                                       
 
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5005                                       
x2[1] (analytic)                  = 0.00082606853503225828165826201261726        
x2[1] (numeric)                   = 0.00082606880817575620212543439584875        
absolute error                    = 2.7314349792046717238323149e-10              
relative error                    = 3.3065476572086215318558438923639e-05      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012912094463356551708370721480129         
x1[1] (numeric)                   = 0.0012912089006070113757604410998799         
absolute error                    = 5.457286437950766310481330e-10               
relative error                    = 4.2264920330610115479922780736944e-05      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.501                                        
x2[1] (analytic)                  = 0.00082652209612631802672115172787186        
x2[1] (numeric)                   = 0.00082652318972417231696319105125235        
absolute error                    = 1.09359785429024203932338049e-09             
relative error                    = 0.00013231320244378640458086758741065      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012906639779909374464836782020351         
x1[1] (numeric)                   = 0.0012906617946801446775376559805325         
absolute error                    = 2.1833107927689460222215026e-09              
relative error                    = 0.00016916182910500942201962755189181      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5015                                       
memory used=3.8MB, alloc=3.0MB, time=0.19
x2[1] (analytic)                  = 0.00082697624740952299139053885956424        
x2[1] (numeric)                   = 0.00082697871065646199330844632017957        
absolute error                    = 2.46324693900191790746061533e-09             
relative error                    = 0.00029786187290360046524212995884707      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012901187823122199004062452509559         
x1[1] (numeric)                   = 0.0012901138416998974922926060371641         
absolute error                    = 4.9406123224081136392137918e-09              
relative error                    = 0.00038295794078381557411515578964112      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.502                                        
x2[1] (analytic)                  = 0.0008274309894041739636559251804687         
x2[1] (numeric)                   = 0.00082744273081846045769900856212361        
absolute error                    = 1.174141428649404308338165491e-08            
relative error                    = 0.0014190203698980305183227569426946       % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012895738591632036100858259251            
x1[1] (numeric)                   = 0.001288752126333438842543823738396          
absolute error                    = 8.217328297647675420021867040e-07            
relative error                    = 0.063721269156152468995328787039003        % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
Real estimate of pole used
Real estimate of pole used
Radius of convergence             = 9.350e-05                                    
Order of pole                     = 16.66                                        
t[1]                              = 0.5025                                       
x2[1] (analytic)                  = 0.00082788632263312837678584048126422        
x2[1] (numeric)                   = 0.0008744573839865111416113185814621         
absolute error                    = 4.657106135338276482547810019788e-05         
relative error                    = 5.6252966234858770409560256318109          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012890292084076577854302062195851         
x1[1] (numeric)                   = -0.0038599445593904498835847086696988        
absolute error                    = 0.0051489737677981076690149148892839         
relative error                    = 399.44585694521636740129912262042          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.503                                        
x2[1] (analytic)                  = 0.0008283422476198008492141699458837         
x2[1] (numeric)                   = 0.059782962021034549990243658790183          
absolute error                    = 0.058954619773414749141029488844299          
relative error                    = 7117.1813272615079880804788273624          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012884848299094197347162072617323         
x1[1] (numeric)                   = -6.4246475315165459556932504998907           
absolute error                    = 6.4259360163464553754279667071524            
relative error                    = 498720.34712261203640836661569779          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
Real estimate of pole used
NO POLE
Radius of convergence             = 2.205e-05                                    
Order of pole                     = 14.42                                        
t[1]                              = 0.5035                                       
x2[1] (analytic)                  = 0.00082879876488816372497515444163463        
x2[1] (numeric)                   = 12.250535434402350302753733879487            
absolute error                    = 12.249706635637462139028758725045            
relative error                    = 1478007.3468485936390527530429964          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012879407235323948305490116710912         
x1[1] (numeric)                   = -1188.7313053228318020652477351831           
absolute error                    = 1188.7325932635553344600782841948            
relative error                    = 92297150.912602215642292734543416          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.504                                        
x2[1] (analytic)                  = 0.00082925587496274761468760841422102        
x2[1] (numeric)                   = 486.18335814693720129285597512012            
absolute error                    = 486.18252889106223854524128751171            
relative error                    = 58628771.11517634460714395549421           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012873968891405564758385060019091         
x1[1] (numeric)                   = -20966.962374156391212249576867692           
absolute error                    = 20966.963661553280352806052706198            
relative error                    = 1628632462.7947840224072373730014          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=7.6MB, alloc=4.3MB, time=0.44
NO POLE
NO POLE
t[1]                              = 0.5045                                       
x2[1] (analytic)                  = 0.00082971357836864193708890062488759        
x2[1] (numeric)                   = 6121.1050834122826693902329032651            
absolute error                    = 6121.1042536987043007482958143645            
relative error                    = 737737023.14644973159632110461524          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012868533265979460697926307621308         
x1[1] (numeric)                   = -66428.603610438698538323466631831           
absolute error                    = 66428.604897292025136269536424462            
relative error                    = 5162096062.0981815462963880616311          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.505                                        
x2[1] (analytic)                  = 0.00083017187563149546111924351454314        
x2[1] (numeric)                   = 22948.649107280345698944315509859            
absolute error                    = 22948.648277108470067448854390615            
relative error                    = 2764324948.9332415030741180139393          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012863100357686729739277295072664         
x1[1] (numeric)                   = -113588.27042486727984062922878508           
absolute error                    = 113588.27171117731560930220271281            
relative error                    = 8830551620.7295430025947910128488          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5055                                       
x2[1] (analytic)                  = 0.0008306307672775168485568375279051         
x2[1] (numeric)                   = 50933.262709642450553075973279273            
absolute error                    = 50933.261879011683275559124722435            
relative error                    = 6131877590.5630148454235749348526          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012857670165169144780958885117126         
x1[1] (numeric)                   = -153650.39440598144609156108260728           
absolute error                    = 153650.39569174846260847556070317            
relative error                    = 11950096224.118466971127925375263          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.506                                        
x2[1] (analytic)                  = 0.00083109025383347519720441727943742        
x2[1] (numeric)                   = 56592.695102489072249787917404879            
absolute error                    = 56592.694271398818416312720200462            
relative error                    = 6809452283.9559426964029417289964          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012852242687069157665292585243653         
x1[1] (numeric)                   = 3308398.1055300747558694180697151            
absolute error                    = 3308398.1042448504871625023031858            
relative error                    = 257417960802.55172526598739311859          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
Real estimate of pole used
Radius of convergence             = 4.729e-05                                    
Order of pole                     = 20.41                                        
t[1]                              = 0.5065                                       
x2[1] (analytic)                  = 0.00083155033582670058462774699213345        
x2[1] (numeric)                   = -5933799.4147672048962824311500841           
absolute error                    = 5933799.4155987552321091317347118            
relative error                    = 713582709301.6038292510887585538           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012846817922029898839013501196003         
x1[1] (numeric)                   = 578986886.27216957723850965298636            
absolute error                    = 578986886.27088489544630666310246            
relative error                    = 45068505663027.283578473429178381          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=11.4MB, alloc=4.4MB, time=0.70
NO POLE
NO POLE
t[1]                              = 0.507                                        
x2[1] (analytic)                  = 0.00083201101378508461244661319002326        
x2[1] (numeric)                   = -756348471.4459393420519836229058            
absolute error                    = 756348471.44677135306576870751825            
relative error                    = 90906064813481.24011363086535145           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001284139586869517701405294158948          
x1[1] (numeric)                   = 68130995070.941208206841239093023            
absolute error                    = 68130995070.939924067254369575322            
relative error                    = 5305575481636698.4961870090743643          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5075                                       
x2[1] (analytic)                  = 0.0008324722882370809511788631756612         
x2[1] (numeric)                   = -85275702896.512243310040957766996           
absolute error                    = 85275702896.513075782329194847947            
relative error                    = 10243668660382757.231996008819952          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012835976525709478828490588830272         
x1[1] (numeric)                   = 7612932293913.5736241970936615058            
absolute error                    = 7612932293913.5723405994410905579            
relative error                    = 593093348111493618.26958760451974          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
Real estimate of pole used
NO POLE
Radius of convergence             = 2.549e-05                                    
Order of pole                     = 23.88                                        
t[1]                              = 0.508                                        
x2[1] (analytic)                  = 0.00083293415971170588563803837477598        
x2[1] (numeric)                   = -3146036146467.2176305864923922802           
absolute error                    = 3146036146467.2184635206521039861            
relative error                    = 377705261548658360.00781712507934          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012830559891717968507676151575396         
x1[1] (numeric)                   = 137224107980662.0887993177173033             
absolute error                    = 137224107980662.0875162617281315             
relative error                    = 10695098977655623123.876783750429          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5085                                       
x2[1] (analytic)                  = 0.00083339662873853886088515218174166        
x2[1] (numeric)                   = -41380773558876.054631369997463893           
absolute error                    = 41380773558876.055464766626202432            
relative error                    = 4965315689062911535.4915564301159          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012825145965366487525520414013697         
x1[1] (numeric)                   = 586100669627935.4391850790081243             
absolute error                    = 586100669627935.43790256441158765            
relative error                    = 45699337162373356341.601925902144          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.509                                        
x2[1] (analytic)                  = 0.00083385969584772302873516249155556        
x2[1] (numeric)                   = -194057294255787.51901174836184356           
absolute error                    = 194057294255787.51984560805769128            
relative error                    = 23272175789537822233.987075783836          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001281973474530155426595559729063          
x1[1] (numeric)                   = 1422756367450799.7969773923155038            
absolute error                    = 1422756367450799.7956954188409736            
relative error                    = 110981732127666794476.18941760482          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5095                                       
x2[1] (analytic)                  = 0.00083432336156996579481868965658664        
x2[1] (numeric)                   = -550957019693829.32353164639469859           
absolute error                    = 550957019693829.32436596975626856            
relative error                    = 66036388895677163656.353917349523          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012814326230170363684564948441937         
x1[1] (numeric)                   = 2279352172704739.6546436900228676            
absolute error                    = 2279352172704739.6533622573998506            
relative error                    = 177875303918685716275.35036533714          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=15.2MB, alloc=4.4MB, time=0.94
NO POLE
Real estimate of pole used
Radius of convergence             = 5.333e-05                                    
Order of pole                     = 21.47                                        
t[1]                              = 0.51                                         
x2[1] (analytic)                  = 0.00083478762643653936619953115948893        
x2[1] (numeric)                   = -554275101471844.73083298316055781           
absolute error                    = 554275101471844.73166777078699435            
relative error                    = 66397139094871427992.201448278124          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012808920418620786970381472243591         
x1[1] (numeric)                   = -58855001148210152.825999892938257           
absolute error                    = 58855001148210152.827280784980119            
relative error                    = 4594844781973235385254.503328922           % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5105                                       
x2[1] (analytic)                  = 0.0008352524909792812995485248473563         
x2[1] (numeric)                   = 81061054094958606.101740552251671            
absolute error                    = 81061054094958606.100905299760692            
relative error                    = 9704976036637686724938.3285629275          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012803517309301371207855721427719         
x1[1] (numeric)                   = -7523497983081997155.8942958469624           
absolute error                    = 7523497983081997155.8955761986933            
relative error                    = 587611810202841806843099.4793732           % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.511                                        
x2[1] (analytic)                  = 0.00083571795573059504987431312643056        
x2[1] (numeric)                   = 7308788831680659223.9486609589077            
absolute error                    = 7308788831680659223.947825240952             
relative error                    = 874552088005722571846092.4525024           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012798116900861339038992560756415         
x1[1] (numeric)                   = -604388859314194886435.80588701698           
absolute error                    = 604388859314194886435.80716682867            
relative error                    = 47224827214503588347929289.204408          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5115                                       
x2[1] (analytic)                  = 0.00083618402122345051981156107146395        
x2[1] (numeric)                   = 592012200779585371123.08145403295            
absolute error                    = 592012200779585371123.08061784893            
relative error                    = 70799272140286932067888406.645798          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012792719191950588325656820487663         
x1[1] (numeric)                   = -49086178687196131260809.834307783           
absolute error                    = 49086178687196131260809.835587055            
relative error                    = 3837040268818067076431950175.4148          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.512                                        
x2[1] (analytic)                  = 0.00083665068799138460946718195917937        
x2[1] (numeric)                   = 20461746156414609650208.231577732            
absolute error                    = 20461746156414609650208.230741081            
relative error                    = 2445673738168887275678670108.8707          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012787324181219691812047754809758         
x1[1] (numeric)                   = -899992468584022766216067.80542636           
absolute error                    = 899992468584022766216067.80670509            
relative error                    = 70381610400228305801204317225.154          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=19.0MB, alloc=4.5MB, time=1.20
NO POLE
NO POLE
t[1]                              = 0.5125                                       
x2[1] (analytic)                  = 0.00083711795656850176682512429116968        
x2[1] (numeric)                   = 279400708975253306814737.44200997            
absolute error                    = 279400708975253306814737.44117285            
relative error                    = 33376504085585196954457132956.156          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012781931867319896787342220862856         
x1[1] (numeric)                   = -4757239618250307621655666.274902            
absolute error                    = 4757239618250307621655666.2761802            
relative error                    = 372184711014877366996069446685.45          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.513                                        
x2[1] (analytic)                  = 0.00083758582748947453871027492802935        
x2[1] (numeric)                   = 1548433817635976422053380.7654449            
absolute error                    = 1548433817635976422053380.7646073            
relative error                    = 184868674566420442785213813547.66          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012776542248903124748506494008434         
x1[1] (numeric)                   = -14661506534778281352702453.378855           
absolute error                    = 14661506534778281352702453.380133            
relative error                    = 1147533209623830902340243349579.9          % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5135                                       
x2[1] (analytic)                  = 0.00083805430128954412231203351352064        
x2[1] (numeric)                   = 5276402104070690228440474.2746916            
absolute error                    = 5276402104070690228440474.2738535            
relative error                    = 629601458515480634866172482463.9           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012771155324621971063276635049614         
x1[1] (numeric)                   = -27364153443668912474690175.768969           
absolute error                    = 27364153443668912474690175.770246            
relative error                    = 2142652935315301811631095808700            % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
Real estimate of pole used
Real estimate of pole used
Radius of convergence             = 5.332e-05                                    
Order of pole                     = 21.92                                        
t[1]                              = 0.514                                        
x2[1] (analytic)                  = 0.0008385233785045209172681139251402         
x2[1] (numeric)                   = 5291896800690995634635455.754443             
absolute error                    = 5291896800690995634635455.7536045            
relative error                    = 631097109078690315424825029986.91          % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012765771093129704633307325147448         
x1[1] (numeric)                   = 714569365042244527646916069.70586            
absolute error                    = 714569365042244527646916069.70458            
relative error                    = 55975417374263602320270958670429           % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5145                                       
x2[1] (analytic)                  = 0.00083899305967078507830912904557372        
x2[1] (numeric)                   = -836162296106235908048752810.74388           
absolute error                    = 836162296106235908048752810.74472            
relative error                    = 99662599883047907238805411092574           % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012760389553080267557489084220364         
x1[1] (numeric)                   = 74687313614250507856546908327.936            
absolute error                    = 74687313614250507856546908327.935            
relative error                    = 5.8530590546290587138466544132853e+33      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.515                                        
memory used=22.8MB, alloc=4.5MB, time=1.46
x2[1] (analytic)                  = 0.00083946334532528706846451570820467        
x2[1] (numeric)                   = -62954189462008643470977760944.527           
absolute error                    = 62954189462008643470977760944.528            
relative error                    = 7.4993375008666123903419132858328e+33      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012755010703128274795433788656077         
x1[1] (numeric)                   = 4926976680177882120610887768682.3            
absolute error                    = 4926976680177882120610887768682.3            
relative error                    = 3.8627773781244254145353578010792e+35      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5155                                       
x2[1] (analytic)                  = 0.00083993423600554821283035722907962        
x2[1] (numeric)                   = -4099102311015173469252734329775.6           
absolute error                    = 4099102311015173469252734329775.6            
relative error                    = 4.8802657818892581919069470969660e+35      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012749634541929013831128404207343         
x1[1] (numeric)                   = 3.1852853053114354017456658763814e+32        
absolute error                    = 3.1852853053114354017456658763814e+32        
relative error                    = 2.4983345952671543813835258487911e+37      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.516                                        
x2[1] (analytic)                  = 0.00084040573224966125289966149752755        
x2[1] (numeric)                   = -1.3370668329161978235746437996079e+32       
absolute error                    = 1.3370668329161978235746437996079e+32        
relative error                    = 1.5909777642009137577238007860667e+37      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012744261068138444336756849984992         
x1[1] (numeric)                   = 5.9159174700351588973659366980111e+33        
absolute error                    = 5.9159174700351588973659366980111e+33        
relative error                    = 4.6420247030448644401889309458430e+38      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
Real estimate of pole used
NO POLE
Radius of convergence             = 1.801e-05                                    
Order of pole                     = 10.13                                        
t[1]                              = 0.5165                                       
x2[1] (analytic)                  = 0.0008408778345962909014556531579845         
x2[1] (numeric)                   = -1.8851446944072360169524776306336e+33       
absolute error                    = 1.8851446944072360169524776306336e+33        
relative error                    = 2.2418770204738506015386433224864e+38      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012738890280413197836689909503695         
x1[1] (numeric)                   = 3.6785761194052085664145698299155e+34        
absolute error                    = 3.6785761194052085664145698299155e+34        
relative error                    = 2.8876739169825791959472484950858e+39      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.517                                        
x2[1] (analytic)                  = 0.0008413505435846743980286389764889         
x2[1] (numeric)                   = -1.1908932566742642914975211137770e+34       
absolute error                    = 1.1908932566742642914975211137770e+34        
relative error                    = 1.4154543142033538717329088078036e+39      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012733522177410577371643104777951         
x1[1] (numeric)                   = 1.3588734170389274326211836845516e+35        
absolute error                    = 1.3588734170389274326211836845516e+35        
relative error                    = 1.0671622494596077581961530030159e+40      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5175                                       
x2[1] (analytic)                  = 0.00084182385975462206491700604678574        
x2[1] (numeric)                   = -4.6872897471036061472298317002385e+34       
absolute error                    = 4.6872897471036061472298317002385e+34        
relative error                    = 5.5680172197422329121399977961422e+39      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012728156757788557163002449507755         
x1[1] (numeric)                   = 2.9033047627847838374741493136819e+35        
absolute error                    = 2.9033047627847838374741493136819e+35        
relative error                    = 2.2810095900242637091565307231455e+40      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=26.7MB, alloc=4.5MB, time=1.71
NO POLE
Real estimate of pole used
Radius of convergence             = 7.258e-05                                    
Order of pole                     = 43.12                                        
t[1]                              = 0.518                                        
x2[1] (analytic)                  = 0.00084229778364651786377291305301299        
x2[1] (numeric)                   = -4.9834215006986637303559570116782e+34       
absolute error                    = 4.9834215006986637303559570116782e+34        
relative error                    = 5.9164604222561112654168636576765e+39      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012722794020205782277317997435378         
x1[1] (numeric)                   = -7.3057278257236270482428407497499e+36       
absolute error                    = 7.3057278257236270482428407497499e+36        
relative error                    = 5.7422354037336383918091655905008e+41      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5185                                       
x2[1] (analytic)                  = 0.00084277231580131995275323536853887        
x2[1] (numeric)                   = 7.6384919718977554130079024440086e+36        
absolute error                    = 7.6384919718977554130079024440086e+36        
relative error                    = 9.0635297679836198315908441756559e+41      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012717433963321568290965101996664         
x1[1] (numeric)                   = -6.6159422813258487498189142950986e+38       
absolute error                    = 6.6159422813258487498189142950986e+38        
relative error                    = 5.2022619503328499425263994247725e+43      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.519                                        
x2[1] (analytic)                  = 0.00084324745676056124423632533367627        
x2[1] (numeric)                   = 5.0957503998328660808805921183275e+38        
absolute error                    = 5.0957503998328660808805921183275e+38        
relative error                    = 6.0430071374407906348900147035228e+43      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012712076585795900954973303432135         
x1[1] (numeric)                   = -3.8260393589899593535923452275797e+40       
absolute error                    = 3.8260393589899593535923452275797e+40        
relative error                    = 3.0097673917926696312888959686587e+45      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5195                                       
x2[1] (analytic)                  = 0.00084372320706634996310514961872029        
x2[1] (numeric)                   = 2.8322423541322644222869281026403e+40        
absolute error                    = 2.8322423541322644222869281026403e+40        
relative error                    = 3.3568382739880453787943125341810e+45      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001270672188628943586002275956513          
x1[1] (numeric)                   = -2.0790681090873844529083610966285e+42       
absolute error                    = 2.0790681090873844529083610966285e+42        
relative error                    = 1.6361954937651549446354451838473e+47      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.52                                         
x2[1] (analytic)                  = 0.00084419956726137020559736614303792        
x2[1] (numeric)                   = 8.7749337069416680776346683948237e+41        
absolute error                    = 8.7749337069416680776346683948237e+41        
relative error                    = 1.0394383090491310370709025152210e+47      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.00127013698634634981016081364961           
x1[1] (numeric)                   = -3.8977812849831450838245346885918e+43       
absolute error                    = 3.8977812849831450838245346885918e+43        
relative error                    = 3.0687881125290456691152036772173e+48      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
memory used=30.5MB, alloc=4.5MB, time=1.97
t[1]                              = 0.5205                                       
x2[1] (analytic)                  = 0.00084467653788888249872290358578525        
x2[1] (numeric)                   = 1.2715230929344517829151266531670e+43        
absolute error                    = 1.2715230929344517829151266531670e+43        
relative error                    = 1.5053372929149845777805519098649e+48      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012696020515980081945369875504003         
x1[1] (numeric)                   = -2.7568801905091419317538221145101e+44       
absolute error                    = 2.7568801905091419317538221145101e+44        
relative error                    = 2.1714522176765101268237905596799e+49      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.521                                        
x2[1] (analytic)                  = 0.00084515411949272436024960708923766        
x2[1] (numeric)                   = 8.9310296843995521364723367631079e+43        
absolute error                    = 8.9310296843995521364723367631079e+43        
relative error                    = 1.0567338522540842072630746025400e+49      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012690673842501850492592752487639         
x1[1] (numeric)                   = -1.1775912250280471228448082665905e+45       
absolute error                    = 1.1775912250280471228448082665905e+45        
relative error                    = 9.2791859568892345221109034444457e+49      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5215                                       
x2[1] (analytic)                  = 0.0008456323126173108592575143216941         
x2[1] (numeric)                   = 3.9562973702372219169960512402205e+44        
absolute error                    = 3.9562973702372219169960512402205e+44        
relative error                    = 4.6785077996749114846214023906954e+49      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012685329841692135345871646321545         
x1[1] (numeric)                   = -2.8344051239035481852685984495256e+45       
absolute error                    = 2.8344051239035481852685984495256e+45        
relative error                    = 2.2343960774184001252118289553499e+50      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
Real estimate of pole used
Radius of convergence             = 3.543e-05                                    
Order of pole                     = 8.78                                         
t[1]                              = 0.522                                        
x2[1] (analytic)                  = 0.00084611111780763517726232663345645        
x2[1] (numeric)                   = 4.6020853381293357319506365201739e+44        
absolute error                    = 4.6020853381293357319506365201739e+44        
relative error                    = 5.4391027859955715358306637859048e+49      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012679988512214936274944432542899         
x1[1] (numeric)                   = 6.7590250331348539794155040409414e+46        
absolute error                    = 6.7590250331348539794155040409414e+46        
relative error                    = 5.3304662118768668205286356925759e+51      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5225                                       
x2[1] (analytic)                  = 0.00084659053560926916990864060649109        
x2[1] (numeric)                   = -6.5102570848854815947616554725482e+46       
absolute error                    = 6.5102570848854815947616554725482e+46        
relative error                    = 7.6899714927715546060760300489008e+51      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012674649852734920882691918827657         
x1[1] (numeric)                   = 5.4997642331813822428683447572052e+48        
absolute error                    = 5.4997642331813822428683447572052e+48        
relative error                    = 4.3391843538736098911185677402355e+53      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.523                                        
x2[1] (analytic)                  = 0.00084707056656836392923350586605222        
x2[1] (numeric)                   = -3.9682146148105569787610423878973e+48       
absolute error                    = 3.9682146148105569787610423878973e+48        
relative error                    = 4.6846328646343032497732607916937e+53      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012669313861917424271304738755899         
x1[1] (numeric)                   = 2.8802170446356687082830026452073e+50        
absolute error                    = 2.8802170446356687082830026452073e+50        
relative error                    = 2.2733804498231644748620511403120e+55      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=34.3MB, alloc=4.6MB, time=2.23
NO POLE
NO POLE
t[1]                              = 0.5235                                       
x2[1] (analytic)                  = 0.00084755121123165034650087559078626        
x2[1] (numeric)                   = -1.9536162854927207016861231474145e+50       
absolute error                    = 1.9536162854927207016861231474145e+50        
relative error                    = 2.3050126760526376223768018922583e+55      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012663980538428448708617120408105         
x1[1] (numeric)                   = 1.3641930707222601989513637317654e+52        
absolute error                    = 1.3641930707222601989513637317654e+52        
relative error                    = 1.0772229683886985139501955794682e+57      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.524                                        
x2[1] (analytic)                  = 0.00084803247014643967560751672664236        
x2[1] (numeric)                   = -5.7818437715425959726616451010250e+51       
absolute error                    = 5.7818437715425959726616451010250e+51        
relative error                    = 6.8179509335817972272216898671072e+56      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012658649880934663294607446375807         
x1[1] (numeric)                   = 2.5741889659579017990131962558355e+53        
absolute error                    = 2.5741889659579017990131962558355e+53        
relative error                    = 2.0335414836260833060756944694720e+58      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5245                                       
x2[1] (analytic)                  = 0.00084851434386062409706094747929037        
x2[1] (numeric)                   = -8.5762731665872697635494299018692e+52       
absolute error                    = 8.5762731665872697635494299018692e+52        
relative error                    = 1.0107399160238589493866121969795e+58      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012653321888103403628065521811756         
x1[1] (numeric)                   = 2.0220709409852608884535590087026e+54        
absolute error                    = 2.0220709409852608884535590087026e+54        
relative error                    = 1.5980554030530140069104198447688e+59      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.525                                        
x2[1] (analytic)                  = 0.00084899683292267728252997022968994        
x2[1] (numeric)                   = -6.5769845612421607330144485880151e+53       
absolute error                    = 6.5769845612421607330144485880151e+53        
relative error                    = 7.7467716087948730492215423232060e+58      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012647996558602671473426467186411         
x1[1] (numeric)                   = 9.7418692849074786890731007056668e+54        
absolute error                    = 9.7418692849074786890731007056668e+54        
relative error                    = 7.7023022893546259471736332545176e+59      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5255                                       
x2[1] (analytic)                  = 0.00084947993788165495996836858796728        
x2[1] (numeric)                   = -3.2178622558918934564850848925509e+54       
absolute error                    = 3.2178622558918934564850848925509e+54        
relative error                    = 3.7880379658126652088051129217907e+59      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012642673891101134427771152459227         
x1[1] (numeric)                   = 2.6052424819187167451518847139804e+55        
absolute error                    = 2.6052424819187167451518847139804e+55        
relative error                    = 2.0606736394209159469786813192892e+60      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
memory used=38.1MB, alloc=4.6MB, time=2.48
t[1]                              = 0.526                                        
x2[1] (analytic)                  = 0.00084996365928719547931233787183942        
x2[1] (numeric)                   = -4.1466577659630543101460422563927e+54       
absolute error                    = 4.1466577659630543101460422563927e+54        
relative error                    = 4.8786294809834145838083512278222e+59      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012637353884268125587993089414852         
x1[1] (numeric)                   = -5.8550734794443453447665035962124e+56       
absolute error                    = 5.8550734794443453447665035962124e+56        
relative error                    = 4.6331483102116465058493529802774e+61      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5265                                       
x2[1] (analytic)                  = 0.00085044799768952037875221886747711        
x2[1] (numeric)                   = 5.3023314876231345185798858256115e+56        
absolute error                    = 5.3023314876231345185798858256115e+56        
relative error                    = 6.2347509806929989876226154954583e+61      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012632036536773643218131698955945         
x1[1] (numeric)                   = -4.3896624922370061616788964674939e+58       
absolute error                    = 4.3896624922370061616788964674939e+58        
relative error                    = 3.4750235874144904535873056314479e+63      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.527                                        
x2[1] (analytic)                  = 0.00085093295363943495157910530292247        
x2[1] (numeric)                   = 3.0102498405732178895066990508395e+58        
absolute error                    = 3.0102498405732178895066990508395e+58        
relative error                    = 3.5375875710282438107898839688442e+63      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012626721847288350416871870185942         
x1[1] (numeric)                   = -2.1226185436535286795710480711492e+60       
absolute error                    = 2.1226185436535286795710480711492e+60        
relative error                    = 1.6810527461720963445539464058303e+65      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5275                                       
x2[1] (analytic)                  = 0.00085141852768832881360689603697165        
x2[1] (numeric)                   = 1.3457428239652444297322673495221e+60        
absolute error                    = 1.3457428239652444297322673495221e+60        
relative error                    = 1.5805890759965567747758645923270e+65      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012621409814483574785209728156648         
x1[1] (numeric)                   = -8.9936619926665332875947527242757e+61       
absolute error                    = 8.9936619926665332875947527242757e+61        
relative error                    = 7.1257190162274462085864780016148e+66      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.528                                        
x2[1] (analytic)                  = 0.00085190472038817647117036353980059        
x2[1] (numeric)                   = 3.8236401570664862939494517834309e+61        
absolute error                    = 3.8236401570664862939494517834309e+61        
relative error                    = 4.4883424936584661056427984296322e+66      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012616100437031308094284527197097         
x1[1] (numeric)                   = -1.7040745807641025905919017159390e+63       
absolute error                    = 1.7040745807641025905919017159390e+63        
relative error                    = 1.3507141840455163791506736806622e+68      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5285                                       
x2[1] (analytic)                  = 0.00085239153229153788969981081555131        
x2[1] (numeric)                   = 5.7858544197164997134759601191736e+62        
absolute error                    = 5.7858544197164997134759601191736e+62        
relative error                    = 6.7877896489211038331892787622080e+67      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012610793713604205953376586781657         
x1[1] (numeric)                   = -1.4602799311146611906120399829122e+64       
absolute error                    = 1.4602799311146611906120399829122e+64        
relative error                    = 1.1579603665543652969017619240847e+69      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=41.9MB, alloc=4.6MB, time=2.75
NO POLE
NO POLE
t[1]                              = 0.529                                        
x2[1] (analytic)                  = 0.00085287896395155906287288949160932        
x2[1] (numeric)                   = 4.7778719982116803238258118408903e+63        
absolute error                    = 4.7778719982116803238258118408903e+63        
relative error                    = 5.6020516393965708774037103354951e+68      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001260548964287558747807118693686          
x1[1] (numeric)                   = -7.7903023299980035805929953441631e+64       
absolute error                    = 7.7903023299980035805929953441631e+64        
relative error                    = 6.1800870499314182032644362262892e+69      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5295                                       
x2[1] (analytic)                  = 0.00085336701592197258234415237438934        
x2[1] (numeric)                   = 2.5449983158741095185393752256760e+64        
absolute error                    = 2.5449983158741095185393752256760e+64        
relative error                    = 2.9823021846286250846556503795493e+69      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012600188223519434958588340227923         
x1[1] (numeric)                   = -2.2876025692842826287855979704150e+65       
absolute error                    = 2.2876025692842826287855979704150e+65        
relative error                    = 1.8155304735958289415696025016653e+70      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.53                                         
x2[1] (analytic)                  = 0.00085385568875709820805291434710783        
x2[1] (numeric)                   = 3.6397881629378252246717301092594e+64        
absolute error                    = 3.6397881629378252246717301092594e+64        
relative error                    = 4.2627673632250742734732238783755e+69      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012594889454210393528278357407412         
x1[1] (numeric)                   = 4.8406433286310945091296409934750e+66        
absolute error                    = 4.8406433286310945091296409934750e+66        
relative error                    = 3.8433392736233166609219229311853e+71      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5305                                       
x2[1] (analytic)                  = 0.00085434498301184343910999606125632        
x2[1] (numeric)                   = -4.1814595462844906660750998768290e+66       
absolute error                    = 4.1814595462844906660750998768290e+66        
relative error                    = 4.8943455271938136761323948372265e+71      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012589593333623770832283123849924         
x1[1] (numeric)                   = 3.4057734693877148243242735026006e+68        
absolute error                    = 3.4057734693877148243242735026006e+68        
relative error                    = 2.7052291357908395446417019844667e+73      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.531                                        
x2[1] (analytic)                  = 0.00085483489924170408526392545030159        
x2[1] (numeric)                   = -2.2410078306664710014207615837367e+68       
absolute error                    = 2.2410078306664710014207615837367e+68        
relative error                    = 2.6215680158290160100232936717172e+73      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012584299860435536696363003938124         
x1[1] (numeric)                   = 1.5406742374656814501773825010100e+70        
absolute error                    = 1.5406742374656814501773825010100e+70        
relative error                    = 1.2242828401677639615743582191000e+75      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
memory used=45.7MB, alloc=4.6MB, time=3.02
t[1]                              = 0.5315                                       
x2[1] (analytic)                  = 0.00085532543800276483894717267152565        
x2[1] (numeric)                   = -9.2601150290851335853838578638542e+69       
absolute error                    = 9.2601150290851335853838578638542e+69        
relative error                    = 1.0826423040460536693757288907153e+75      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012579009033322322795889290606847         
x1[1] (numeric)                   = 5.9543276975119612777441525612008e+71        
absolute error                    = 5.9543276975119612777441525612008e+71        
relative error                    = 4.7335427470786429512170988063459e+76      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.532                                        
x2[1] (analytic)                  = 0.00085581659985169984790299465988337        
x2[1] (numeric)                   = -2.5371071000571595013835976771490e+71       
absolute error                    = 2.5371071000571595013835976771490e+71        
relative error                    = 2.9645453248941444042612230280920e+76      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001257372085096142232500211729337          
x1[1] (numeric)                   = 1.1306945667854910530993225900770e+73        
absolute error                    = 1.1306945667854910530993225900770e+73        
relative error                    = 8.9925216265560320802013778678695e+77      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5325                                       
x2[1] (analytic)                  = 0.00085630838534577328839346605629603        
x2[1] (numeric)                   = -3.9048552189800486010289878075040e+72       
absolute error                    = 3.9048552189800486010289878075040e+72        
relative error                    = 4.5601039132686835426960839212856e+77      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012568435312030789665933749583355         
x1[1] (numeric)                   = 1.0424862108309911157147554806003e+74        
absolute error                    = 1.0424862108309911157147554806003e+74        
relative error                    = 8.2944788666979079677245486571333e+78      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.533                                        
x2[1] (analytic)                  = 0.0008568007950428399389892738519192         
x2[1] (numeric)                   = -3.4347019024159470844200763324768e+73       
absolute error                    = 3.4347019024159470844200763324768e+73        
relative error                    = 4.0087520019682199212159092110852e+78      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012563152415209040058497173883259         
x1[1] (numeric)                   = 6.0711622548978015858515886016034e+74        
absolute error                    = 6.0711622548978015858515886016034e+74        
relative error                    = 4.8325150043933321682390043147567e+79      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5335                                       
x2[1] (analytic)                  = 0.0008572938295013457549418536696203         
x2[1] (numeric)                   = -1.9693736640077246249682113171473e+74       
absolute error                    = 1.9693736640077246249682113171473e+74        
relative error                    = 2.2971979923770501831397511223897e+79      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012557872159175449269739900491366         
x1[1] (numeric)                   = 1.9380664265387194731386839135260e+75        
absolute error                    = 1.9380664265387194731386839135260e+75        
relative error                    = 1.5433079760432702517692737667735e+80      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.534                                        
x2[1] (analytic)                  = 0.00085778748928032844313844618417794        
x2[1] (numeric)                   = -3.1150226663162210397833395583088e+74       
absolute error                    = 3.1150226663162210397833395583088e+74        
relative error                    = 3.6314619940769723125063026324025e+79      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012552594542609953263762898480893         
x1[1] (numeric)                   = -3.8648847354589006474058191821004e+76       
absolute error                    = 3.8648847354589006474058191821004e+76        
relative error                    = 3.0789528988126691541197369581591e+81      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=49.5MB, alloc=4.6MB, time=3.29
NO POLE
NO POLE
t[1]                              = 0.5345                                       
x2[1] (analytic)                  = 0.00085828177493941803764065276357102        
x2[1] (numeric)                   = 3.2187651452320364096298246379425e+76        
absolute error                    = 3.2187651452320364096298246379425e+76        
relative error                    = 3.7502429146409796301721694333472e+81      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012547319564193147871704579849903         
x1[1] (numeric)                   = -2.5878102750052402051173757936756e+78       
absolute error                    = 2.5878102750052402051173757936756e+78        
relative error                    = 2.0624407163344999839120125378410e+83      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.535                                        
x2[1] (analytic)                  = 0.00085877668703883747580706999516187        
x2[1] (numeric)                   = 1.6450284472579534721678710435451e+78        
absolute error                    = 1.6450284472579534721678710435451e+78        
relative error                    = 1.9155485612100208319518682063462e+83      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012542047222606288461889750434006         
x1[1] (numeric)                   = -1.1057559194454472709834586764530e+80       
absolute error                    = 1.1057559194454472709834586764530e+80        
relative error                    = 8.8163909752499456005112226119664e+84      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5355                                       
x2[1] (analytic)                  = 0.00085927222613940317500058334259466        
x2[1] (numeric)                   = 6.3664366858843034683120597004574e+79        
absolute error                    = 6.3664366858843034683120597004574e+79        
relative error                    = 7.4091032995304225560413036572542e+84      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012536777516531289610143445119101         
x1[1] (numeric)                   = -3.9569751958655743475225293170394e+81       
absolute error                    = 3.9569751958655743475225293170394e+81        
relative error                    = 3.1562937051788737688166372194128e+86      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.536                                        
x2[1] (analytic)                  = 0.00085976839280252560988090076182799        
x2[1] (numeric)                   = 1.6885831561343867069221702756268e+81        
absolute error                    = 1.6885831561343867069221702756268e+81        
relative error                    = 1.9639977117910008553354724314337e+86      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012531510444650724770269564932605         
x1[1] (numeric)                   = -7.5193914246894730314170610720019e+82       
absolute error                    = 7.5193914246894730314170610720019e+82        
relative error                    = 6.0003871503767889900673513202654e+87      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5365                                       
x2[1] (analytic)                  = 0.00086026518759020989028290768790106        
x2[1] (numeric)                   = 2.6367231330072136386158506287184e+82        
absolute error                    = 2.6367231330072136386158506287184e+82        
relative error                    = 3.0650120114627086910290734937437e+87      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012526246005647825944694233632835         
x1[1] (numeric)                   = -7.3773588475164289122901889554876e+83       
absolute error                    = 7.3773588475164289122901889554876e+83        
relative error                    = 5.8895209659702755166611227995351e+88      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.537                                        
x2[1] (analytic)                  = 0.00086076261106505633968142538779503        
x2[1] (numeric)                   = 2.4488755238658301707399925808950e+83        
absolute error                    = 2.4488755238658301707399925808950e+83        
memory used=53.4MB, alloc=4.6MB, time=3.56
relative error                    = 2.8450068490262809972048810668594e+88      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012520984198206483355273791457368         
x1[1] (numeric)                   = -4.6370038453625398071217473253005e+84       
absolute error                    = 4.6370038453625398071217473253005e+84        
relative error                    = 3.7033860693049578824932215254428e+89      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5375                                       
x2[1] (analytic)                  = 0.00086126066379026107424295525909657        
x2[1] (numeric)                   = 1.4976162292810249762411604921691e+84        
absolute error                    = 1.4976162292810249762411604921691e+84        
relative error                    = 1.7388652381850016818303807727914e+89      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012515725021011245114267343732391         
x1[1] (numeric)                   = -1.5954756740766820217259699210064e+85       
absolute error                    = 1.5954756740766820217259699210064e+85        
relative error                    = 1.2747768678188575557164847381710e+90      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.538                                        
x2[1] (analytic)                  = 0.0008617593463296165824649922390997         
x2[1] (numeric)                   = 2.6045792120892561092212104361514e+84        
absolute error                    = 2.6045792120892561092212104361514e+84        
relative error                    = 3.0223974050094303308326881736316e+89      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012510468472747316895473782086164         
x1[1] (numeric)                   = 3.0036626917051669476113800109391e+86        
absolute error                    = 3.0036626917051669476113800109391e+86        
relative error                    = 2.4009194365888988123001699722548e+91      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5385                                       
x2[1] (analytic)                  = 0.00086225865924751230540349107449532        
x2[1] (numeric)                   = -2.4315125609848172647057652762615e+86       
absolute error                    = 2.4315125609848172647057652762615e+86        
relative error                    = 2.8199340591218683077866164426349e+91      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012505214552100561605533196050853         
x1[1] (numeric)                   = 1.9350260241891170759663433646635e+88        
absolute error                    = 1.9350260241891170759663433646635e+88        
relative error                    = 1.5473753098175203714926039708443e+93      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.539                                        
x2[1] (analytic)                  = 0.00086275860310893521748906978789598        
x2[1] (numeric)                   = -1.1944907532919001057096962627641e+88       
absolute error                    = 1.1944907532919001057096962627641e+88        
relative error                    = 1.3845017006930722101773228427050e+93      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012499963257757499055392592878095         
x1[1] (numeric)                   = 7.8685800602153730694971170446814e+89        
absolute error                    = 7.8685800602153730694971170446814e+89        
relative error                    = 6.2948825512203954079682304597752e+94      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5395                                       
x2[1] (analytic)                  = 0.00086325917847947040793253526412643        
x2[1] (numeric)                   = -4.3739890075115528632211255047079e+89       
absolute error                    = 4.3739890075115528632211255047079e+89        
relative error                    = 5.0668317424852875189775117910290e+94      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.00124947145884053056319358434347           
x1[1] (numeric)                   = 2.6384287936043439330573227838038e+91        
absolute error                    = 2.6384287936043439330573227838038e+91        
relative error                    = 2.1116359040747687230047665361107e+96      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=57.2MB, alloc=4.6MB, time=3.83
NO POLE
NO POLE
t[1]                              = 0.54                                         
x2[1] (analytic)                  = 0.0008637603859253016627203164664802         
x2[1] (numeric)                   = -1.1269565865562991642400990241165e+91       
absolute error                    = 1.1269565865562991642400990241165e+91        
relative error                    = 1.3047097377000556405221681640406e+96      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012489468542731813969777772086            
x1[1] (numeric)                   = 5.0114622574885485332027782653281e+92        
absolute error                    = 5.0114622574885485332027782653281e+92        
relative error                    = 4.0125504462757503345657696122094e+97      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5405                                       
x2[1] (analytic)                  = 0.00086426222601321204720039138099847        
x2[1] (numeric)                   = -1.7814916191887884299708536481978e+92       
absolute error                    = 1.7814916191887884299708536481978e+92        
relative error                    = 2.0612859911819802502416110375889e+97      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012484225119425512623222308515348         
x1[1] (numeric)                   = 5.1855151659346459785862752615530e+93        
absolute error                    = 5.1855151659346459785862752615530e+93        
relative error                    = 4.1536540044171104773303296674755e+98      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.541                                        
x2[1] (analytic)                  = 0.00086476469931058448925929437526969        
x2[1] (numeric)                   = -1.7345566330588627165293900930313e+93       
absolute error                    = 1.7345566330588627165293900930313e+93        
relative error                    = 2.0058134131072898733925081621187e+98      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012478984317175545738384619469313         
x1[1] (numeric)                   = 3.4850494953745665367841298940946e+94        
absolute error                    = 3.4850494953745665367841298940946e+94        
relative error                    = 2.7927348947605390807085880530793e+99      % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5415                                       
x2[1] (analytic)                  = 0.00086526780638540236309079124728038        
x2[1] (numeric)                   = -1.1228379951103558860832662867410e+94       
absolute error                    = 1.1228379951103558860832662867410e+94        
relative error                    = 1.2976768427348932988788922162689e+99      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012473746134671712725477138459096         
x1[1] (numeric)                   = 1.2829902114785363827225976030786e+95        
absolute error                    = 1.2829902114785363827225976030786e+95        
relative error                    = 1.0285524473777519688859241955734e+100     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.542                                        
x2[1] (analytic)                  = 0.00086577154780625007355680982946525        
x2[1] (numeric)                   = -2.1328424442291213280370806176556e+94       
absolute error                    = 2.1328424442291213280370806176556e+94        
relative error                    = 2.4635164433775403505556970824519e+99      % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001246851057060446793125941148968          
x1[1] (numeric)                   = -2.2847646422684486692220104155585e+96       
absolute error                    = 2.2847646422684486692220104155585e+96        
relative error                    = 1.8324278824890022771107866953637e+101     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5425                                       
x2[1] (analytic)                  = 0.00086627592414231364114121460331367        
x2[1] (numeric)                   = 1.8093387513126799333989425568220e+96        
absolute error                    = 1.8093387513126799333989425568220e+96        
relative error                    = 2.0886402367745336718714002623023e+101     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001246327762366492031165167692916          
x1[1] (numeric)                   = -1.4286608261249426280526434163905e+98       
absolute error                    = 1.4286608261249426280526434163905e+98        
relative error                    = 1.1462962386493274561535921199071e+103     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=61.0MB, alloc=4.6MB, time=4.09
NO POLE
NO POLE
t[1]                              = 0.543                                        
x2[1] (analytic)                  = 0.00086678093596338128749701437068642        
x2[1] (numeric)                   = 8.5990840284831101631247241968314e+97        
absolute error                    = 8.5990840284831101631247241968314e+97        
relative error                    = 9.9207119950390716293926207851427e+102     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012458047292544833104512097671668         
x1[1] (numeric)                   = -5.5623788893879010084810207789150e+99       
absolute error                    = 5.5623788893879010084810207789150e+99        
relative error                    = 4.4648882435344018247595678526993e+104     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5435                                       
x2[1] (analytic)                  = 0.00086728658383984402158759261938419        
x2[1] (numeric)                   = 3.0034508042526728745124234953861e+99        
absolute error                    = 3.0034508042526728745124234953861e+99        
relative error                    = 3.4630430819708147677167090000344e+104     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012452819575936623502577563788178         
x1[1] (numeric)                   = -1.7644687583634481765033488854716e+101      
absolute error                    = 1.7644687583634481765033488854716e+101       
relative error                    = 1.4169230892681072429558726795343e+106     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.544                                        
x2[1] (analytic)                  = 0.00086779286834269622642255081248739        
x2[1] (numeric)                   = 7.5401679470285622472021105383852e+100       
absolute error                    = 7.5401679470285622472021105383852e+100       
relative error                    = 8.6889028731345923216631298599652e+105     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.00124475944725333623265679839004           
x1[1] (numeric)                   = -3.3469423006779772417493321801265e+102      
absolute error                    = 3.3469423006779772417493321801265e+102       
relative error                    = 2.6888265906021278366877624725458e+107     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5445                                       
x2[1] (analytic)                  = 0.00086829979004353624638875542355646        
x2[1] (numeric)                   = 1.2044463838635247001172221386809e+102       
absolute error                    = 1.2044463838635247001172221386809e+102       
relative error                    = 1.3871319533581070906652044592006e+107     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012442371981028773698453983553836         
x1[1] (numeric)                   = -3.6256178084355481209445516692958e+103      
absolute error                    = 3.6256178084355481209445516692958e+103       
relative error                    = 2.9139281593281628090293016607732e+108     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.545                                        
x2[1] (analytic)                  = 0.00086880734951456697517718013294248        
x2[1] (numeric)                   = 1.2220823271605823577207110860536e+103       
absolute error                    = 1.2220823271605823577207110860536e+103       
relative error                    = 1.4066206136992308559623257483974e+108     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012437152100117234714887928906918         
x1[1] (numeric)                   = -2.5851980757248032235116336641981e+104      
absolute error                    = 2.5851980757248032235116336641981e+104       
relative error                    = 2.0786093592120938248818012140291e+109     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=64.8MB, alloc=4.6MB, time=4.37
NO POLE
NO POLE
t[1]                              = 0.5455                                       
x2[1] (analytic)                  = 0.00086931554732859644430613519421227        
x2[1] (numeric)                   = 8.3205360434518853311850861588999e+103       
absolute error                    = 8.3205360434518853311850861588999e+103       
relative error                    = 9.5713645856454111721808870933495e+108     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012431934828493775120798194093974         
x1[1] (numeric)                   = -1.0118183548114506402152667026640e+105      
absolute error                    = 1.0118183548114506402152667026640e+105       
relative error                    = 8.1388646962046554193051034597983e+109     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.546                                        
x2[1] (analytic)                  = 0.00086982438405903841224147657403825        
x2[1] (numeric)                   = 1.7146426496826497436524516056009e+104       
absolute error                    = 1.7146426496826497436524516056009e+104       
relative error                    = 1.9712515320405988791781174781603e+109     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012426720164854076983146590660609         
x1[1] (numeric)                   = 1.7078633820395955828330466786989e+106       
absolute error                    = 1.7078633820395955828330466786989e+106       
relative error                    = 1.3743476632473525073184066465423e+111     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5465                                       
x2[1] (analytic)                  = 0.00087033386027991295411438806384394        
x2[1] (numeric)                   = -1.3298786880441368475990270070625e+106      
absolute error                    = 1.3298786880441368475990270070625e+106       
relative error                    = 1.5280098232837075924495001832605e+111     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012421508107894474364848877510829         
x1[1] (numeric)                   = 1.0440049253894586151147004329422e+108       
absolute error                    = 1.0440049253894586151147004329422e+108       
relative error                    = 8.4048161972050926329442889145431e+112     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.547                                        
x2[1] (analytic)                  = 0.00087084397656584705203733015703041        
x2[1] (numeric)                   = -6.1474792060672559685840216638278e+107      
absolute error                    = 6.1474792060672559685840216638278e+107       
relative error                    = 7.0592199883034123996966587333247e+112     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012416298656311952998858269846059         
x1[1] (numeric)                   = 3.9116916991875880330764571649916e+109       
absolute error                    = 3.9116916991875880330764571649916e+109       
relative error                    = 3.1504491052162629523529081511667e+114     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5475                                       
x2[1] (analytic)                  = 0.00087135473349207518601875008173811        
x2[1] (numeric)                   = -2.0614510866304581322582090115315e+109      
absolute error                    = 2.0614510866304581322582090115315e+109       
relative error                    = 2.3658000667178411072506976266527e+114     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012411091808804149962411865616909         
x1[1] (numeric)                   = 1.1831004502849889164043032074850e+111       
absolute error                    = 1.1831004502849889164043032074850e+111       
relative error                    = 9.5326057409850438109119225831389e+115     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.548                                        
x2[1] (analytic)                  = 0.0008718661316344399254771479758239         
x2[1] (numeric)                   = -5.0563927732576912415539216338334e+110      
absolute error                    = 5.0563927732576912415539216338334e+110       
relative error                    = 5.7995058986621572886886489950533e+115     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012405887564069353351439908049313         
x1[1] (numeric)                   = 2.2396877635055163172288938561667e+112       
absolute error                    = 2.2396877635055163172288938561667e+112       
relative error                    = 1.8053426261835784449050309240990e+117     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
memory used=68.6MB, alloc=4.6MB, time=4.64
NO POLE
NO POLE
t[1]                              = 0.5485                                       
x2[1] (analytic)                  = 0.00087237817156939252135509478805287        
x2[1] (numeric)                   = -8.1487381793984486772850202188741e+111      
absolute error                    = 8.1487381793984486772850202188741e+111       
relative error                    = 9.3408322731631585468839154083612e+116     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012400685920806501955137802847337         
x1[1] (numeric)                   = 2.5243749656300605236451500692334e+113       
absolute error                    = 2.5243749656300605236451500692334e+113       
relative error                    = 2.0356736568858144624431041545514e+118     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.549                                        
x2[1] (analytic)                  = 0.00087289085387399349883379808742284        
x2[1] (numeric)                   = -8.5728421024217586174576243173748e+112      
absolute error                    = 8.5728421024217586174576243173748e+112       
relative error                    = 9.8212073873548623497959867717947e+117     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012395486877715184930700808715671         
x1[1] (numeric)                   = 1.8971020650006998723358394285970e+114       
absolute error                    = 1.8971020650006998723358394285970e+114       
relative error                    = 1.5304780552116447439729515389758e+119     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.5495                                       
x2[1] (analytic)                  = 0.00087340417912591325064881256105309        
x2[1] (numeric)                   = -6.1057357422083055163315889469986e+113      
absolute error                    = 6.1057357422083055163315889469986e+113       
relative error                    = 6.9907333719410558866256079239501e+118     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.001239029043349564147822131988547          
x1[1] (numeric)                   = 7.8501656431858371980965277688739e+114       
absolute error                    = 7.8501656431858371980965277688739e+114       
relative error                    = 6.3357398160448848401030146895021e+119     % 
h                                 = 0.0005                                       
 
TOP MAIN SOLVE Loop
NO POLE
NO POLE
t[1]                              = 0.55                                         
x2[1] (analytic)                  = 0.00087391814790343263100749258018221        
x2[1] (numeric)                   = -1.3562819417346254813291957170260e+114      
absolute error                    = 1.3562819417346254813291957170260e+114       
relative error                    = 1.5519553461481540556136603865481e+119     % 
h                                 = 0.0005                                       
x1[1] (analytic)                  = 0.0012385096586848760515748659367868         
x1[1] (numeric)                   = -1.2583448095047121464526355411747e+116      
absolute error                    = 1.2583448095047121464526355411747e+116       
relative error                    = 1.0160153380159329959886195467384e+121     % 
h                                 = 0.0005                                       
Finished!
Maximum Iterations Reached before Solution Completed!
diff (x2,t,2) = 3.0 * diff(x2,t,1) - 2.0 * x2 - diff(x1,t,2) - diff (x1,t,1) + x1;
diff (x1,t,1) = 4.0 * x2 -  2.0 * diff (x2,t ,1) - 2.0 * x1;
Iterations                        = 100                                 
Total Elapsed Time               = 4 Seconds
Elapsed Time(since restart)      = 4 Seconds
Expected Time Remaining          = 7 Minutes 0 Seconds
Optimized Time Remaining         = 6 Minutes 58 Seconds
Time to Timeout                  = 14 Minutes 55 Seconds
Percent Done                     = 1.122                                      % 
> quit
memory used=71.2MB, alloc=4.6MB, time=4.81