|\^/| 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
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> 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_x[1];
> omniout_float(ALWAYS,"x[1] ",33,ind_var,20," ");
> analytic_val_y := exact_soln_y(ind_var);
> omniout_float(ALWAYS,"y[1] (analytic) ",33,analytic_val_y,20," ");
> term_no := 1;
> numeric_val := array_y[term_no];
> abserr := omniabs(numeric_val - analytic_val_y);
> omniout_float(ALWAYS,"y[1] (numeric) ",33,numeric_val,20," ");
> if (omniabs(analytic_val_y) <> 0.0) then # if number 2
> relerr := abserr*100.0/omniabs(analytic_val_y);
> if (relerr <> 0.0) then # if number 3
> glob_good_digits := -trunc(log10(relerr/100.0));
> else
> glob_good_digits := Digits;
> fi;# end if 3
> ;
> else
> relerr := -1.0 ;
> glob_good_digits := -1;
> 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_int(INFO,"Correct digits ",32,glob_good_digits,4," ")
> ;
> 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 DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
if 0 <= iter then
ind_var := array_x[1];
omniout_float(ALWAYS, "x[1] ", 33,
ind_var, 20, " ");
analytic_val_y := exact_soln_y(ind_var);
omniout_float(ALWAYS, "y[1] (analytic) ", 33,
analytic_val_y, 20, " ");
term_no := 1;
numeric_val := array_y[term_no];
abserr := omniabs(numeric_val - analytic_val_y);
omniout_float(ALWAYS, "y[1] (numeric) ", 33,
numeric_val, 20, " ");
if omniabs(analytic_val_y) <> 0. then
relerr := abserr*100.0/omniabs(analytic_val_y);
if relerr <> 0. then
glob_good_digits := -trunc(log10(relerr/100.0))
else glob_good_digits := Digits
end if
else relerr := -1.0; glob_good_digits := -1
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_int(INFO, "Correct digits ", 32,
glob_good_digits, 4, " ");
omniout_float(ALWAYS, "h ", 4,
glob_h, 20, " ")
end if
end proc
> # Begin Function number 4
> adjust_for_pole := proc(h_param)
> global
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> glob_last;
>
> local hnew, sz2, tmp;
>
>
>
> #TOP ADJUST FOR POLE
>
> hnew := h_param;
> glob_normmax := glob_small_float;
> if (omniabs(array_y_higher[1,1]) > glob_small_float) then # if number 1
> tmp := omniabs(array_y_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 (omniabs(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");
> 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_x[1];
> fi;# end if 1
> ;
> hnew := sz2;
> ;#END block
> return(hnew);
> #BOTTOM ADJUST FOR POLE
>
> # End Function number 4
> end;
adjust_for_pole := proc(h_param)
local hnew, sz2, tmp;
global DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
hnew := h_param;
glob_normmax := glob_small_float;
if glob_small_float < omniabs(array_y_higher[1, 1]) then
tmp := omniabs(array_y_higher[1, 1]);
if tmp < glob_normmax then glob_normmax := tmp end if
end if;
if glob_look_poles and glob_small_float < omniabs(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");
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_x[1]
end if;
hnew := sz2;
return hnew
end proc
> # Begin Function number 5
> prog_report := proc(x_start,x_end)
> global
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> 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(x_end),convfloat(x_start),convfloat(array_x[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(x_end),convfloat(x_start),convfloat(array_x[1]) +convfloat( glob_h) ,convfloat( opt_clock_sec));
> percent_done := comp_percent(convfloat(x_end),convfloat(x_start),convfloat(array_x[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(x_start, x_end)
local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec,
percent_done, total_clock_sec;
global DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, 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(x_end), convfloat(x_start),
convfloat(array_x[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(x_end),
convfloat(x_start), convfloat(array_x[1]) + convfloat(glob_h),
convfloat(opt_clock_sec));
percent_done := comp_percent(convfloat(x_end), convfloat(x_start),
convfloat(array_x[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
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> 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 - 1 - 1;
> while ((m >= 10) and ((omniabs(array_y_higher[1,m]) < glob_small_float) or (omniabs(array_y_higher[1,m-1]) < glob_small_float) or (omniabs(array_y_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_y_higher[1,m]/array_y_higher[1,m-1];
> rm1 := array_y_higher[1,m-1]/array_y_higher[1,m-2];
> hdrc := convfloat(m-1)*rm0-convfloat(m-2)*rm1;
> if (omniabs(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
> #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 - 1 - 1;
> cnt := 0;
> while ((cnt < 5) and (n >= 10)) do # do number 2
> if (omniabs(array_y_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 ((omniabs(array_y_higher[1,m]) >= (glob_large_float)) or (omniabs(array_y_higher[1,m-1]) >=(glob_large_float)) or (omniabs(array_y_higher[1,m-2]) >= (glob_large_float)) or (omniabs(array_y_higher[1,m-3]) >= (glob_large_float)) or (omniabs(array_y_higher[1,m-4]) >= (glob_large_float)) or (omniabs(array_y_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_y_higher[1,m])/(array_y_higher[1,m-1]);
> rm1 := (array_y_higher[1,m-1])/(array_y_higher[1,m-2]);
> rm2 := (array_y_higher[1,m-2])/(array_y_higher[1,m-3]);
> rm3 := (array_y_higher[1,m-3])/(array_y_higher[1,m-4]);
> rm4 := (array_y_higher[1,m-4])/(array_y_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 ((omniabs(nr1 * dr2 - nr2 * dr1) <= glob_small_float) or (omniabs(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 (omniabs(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 (omniabs(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
> 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 2
> 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 3
> omniout_str(ALWAYS,"Complex estimate of poles used");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> 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 2
> 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 3
> omniout_str(ALWAYS,"Real estimate of pole used");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> 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 2
> 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 3
> omniout_str(ALWAYS,"NO POLE");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> 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 2
> 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 3
> omniout_str(ALWAYS,"Real estimate of pole used");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> 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 2
> 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 3
> omniout_str(ALWAYS,"Complex estimate of poles used");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> if ( not found ) then # if number 2
> 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 3
> omniout_str(ALWAYS,"NO POLE");
> fi;# end if 3
> ;
> fi;# end if 2
> ;
> #BOTTOM WHICH RADII EQ = 1
> 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 2
> array_pole[1] := array_poles[1,1];
> array_pole[2] := array_poles[1,2];
> fi;# end if 2
> ;
> #BOTTOM WHICH RADIUS EQ = 1
> #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 DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
n := glob_max_terms;
m := n - 2;
while 10 <= m and (omniabs(array_y_higher[1, m]) < glob_small_float or
omniabs(array_y_higher[1, m - 1]) < glob_small_float or
omniabs(array_y_higher[1, m - 2]) < glob_small_float) do m := m - 1
end do;
if 10 < m then
rm0 := array_y_higher[1, m]/array_y_higher[1, m - 1];
rm1 := array_y_higher[1, m - 1]/array_y_higher[1, m - 2];
hdrc := convfloat(m - 1)*rm0 - convfloat(m - 2)*rm1;
if glob_small_float < omniabs(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 - 2;
cnt := 0;
while cnt < 5 and 10 <= n do
if glob_small_float < omniabs(array_y_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 <= omniabs(array_y_higher[1, m]) or
glob_large_float <= omniabs(array_y_higher[1, m - 1]) or
glob_large_float <= omniabs(array_y_higher[1, m - 2]) or
glob_large_float <= omniabs(array_y_higher[1, m - 3]) or
glob_large_float <= omniabs(array_y_higher[1, m - 4]) or
glob_large_float <= omniabs(array_y_higher[1, m - 5]) then
array_complex_pole[1, 1] := glob_large_float;
array_complex_pole[1, 2] := glob_large_float
else
rm0 := array_y_higher[1, m]/array_y_higher[1, m - 1];
rm1 := array_y_higher[1, m - 1]/array_y_higher[1, m - 2];
rm2 := array_y_higher[1, m - 2]/array_y_higher[1, m - 3];
rm3 := array_y_higher[1, m - 3]/array_y_higher[1, m - 4];
rm4 := array_y_higher[1, m - 4]/array_y_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 omniabs(nr1*dr2 - nr2*dr1) <= glob_small_float or
omniabs(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 < omniabs(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 < omniabs(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;
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;
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;
display_pole()
end proc
> # Begin Function number 7
> get_norms := proc()
> global
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> glob_last;
>
> local iii;
>
>
>
> if ( not glob_initial_pass) then # if number 2
> iii := 1;
> while (iii <= glob_max_terms) do # do number 2
> array_norms[iii] := 0.0;
> iii := iii + 1;
> od;# end do number 2
> ;
> #TOP GET NORMS
> iii := 1;
> while (iii <= glob_max_terms) do # do number 2
> if (omniabs(array_y[iii]) > array_norms[iii]) then # if number 3
> array_norms[iii] := omniabs(array_y[iii]);
> fi;# end if 3
> ;
> iii := iii + 1;
> od;# end do number 2
> #BOTTOM GET NORMS
> ;
> fi;# end if 2
> ;
>
> # End Function number 7
> end;
get_norms := proc()
local iii;
global DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
if not glob_initial_pass then
iii := 1;
while iii <= glob_max_terms do
array_norms[iii] := 0.; iii := iii + 1
end do;
iii := 1;
while iii <= glob_max_terms do
if array_norms[iii] < omniabs(array_y[iii]) then
array_norms[iii] := omniabs(array_y[iii])
end if;
iii := iii + 1
end do
end if
end proc
> # Begin Function number 8
> atomall := proc()
> global
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> glob_last;
>
> local kkk, order_d, adj2, temporary, term;
>
>
>
>
>
> #TOP ATOMALL
> #END OUTFILE1
> #BEGIN ATOMHDR1
> #emit pre mult FULL CONST $eq_no = 1 i = 1
> array_tmp1[1] := array_m1[1] * array_const_3D0[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 1
> array_tmp2[1] := array_tmp1[1] / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 1
> array_tmp3[1] := array_tmp2[1] / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 1
> array_tmp4[1] := array_tmp3[1] / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 1
> array_tmp5[1] := array_tmp4[1] / array_x[1];
> #emit pre add CONST FULL $eq_no = 1 i = 1
> array_tmp6[1] := array_const_0D0[1] + array_tmp5[1];
> #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5
> if ( not array_y_set_initial[1,2]) then # if number 1
> if (1 <= glob_max_terms) then # if number 2
> temporary := array_tmp6[1] * expt(glob_h , (1)) * factorial_3(0,1);
> array_y[2] := temporary;
> array_y_higher[1,2] := temporary;
> temporary := temporary / glob_h * (2.0);
> array_y_higher[2,1] := temporary
> ;
> fi;# end if 2
> ;
> fi;# end if 1
> ;
> kkk := 2;
> #END ATOMHDR1
> #BEGIN ATOMHDR2
> #emit pre mult FULL CONST $eq_no = 1 i = 2
> array_tmp1[2] := array_m1[2] * array_const_3D0[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 2
> array_tmp2[2] := (array_tmp1[2] - array_tmp2[1] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 2
> array_tmp3[2] := (array_tmp2[2] - array_tmp3[1] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 2
> array_tmp4[2] := (array_tmp3[2] - array_tmp4[1] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 2
> array_tmp5[2] := (array_tmp4[2] - array_tmp5[1] * array_x[2]) / array_x[1];
> #emit pre add CONST FULL $eq_no = 1 i = 2
> array_tmp6[2] := array_tmp5[2];
> #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5
> if ( not array_y_set_initial[1,3]) then # if number 1
> if (2 <= glob_max_terms) then # if number 2
> temporary := array_tmp6[2] * expt(glob_h , (1)) * factorial_3(1,2);
> array_y[3] := temporary;
> array_y_higher[1,3] := temporary;
> temporary := temporary / glob_h * (2.0);
> array_y_higher[2,2] := temporary
> ;
> fi;# end if 2
> ;
> fi;# end if 1
> ;
> kkk := 3;
> #END ATOMHDR2
> #BEGIN ATOMHDR3
> #emit pre mult FULL CONST $eq_no = 1 i = 3
> array_tmp1[3] := array_m1[3] * array_const_3D0[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 3
> array_tmp2[3] := (array_tmp1[3] - array_tmp2[2] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 3
> array_tmp3[3] := (array_tmp2[3] - array_tmp3[2] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 3
> array_tmp4[3] := (array_tmp3[3] - array_tmp4[2] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 3
> array_tmp5[3] := (array_tmp4[3] - array_tmp5[2] * array_x[2]) / array_x[1];
> #emit pre add CONST FULL $eq_no = 1 i = 3
> array_tmp6[3] := array_tmp5[3];
> #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5
> if ( not array_y_set_initial[1,4]) then # if number 1
> if (3 <= glob_max_terms) then # if number 2
> temporary := array_tmp6[3] * expt(glob_h , (1)) * factorial_3(2,3);
> array_y[4] := temporary;
> array_y_higher[1,4] := temporary;
> temporary := temporary / glob_h * (2.0);
> array_y_higher[2,3] := temporary
> ;
> fi;# end if 2
> ;
> fi;# end if 1
> ;
> kkk := 4;
> #END ATOMHDR3
> #BEGIN ATOMHDR4
> #emit pre mult FULL CONST $eq_no = 1 i = 4
> array_tmp1[4] := array_m1[4] * array_const_3D0[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 4
> array_tmp2[4] := (array_tmp1[4] - array_tmp2[3] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 4
> array_tmp3[4] := (array_tmp2[4] - array_tmp3[3] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 4
> array_tmp4[4] := (array_tmp3[4] - array_tmp4[3] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 4
> array_tmp5[4] := (array_tmp4[4] - array_tmp5[3] * array_x[2]) / array_x[1];
> #emit pre add CONST FULL $eq_no = 1 i = 4
> array_tmp6[4] := array_tmp5[4];
> #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5
> if ( not array_y_set_initial[1,5]) then # if number 1
> if (4 <= glob_max_terms) then # if number 2
> temporary := array_tmp6[4] * expt(glob_h , (1)) * factorial_3(3,4);
> array_y[5] := temporary;
> array_y_higher[1,5] := temporary;
> temporary := temporary / glob_h * (2.0);
> array_y_higher[2,4] := temporary
> ;
> fi;# end if 2
> ;
> fi;# end if 1
> ;
> kkk := 5;
> #END ATOMHDR4
> #BEGIN ATOMHDR5
> #emit pre mult FULL CONST $eq_no = 1 i = 5
> array_tmp1[5] := array_m1[5] * array_const_3D0[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 5
> array_tmp2[5] := (array_tmp1[5] - array_tmp2[4] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 5
> array_tmp3[5] := (array_tmp2[5] - array_tmp3[4] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 5
> array_tmp4[5] := (array_tmp3[5] - array_tmp4[4] * array_x[2]) / array_x[1];
> #emit pre div FULL - LINEAR $eq_no = 1 i = 5
> array_tmp5[5] := (array_tmp4[5] - array_tmp5[4] * array_x[2]) / array_x[1];
> #emit pre add CONST FULL $eq_no = 1 i = 5
> array_tmp6[5] := array_tmp5[5];
> #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5
> if ( not array_y_set_initial[1,6]) then # if number 1
> if (5 <= glob_max_terms) then # if number 2
> temporary := array_tmp6[5] * expt(glob_h , (1)) * factorial_3(4,5);
> array_y[6] := temporary;
> array_y_higher[1,6] := temporary;
> temporary := temporary / glob_h * (2.0);
> array_y_higher[2,5] := temporary
> ;
> fi;# end if 2
> ;
> 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 mult FULL CONST $eq_no = 1 i = 1
> array_tmp1[kkk] := array_m1[kkk] * array_const_3D0[1];
> #emit div FULL LINEAR $eq_no = 1 i = 1
> array_tmp2[kkk] := -ats(kkk,array_x,array_tmp2,2) / array_x[1];
> #emit div FULL LINEAR $eq_no = 1 i = 1
> array_tmp3[kkk] := -ats(kkk,array_x,array_tmp3,2) / array_x[1];
> #emit div FULL LINEAR $eq_no = 1 i = 1
> array_tmp4[kkk] := -ats(kkk,array_x,array_tmp4,2) / array_x[1];
> #emit div FULL LINEAR $eq_no = 1 i = 1
> array_tmp5[kkk] := -ats(kkk,array_x,array_tmp5,2) / array_x[1];
> #emit NOT FULL - FULL add $eq_no = 1
> array_tmp6[kkk] := array_tmp5[kkk];
> #emit assign $eq_no = 1
> order_d := 1;
> if (kkk + order_d + 1 <= glob_max_terms) then # if number 1
> if ( not array_y_set_initial[1,kkk + order_d]) then # if number 2
> temporary := array_tmp6[kkk] * expt(glob_h , (order_d)) / factorial_3((kkk - 1),(kkk + order_d - 1));
> array_y[kkk + order_d] := temporary;
> array_y_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_y_higher[adj2,term] := temporary;
> adj2 := adj2 + 1;
> term := term - 1;
> od;# end do number 2
> fi;# end if 2
> fi;# end if 1
> ;
> kkk := kkk + 1;
> od;# end do number 1
> ;
> #BOTTOM ATOMALL
> #END OUTFILE4
> #BEGIN OUTFILE5
>
> #BOTTOM ATOMALL ???
> # End Function number 8
> end;
atomall := proc()
local kkk, order_d, adj2, temporary, term;
global DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
array_tmp1[1] := array_m1[1]*array_const_3D0[1];
array_tmp2[1] := array_tmp1[1]/array_x[1];
array_tmp3[1] := array_tmp2[1]/array_x[1];
array_tmp4[1] := array_tmp3[1]/array_x[1];
array_tmp5[1] := array_tmp4[1]/array_x[1];
array_tmp6[1] := array_const_0D0[1] + array_tmp5[1];
if not array_y_set_initial[1, 2] then
if 1 <= glob_max_terms then
temporary := array_tmp6[1]*expt(glob_h, 1)*factorial_3(0, 1);
array_y[2] := temporary;
array_y_higher[1, 2] := temporary;
temporary := temporary*2.0/glob_h;
array_y_higher[2, 1] := temporary
end if
end if;
kkk := 2;
array_tmp1[2] := array_m1[2]*array_const_3D0[1];
array_tmp2[2] := (array_tmp1[2] - array_tmp2[1]*array_x[2])/array_x[1];
array_tmp3[2] := (array_tmp2[2] - array_tmp3[1]*array_x[2])/array_x[1];
array_tmp4[2] := (array_tmp3[2] - array_tmp4[1]*array_x[2])/array_x[1];
array_tmp5[2] := (array_tmp4[2] - array_tmp5[1]*array_x[2])/array_x[1];
array_tmp6[2] := array_tmp5[2];
if not array_y_set_initial[1, 3] then
if 2 <= glob_max_terms then
temporary := array_tmp6[2]*expt(glob_h, 1)*factorial_3(1, 2);
array_y[3] := temporary;
array_y_higher[1, 3] := temporary;
temporary := temporary*2.0/glob_h;
array_y_higher[2, 2] := temporary
end if
end if;
kkk := 3;
array_tmp1[3] := array_m1[3]*array_const_3D0[1];
array_tmp2[3] := (array_tmp1[3] - array_tmp2[2]*array_x[2])/array_x[1];
array_tmp3[3] := (array_tmp2[3] - array_tmp3[2]*array_x[2])/array_x[1];
array_tmp4[3] := (array_tmp3[3] - array_tmp4[2]*array_x[2])/array_x[1];
array_tmp5[3] := (array_tmp4[3] - array_tmp5[2]*array_x[2])/array_x[1];
array_tmp6[3] := array_tmp5[3];
if not array_y_set_initial[1, 4] then
if 3 <= glob_max_terms then
temporary := array_tmp6[3]*expt(glob_h, 1)*factorial_3(2, 3);
array_y[4] := temporary;
array_y_higher[1, 4] := temporary;
temporary := temporary*2.0/glob_h;
array_y_higher[2, 3] := temporary
end if
end if;
kkk := 4;
array_tmp1[4] := array_m1[4]*array_const_3D0[1];
array_tmp2[4] := (array_tmp1[4] - array_tmp2[3]*array_x[2])/array_x[1];
array_tmp3[4] := (array_tmp2[4] - array_tmp3[3]*array_x[2])/array_x[1];
array_tmp4[4] := (array_tmp3[4] - array_tmp4[3]*array_x[2])/array_x[1];
array_tmp5[4] := (array_tmp4[4] - array_tmp5[3]*array_x[2])/array_x[1];
array_tmp6[4] := array_tmp5[4];
if not array_y_set_initial[1, 5] then
if 4 <= glob_max_terms then
temporary := array_tmp6[4]*expt(glob_h, 1)*factorial_3(3, 4);
array_y[5] := temporary;
array_y_higher[1, 5] := temporary;
temporary := temporary*2.0/glob_h;
array_y_higher[2, 4] := temporary
end if
end if;
kkk := 5;
array_tmp1[5] := array_m1[5]*array_const_3D0[1];
array_tmp2[5] := (array_tmp1[5] - array_tmp2[4]*array_x[2])/array_x[1];
array_tmp3[5] := (array_tmp2[5] - array_tmp3[4]*array_x[2])/array_x[1];
array_tmp4[5] := (array_tmp3[5] - array_tmp4[4]*array_x[2])/array_x[1];
array_tmp5[5] := (array_tmp4[5] - array_tmp5[4]*array_x[2])/array_x[1];
array_tmp6[5] := array_tmp5[5];
if not array_y_set_initial[1, 6] then
if 5 <= glob_max_terms then
temporary := array_tmp6[5]*expt(glob_h, 1)*factorial_3(4, 5);
array_y[6] := temporary;
array_y_higher[1, 6] := temporary;
temporary := temporary*2.0/glob_h;
array_y_higher[2, 5] := temporary
end if
end if;
kkk := 6;
while kkk <= glob_max_terms do
array_tmp1[kkk] := array_m1[kkk]*array_const_3D0[1];
array_tmp2[kkk] := -ats(kkk, array_x, array_tmp2, 2)/array_x[1];
array_tmp3[kkk] := -ats(kkk, array_x, array_tmp3, 2)/array_x[1];
array_tmp4[kkk] := -ats(kkk, array_x, array_tmp4, 2)/array_x[1];
array_tmp5[kkk] := -ats(kkk, array_x, array_tmp5, 2)/array_x[1];
array_tmp6[kkk] := array_tmp5[kkk];
order_d := 1;
if kkk + order_d + 1 <= glob_max_terms then
if not array_y_set_initial[1, kkk + order_d] then
temporary := array_tmp6[kkk]*expt(glob_h, order_d)/
factorial_3(kkk - 1, kkk + order_d - 1);
array_y[kkk + order_d] := temporary;
array_y_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_y_higher[adj2, term] := temporary;
adj2 := adj2 + 1;
term := term - 1
end do
end if
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_minute, 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_minute * 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_minute;
> sec_int := floor(seconds);
> fprintf(fd,"
");
> 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," | ");
> # 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_minute, years_in_century;
secs := secs_in;
if 0. <= secs then
sec_in_millinium := convfloat(sec_in_minute*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_minute;
sec_int := floor(seconds);
fprintf(fd, "");
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, " | ")
end proc
> omniout_timestr := proc (secs_in)
> global centuries_in_millinium, days_in_year, hours_in_day, min_in_hour, sec_in_minute, 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_minute * 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_minute;
> 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_minute, years_in_century;
secs := convfloat(secs_in);
if 0. <= secs then
sec_in_millinium := convfloat(sec_in_minute*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_minute;
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,"");
> fprintf(file,"ditto");
> fprintf(file," | ");
> # End Function number 6
> end;
logditto := proc(file)
fprintf(file, ""); fprintf(file, "ditto"); fprintf(file, " | ")
end proc
> # Begin Function number 7
> logitem_integer := proc(file,n)
> fprintf(file,"");
> fprintf(file,"%d",n);
> fprintf(file," | ");
> # End Function number 7
> end;
logitem_integer := proc(file, n)
fprintf(file, ""); fprintf(file, "%d", n); fprintf(file, " | ")
end proc
> # Begin Function number 8
> logitem_str := proc(file,str)
> fprintf(file,"");
> fprintf(file,str);
> fprintf(file," | ");
> # End Function number 8
> end;
logitem_str := proc(file, str)
fprintf(file, ""); fprintf(file, str); fprintf(file, " | ")
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,"");
> fprintf(file,"%g",x);
> fprintf(file," | ");
> # End Function number 10
> end;
logitem_float := proc(file, x)
fprintf(file, ""); fprintf(file, "%g", x); fprintf(file, " | ")
end proc
> # Begin Function number 11
> logitem_pole := proc(file,pole)
> fprintf(file,"");
> 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," | ");
> # End Function number 11
> end;
logitem_pole := proc(file, pole)
fprintf(file, "");
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, " | ")
end proc
> # Begin Function number 12
> logstart := proc(file)
> fprintf(file,"");
> # End Function number 12
> end;
logstart := proc(file) fprintf(file, "
") end proc
> # Begin Function number 13
> logend := proc(file)
> fprintf(file,"
\n");
> # End Function number 13
> end;
logend := proc(file) fprintf(file, "\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_sec2)
> global glob_small_float;
> local ms2, rrr, sec_left, sub1, sub2;
>
>
>
> ;
> ms2 := clock_sec2;
> sub1 := (t_end2-t_start2);
> sub2 := (t2-t_start2);
> if (sub1 = 0.0) then # if number 13
> sec_left := 0.0;
> else
> if (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_sec2)
local ms2, rrr, sec_left, sub1, sub2;
global glob_small_float;
ms2 := clock_sec2;
sub1 := t_end2 - t_start2;
sub2 := t2 - t_start2;
if sub1 = 0. then sec_left := 0.
else
if 0. < 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 (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 < sub2 then rrr := 100.0*sub2/sub1
else rrr := 0.
end if;
rrr
end proc
> # Begin Function number 17
> factorial_2 := proc(nnn)
> local ret;
>
>
>
> ret := nnn!;
>
> # End Function number 17
> end;
factorial_2 := proc(nnn) local ret; ret := nnn! end proc
> # Begin Function number 18
> factorial_1 := proc(nnn)
> global glob_max_terms,array_fact_1;
> local ret;
>
>
>
> if (nnn <= glob_max_terms) then # if number 13
> if (array_fact_1[nnn] = 0) then # if number 14
> ret := factorial_2(nnn);
> array_fact_1[nnn] := ret;
> else
> ret := array_fact_1[nnn];
> fi;# end if 14
> ;
> else
> ret := factorial_2(nnn);
> fi;# end if 13
> ;
> ret;
>
> # End Function number 18
> end;
factorial_1 := proc(nnn)
local ret;
global glob_max_terms, array_fact_1;
if nnn <= glob_max_terms then
if array_fact_1[nnn] = 0 then
ret := factorial_2(nnn); array_fact_1[nnn] := ret
else ret := array_fact_1[nnn]
end if
else ret := factorial_2(nnn)
end if;
ret
end proc
> # Begin Function number 19
> factorial_3 := proc(mmm,nnn)
> global glob_max_terms,array_fact_2;
> local ret;
>
>
>
> if ((nnn <= glob_max_terms) and (mmm <= glob_max_terms)) then # if number 13
> if (array_fact_2[mmm,nnn] = 0) then # if number 14
> ret := factorial_1(mmm)/factorial_1(nnn);
> array_fact_2[mmm,nnn] := ret;
> else
> ret := array_fact_2[mmm,nnn];
> fi;# end if 14
> ;
> else
> ret := factorial_2(mmm)/factorial_2(nnn);
> fi;# end if 13
> ;
> ret;
>
> # End Function number 19
> end;
factorial_3 := proc(mmm, nnn)
local ret;
global glob_max_terms, array_fact_2;
if nnn <= glob_max_terms and mmm <= glob_max_terms then
if array_fact_2[mmm, nnn] = 0 then
ret := factorial_1(mmm)/factorial_1(nnn);
array_fact_2[mmm, nnn] := ret
else ret := array_fact_2[mmm, nnn]
end if
else ret := factorial_2(mmm)/factorial_2(nnn)
end if;
ret
end proc
> # Begin Function number 20
> convfp := proc(mmm)
> (mmm);
>
> # End Function number 20
> end;
convfp := proc(mmm) mmm end proc
> # Begin Function number 21
> convfloat := proc(mmm)
> (mmm);
>
> # End Function number 21
> end;
convfloat := proc(mmm) mmm end proc
> elapsed_time_seconds := proc()
> time();
> end;
elapsed_time_seconds := proc() time() end proc
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
>
> omniabs := proc(x)
> abs(x);
> end;
omniabs := proc(x) abs(x) end proc
> expt := proc(x,y)
> (x^y);
> end;
expt := proc(x, y) x^y end proc
> #END ATS LIBRARY BLOCK
> #BEGIN USER DEF BLOCK
> #BEGIN USER DEF BLOCK
> exact_soln_y := proc(x)
> return(1.0/x/x/x);
> end;
exact_soln_y := proc(x) return 1.0/(x*x*x) end proc
>
>
> #END USER DEF BLOCK
> #END USER DEF BLOCK
> #END OUTFILE5
> # Begin Function number 2
> main := proc()
> #BEGIN OUTFIEMAIN
> local d1,d2,d3,d4,est_err_2,niii,done_once,
> term,ord,order_diff,term_no,html_log_file,iiif,jjjf,
> rows,r_order,sub_iter,calc_term,iii,temp_sum,current_iter,
> x_start,x_end
> ,it, log10norm, max_terms, opt_iter, tmp,subiter;
> global
> DEBUGL,
> DEBUGMASSIVE,
> glob_max_terms,
> INFO,
> ALWAYS,
> glob_iolevel,
> #Top Generate Globals Decl
> glob_small_float,
> glob_log10_relerr,
> glob_large_float,
> glob_optimal_done,
> glob_percent_done,
> glob_max_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_initial_pass,
> glob_almost_1,
> min_in_hour,
> sec_in_minute,
> glob_good_digits,
> glob_log10relerr,
> MAX_UNCHANGED,
> glob_abserr,
> glob_last_good_h,
> glob_clock_start_sec,
> glob_clock_sec,
> glob_max_sec,
> glob_unchanged_h_cnt,
> glob_log10_abserr,
> glob_hmin_init,
> glob_hmax,
> glob_reached_optimal_h,
> glob_not_yet_finished,
> glob_orig_start_sec,
> glob_optimal_start,
> glob_max_rel_trunc_err,
> glob_hmin,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_max_minutes,
> glob_iter,
> glob_current_iter,
> glob_start,
> djd_debug2,
> glob_display_flag,
> glob_dump,
> glob_html_log,
> glob_optimal_expect_sec,
> glob_log10abserr,
> glob_max_hours,
> glob_look_poles,
> glob_smallish_float,
> glob_no_eqs,
> glob_max_iter,
> glob_h,
> glob_disp_incr,
> centuries_in_millinium,
> djd_debug,
> glob_max_opt_iter,
> glob_subiter_method,
> glob_normmax,
> glob_curr_iter_when_opt,
> glob_warned,
> glob_optimal_clock_start_sec,
> days_in_year,
> hours_in_day,
> glob_warned2,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D0,
> array_const_3D0,
> array_const_1,
> #END CONST
> array_y,
> array_x,
> array_type_pole,
> array_y_init,
> array_m1,
> array_fact_1,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_tmp6,
> array_last_rel_error,
> array_pole,
> array_norms,
> array_1st_rel_error,
> array_real_pole,
> array_y_set_initial,
> array_y_higher_work2,
> array_fact_2,
> array_complex_pole,
> array_y_higher_work,
> array_poles,
> array_y_higher,
> glob_last;
> glob_last;
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> glob_iolevel := INFO;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> glob_max_terms := 30;
> INFO := 2;
> ALWAYS := 1;
> glob_iolevel := 5;
> glob_small_float := 0.1e-50;
> glob_log10_relerr := 0.1e-10;
> glob_large_float := 9.0e100;
> glob_optimal_done := false;
> glob_percent_done := 0.0;
> glob_max_trunc_err := 0.1e-10;
> glob_relerr := 0.1e-10;
> glob_dump_analytic := false;
> glob_initial_pass := true;
> glob_almost_1 := 0.9990;
> min_in_hour := 60;
> sec_in_minute := 60;
> glob_good_digits := 0;
> glob_log10relerr := 0.0;
> MAX_UNCHANGED := 10;
> glob_abserr := 0.1e-10;
> glob_last_good_h := 0.1;
> glob_clock_start_sec := 0.0;
> glob_clock_sec := 0.0;
> glob_max_sec := 10000.0;
> glob_unchanged_h_cnt := 0;
> glob_log10_abserr := 0.1e-10;
> glob_hmin_init := 0.001;
> glob_hmax := 1.0;
> glob_reached_optimal_h := false;
> glob_not_yet_finished := true;
> glob_orig_start_sec := 0.0;
> glob_optimal_start := 0.0;
> glob_max_rel_trunc_err := 0.1e-10;
> glob_hmin := 0.00000000001;
> glob_not_yet_start_msg := true;
> years_in_century := 100;
> glob_log10normmin := 0.1;
> glob_max_minutes := 0.0;
> glob_iter := 0;
> glob_current_iter := 0;
> glob_start := 0;
> djd_debug2 := true;
> glob_display_flag := true;
> glob_dump := false;
> glob_html_log := true;
> glob_optimal_expect_sec := 0.1;
> glob_log10abserr := 0.0;
> glob_max_hours := 0.0;
> glob_look_poles := false;
> glob_smallish_float := 0.1e-100;
> glob_no_eqs := 0;
> glob_max_iter := 1000;
> glob_h := 0.1;
> glob_disp_incr := 0.1;
> centuries_in_millinium := 10;
> djd_debug := true;
> glob_max_opt_iter := 10;
> glob_subiter_method := 3;
> glob_normmax := 0.0;
> glob_curr_iter_when_opt := 0;
> glob_warned := false;
> glob_optimal_clock_start_sec := 0.0;
> days_in_year := 365;
> hours_in_day := 24;
> glob_warned2 := false;
> #Write Set Defaults
> glob_orig_start_sec := elapsed_time_seconds();
> MAX_UNCHANGED := 10;
> glob_curr_iter_when_opt := 0;
> glob_display_flag := true;
> glob_no_eqs := 1;
> 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/sing5postode.ode#################");
> omniout_str(ALWAYS,"diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"Digits := 32;");
> omniout_str(ALWAYS,"max_terms := 30;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"x_start := -1.0;");
> omniout_str(ALWAYS,"x_end := -0.7;");
> omniout_str(ALWAYS,"array_y_init[0 + 1] := exact_soln_y(x_start);");
> omniout_str(ALWAYS,"glob_h := 0.00001;");
> omniout_str(ALWAYS,"glob_look_poles := true;");
> omniout_str(ALWAYS,"glob_max_iter := 100;");
> omniout_str(ALWAYS,"#END SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN OVERRIDE BLOCK");
> omniout_str(ALWAYS,"glob_h := 0.00001 ;");
> omniout_str(ALWAYS,"glob_look_poles := true;");
> omniout_str(ALWAYS,"glob_max_iter := 100;");
> omniout_str(ALWAYS,"glob_max_minutes := 1;");
> omniout_str(ALWAYS,"#END OVERRIDE BLOCK");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN USER DEF BLOCK");
> omniout_str(ALWAYS,"exact_soln_y := proc(x)");
> omniout_str(ALWAYS,"return(1.0/x/x/x);");
> omniout_str(ALWAYS,"end;");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> 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
> #START OF INITS AFTER INPUT BLOCK
> glob_max_terms := max_terms;
> glob_html_log := true;
> #END OF INITS AFTER INPUT BLOCK
> array_y:= Array(0..(max_terms + 1),[]);
> array_x:= Array(0..(max_terms + 1),[]);
> array_type_pole:= Array(0..(max_terms + 1),[]);
> array_y_init:= Array(0..(max_terms + 1),[]);
> array_m1:= Array(0..(max_terms + 1),[]);
> array_fact_1:= Array(0..(max_terms + 1),[]);
> array_tmp0:= Array(0..(max_terms + 1),[]);
> array_tmp1:= Array(0..(max_terms + 1),[]);
> array_tmp2:= Array(0..(max_terms + 1),[]);
> array_tmp3:= Array(0..(max_terms + 1),[]);
> array_tmp4:= Array(0..(max_terms + 1),[]);
> array_tmp5:= Array(0..(max_terms + 1),[]);
> array_tmp6:= Array(0..(max_terms + 1),[]);
> array_last_rel_error:= Array(0..(max_terms + 1),[]);
> array_pole:= Array(0..(max_terms + 1),[]);
> array_norms:= Array(0..(max_terms + 1),[]);
> array_1st_rel_error:= Array(0..(max_terms + 1),[]);
> array_real_pole := Array(0..(1+ 1) ,(0..3+ 1),[]);
> array_y_set_initial := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_y_higher_work2 := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_fact_2 := Array(0..(max_terms+ 1) ,(0..max_terms+ 1),[]);
> array_complex_pole := Array(0..(1+ 1) ,(0..3+ 1),[]);
> array_y_higher_work := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_poles := Array(0..(1+ 1) ,(0..3+ 1),[]);
> array_y_higher := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> term := 1;
> while (term <= max_terms) do # do number 2
> array_y[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_x[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> 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_y_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_fact_1[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_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_pole[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_1st_rel_error[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> ord := 1;
> while (ord <=1) 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_y_set_initial[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_y_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 <=max_terms) do # do number 2
> term := 1;
> while (term <= max_terms) do # do number 3
> array_fact_2[ord,term] := 0.0;
> term := term + 1;
> od;# end do number 3
> ;
> ord := ord + 1;
> od;# end do number 2
> ;
> ord := 1;
> while (ord <=1) 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
> ;
> ord := 1;
> while (ord <=2) do # do number 2
> term := 1;
> while (term <= max_terms) do # do number 3
> array_y_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 <=1) 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_y_higher[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_x := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_x[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_y := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_y[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_m1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_m1[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_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_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_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_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
> #Initing Factorial Tables
> iiif := 0;
> while (iiif <= glob_max_terms) do # do number 2
> jjjf := 0;
> while (jjjf <= glob_max_terms) do # do number 3
> array_fact_1[iiif] := 0;
> array_fact_2[iiif,jjjf] := 0;
> jjjf := jjjf + 1;
> od;# end do number 3
> ;
> iiif := iiif + 1;
> od;# end do number 2
> ;
> #Done Initing Factorial Tables
> #TOP SECOND INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> #END FIRST INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> x_start := -1.0;
> x_end := -0.7;
> array_y_init[0 + 1] := exact_soln_y(x_start);
> glob_h := 0.00001;
> glob_look_poles := true;
> glob_max_iter := 100;
> #END SECOND INPUT BLOCK
> #BEGIN OVERRIDE BLOCK
> glob_h := 0.00001 ;
> glob_look_poles := true;
> glob_max_iter := 100;
> glob_max_minutes := 1;
> #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 := expt(10.0 , (glob_log10_abserr));
> glob_relerr := expt(10.0 , (glob_log10_relerr));
> chk_data();
> #AFTER INITS AFTER SECOND INPUT BLOCK
> array_y_set_initial[1,1] := true;
> array_y_set_initial[1,2] := false;
> array_y_set_initial[1,3] := false;
> array_y_set_initial[1,4] := false;
> array_y_set_initial[1,5] := false;
> array_y_set_initial[1,6] := false;
> array_y_set_initial[1,7] := false;
> array_y_set_initial[1,8] := false;
> array_y_set_initial[1,9] := false;
> array_y_set_initial[1,10] := false;
> array_y_set_initial[1,11] := false;
> array_y_set_initial[1,12] := false;
> array_y_set_initial[1,13] := false;
> array_y_set_initial[1,14] := false;
> array_y_set_initial[1,15] := false;
> array_y_set_initial[1,16] := false;
> array_y_set_initial[1,17] := false;
> array_y_set_initial[1,18] := false;
> array_y_set_initial[1,19] := false;
> array_y_set_initial[1,20] := false;
> array_y_set_initial[1,21] := false;
> array_y_set_initial[1,22] := false;
> array_y_set_initial[1,23] := false;
> array_y_set_initial[1,24] := false;
> array_y_set_initial[1,25] := false;
> array_y_set_initial[1,26] := false;
> array_y_set_initial[1,27] := false;
> array_y_set_initial[1,28] := false;
> array_y_set_initial[1,29] := false;
> array_y_set_initial[1,30] := false;
> if (glob_html_log) then # if number 2
> html_log_file := fopen("html/entry.html",WRITE,TEXT);
> fi;# end if 2
> ;
> #BEGIN SOLUTION CODE
> omniout_str(ALWAYS,"START of Soultion");
> #Start Series -- INITIALIZE FOR SOLUTION
> array_x[1] := x_start;
> array_x[2] := glob_h;
> order_diff := 1;
> #Start Series array_y
> term_no := 1;
> while (term_no <= order_diff) do # do number 2
> array_y[term_no] := array_y_init[term_no] * expt(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_y_higher[r_order,term_no] := array_y_init[it]* expt(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();
> if (omniabs(array_y_higher[1,1]) > glob_small_float) then # if number 2
> tmp := omniabs(array_y_higher[1,1]);
> log10norm := (log10(tmp));
> if (log10norm < glob_log10normmin) then # if number 3
> glob_log10normmin := log10norm;
> fi;# end if 3
> fi;# end if 2
> ;
> 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_x[1] <= x_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;
> atomall();
> if (glob_look_poles) then # if number 2
> #left paren 0004C
> check_for_pole();
> fi;# end if 2
> ;#was right paren 0004C
> array_x[1] := array_x[1] + glob_h;
> array_x[2] := glob_h;
> #Jump Series array_y
> order_diff := 1;
> #START PART 1 SUM AND ADJUST
> #START SUM AND ADJUST EQ =1
> #sum_and_adjust array_y
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 2;
> calc_term := 1;
> #adjust_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> array_y_higher_work[2,iii] := array_y_higher[2,iii] / expt(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
> temp_sum := 0.0;
> ord := 2;
> calc_term := 1;
> #sum_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 3
> ;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , (calc_term - 1)) / (factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =1
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 1;
> calc_term := 2;
> #adjust_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(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
> temp_sum := 0.0;
> ord := 1;
> calc_term := 2;
> #sum_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 3
> ;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , (calc_term - 1)) / (factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =1
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 1;
> calc_term := 1;
> #adjust_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(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
> temp_sum := 0.0;
> ord := 1;
> calc_term := 1;
> #sum_subseriesarray_y
> iii := glob_max_terms;
> while (iii >= calc_term) do # do number 3
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 3
> ;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , (calc_term - 1)) / (factorial_1(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_y[term_no] := array_y_higher_work2[1,term_no];
> ord := 1;
> while (ord <= order_diff) do # do number 4
> array_y_higher[ord,term_no] := array_y_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 2
> omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!");
> fi;# end if 2
> ;
> if (elapsed_time_seconds() - convfloat(glob_orig_start_sec) >= convfloat(glob_max_sec )) then # if number 2
> omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!");
> fi;# end if 2
> ;
> glob_clock_sec := elapsed_time_seconds();
> omniout_str(INFO,"diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;");
> omniout_int(INFO,"Iterations ",32,glob_iter,4," ")
> ;
> prog_report(x_start,x_end);
> if (glob_html_log) then # if number 2
> logstart(html_log_file);
> logitem_str(html_log_file,"2012-08-21T18:34:03-05:00")
> ;
> logitem_str(html_log_file,"Maple")
> ;
> logitem_str(html_log_file,"sing5")
> ;
> logitem_str(html_log_file,"diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;")
> ;
> logitem_float(html_log_file,x_start)
> ;
> logitem_float(html_log_file,x_end)
> ;
> logitem_float(html_log_file,array_x[1])
> ;
> logitem_float(html_log_file,glob_h)
> ;
> logitem_integer(html_log_file,Digits)
> ;
> ;
> logitem_integer(html_log_file,glob_good_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 3
> 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 3
> ;
> logitem_time(html_log_file,convfloat(glob_clock_sec))
> ;
> if (glob_percent_done < 100.0) then # if number 3
> logitem_time(html_log_file,convfloat(glob_optimal_expect_sec))
> ;
> 0;
> else
> logitem_str(html_log_file,"Done")
> ;
> 0;
> fi;# end if 3
> ;
> log_revs(html_log_file," 123 | ")
> ;
> logitem_str(html_log_file,"sing5 diffeq.mxt")
> ;
> logitem_str(html_log_file,"sing5 maple results")
> ;
> logitem_str(html_log_file,"c c++ Maple and Maxima")
> ;
> logend(html_log_file)
> ;
> ;
> fi;# end if 2
> ;
> if (glob_html_log) then # if number 2
> fclose(html_log_file);
> fi;# end if 2
> ;
> ;;
> #END OUTFILEMAIN
>
> # End Function number 8
> end;
main := proc()
local d1, d2, d3, d4, est_err_2, niii, done_once, term, ord, order_diff,
term_no, html_log_file, iiif, jjjf, rows, r_order, sub_iter, calc_term, iii,
temp_sum, current_iter, x_start, x_end, it, log10norm, max_terms, opt_iter,
tmp, subiter;
global DEBUGL, DEBUGMASSIVE, glob_max_terms, INFO, ALWAYS, glob_iolevel,
glob_small_float, glob_log10_relerr, glob_large_float, glob_optimal_done,
glob_percent_done, glob_max_trunc_err, glob_relerr, glob_dump_analytic,
glob_initial_pass, glob_almost_1, min_in_hour, sec_in_minute,
glob_good_digits, glob_log10relerr, MAX_UNCHANGED, glob_abserr,
glob_last_good_h, glob_clock_start_sec, glob_clock_sec, glob_max_sec,
glob_unchanged_h_cnt, glob_log10_abserr, glob_hmin_init, glob_hmax,
glob_reached_optimal_h, glob_not_yet_finished, glob_orig_start_sec,
glob_optimal_start, glob_max_rel_trunc_err, glob_hmin,
glob_not_yet_start_msg, years_in_century, glob_log10normmin,
glob_max_minutes, glob_iter, glob_current_iter, glob_start, djd_debug2,
glob_display_flag, glob_dump, glob_html_log, glob_optimal_expect_sec,
glob_log10abserr, glob_max_hours, glob_look_poles, glob_smallish_float,
glob_no_eqs, glob_max_iter, glob_h, glob_disp_incr, centuries_in_millinium,
djd_debug, glob_max_opt_iter, glob_subiter_method, glob_normmax,
glob_curr_iter_when_opt, glob_warned, glob_optimal_clock_start_sec,
days_in_year, hours_in_day, glob_warned2, array_const_0D0, array_const_3D0,
array_const_1, array_y, array_x, array_type_pole, array_y_init, array_m1,
array_fact_1, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_tmp5, array_tmp6, array_last_rel_error, array_pole, array_norms,
array_1st_rel_error, array_real_pole, array_y_set_initial,
array_y_higher_work2, array_fact_2, array_complex_pole, array_y_higher_work,
array_poles, array_y_higher, glob_last;
glob_last;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
glob_iolevel := INFO;
DEBUGL := 3;
DEBUGMASSIVE := 4;
glob_max_terms := 30;
INFO := 2;
ALWAYS := 1;
glob_iolevel := 5;
glob_small_float := 0.1*10^(-50);
glob_log10_relerr := 0.1*10^(-10);
glob_large_float := 0.90*10^101;
glob_optimal_done := false;
glob_percent_done := 0.;
glob_max_trunc_err := 0.1*10^(-10);
glob_relerr := 0.1*10^(-10);
glob_dump_analytic := false;
glob_initial_pass := true;
glob_almost_1 := 0.9990;
min_in_hour := 60;
sec_in_minute := 60;
glob_good_digits := 0;
glob_log10relerr := 0.;
MAX_UNCHANGED := 10;
glob_abserr := 0.1*10^(-10);
glob_last_good_h := 0.1;
glob_clock_start_sec := 0.;
glob_clock_sec := 0.;
glob_max_sec := 10000.0;
glob_unchanged_h_cnt := 0;
glob_log10_abserr := 0.1*10^(-10);
glob_hmin_init := 0.001;
glob_hmax := 1.0;
glob_reached_optimal_h := false;
glob_not_yet_finished := true;
glob_orig_start_sec := 0.;
glob_optimal_start := 0.;
glob_max_rel_trunc_err := 0.1*10^(-10);
glob_hmin := 0.1*10^(-10);
glob_not_yet_start_msg := true;
years_in_century := 100;
glob_log10normmin := 0.1;
glob_max_minutes := 0.;
glob_iter := 0;
glob_current_iter := 0;
glob_start := 0;
djd_debug2 := true;
glob_display_flag := true;
glob_dump := false;
glob_html_log := true;
glob_optimal_expect_sec := 0.1;
glob_log10abserr := 0.;
glob_max_hours := 0.;
glob_look_poles := false;
glob_smallish_float := 0.1*10^(-100);
glob_no_eqs := 0;
glob_max_iter := 1000;
glob_h := 0.1;
glob_disp_incr := 0.1;
centuries_in_millinium := 10;
djd_debug := true;
glob_max_opt_iter := 10;
glob_subiter_method := 3;
glob_normmax := 0.;
glob_curr_iter_when_opt := 0;
glob_warned := false;
glob_optimal_clock_start_sec := 0.;
days_in_year := 365;
hours_in_day := 24;
glob_warned2 := false;
glob_orig_start_sec := elapsed_time_seconds();
MAX_UNCHANGED := 10;
glob_curr_iter_when_opt := 0;
glob_display_flag := true;
glob_no_eqs := 1;
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/sing5postode.ode#################");
omniout_str(ALWAYS, "diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;")
;
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
omniout_str(ALWAYS, "Digits := 32;");
omniout_str(ALWAYS, "max_terms := 30;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
omniout_str(ALWAYS, "x_start := -1.0;");
omniout_str(ALWAYS, "x_end := -0.7;");
omniout_str(ALWAYS, "array_y_init[0 + 1] := exact_soln_y(x_start);");
omniout_str(ALWAYS, "glob_h := 0.00001;");
omniout_str(ALWAYS, "glob_look_poles := true;");
omniout_str(ALWAYS, "glob_max_iter := 100;");
omniout_str(ALWAYS, "#END SECOND INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN OVERRIDE BLOCK");
omniout_str(ALWAYS, "glob_h := 0.00001 ;");
omniout_str(ALWAYS, "glob_look_poles := true;");
omniout_str(ALWAYS, "glob_max_iter := 100;");
omniout_str(ALWAYS, "glob_max_minutes := 1;");
omniout_str(ALWAYS, "#END OVERRIDE BLOCK");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN USER DEF BLOCK");
omniout_str(ALWAYS, "exact_soln_y := proc(x)");
omniout_str(ALWAYS, "return(1.0/x/x/x);");
omniout_str(ALWAYS, "end;");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
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_y := Array(0 .. max_terms + 1, []);
array_x := Array(0 .. max_terms + 1, []);
array_type_pole := Array(0 .. max_terms + 1, []);
array_y_init := Array(0 .. max_terms + 1, []);
array_m1 := Array(0 .. max_terms + 1, []);
array_fact_1 := Array(0 .. max_terms + 1, []);
array_tmp0 := Array(0 .. max_terms + 1, []);
array_tmp1 := Array(0 .. max_terms + 1, []);
array_tmp2 := Array(0 .. max_terms + 1, []);
array_tmp3 := Array(0 .. max_terms + 1, []);
array_tmp4 := Array(0 .. max_terms + 1, []);
array_tmp5 := Array(0 .. max_terms + 1, []);
array_tmp6 := Array(0 .. max_terms + 1, []);
array_last_rel_error := Array(0 .. max_terms + 1, []);
array_pole := Array(0 .. max_terms + 1, []);
array_norms := Array(0 .. max_terms + 1, []);
array_1st_rel_error := Array(0 .. max_terms + 1, []);
array_real_pole := Array(0 .. 2, 0 .. 4, []);
array_y_set_initial := Array(0 .. 3, 0 .. max_terms + 1, []);
array_y_higher_work2 := Array(0 .. 3, 0 .. max_terms + 1, []);
array_fact_2 := Array(0 .. max_terms + 1, 0 .. max_terms + 1, []);
array_complex_pole := Array(0 .. 2, 0 .. 4, []);
array_y_higher_work := Array(0 .. 3, 0 .. max_terms + 1, []);
array_poles := Array(0 .. 2, 0 .. 4, []);
array_y_higher := Array(0 .. 3, 0 .. max_terms + 1, []);
term := 1;
while term <= max_terms do array_y[term] := 0.; term := term + 1 end do
;
term := 1;
while term <= max_terms do array_x[term] := 0.; term := term + 1 end do
;
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_y_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_fact_1[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_last_rel_error[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_pole[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_1st_rel_error[term] := 0.; term := term + 1
end do;
ord := 1;
while ord <= 1 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_y_set_initial[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_y_higher_work2[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= max_terms do
term := 1;
while term <= max_terms do
array_fact_2[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 1 do
term := 1;
while term <= 3 do
array_complex_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_y_higher_work[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 1 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_y_higher[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
array_x := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_x[term] := 0.; term := term + 1
end do;
array_y := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_y[term] := 0.; term := term + 1
end do;
array_m1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_m1[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_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_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_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_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;
iiif := 0;
while iiif <= glob_max_terms do
jjjf := 0;
while jjjf <= glob_max_terms do
array_fact_1[iiif] := 0;
array_fact_2[iiif, jjjf] := 0;
jjjf := jjjf + 1
end do;
iiif := iiif + 1
end do;
x_start := -1.0;
x_end := -0.7;
array_y_init[1] := exact_soln_y(x_start);
glob_h := 0.00001;
glob_look_poles := true;
glob_max_iter := 100;
glob_h := 0.00001;
glob_look_poles := true;
glob_max_iter := 100;
glob_max_minutes := 1;
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 := expt(10.0, glob_log10_abserr);
glob_relerr := expt(10.0, glob_log10_relerr);
chk_data();
array_y_set_initial[1, 1] := true;
array_y_set_initial[1, 2] := false;
array_y_set_initial[1, 3] := false;
array_y_set_initial[1, 4] := false;
array_y_set_initial[1, 5] := false;
array_y_set_initial[1, 6] := false;
array_y_set_initial[1, 7] := false;
array_y_set_initial[1, 8] := false;
array_y_set_initial[1, 9] := false;
array_y_set_initial[1, 10] := false;
array_y_set_initial[1, 11] := false;
array_y_set_initial[1, 12] := false;
array_y_set_initial[1, 13] := false;
array_y_set_initial[1, 14] := false;
array_y_set_initial[1, 15] := false;
array_y_set_initial[1, 16] := false;
array_y_set_initial[1, 17] := false;
array_y_set_initial[1, 18] := false;
array_y_set_initial[1, 19] := false;
array_y_set_initial[1, 20] := false;
array_y_set_initial[1, 21] := false;
array_y_set_initial[1, 22] := false;
array_y_set_initial[1, 23] := false;
array_y_set_initial[1, 24] := false;
array_y_set_initial[1, 25] := false;
array_y_set_initial[1, 26] := false;
array_y_set_initial[1, 27] := false;
array_y_set_initial[1, 28] := false;
array_y_set_initial[1, 29] := false;
array_y_set_initial[1, 30] := false;
if glob_html_log then
html_log_file := fopen("html/entry.html", WRITE, TEXT)
end if;
omniout_str(ALWAYS, "START of Soultion");
array_x[1] := x_start;
array_x[2] := glob_h;
order_diff := 1;
term_no := 1;
while term_no <= order_diff do
array_y[term_no] := array_y_init[term_no]*expt(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_y_higher[r_order, term_no] := array_y_init[it]*
expt(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();
if glob_small_float < omniabs(array_y_higher[1, 1]) then
tmp := omniabs(array_y_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_x[1] <= x_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;
atomall();
if glob_look_poles then check_for_pole() end if;
array_x[1] := array_x[1] + glob_h;
array_x[2] := glob_h;
order_diff := 1;
ord := 2;
calc_term := 1;
iii := glob_max_terms;
while calc_term <= iii do
array_y_higher_work[2, iii] := array_y_higher[2, iii]/(
expt(glob_h, calc_term - 1)*
factorial_3(iii - calc_term, iii - 1));
iii := iii - 1
end do;
temp_sum := 0.;
ord := 2;
calc_term := 1;
iii := glob_max_terms;
while calc_term <= iii do
temp_sum := temp_sum + array_y_higher_work[ord, iii];
iii := iii - 1
end do;
array_y_higher_work2[ord, calc_term] :=
temp_sum*expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1)
;
ord := 1;
calc_term := 2;
iii := glob_max_terms;
while calc_term <= iii do
array_y_higher_work[1, iii] := array_y_higher[1, iii]/(
expt(glob_h, calc_term - 1)*
factorial_3(iii - calc_term, iii - 1));
iii := iii - 1
end do;
temp_sum := 0.;
ord := 1;
calc_term := 2;
iii := glob_max_terms;
while calc_term <= iii do
temp_sum := temp_sum + array_y_higher_work[ord, iii];
iii := iii - 1
end do;
array_y_higher_work2[ord, calc_term] :=
temp_sum*expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1)
;
ord := 1;
calc_term := 1;
iii := glob_max_terms;
while calc_term <= iii do
array_y_higher_work[1, iii] := array_y_higher[1, iii]/(
expt(glob_h, calc_term - 1)*
factorial_3(iii - calc_term, iii - 1));
iii := iii - 1
end do;
temp_sum := 0.;
ord := 1;
calc_term := 1;
iii := glob_max_terms;
while calc_term <= iii do
temp_sum := temp_sum + array_y_higher_work[ord, iii];
iii := iii - 1
end do;
array_y_higher_work2[ord, calc_term] :=
temp_sum*expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1)
;
term_no := glob_max_terms;
while 1 <= term_no do
array_y[term_no] := array_y_higher_work2[1, term_no];
ord := 1;
while ord <= order_diff do
array_y_higher[ord, term_no] :=
array_y_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 ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;");
omniout_int(INFO, "Iterations ", 32, glob_iter, 4,
" ");
prog_report(x_start, x_end);
if glob_html_log then
logstart(html_log_file);
logitem_str(html_log_file, "2012-08-21T18:34:03-05:00");
logitem_str(html_log_file, "Maple");
logitem_str(html_log_file, "sing5");
logitem_str(html_log_file,
"diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;");
logitem_float(html_log_file, x_start);
logitem_float(html_log_file, x_end);
logitem_float(html_log_file, array_x[1]);
logitem_float(html_log_file, glob_h);
logitem_integer(html_log_file, Digits);
logitem_integer(html_log_file, glob_good_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, " 123 | ");
logitem_str(html_log_file,
"sing5 diffeq.mxt");
logitem_str(html_log_file,
"sing5 maple results");
logitem_str(html_log_file, "c c++ Maple and Maxima");
logend(html_log_file)
end if;
if glob_html_log then fclose(html_log_file) end if
end proc
> main();
##############ECHO OF PROBLEM#################
##############temp/sing5postode.ode#################
diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;
!
#BEGIN FIRST INPUT BLOCK
Digits := 32;
max_terms := 30;
!
#END FIRST INPUT BLOCK
#BEGIN SECOND INPUT BLOCK
x_start := -1.0;
x_end := -0.7;
array_y_init[0 + 1] := exact_soln_y(x_start);
glob_h := 0.00001;
glob_look_poles := true;
glob_max_iter := 100;
#END SECOND INPUT BLOCK
#BEGIN OVERRIDE BLOCK
glob_h := 0.00001 ;
glob_look_poles := true;
glob_max_iter := 100;
glob_max_minutes := 1;
#END OVERRIDE BLOCK
!
#BEGIN USER DEF BLOCK
exact_soln_y := proc(x)
return(1.0/x/x/x);
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
x[1] = -1
y[1] (analytic) = -1
y[1] (numeric) = -1
absolute error = 0
relative error = 0 %
Correct digits = 32
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.002
Order of pole = 2.082
x[1] = -0.99999
y[1] (analytic) = -1.000030000600010000150002100028
y[1] (numeric) = -1.00003000060001000015000210063
absolute error = 6.020e-28
relative error = 6.0198194018059939800000000000000e-26 %
Correct digits = 27
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.002
Order of pole = 2.082
x[1] = -0.99998
y[1] (analytic) = -1.000060002400080002400067201792
y[1] (numeric) = -1.0000600024000800024000672029961
absolute error = 1.2041e-27
relative error = 1.2040277554449103672000000000001e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.002
Order of pole = 2.082
x[1] = -0.99997
y[1] (analytic) = -1.0000900054002700121505103204128
y[1] (numeric) = -1.000090005400270012150510322219
absolute error = 1.8062e-27
relative error = 1.8060374468766912326000000000000e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.002
Order of pole = 2.082
x[1] = -0.99996
y[1] (analytic) = -1.0001200096006400384021505146939
y[1] (numeric) = -1.0001200096006400384021505171023
absolute error = 2.4084e-27
relative error = 2.4081110035601658624000000000000e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.002
Order of pole = 2.082
x[1] = -0.99995
y[1] (analytic) = -1.0001500150012500937565629375282
y[1] (numeric) = -1.0001500150012500937565629405388
absolute error = 3.0106e-27
relative error = 3.0101484325791236749999999999998e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99994
y[1] (analytic) = -1.0001800216021601944163309064688
y[1] (numeric) = -1.0001800216021601944163309100817
absolute error = 3.6129e-27
relative error = 3.6122497170185396135999999999999e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99993
y[1] (analytic) = -1.0002100294034303601852979944685
y[1] (numeric) = -1.0002100294034303601852979986837
absolute error = 4.2152e-27
relative error = 4.2143148699619941864000000000000e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99992
y[1] (analytic) = -1.0002400384051206144688201407871
y[1] (numeric) = -1.0002400384051206144688201456046
absolute error = 4.8175e-27
relative error = 4.8163438924935334399999999999998e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.666
Order of pole = 0.7218
x[1] = -0.99991
y[1] (analytic) = -1.00027004860729098427401778207
y[1] (numeric) = -1.0002700486072909842740177874901
absolute error = 5.4201e-27
relative error = 5.4186367047044787471000000000003e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9999
y[1] (analytic) = -1.0003000600100015002100280036005
y[1] (numeric) = -1.000300060010001500210028009623
absolute error = 6.0225e-27
relative error = 6.0206934306689774999999999999997e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99989
y[1] (analytic) = -1.0003300726133121964882567107244
y[1] (numeric) = -1.0003300726133121964882567173494
absolute error = 6.6250e-27
relative error = 6.6228139904786821249999999999996e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99988
y[1] (analytic) = -1.0003600864172831109226308204535
y[1] (numeric) = -1.000360086417283110922630827681
absolute error = 7.2275e-27
relative error = 7.2248984122155108799999999999992e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
memory used=3.8MB, alloc=3.1MB, time=0.49
x[1] = -0.99987
y[1] (analytic) = -1.0003901014219742849298504732451
y[1] (numeric) = -1.0003901014219742849298504810754
absolute error = 7.8303e-27
relative error = 7.8272465799790068309000000000003e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99986
y[1] (analytic) = -1.0004201176274457635296412649635
y[1] (numeric) = -1.0004201176274457635296412733965
absolute error = 8.4330e-27
relative error = 8.4294586358372598480000000000000e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.6343
Order of pole = 0.7012
x[1] = -0.99985
y[1] (analytic) = -1.0004501350337575953450064990209
y[1] (numeric) = -1.0004501350337575953450065080567
absolute error = 9.0358e-27
relative error = 9.0317344998860041750000000000001e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99984
y[1] (analytic) = -1.0004801536409698326024794587041
y[1] (numeric) = -1.0004801536409698326024794683427
absolute error = 9.6386e-27
relative error = 9.6339742122050002944000000000000e-25 %
Correct digits = 26
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99983
y[1] (analytic) = -1.0005101734491425311323756996853
y[1] (numeric) = -1.0005101734491425311323757099268
absolute error = 1.02415e-26
relative error = 1.0236277722887733510500000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99982
y[1] (analytic) = -1.0005401944583357503690453627208
y[1] (numeric) = -1.0005401944583357503690453735652
absolute error = 1.08444e-26
relative error = 1.0838545078012435459200000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.9771
Order of pole = 0.9775
x[1] = -0.99981
y[1] (analytic) = -1.0005702166686095533511255065382
y[1] (numeric) = -1.0005702166686095533511255179856
absolute error = 1.14474e-26
relative error = 1.1440876221674902283400000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9998
y[1] (analytic) = -1.0006002400800240067217924609153
y[1] (numeric) = -1.0006002400800240067217924729656
absolute error = 1.20503e-26
relative error = 1.2043071265939597599999999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99979
y[1] (analytic) = -1.0006302646926391807290141999502
y[1] (numeric) = -1.0006302646926391807290142126036
absolute error = 1.26534e-26
relative error = 1.2645430031927636862599999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.8022
Order of pole = 0.8219
x[1] = -0.99978
y[1] (analytic) = -1.0006602905065151492258027355279
y[1] (numeric) = -1.0006602905065151492258027487845
absolute error = 1.32566e-26
relative error = 1.3247852568717163723199999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99977
y[1] (analytic) = -1.0006903175217119896704665309816
y[1] (numeric) = -1.0006903175217119896704665448415
absolute error = 1.38599e-26
relative error = 1.3850338868397496596700000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99976
y[1] (analytic) = -1.0007203457382897831268629349532
y[1] (numeric) = -1.0007203457382897831268629494163
absolute error = 1.44631e-26
relative error = 1.4452689067023742105600000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.3357
Order of pole = 0.5564
x[1] = -0.99975
y[1] (analytic) = -1.0007503751563086142646506354525
y[1] (numeric) = -1.0007503751563086142646506505189
absolute error = 1.50664e-26
relative error = 1.5055103024714587500000000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99974
y[1] (analytic) = -1.0007804057758285713595421341197
y[1] (numeric) = -1.0007804057758285713595421497895
absolute error = 1.56698e-26
relative error = 1.5657580733560027595200000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99973
y[1] (analytic) = -1.0008104375969097462935562406905
y[1] (numeric) = -1.0008104375969097462935562569637
absolute error = 1.62732e-26
relative error = 1.6260022266628534604400000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99972
y[1] (analytic) = -1.0008404706196122345552705876669
y[1] (numeric) = -1.0008404706196122345552706045436
absolute error = 1.68767e-26
relative error = 1.6862527541029362681600000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99971
y[1] (analytic) = -1.0008705048439961352400741651954
y[1] (numeric) = -1.0008705048439961352400741826755
absolute error = 1.74801e-26
relative error = 1.7464896722802907841100000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9997
y[1] (analytic) = -1.0009005402701215510504198761535
y[1] (numeric) = -1.0009005402701215510504198942372
absolute error = 1.80837e-26
relative error = 1.8067429552110740100000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99969
y[1] (analytic) = -1.0009305768980485882960771114485
y[1] (numeric) = -1.0009305768980485882960771301358
absolute error = 1.86873e-26
relative error = 1.8669926197991876645700000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99968
y[1] (analytic) = -1.0009606147278373568943843455276
y[1] (numeric) = -1.0009606147278373568943843648185
absolute error = 1.92909e-26
relative error = 1.9272386661532355788799999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99967
y[1] (analytic) = -1.0009906537595479703705017521029
y[1] (numeric) = -1.0009906537595479703705017719976
absolute error = 1.98947e-26
relative error = 1.9875010745883534166099999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99966
y[1] (analytic) = -1.0010206939932405458576638400934
y[1] (numeric) = -1.001020693993240545857663860592
absolute error = 2.04986e-26
relative error = 2.0477698536108803025600000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
memory used=7.6MB, alloc=4.1MB, time=1.10
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99965
y[1] (analytic) = -1.0010507354289752040974321097846
y[1] (numeric) = -1.001050735428975204097432130887
absolute error = 2.11024e-26
relative error = 2.1080250234227234600000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99964
y[1] (analytic) = -1.0010807780668120694399477292077
y[1] (numeric) = -1.0010807780668120694399477509139
absolute error = 2.17062e-26
relative error = 2.1682765742357835532799999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99963
y[1] (analytic) = -1.0011108219068112698441842307411
y[1] (numeric) = -1.0011108219068112698441842530513
absolute error = 2.23102e-26
relative error = 2.2285444839669061439399999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99962
y[1] (analytic) = -1.0011408669490329368782002279359
y[1] (numeric) = -1.0011408669490329368782002508501
absolute error = 2.29142e-26
relative error = 2.2888087737174092017600000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99961
y[1] (analytic) = -1.001170913193537205719392152566
y[1] (numeric) = -1.0011709131935372057193921760842
absolute error = 2.35182e-26
relative error = 2.3490694435959583894199999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9996
y[1] (analytic) = -1.0012009606403842151547470119056
y[1] (numeric) = -1.001200960640384215154747036028
absolute error = 2.41224e-26
relative error = 2.4093464697208166400000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99959
y[1] (analytic) = -1.0012310092896341075810951662369
y[1] (numeric) = -1.0012310092896341075810951909633
absolute error = 2.47264e-26
relative error = 2.4695998995819351785599999999997e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99958
y[1] (analytic) = -1.0012610591413470290053631265863
y[1] (numeric) = -1.001261059141347029005363151917
absolute error = 2.53307e-26
relative error = 2.5298796721129739098400000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99957
y[1] (analytic) = -1.0012911101955831290448263726966
y[1] (numeric) = -1.0012911101955831290448263986316
absolute error = 2.59350e-26
relative error = 2.5901558234082485954999999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99956
y[1] (analytic) = -1.0013211624524025609273621912304
y[1] (numeric) = -1.0013211624524025609273622177699
absolute error = 2.65395e-26
relative error = 2.6504483271880859232000000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.8311
Order of pole = 0.8456
x[1] = -0.99955
y[1] (analytic) = -1.0013512159118654814917025342128
y[1] (numeric) = -1.0013512159118654814917025613566
absolute error = 2.71438e-26
relative error = 2.7107172357385021225000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99954
y[1] (analytic) = -1.0013812705740320511876868977096
y[1] (numeric) = -1.0013812705740320511876869254578
absolute error = 2.77482e-26
relative error = 2.7709925095856461204800000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99953
y[1] (analytic) = -1.0014113264389624340765152207478
y[1] (numeric) = -1.0014113264389624340765152491004
absolute error = 2.83526e-26
relative error = 2.8312641620324368010199999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99952
y[1] (analytic) = -1.0014413835067167978310008044764
y[1] (numeric) = -1.0014413835067167978310008334336
absolute error = 2.89572e-26
relative error = 2.8915521644014205337600000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99951
y[1] (analytic) = -1.001471441777355313735823251572
y[1] (numeric) = -1.0014714417773553137358232811338
absolute error = 2.95618e-26
relative error = 2.9518365443886623791800000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9995
y[1] (analytic) = -1.0015015012509381566877814258887
y[1] (numeric) = -1.0015015012509381566877814560552
absolute error = 3.01665e-26
relative error = 3.0121272871104187500000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99949
y[1] (analytic) = -1.0015315619275255051960464323562
y[1] (numeric) = -1.0015315619275255051960464631274
absolute error = 3.07712e-26
relative error = 3.0724144070685529548800000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99948
y[1] (analytic) = -1.0015616238071775413824146171267
y[1] (numeric) = -1.0015616238071775413824146485026
absolute error = 3.13759e-26
relative error = 3.1326979043718377452799999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99947
y[1] (analytic) = -1.0015916868899544509815605879726
y[1] (numeric) = -1.0015916868899544509815606199533
absolute error = 3.19807e-26
relative error = 3.1929877632374699326099999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99946
y[1] (analytic) = -1.0016217511759164233412902549373
y[1] (numeric) = -1.0016217511759164233412902875229
absolute error = 3.25856e-26
relative error = 3.2532839828751821081600000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99945
y[1] (analytic) = -1.0016518166651236514227938912405
y[1] (numeric) = -1.0016518166651236514227939244311
absolute error = 3.31906e-26
relative error = 3.3135865624947413925000000000002e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99944
y[1] (analytic) = -1.0016818833576363318008992144398
y[1] (numeric) = -1.0016818833576363318008992482354
absolute error = 3.37956e-26
relative error = 3.3738855180965431910400000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
memory used=11.4MB, alloc=4.3MB, time=1.74
x[1] = -0.99943
y[1] (analytic) = -1.0017119512535146646643244878503
y[1] (numeric) = -1.001711951253514664664324522251
absolute error = 3.44007e-26
relative error = 3.4341908326991521164900000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99942
y[1] (analytic) = -1.001742020352818853815931642225
y[1] (numeric) = -1.0017420203528188538159316772308
absolute error = 3.50058e-26
relative error = 3.4944925229023308350400000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.4652
Order of pole = 0.6083
x[1] = -0.99941
y[1] (analytic) = -1.0017720906556091066729794176963
y[1] (numeric) = -1.0017720906556091066729794533073
absolute error = 3.56110e-26
relative error = 3.5548005711253548431000000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9994
y[1] (analytic) = -1.0018021621619456342673765259818
y[1] (numeric) = -1.0018021621619456342673765621981
absolute error = 3.62163e-26
relative error = 3.6151149765781279200000000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99939
y[1] (analytic) = -1.0018322348718886512459348328555
y[1] (numeric) = -1.001832234871888651245934869677
absolute error = 3.68215e-26
relative error = 3.6754157750482669108500000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99938
y[1] (analytic) = -1.0018623087854983758706225608857
y[1] (numeric) = -1.0018623087854983758706225983126
absolute error = 3.74269e-26
relative error = 3.7357329117781201776800000000004e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99937
y[1] (analytic) = -1.0018923839028350300188175124436
y[1] (numeric) = -1.0018923839028350300188175504758
absolute error = 3.80322e-26
relative error = 3.7960364417430702486600000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99936
y[1] (analytic) = -1.0019224602239588391835603129809
y[1] (numeric) = -1.0019224602239588391835603516186
absolute error = 3.86377e-26
relative error = 3.8563563083877118771200000000002e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99935
y[1] (analytic) = -1.0019525377489300324738076745823
y[1] (numeric) = -1.0019525377489300324738077138255
absolute error = 3.92432e-26
relative error = 3.9166725489978836200000000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99934
y[1] (analytic) = -1.0019826164778088426146856797911
y[1] (numeric) = -1.0019826164778088426146857196398
absolute error = 3.98487e-26
relative error = 3.9769851636824818144800000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99933
y[1] (analytic) = -1.002012696410655505947743085712
y[1] (numeric) = -1.0020126964106555059477431261663
absolute error = 4.04543e-26
relative error = 4.0373041324638653369100000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.2254
Order of pole = 0.5254
x[1] = -0.99932
y[1] (analytic) = -1.0020427775475302624312046483924
y[1] (numeric) = -1.0020427775475302624312046894523
absolute error = 4.10599e-26
relative error = 4.0976194749382733523200000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99931
y[1] (analytic) = -1.0020728598884933556402244674831
y[1] (numeric) = -1.0020728598884933556402245091487
absolute error = 4.16656e-26
relative error = 4.1579411705288955409600000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9993
y[1] (analytic) = -1.0021029434336050327671393511817
y[1] (numeric) = -1.0021029434336050327671393934531
absolute error = 4.22714e-26
relative error = 4.2182692184458909800000000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99929
y[1] (analytic) = -1.0021330281829255446217222014597
y[1] (numeric) = -1.0021330281829255446217222443369
absolute error = 4.28772e-26
relative error = 4.2785936391843338470800000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.7664
Order of pole = 0.7941
x[1] = -0.99928
y[1] (analytic) = -1.0021631141365151456314354195746
y[1] (numeric) = -1.0021631141365151456314354630576
absolute error = 4.34830e-26
relative error = 4.3389144328531657215999999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99927
y[1] (analytic) = -1.0021932012944340938416843318701
y[1] (numeric) = -1.002193201294434093841684375959
absolute error = 4.40889e-26
relative error = 4.3992415776773098388699999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99926
y[1] (analytic) = -1.0022232896567426509160706358656
y[1] (numeric) = -1.0022232896567426509160706805605
absolute error = 4.46949e-26
relative error = 4.4595750728670273842400000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99925
y[1] (analytic) = -1.0022533792235010821366458666365
y[1] (numeric) = -1.0022533792235010821366459119374
absolute error = 4.53009e-26
relative error = 4.5199049401157432812499999999997e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99924
y[1] (analytic) = -1.0022834699947696564041648834872
y[1] (numeric) = -1.0022834699947696564041649293942
absolute error = 4.59070e-26
relative error = 4.5802411567497528767999999999996e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99923
y[1] (analytic) = -1.0023135619706086462383393769195
y[1] (numeric) = -1.0023135619706086462383394234328
absolute error = 4.65133e-26
relative error = 4.6405936988971853611100000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99922
y[1] (analytic) = -1.0023436551510783277780913958977
y[1] (numeric) = -1.0023436551510783277780914430172
absolute error = 4.71195e-26
relative error = 4.7009326350150747036000000000002e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.3838
Order of pole = 0.5738
x[1] = -0.99921
y[1] (analytic) = -1.0023737495362389807818068954108
y[1] (numeric) = -1.0023737495362389807818069431365
absolute error = 4.77257e-26
relative error = 4.7612679424297478597699999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
memory used=15.2MB, alloc=4.3MB, time=2.37
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9992
y[1] (analytic) = -1.0024038451261508886275893043363
y[1] (numeric) = -1.0024038451261508886275893526683
absolute error = 4.83320e-26
relative error = 4.8216095972694015999999999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.4301
Order of pole = 0.5926
x[1] = -0.99919
y[1] (analytic) = -1.0024339419208743383135131136059
y[1] (numeric) = -1.0024339419208743383135131625443
absolute error = 4.89384e-26
relative error = 4.8819575987444847765599999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99918
y[1] (analytic) = -1.0024640399204696204578774846744
y[1] (numeric) = -1.0024640399204696204578775342193
absolute error = 4.95449e-26
relative error = 4.9423119460654807576800000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99917
y[1] (analytic) = -1.0024941391249970292994598782953
y[1] (numeric) = -1.0024941391249970292994599284466
absolute error = 5.01513e-26
relative error = 5.0026526882015848626899999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99916
y[1] (analytic) = -1.0025242395345168626977697036025
y[1] (numeric) = -1.0025242395345168626977697543604
absolute error = 5.07579e-26
relative error = 5.0630097506238309638400000000004e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99915
y[1] (analytic) = -1.0025543411490894221333019875037
y[1] (numeric) = -1.0025543411490894221333020388681
absolute error = 5.13644e-26
relative error = 5.1233532080792837850000000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99914
y[1] (analytic) = -1.0025844439687750127077910643822
y[1] (numeric) = -1.0025844439687750127077911163532
absolute error = 5.19710e-26
relative error = 5.1837030100198333623999999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99913
y[1] (analytic) = -1.0026145479936339431444642861141
y[1] (numeric) = -1.0026145479936339431444643386919
absolute error = 5.25778e-26
relative error = 5.2440691295787820966600000000003e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99912
y[1] (analytic) = -1.0026446532237265257882957523997
y[1] (numeric) = -1.0026446532237265257882958055841
absolute error = 5.31844e-26
relative error = 5.3044116705754400563199999999997e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99911
y[1] (analytic) = -1.0026747596591130766062600614103
y[1] (numeric) = -1.0026747596591130766062601152015
absolute error = 5.37912e-26
relative error = 5.3647705282107431527199999999996e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.9991
y[1] (analytic) = -1.0027048672998539151875860807557
y[1] (numeric) = -1.0027048672998539151875861351537
absolute error = 5.43980e-26
relative error = 5.4251257547483857999999999999995e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99909
y[1] (analytic) = -1.0027349761460093647440107387705
y[1] (numeric) = -1.0027349761460093647440107937755
absolute error = 5.50050e-26
relative error = 5.4854972957471327144999999999999e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99908
y[1] (analytic) = -1.0027650861976397521100328361233
y[1] (numeric) = -1.0027650861976397521100328917354
absolute error = 5.56121e-26
relative error = 5.5458751770939845075200000000004e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99907
y[1] (analytic) = -1.0027951974548054077431668777499
y[1] (numeric) = -1.0027951974548054077431669339689
absolute error = 5.62190e-26
relative error = 5.6062294816219153817000000000000e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99906
y[1] (analytic) = -1.0028253099175666657241969251115
y[1] (numeric) = -1.0028253099175666657241969819375
absolute error = 5.68260e-26
relative error = 5.6665901267162033615999999999998e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99905
y[1] (analytic) = -1.002855423585983863757430468782
y[1] (numeric) = -1.0028554235859838637574305262152
absolute error = 5.74332e-26
relative error = 5.7269670831147210150000000000004e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99904
y[1] (analytic) = -1.0028855384601173431709523213643
y[1] (numeric) = -1.0028855384601173431709523794046
absolute error = 5.80403e-26
relative error = 5.7873304354471097139199999999997e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Complex estimate of poles used
Radius of convergence = 0.7574
Order of pole = 0.7874
x[1] = -0.99903
y[1] (analytic) = -1.0029156545400274489168785307367
y[1] (numeric) = -1.0029156545400274489168785893843
absolute error = 5.86476e-26
relative error = 5.8477100975054438965200000000002e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99902
y[1] (analytic) = -1.002945771825774529571610313635
y[1] (numeric) = -1.0029457718257745295716103728899
absolute error = 5.92549e-26
relative error = 5.9080861263447642159200000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.99901
y[1] (analytic) = -1.0029758903174189373360880095671
y[1] (numeric) = -1.0029758903174189373360880694293
absolute error = 5.98622e-26
relative error = 5.9684585220742427202200000000001e-24 %
Correct digits = 25
h = 1e-05
TOP MAIN SOLVE Loop
Real estimate of pole used
Radius of convergence = 1.001
Order of pole = 2.082
x[1] = -0.999
y[1] (analytic) = -1.0030060100150210280360450550661
y[1] (numeric) = -1.0030060100150210280360451155357
absolute error = 6.04696e-26
relative error = 6.0288372548330399999999999999999e-24 %
Correct digits = 25
h = 1e-05
Finished!
Maximum Iterations Reached before Solution Completed!
diff ( y , x , 1 ) = m1 * 3.0 / x / x / x / x ;
Iterations = 100
Total Elapsed Time = 2 Seconds
Elapsed Time(since restart) = 2 Seconds
Expected Time Remaining = 14 Minutes 5 Seconds
Optimized Time Remaining = 13 Minutes 55 Seconds
Time to Timeout = 57 Seconds
Percent Done = 0.3367 %
> quit
memory used=18.9MB, alloc=4.3MB, time=2.96