|\^/| 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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> glob_last;
>
> local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no;
>
>
>
>
>
> #TOP DISPLAY ALOT
> if (iter >= 0) then # if number 1
> ind_var := array_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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, 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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> 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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, 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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> glob_last;
>
> local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec;
>
>
>
>
>
> #TOP PROGRESS REPORT
> clock_sec1 := elapsed_time_seconds();
> total_clock_sec := convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
> glob_clock_sec := convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
> left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec) - convfloat(clock_sec1);
> expect_sec := comp_expect_sec(convfloat(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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, glob_last;
clock_sec1 := elapsed_time_seconds();
total_clock_sec :=
convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
glob_clock_sec :=
convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec)
- convfloat(clock_sec1);
expect_sec := comp_expect_sec(convfloat(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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> glob_last;
>
> local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found;
>
>
>
>
>
> #TOP CHECK FOR POLE
> #IN RADII REAL EQ = 1
> #Computes radius of convergence and r_order of pole from 3 adjacent Taylor series terms. EQUATUON NUMBER 1
> #Applies to pole of arbitrary r_order on the real axis,
> #Due to Prof. George Corliss.
> n := glob_max_terms;
> m := n - 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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, 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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> 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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, 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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> glob_last;
>
> local kkk, order_d, adj2, temporary, term;
>
>
>
>
>
> #TOP ATOMALL
> #END OUTFILE1
> #BEGIN ATOMHDR1
> #emit pre mult CONST - LINEAR $eq_no = 1 i = 1
> array_tmp1[1] := array_const_0D1[1] * array_x[1];
> #emit pre add LINEAR - CONST $eq_no = 1 i = 1
> array_tmp2[1] := array_tmp1[1] + array_const_0D2[1];
> omniout_str(ALWAYS,"WARNING: arccos of linear function has low precision in testing.");
> #emit pre acos ID_LINEAR iii = 1 $eq_no = 1
> #emit pre acos 1 $eq_no = 1
> array_tmp3[1] := arccos(array_tmp2[1]);
> array_tmp3_a1[1] := sin(array_tmp3[1]);
> #emit pre add CONST FULL $eq_no = 1 i = 1
> array_tmp4[1] := array_const_0D0[1] + array_tmp3[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_tmp4[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 CONST - LINEAR $eq_no = 1 i = 2
> array_tmp1[2] := array_const_0D1[1] * array_x[2];
> #emit pre add LINEAR - CONST $eq_no = 1 i = 2
> array_tmp2[2] := array_tmp1[2];
> #emit pre acos ID_LINEAR iii = 2 $eq_no = 1
> #emit pre acos 1 $eq_no = 1
> array_tmp3[2] := - array_tmp2[2] / array_tmp3_a1[1];
> array_tmp3_a1[2] := array_tmp2[1] * array_tmp3[2];
> #emit pre add CONST FULL $eq_no = 1 i = 2
> array_tmp4[2] := array_tmp3[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_tmp4[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 acos ID_LINEAR iii = 3 $eq_no = 1
> array_tmp3[3] := att(2,array_tmp3_a1,array_tmp3,2) / array_tmp3_a1[1];
> array_tmp3_a1[3] := array_tmp3[3] * array_tmp2[1] + array_tmp3[2] * array_tmp2[2] * 1 / 2;
> #emit pre add CONST FULL $eq_no = 1 i = 3
> array_tmp4[3] := array_tmp3[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_tmp4[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 acos ID_LINEAR iii = 4 $eq_no = 1
> array_tmp3[4] := att(3,array_tmp3_a1,array_tmp3,2) / array_tmp3_a1[1];
> array_tmp3_a1[4] := array_tmp3[4] * array_tmp2[1] + array_tmp3[3] * array_tmp2[2] * 2 / 3;
> #emit pre add CONST FULL $eq_no = 1 i = 4
> array_tmp4[4] := array_tmp3[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_tmp4[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 acos ID_LINEAR iii = 5 $eq_no = 1
> array_tmp3[5] := att(4,array_tmp3_a1,array_tmp3,2) / array_tmp3_a1[1];
> array_tmp3_a1[5] := array_tmp3[5] * array_tmp2[1] + array_tmp3[4] * array_tmp2[2] * 3 / 4;
> #emit pre add CONST FULL $eq_no = 1 i = 5
> array_tmp4[5] := array_tmp3[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_tmp4[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 acos ID_LINEAR $eq_no = 1
> array_tmp3[kkk] := att(kkk-1,array_tmp3_a1,array_tmp3,2)/array_tmp3_a1[1];
> array_tmp3_a1[kkk] := array_tmp3[kkk] * array_tmp2[1] + array_tmp3[kkk-1] * array_tmp2[2] * (kkk - 2) / (kkk - 1);
> #emit NOT FULL - FULL add $eq_no = 1
> array_tmp4[kkk] := array_tmp3[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_tmp4[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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, glob_last;
array_tmp1[1] := array_const_0D1[1]*array_x[1];
array_tmp2[1] := array_tmp1[1] + array_const_0D2[1];
omniout_str(ALWAYS,
"WARNING: arccos of linear function has low precision in testing.")
;
array_tmp3[1] := arccos(array_tmp2[1]);
array_tmp3_a1[1] := sin(array_tmp3[1]);
array_tmp4[1] := array_const_0D0[1] + array_tmp3[1];
if not array_y_set_initial[1, 2] then
if 1 <= glob_max_terms then
temporary := array_tmp4[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_const_0D1[1]*array_x[2];
array_tmp2[2] := array_tmp1[2];
array_tmp3[2] := -array_tmp2[2]/array_tmp3_a1[1];
array_tmp3_a1[2] := array_tmp2[1]*array_tmp3[2];
array_tmp4[2] := array_tmp3[2];
if not array_y_set_initial[1, 3] then
if 2 <= glob_max_terms then
temporary := array_tmp4[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_tmp3[3] := att(2, array_tmp3_a1, array_tmp3, 2)/array_tmp3_a1[1];
array_tmp3_a1[3] :=
array_tmp3[3]*array_tmp2[1] + 1/2*array_tmp3[2]*array_tmp2[2];
array_tmp4[3] := array_tmp3[3];
if not array_y_set_initial[1, 4] then
if 3 <= glob_max_terms then
temporary := array_tmp4[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_tmp3[4] := att(3, array_tmp3_a1, array_tmp3, 2)/array_tmp3_a1[1];
array_tmp3_a1[4] :=
array_tmp3[4]*array_tmp2[1] + 2/3*array_tmp3[3]*array_tmp2[2];
array_tmp4[4] := array_tmp3[4];
if not array_y_set_initial[1, 5] then
if 4 <= glob_max_terms then
temporary := array_tmp4[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_tmp3[5] := att(4, array_tmp3_a1, array_tmp3, 2)/array_tmp3_a1[1];
array_tmp3_a1[5] :=
array_tmp3[5]*array_tmp2[1] + 3/4*array_tmp3[4]*array_tmp2[2];
array_tmp4[5] := array_tmp3[5];
if not array_y_set_initial[1, 6] then
if 5 <= glob_max_terms then
temporary := array_tmp4[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_tmp3[kkk] :=
att(kkk - 1, array_tmp3_a1, array_tmp3, 2)/array_tmp3_a1[1];
array_tmp3_a1[kkk] := array_tmp3[kkk]*array_tmp2[1]
+ array_tmp3[kkk - 1]*array_tmp2[2]*(kkk - 2)/(kkk - 1);
array_tmp4[kkk] := array_tmp3[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_tmp4[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(10.0 * (0.1 * x + 0.2) * arccos(0.1 * x + 0.2 ) - 10.0 * sqrt(1.0 -
> expt((0.1 * x + 0.2) , 2 )));
> end;
exact_soln_y := proc(x)
return 10.0*(0.1*x + 0.2)*arccos(0.1*x + 0.2)
- 10.0*sqrt(1.0 - expt(0.1*x + 0.2, 2))
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
> glob_iolevel,
> DEBUGMASSIVE,
> INFO,
> glob_max_terms,
> DEBUGL,
> ALWAYS,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> min_in_hour,
> glob_subiter_method,
> glob_current_iter,
> glob_disp_incr,
> sec_in_minute,
> glob_log10normmin,
> glob_unchanged_h_cnt,
> glob_max_rel_trunc_err,
> glob_relerr,
> glob_dump_analytic,
> glob_no_eqs,
> glob_look_poles,
> glob_last_good_h,
> glob_not_yet_start_msg,
> glob_not_yet_finished,
> glob_html_log,
> glob_max_hours,
> glob_hmin,
> glob_clock_start_sec,
> centuries_in_millinium,
> djd_debug2,
> djd_debug,
> glob_optimal_expect_sec,
> glob_normmax,
> glob_iter,
> glob_small_float,
> glob_initial_pass,
> glob_clock_sec,
> hours_in_day,
> glob_good_digits,
> glob_max_sec,
> glob_max_iter,
> glob_abserr,
> glob_log10_relerr,
> glob_optimal_done,
> glob_reached_optimal_h,
> glob_almost_1,
> glob_dump,
> glob_log10abserr,
> glob_smallish_float,
> glob_large_float,
> glob_hmin_init,
> glob_h,
> years_in_century,
> glob_display_flag,
> glob_max_opt_iter,
> glob_curr_iter_when_opt,
> glob_optimal_clock_start_sec,
> glob_hmax,
> glob_log10relerr,
> glob_start,
> glob_orig_start_sec,
> glob_warned,
> glob_optimal_start,
> glob_percent_done,
> glob_max_minutes,
> glob_warned2,
> glob_max_trunc_err,
> glob_log10_abserr,
> days_in_year,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> #END CONST
> array_m1,
> array_tmp3_a1,
> array_last_rel_error,
> array_norms,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_fact_1,
> array_y,
> array_x,
> array_type_pole,
> array_pole,
> array_y_init,
> array_1st_rel_error,
> array_complex_pole,
> array_y_higher_work,
> array_fact_2,
> array_poles,
> array_y_set_initial,
> array_y_higher_work2,
> array_y_higher,
> array_real_pole,
> glob_last;
> glob_last;
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> glob_iolevel := INFO;
> glob_iolevel := 5;
> DEBUGMASSIVE := 4;
> INFO := 2;
> glob_max_terms := 30;
> DEBUGL := 3;
> ALWAYS := 1;
> MAX_UNCHANGED := 10;
> min_in_hour := 60;
> glob_subiter_method := 3;
> glob_current_iter := 0;
> glob_disp_incr := 0.1;
> sec_in_minute := 60;
> glob_log10normmin := 0.1;
> glob_unchanged_h_cnt := 0;
> glob_max_rel_trunc_err := 0.1e-10;
> glob_relerr := 0.1e-10;
> glob_dump_analytic := false;
> glob_no_eqs := 0;
> glob_look_poles := false;
> glob_last_good_h := 0.1;
> glob_not_yet_start_msg := true;
> glob_not_yet_finished := true;
> glob_html_log := true;
> glob_max_hours := 0.0;
> glob_hmin := 0.00000000001;
> glob_clock_start_sec := 0.0;
> centuries_in_millinium := 10;
> djd_debug2 := true;
> djd_debug := true;
> glob_optimal_expect_sec := 0.1;
> glob_normmax := 0.0;
> glob_iter := 0;
> glob_small_float := 0.1e-50;
> glob_initial_pass := true;
> glob_clock_sec := 0.0;
> hours_in_day := 24;
> glob_good_digits := 0;
> glob_max_sec := 10000.0;
> glob_max_iter := 1000;
> glob_abserr := 0.1e-10;
> glob_log10_relerr := 0.1e-10;
> glob_optimal_done := false;
> glob_reached_optimal_h := false;
> glob_almost_1 := 0.9990;
> glob_dump := false;
> glob_log10abserr := 0.0;
> glob_smallish_float := 0.1e-100;
> glob_large_float := 9.0e100;
> glob_hmin_init := 0.001;
> glob_h := 0.1;
> years_in_century := 100;
> glob_display_flag := true;
> glob_max_opt_iter := 10;
> glob_curr_iter_when_opt := 0;
> glob_optimal_clock_start_sec := 0.0;
> glob_hmax := 1.0;
> glob_log10relerr := 0.0;
> glob_start := 0;
> glob_orig_start_sec := 0.0;
> glob_warned := false;
> glob_optimal_start := 0.0;
> glob_percent_done := 0.0;
> glob_max_minutes := 0.0;
> glob_warned2 := false;
> glob_max_trunc_err := 0.1e-10;
> glob_log10_abserr := 0.1e-10;
> days_in_year := 365;
> #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/lin_arccospostode.ode#################");
> omniout_str(ALWAYS,"diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"max_terms := 30;");
> omniout_str(ALWAYS,"Digits := 32;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"x_start := -0.8;");
> omniout_str(ALWAYS,"x_end := 0.8 ;");
> 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(10.0 * (0.1 * x + 0.2) * arccos(0.1 * x + 0.2 ) - 10.0 * sqrt(1.0 -");
> omniout_str(ALWAYS,"expt((0.1 * x + 0.2) , 2 )));");
> omniout_str(ALWAYS,"end;");
> 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
> max_terms := 30;
> Digits := 32;
> #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_m1:= Array(0..(max_terms + 1),[]);
> array_tmp3_a1:= Array(0..(max_terms + 1),[]);
> array_last_rel_error:= Array(0..(max_terms + 1),[]);
> array_norms:= 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_fact_1:= Array(0..(max_terms + 1),[]);
> array_y:= Array(0..(max_terms + 1),[]);
> array_x:= Array(0..(max_terms + 1),[]);
> array_type_pole:= Array(0..(max_terms + 1),[]);
> array_pole:= Array(0..(max_terms + 1),[]);
> array_y_init:= Array(0..(max_terms + 1),[]);
> array_1st_rel_error:= Array(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_fact_2 := Array(0..(max_terms+ 1) ,(0..max_terms+ 1),[]);
> array_poles := 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_y_higher := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_real_pole := Array(0..(1+ 1) ,(0..3+ 1),[]);
> 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_tmp3_a1[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_norms[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_tmp0[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_tmp1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_tmp2[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_tmp3[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_tmp4[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_fact_1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> 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_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_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_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 <=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_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_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 <=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
> ;
> 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
> ;
> #BEGIN ARRAYS DEFINED AND INITIALIZATED
> array_tmp3_a1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp3_a1[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_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_const_1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_const_1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_1[1] := 1;
> array_const_0D2 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_const_0D2[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_0D2[1] := 0.2;
> array_const_0D1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_const_0D1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_0D1[1] := 0.1;
> array_const_0D0 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_const_0D0[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_0D0[1] := 0.0;
> array_m1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms) do # do number 2
> array_m1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_m1[1] := -1.0;
> #END ARRAYS DEFINED AND INITIALIZATED
> #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 := -0.8;
> x_end := 0.8 ;
> 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 ) = arccos(0.1 * x + 0.2) ;");
> 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-21T17:48:50-05:00")
> ;
> logitem_str(html_log_file,"Maple")
> ;
> logitem_str(html_log_file,"lin_arccos")
> ;
> logitem_str(html_log_file,"diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;")
> ;
> 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,"lin_arccos diffeq.mxt")
> ;
> logitem_str(html_log_file,"lin_arccos 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 glob_iolevel, DEBUGMASSIVE, INFO, glob_max_terms, DEBUGL, ALWAYS,
MAX_UNCHANGED, min_in_hour, glob_subiter_method, glob_current_iter,
glob_disp_incr, sec_in_minute, glob_log10normmin, glob_unchanged_h_cnt,
glob_max_rel_trunc_err, glob_relerr, glob_dump_analytic, glob_no_eqs,
glob_look_poles, glob_last_good_h, glob_not_yet_start_msg,
glob_not_yet_finished, glob_html_log, glob_max_hours, glob_hmin,
glob_clock_start_sec, centuries_in_millinium, djd_debug2, djd_debug,
glob_optimal_expect_sec, glob_normmax, glob_iter, glob_small_float,
glob_initial_pass, glob_clock_sec, hours_in_day, glob_good_digits,
glob_max_sec, glob_max_iter, glob_abserr, glob_log10_relerr,
glob_optimal_done, glob_reached_optimal_h, glob_almost_1, glob_dump,
glob_log10abserr, glob_smallish_float, glob_large_float, glob_hmin_init,
glob_h, years_in_century, glob_display_flag, glob_max_opt_iter,
glob_curr_iter_when_opt, glob_optimal_clock_start_sec, glob_hmax,
glob_log10relerr, glob_start, glob_orig_start_sec, glob_warned,
glob_optimal_start, glob_percent_done, glob_max_minutes, glob_warned2,
glob_max_trunc_err, glob_log10_abserr, days_in_year, array_const_1,
array_const_0D2, array_const_0D1, array_const_0D0, array_m1, array_tmp3_a1,
array_last_rel_error, array_norms, array_tmp0, array_tmp1, array_tmp2,
array_tmp3, array_tmp4, array_fact_1, array_y, array_x, array_type_pole,
array_pole, array_y_init, array_1st_rel_error, array_complex_pole,
array_y_higher_work, array_fact_2, array_poles, array_y_set_initial,
array_y_higher_work2, array_y_higher, array_real_pole, glob_last;
glob_last;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
glob_iolevel := INFO;
glob_iolevel := 5;
DEBUGMASSIVE := 4;
INFO := 2;
glob_max_terms := 30;
DEBUGL := 3;
ALWAYS := 1;
MAX_UNCHANGED := 10;
min_in_hour := 60;
glob_subiter_method := 3;
glob_current_iter := 0;
glob_disp_incr := 0.1;
sec_in_minute := 60;
glob_log10normmin := 0.1;
glob_unchanged_h_cnt := 0;
glob_max_rel_trunc_err := 0.1*10^(-10);
glob_relerr := 0.1*10^(-10);
glob_dump_analytic := false;
glob_no_eqs := 0;
glob_look_poles := false;
glob_last_good_h := 0.1;
glob_not_yet_start_msg := true;
glob_not_yet_finished := true;
glob_html_log := true;
glob_max_hours := 0.;
glob_hmin := 0.1*10^(-10);
glob_clock_start_sec := 0.;
centuries_in_millinium := 10;
djd_debug2 := true;
djd_debug := true;
glob_optimal_expect_sec := 0.1;
glob_normmax := 0.;
glob_iter := 0;
glob_small_float := 0.1*10^(-50);
glob_initial_pass := true;
glob_clock_sec := 0.;
hours_in_day := 24;
glob_good_digits := 0;
glob_max_sec := 10000.0;
glob_max_iter := 1000;
glob_abserr := 0.1*10^(-10);
glob_log10_relerr := 0.1*10^(-10);
glob_optimal_done := false;
glob_reached_optimal_h := false;
glob_almost_1 := 0.9990;
glob_dump := false;
glob_log10abserr := 0.;
glob_smallish_float := 0.1*10^(-100);
glob_large_float := 0.90*10^101;
glob_hmin_init := 0.001;
glob_h := 0.1;
years_in_century := 100;
glob_display_flag := true;
glob_max_opt_iter := 10;
glob_curr_iter_when_opt := 0;
glob_optimal_clock_start_sec := 0.;
glob_hmax := 1.0;
glob_log10relerr := 0.;
glob_start := 0;
glob_orig_start_sec := 0.;
glob_warned := false;
glob_optimal_start := 0.;
glob_percent_done := 0.;
glob_max_minutes := 0.;
glob_warned2 := false;
glob_max_trunc_err := 0.1*10^(-10);
glob_log10_abserr := 0.1*10^(-10);
days_in_year := 365;
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/lin_arccospostode.ode#################");
omniout_str(ALWAYS, "diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
omniout_str(ALWAYS, "max_terms := 30;");
omniout_str(ALWAYS, "Digits := 32;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
omniout_str(ALWAYS, "x_start := -0.8;");
omniout_str(ALWAYS, "x_end := 0.8 ;");
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(10.0 * (0.1 * x + 0.2) * arccos(0.1 * x \
+ 0.2 ) - 10.0 * sqrt(1.0 -");
omniout_str(ALWAYS, "expt((0.1 * x + 0.2) , 2 )));");
omniout_str(ALWAYS, "end;");
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;
max_terms := 30;
Digits := 32;
glob_max_terms := max_terms;
glob_html_log := true;
array_m1 := Array(0 .. max_terms + 1, []);
array_tmp3_a1 := Array(0 .. max_terms + 1, []);
array_last_rel_error := Array(0 .. max_terms + 1, []);
array_norms := 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_fact_1 := Array(0 .. max_terms + 1, []);
array_y := Array(0 .. max_terms + 1, []);
array_x := Array(0 .. max_terms + 1, []);
array_type_pole := Array(0 .. max_terms + 1, []);
array_pole := Array(0 .. max_terms + 1, []);
array_y_init := Array(0 .. max_terms + 1, []);
array_1st_rel_error := Array(0 .. max_terms + 1, []);
array_complex_pole := Array(0 .. 2, 0 .. 4, []);
array_y_higher_work := Array(0 .. 3, 0 .. max_terms + 1, []);
array_fact_2 := Array(0 .. max_terms + 1, 0 .. max_terms + 1, []);
array_poles := 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_y_higher := Array(0 .. 3, 0 .. max_terms + 1, []);
array_real_pole := Array(0 .. 2, 0 .. 4, []);
term := 1;
while term <= max_terms do array_m1[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp3_a1[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_norms[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp0[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp1[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp2[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp3[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_tmp4[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_fact_1[term] := 0.; term := term + 1
end do;
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_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_1st_rel_error[term] := 0.; term := term + 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 <= 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_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_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 <= 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;
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;
array_tmp3_a1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_tmp3_a1[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_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_const_1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_const_1[term] := 0.; term := term + 1
end do;
array_const_1[1] := 1;
array_const_0D2 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_const_0D2[term] := 0.; term := term + 1
end do;
array_const_0D2[1] := 0.2;
array_const_0D1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_const_0D1[term] := 0.; term := term + 1
end do;
array_const_0D1[1] := 0.1;
array_const_0D0 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_const_0D0[term] := 0.; term := term + 1
end do;
array_const_0D0[1] := 0.;
array_m1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms do array_m1[term] := 0.; term := term + 1
end do;
array_m1[1] := -1.0;
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 := -0.8;
x_end := 0.8;
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 ) = arccos(0.1 * x + 0.2) ;");
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-21T17:48:50-05:00");
logitem_str(html_log_file, "Maple");
logitem_str(html_log_file,
"lin_arccos");
logitem_str(html_log_file,
"diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;");
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, "lin_arccos diffeq.mxt");
logitem_str(html_log_file, "lin_arccos 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/lin_arccospostode.ode#################
diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;
!
#BEGIN FIRST INPUT BLOCK
max_terms := 30;
Digits := 32;
!
#END FIRST INPUT BLOCK
#BEGIN SECOND INPUT BLOCK
x_start := -0.8;
x_end := 0.8 ;
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(10.0 * (0.1 * x + 0.2) * arccos(0.1 * x + 0.2 ) - 10.0 * sqrt(1.0 -
expt((0.1 * x + 0.2) , 2 )));
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
x[1] = -0.8
y[1] (analytic) = -8.1871311835125550194134248888549
y[1] (numeric) = -8.1871311835125550194134248888549
absolute error = 0
relative error = 0 %
Correct digits = 32
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79999
y[1] (analytic) = -8.1871166784531474120575039383491
y[1] (numeric) = -8.1871166784531474116487049109429
absolute error = 4.087990274062e-19
relative error = 4.9931989913137213016763174686363e-18 %
Correct digits = 19
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79998
y[1] (analytic) = -8.1871021734038125929783009917529
y[1] (numeric) = -8.1871021734038125921606993809691
absolute error = 8.176016107838e-19
relative error = 9.9864591093026465461213102824459e-18 %
Correct digits = 19
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79997
y[1] (analytic) = -8.1870876683645505634022265781708
y[1] (numeric) = -8.1870876683645505621758188280346
absolute error = 1.2264077501362e-18
relative error = 1.4979780354314768604502128537895e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79996
y[1] (analytic) = -8.187073163335361324555701894638
y[1] (numeric) = -8.1870731633353613229204844491704
absolute error = 1.6352174454676e-18
relative error = 1.9973162726707853861694466403610e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79995
y[1] (analytic) = -8.1870586583162448776651588061304
y[1] (numeric) = -8.1870586583162448756211281093488
absolute error = 2.0440306967816e-18
relative error = 2.4966606226832342144443105548340e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
memory used=3.8MB, alloc=2.9MB, time=0.33
x[1] = -0.79994
y[1] (analytic) = -8.1870441533072012239570398455773
y[1] (numeric) = -8.1870441533072012215041923414951
absolute error = 2.4528475040822e-18
relative error = 2.9960110855043561076962231750247e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79993
y[1] (analytic) = -8.1870296483082303646577982138717
y[1] (numeric) = -8.1870296483082303617961303464987
absolute error = 2.8616678673730e-18
relative error = 3.4953676611691954570511582950535e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79992
y[1] (analytic) = -8.1870151433193323009938977798828
y[1] (numeric) = -8.1870151433193322977234059932248
absolute error = 3.2704917866580e-18
relative error = 3.9947303497132854351159832214857e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79991
y[1] (analytic) = -8.1870006383405070341918130804668
y[1] (numeric) = -8.1870006383405070305124938185259
absolute error = 3.6793192619409e-18
relative error = 4.4940991511717929863279128943991e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7999
y[1] (analytic) = -8.1869861333717545654780293204789
y[1] (numeric) = -8.1869861333717545613898790272533
absolute error = 4.0881502932256e-18
relative error = 4.9934740655801295490632597181713e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79989
y[1] (analytic) = -8.1869716284130748960790423727843
y[1] (numeric) = -8.1869716284130748915820574922683
absolute error = 4.4969848805160e-18
relative error = 5.4928550929737067672286609573778e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79988
y[1] (analytic) = -8.1869571234644680272213587782699
y[1] (numeric) = -8.186957123464468022315535754454
absolute error = 4.9058230238159e-18
relative error = 5.9922422333878143447589487180911e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79987
y[1] (analytic) = -8.1869426185259339601314957458555
y[1] (numeric) = -8.1869426185259339548168310227266
absolute error = 5.3146647231289e-18
relative error = 6.4916354868574978988165769655596e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79986
y[1] (analytic) = -8.1869281135974726960359811525058
y[1] (numeric) = -8.1869281135974726903124711740468
absolute error = 5.7235099784590e-18
relative error = 6.9910348534182918332468156205296e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79985
y[1] (analytic) = -8.1869136086790842361613535432417
y[1] (numeric) = -8.1869136086790842300289947534316
absolute error = 6.1323587898101e-18
relative error = 7.4904403331056086121436427865772e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79984
y[1] (analytic) = -8.1868991037707685817341621311513
y[1] (numeric) = -8.1868991037707685751929509739653
absolute error = 6.5412111571860e-18
relative error = 7.9898519259547387587690785077379e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=7.6MB, alloc=3.9MB, time=0.73
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79983
y[1] (analytic) = -8.1868845988725257339809667974018
y[1] (numeric) = -8.1868845988725257270308997168114
absolute error = 6.9500670805904e-18
relative error = 8.4892696320008508544725092884952e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79982
y[1] (analytic) = -8.1868700939843556941283380912511
y[1] (numeric) = -8.1868700939843556867694115312239
absolute error = 7.3589265600272e-18
relative error = 8.9886934512793579780158679292357e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79981
y[1] (analytic) = -8.1868555891062584634028572300588
y[1] (numeric) = -8.1868555891062584556350676345586
absolute error = 7.7677895955002e-18
relative error = 9.4881233838255512666840053574335e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7998
y[1] (analytic) = -8.1868410842382340430311160992982
y[1] (numeric) = -8.186841084238234034854459912285
absolute error = 8.1766561870132e-18
relative error = 9.9875594296747220624387831218837e-17 %
Correct digits = 18
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79979
y[1] (analytic) = -8.1868265793802824342397172525675
y[1] (numeric) = -8.1868265793802824256541909179973
absolute error = 8.5855263345702e-18
relative error = 1.0487001588862406206822818503484e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79978
y[1] (analytic) = -8.1868120745324036382552739116009
y[1] (numeric) = -8.1868120745324036292608738734262
absolute error = 8.9944000381747e-18
relative error = 1.0986449861423529009451764199105e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79977
y[1] (analytic) = -8.186797569694597656304409966281
y[1] (numeric) = -8.1867975696945976469011326684502
absolute error = 9.4032772978308e-18
relative error = 1.1485904247393748869329522590234e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79976
y[1] (analytic) = -8.1867830648668644896137599746494
y[1] (numeric) = -8.1867830648668644798016018611072
absolute error = 9.8121581135422e-18
relative error = 1.1985364746808235800337719456735e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79975
y[1] (analytic) = -8.1867685600492041394099691629186
y[1] (numeric) = -8.1867685600492041291889266776058
absolute error = 1.02210424853128e-17
relative error = 1.2484831359702404316809860817373e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79974
y[1] (analytic) = -8.1867540552416166069196934254835
y[1] (numeric) = -8.1867540552416165962897630123371
absolute error = 1.06299304131464e-17
relative error = 1.2984304086111546990097068107950e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79973
y[1] (analytic) = -8.1867395504441018933695993249325
y[1] (numeric) = -8.1867395504441018823307774278858
absolute error = 1.10388218970467e-17
relative error = 1.3483782926070834447487371978600e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=11.4MB, alloc=4.1MB, time=1.13
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79972
y[1] (analytic) = -8.1867250456566599999863640920597
y[1] (numeric) = -8.1867250456566599885386471550419
absolute error = 1.14477169370178e-17
relative error = 1.3983267879615926115955452918256e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79971
y[1] (analytic) = -8.1867105408792909279966756258754
y[1] (numeric) = -8.186710540879290916140060092812
absolute error = 1.18566155330634e-17
relative error = 1.4482758946781993033032276336155e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7997
y[1] (analytic) = -8.1866960361119946786272324936182
y[1] (numeric) = -8.186696036111994666361714808431
absolute error = 1.22655176851872e-17
relative error = 1.4982256127604206440073828352084e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79969
y[1] (analytic) = -8.1866815313547712531047439307665
y[1] (numeric) = -8.1866815313547712404303205373735
absolute error = 1.26744233933930e-17
relative error = 1.5481759422117859931877820420035e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79968
y[1] (analytic) = -8.1866670266076206526559298410499
y[1] (numeric) = -8.1866670266076206395725971833651
absolute error = 1.30833326576848e-17
relative error = 1.5981268830358491607598907224932e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79967
y[1] (analytic) = -8.1866525218705428785075207964605
y[1] (numeric) = -8.1866525218705428650152753183941
absolute error = 1.34922454780664e-17
relative error = 1.6480784352361395472721518222634e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79966
y[1] (analytic) = -8.1866380171435379318862580372644
y[1] (numeric) = -8.1866380171435379179850961827228
absolute error = 1.39011618545416e-17
relative error = 1.6980305988161865737426240796953e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79965
y[1] (analytic) = -8.1866235124266058140188934720133
y[1] (numeric) = -8.1866235124266057997088116848991
absolute error = 1.43100817871142e-17
relative error = 1.7479833737795196816591186946383e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79964
y[1] (analytic) = -8.186609007719746526132189677556
y[1] (numeric) = -8.186609007719746511413184401768
absolute error = 1.47190052757880e-17
relative error = 1.7979367601296683329793359981358e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79963
y[1] (analytic) = -8.1865945030229600694529198990499
y[1] (numeric) = -8.186594503022960054324987578483
absolute error = 1.51279323205669e-17
relative error = 1.8478907578701742252223887888389e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79962
y[1] (analytic) = -8.186579998336246445207868049972
y[1] (numeric) = -8.1865799983362464296710051285174
absolute error = 1.55368629214546e-17
relative error = 1.8978453670045546462380635232640e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79961
y[1] (analytic) = -8.1865654936596056546238287121313
y[1] (numeric) = -8.1865654936596056386780316336762
absolute error = 1.59457970784551e-17
relative error = 1.9478005875363635496638906251563e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=15.2MB, alloc=4.2MB, time=1.54
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7996
y[1] (analytic) = -8.1865509889930376989276071356792
y[1] (numeric) = -8.1865509889930376825728723441072
absolute error = 1.63547347915720e-17
relative error = 1.9977564194691060491557208923085e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79959
y[1] (analytic) = -8.1865364843365425793460192391221
y[1] (numeric) = -8.1865364843365425625823431783126
absolute error = 1.67636760608095e-17
relative error = 2.0477128628063605697345752144734e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79958
y[1] (analytic) = -8.1865219796901202971058916093316
y[1] (numeric) = -8.1865219796901202799332707231606
absolute error = 1.71726208861710e-17
relative error = 2.0976699175516078356416751573744e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79957
y[1] (analytic) = -8.1865074750537708534340615015572
y[1] (numeric) = -8.1865074750537708358524922338966
absolute error = 1.75815692676606e-17
relative error = 2.1476275837084140977914965156633e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79956
y[1] (analytic) = -8.1864929704274942495573768394369
y[1] (numeric) = -8.186492970427494231566855634155
absolute error = 1.79905212052819e-17
relative error = 2.1975858612802845516147903215447e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79955
y[1] (analytic) = -8.1864784658112904867026962150095
y[1] (numeric) = -8.1864784658112904683032195159704
absolute error = 1.83994766990391e-17
relative error = 2.2475447502707977044274451297525e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79954
y[1] (analytic) = -8.1864639612051595660968888887249
y[1] (numeric) = -8.1864639612051595472884531397893
absolute error = 1.88084357489356e-17
relative error = 2.2975042506834343620735361311142e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79953
y[1] (analytic) = -8.1864494566091014889668347894568
y[1] (numeric) = -8.1864494566091014697494364344813
absolute error = 1.92173983549755e-17
relative error = 2.3474643625217608576769320514709e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79952
y[1] (analytic) = -8.1864349520231162565394245145135
y[1] (numeric) = -8.1864349520231162369130599973509
absolute error = 1.96263645171626e-17
relative error = 2.3974250857893068991043810539855e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79951
y[1] (analytic) = -8.1864204474472038700415593296494
y[1] (numeric) = -8.1864204474472038500062250941488
absolute error = 2.00353342355006e-17
relative error = 2.4473864204895899993432008878290e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7995
y[1] (analytic) = -8.1864059428813643307001511690766
y[1] (numeric) = -8.1864059428813643102558436590833
absolute error = 2.04443075099933e-17
relative error = 2.4973483666261399071386822344039e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=19.0MB, alloc=4.3MB, time=1.94
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79949
y[1] (analytic) = -8.1863914383255976397421226354766
y[1] (numeric) = -8.186391438325597618888838294832
absolute error = 2.08532843406446e-17
relative error = 2.5473109242024986071024400725925e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79948
y[1] (analytic) = -8.1863769337799037983944070000114
y[1] (numeric) = -8.186376933779903777132142272553
absolute error = 2.12622647274584e-17
relative error = 2.5972740932222081044047389648963e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79947
y[1] (analytic) = -8.1863624292442828078839482023351
y[1] (numeric) = -8.1863624292442827862126995318966
absolute error = 2.16712486704385e-17
relative error = 2.6472378736887982093369601739833e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79946
y[1] (analytic) = -8.1863479247187346694377008506053
y[1] (numeric) = -8.1863479247187346473574646810167
absolute error = 2.20802361695886e-17
relative error = 2.6972022656057865372035227466821e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79945
y[1] (analytic) = -8.1863334202032593842826302214951
y[1] (numeric) = -8.1863334202032593617934029965824
absolute error = 2.24892272249127e-17
relative error = 2.7471672689767273701376306256892e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79944
y[1] (analytic) = -8.1863189156978569536457122602037
y[1] (numeric) = -8.1863189156978569307474904237892
absolute error = 2.28982218364145e-17
relative error = 2.7971328838051383644104586046141e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79943
y[1] (analytic) = -8.1863044112025273787539335804685
y[1] (numeric) = -8.1863044112025273554467135763706
absolute error = 2.33072200040979e-17
relative error = 2.8470991100945616277278564880202e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79942
y[1] (analytic) = -8.1862899067172706608342914645765
y[1] (numeric) = -8.1862899067172706371180697366098
absolute error = 2.37162217279667e-17
relative error = 2.8970659478485270728092589998550e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79941
y[1] (analytic) = -8.1862754022420868011137938633754
y[1] (numeric) = -8.1862754022420867769885668553508
absolute error = 2.41252270080246e-17
relative error = 2.9470333970705524172796053310996e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7994
y[1] (analytic) = -8.186260897776975800819459396286
y[1] (numeric) = -8.1862608977769757762852235520102
absolute error = 2.45342358442758e-17
relative error = 2.9970014577642164770963029186348e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79939
y[1] (analytic) = -8.1862463933219376611783173513122
y[1] (numeric) = -8.1862463933219376362350691145885
absolute error = 2.49432482367237e-17
relative error = 3.0469701299330003641498231328592e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79938
y[1] (analytic) = -8.1862318888769723834174076850539
y[1] (numeric) = -8.1862318888769723580651434996816
absolute error = 2.53522641853723e-17
relative error = 3.0969394135804585042525534224054e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=22.8MB, alloc=4.3MB, time=2.35
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79937
y[1] (analytic) = -8.1862173844420799687637810227179
y[1] (numeric) = -8.1862173844420799430024973324924
absolute error = 2.57612836902255e-17
relative error = 3.1469093087101331282095076862423e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79936
y[1] (analytic) = -8.1862028800172604184444986581292
y[1] (numeric) = -8.1862028800172603922741919068421
absolute error = 2.61703067512871e-17
relative error = 3.1968798153255542717102449016113e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79935
y[1] (analytic) = -8.1861883756025137336866325537423
y[1] (numeric) = -8.1861883756025137071072991851817
absolute error = 2.65793333685606e-17
relative error = 3.2468509334302153438260004504423e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79934
y[1] (analytic) = -8.1861738711978399157172653406539
y[1] (numeric) = -8.1861738711978398887289017986036
absolute error = 2.69883635420503e-17
relative error = 3.2968226630277074995945719603398e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79933
y[1] (analytic) = -8.1861593668032389657634903186129
y[1] (numeric) = -8.186159366803238938366093046853
absolute error = 2.73973972717599e-17
relative error = 3.3467950041215486205166789282649e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79932
y[1] (analytic) = -8.1861448624187108850524114560324
y[1] (numeric) = -8.1861448624187108572459768983395
absolute error = 2.78064345576929e-17
relative error = 3.3967679567152321769560805858838e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79931
y[1] (analytic) = -8.1861303580442556748111433900019
y[1] (numeric) = -8.1861303580442556465956679901483
absolute error = 2.82154753998536e-17
relative error = 3.4467415208123493857629652528870e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7993
y[1] (analytic) = -8.1861158536798733362668114262977
y[1] (numeric) = -8.186115853679873307642291628052
absolute error = 2.86245197982457e-17
relative error = 3.4967156964164181898612622551861e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79929
y[1] (analytic) = -8.1861013493255638706465515393945
y[1] (numeric) = -8.1861013493255638416129837865218
absolute error = 2.90335677528727e-17
relative error = 3.5466904835309321209084850144245e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79928
y[1] (analytic) = -8.186086844981327279177510372478
y[1] (numeric) = -8.1860868449813272497348911087392
absolute error = 2.94426192637388e-17
relative error = 3.5966658821594702417195449585913e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79927
y[1] (analytic) = -8.1860723406471635630868452374548
y[1] (numeric) = -8.1860723406471635332351709066073
absolute error = 2.98516743308475e-17
relative error = 3.6466418923055261248367858849646e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=26.7MB, alloc=4.3MB, time=2.76
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79926
y[1] (analytic) = -8.1860578363230727236017241149655
y[1] (numeric) = -8.1860578363230726933409911607625
absolute error = 3.02607329542030e-17
relative error = 3.6966185139726788742632441602508e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79925
y[1] (analytic) = -8.1860433320090547619493256543946
y[1] (numeric) = -8.1860433320090547312795305205857
absolute error = 3.06697951338089e-17
relative error = 3.7465957471644343193404769727048e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79924
y[1] (analytic) = -8.1860288277051096793568391738831
y[1] (numeric) = -8.1860288277051096482779783042141
absolute error = 3.10788608696690e-17
relative error = 3.7965735918843227415832067411843e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79923
y[1] (analytic) = -8.1860143234112374770514646603397
y[1] (numeric) = -8.1860143234112374455635344985523
absolute error = 3.14879301617874e-17
relative error = 3.8465520481359110908530282906598e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79922
y[1] (analytic) = -8.1859998191274381562604127694518
y[1] (numeric) = -8.1859998191274381243634097592841
absolute error = 3.18970030101677e-17
relative error = 3.8965311159227052578530580766746e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79921
y[1] (analytic) = -8.1859853148537117182109048256975
y[1] (numeric) = -8.1859853148537116859048254108839
absolute error = 3.23060794148136e-17
relative error = 3.9465107952482233695894405826825e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7992
y[1] (analytic) = -8.185970810590058164130172822357
y[1] (numeric) = -8.1859708105900581314150134466281
absolute error = 3.27151593757289e-17
relative error = 3.9964910861159957894797080407893e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79919
y[1] (analytic) = -8.1859563063364774952454594215244
y[1] (numeric) = -8.1859563063364774621212165286065
absolute error = 3.31242428929179e-17
relative error = 4.0464719885296139816359584268496e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79918
y[1] (analytic) = -8.1859418020929697127840179541181
y[1] (numeric) = -8.1859418020929696792506879877341
absolute error = 3.35333299663840e-17
relative error = 4.0964535024925594864912261403143e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79917
y[1] (analytic) = -8.1859272978595348179731124198935
y[1] (numeric) = -8.1859272978595347840306918237623
absolute error = 3.39424205961312e-17
relative error = 4.1464356280083871611305104483985e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79916
y[1] (analytic) = -8.1859127936361728120400174874538
y[1] (numeric) = -8.1859127936361727776885027052905
absolute error = 3.43515147821633e-17
relative error = 4.1964183650806274510711470889294e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79915
y[1] (analytic) = -8.1858982894228836962120184942616
y[1] (numeric) = -8.1858982894228836614514059697775
absolute error = 3.47606125244841e-17
relative error = 4.2464017137128108223070638472164e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=30.5MB, alloc=4.3MB, time=3.18
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79914
y[1] (analytic) = -8.1858837852196674717164114466504
y[1] (numeric) = -8.185883785219667436546697623553
absolute error = 3.51697138230974e-17
relative error = 4.2963856739084677613089172784262e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79913
y[1] (analytic) = -8.1858692810265241397805030198363
y[1] (numeric) = -8.1858692810265241042016843418292
absolute error = 3.55788186780071e-17
relative error = 4.3463702456711409911978045189099e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79912
y[1] (analytic) = -8.185854776843453701631610557929
y[1] (numeric) = -8.1858547768434536656436834687121
absolute error = 3.59879270892169e-17
relative error = 4.3963554290043488232679654289718e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79911
y[1] (analytic) = -8.1858402726704561584970620739439
y[1] (numeric) = -8.1858402726704561221000230172131
absolute error = 3.63970390567308e-17
relative error = 4.4463412239116462378547950662594e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.7991
y[1] (analytic) = -8.1858257685075315116041962498129
y[1] (numeric) = -8.1858257685075314747980416692605
absolute error = 3.68061545805524e-17
relative error = 4.4963276303965393709900826894383e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79909
y[1] (analytic) = -8.1858112643546797621803624363967
y[1] (numeric) = -8.1858112643546797249650887757108
absolute error = 3.72152736606859e-17
relative error = 4.5463146484626076765708074181115e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79908
y[1] (analytic) = -8.185796760211900911452920653495
y[1] (numeric) = -8.1857967602119008738285243563604
absolute error = 3.76243962971346e-17
relative error = 4.5963022781133206827816052147647e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79907
y[1] (analytic) = -8.1857822560791949606492415898598
y[1] (numeric) = -8.185782256079194922615719099957
absolute error = 3.80335224899028e-17
relative error = 4.6462905193522701008863669803088e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79906
y[1] (analytic) = -8.1857677519565619109967066032052
y[1] (numeric) = -8.1857677519565618725540543642111
absolute error = 3.84426522389941e-17
relative error = 4.6962793721829621487840636631752e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79905
y[1] (analytic) = -8.1857532478440017637227077202197
y[1] (numeric) = -8.1857532478440017248709221758073
absolute error = 3.88517855444124e-17
relative error = 4.7462688366089397137186794569897e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79904
y[1] (analytic) = -8.1857387437415145200546476365777
y[1] (numeric) = -8.1857387437415144807937252304161
absolute error = 3.92609224061616e-17
relative error = 4.7962589126337457034988786845133e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
memory used=34.3MB, alloc=4.3MB, time=3.58
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79903
y[1] (analytic) = -8.1857242396491001812199397169503
y[1] (numeric) = -8.1857242396491001415498768927052
absolute error = 3.96700628242451e-17
relative error = 4.8462496002608619645479867827544e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79902
y[1] (analytic) = -8.1857097355667587484460079950182
y[1] (numeric) = -8.1857097355667587083668011963509
absolute error = 4.00792067986673e-17
relative error = 4.8962408994938925275381371742149e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.79901
y[1] (analytic) = -8.1856952314944902229602871734814
y[1] (numeric) = -8.1856952314944901824719328440497
absolute error = 4.04883543294317e-17
relative error = 4.9462328103363314962395647513865e-16 %
Correct digits = 17
h = 1e-05
TOP MAIN SOLVE Loop
WARNING: arccos of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 9.891
Order of pole = 0.3249
x[1] = -0.799
y[1] (analytic) = -8.1856807274322946059902226240723
y[1] (numeric) = -8.1856807274322945650927172075299
absolute error = 4.08975054165424e-17
relative error = 4.9962253327917462933712126357837e-16 %
Correct digits = 17
h = 1e-05
Finished!
Maximum Iterations Reached before Solution Completed!
diff ( y , x , 1 ) = arccos(0.1 * x + 0.2) ;
Iterations = 100
Total Elapsed Time = 3 Seconds
Elapsed Time(since restart) = 3 Seconds
Expected Time Remaining = 1 Hours 35 Minutes 8 Seconds
Optimized Time Remaining = 1 Hours 34 Minutes 15 Seconds
Time to Timeout = 56 Seconds
Percent Done = 0.06312 %
> quit
memory used=35.5MB, alloc=4.3MB, time=3.70