|\^/| 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
> reached_interval := proc()
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_pole,
> glob_last;
>
>
>
> local ret;
>
> if ((((array_x[1] >= glob_next_display) and not glob_neg_h) or ((array_x[1] <= glob_next_display) and glob_neg_h)) or (glob_next_display = 0.0)) then # if number 1
> ret := true;
> else
> ret := false;
> fi;# end if 1
> ;
> return(ret);
>
> # End Function number 3
> end;
reached_interval := proc()
local ret;
global glob_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_pole, glob_last;
if glob_next_display <= array_x[1] and not glob_neg_h or
array_x[1] <= glob_next_display and glob_neg_h or
glob_next_display = 0. then ret := true
else ret := false
end if;
return ret
end proc
> # Begin Function number 4
> display_alot := proc(iter)
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_pole,
> glob_last;
>
> local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no;
>
>
>
>
>
> #TOP DISPLAY ALOT
> if (reached_interval()) then # if number 1
> if (iter >= 0) then # if number 2
> 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 3
> relerr := abserr*100.0/omniabs(analytic_val_y);
> if (relerr <> 0.0) then # if number 4
> glob_good_digits := -trunc(log10(relerr/100.0));
> else
> glob_good_digits := Digits;
> fi;# end if 4
> ;
> else
> relerr := -1.0 ;
> glob_good_digits := -1;
> fi;# end if 3
> ;
> if (glob_iter = 1) then # if number 3
> array_1st_rel_error[1] := relerr;
> else
> array_last_rel_error[1] := relerr;
> fi;# end if 3
> ;
> 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," ");
> fi;# end if 2
> ;
> #BOTTOM DISPLAY ALOT
> fi;# end if 1
> ;
>
> # End Function number 4
> end;
display_alot := proc(iter)
local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no;
global glob_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_pole, glob_last;
if reached_interval() then
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 if
end proc
> # Begin Function number 5
> adjust_for_pole := proc(h_param)
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_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 5
> end;
adjust_for_pole := proc(h_param)
local hnew, sz2, tmp;
global glob_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_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 6
> prog_report := proc(x_start,x_end)
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_pole,
> glob_last;
>
> local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec;
>
>
>
>
>
> #TOP PROGRESS REPORT
> clock_sec1 := elapsed_time_seconds();
> total_clock_sec := convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
> glob_clock_sec := convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
> left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec) - convfloat(clock_sec1);
> expect_sec := comp_expect_sec(convfloat(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 6
> 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_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_pole, glob_last;
clock_sec1 := elapsed_time_seconds();
total_clock_sec :=
convfloat(clock_sec1) - convfloat(glob_orig_start_sec);
glob_clock_sec :=
convfloat(clock_sec1) - convfloat(glob_clock_start_sec);
left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec)
- convfloat(clock_sec1);
expect_sec := comp_expect_sec(convfloat(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 7
> check_for_pole := proc()
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_pole,
> glob_last;
>
> local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found;
>
>
>
>
>
> #TOP CHECK FOR POLE
> #IN RADII REAL EQ = 1
> #Computes radius of convergence and r_order of pole from 3 adjacent Taylor series terms. EQUATUON NUMBER 1
> #Applies to pole of arbitrary r_order on the real axis,
> #Due to Prof. George Corliss.
> n := glob_max_terms;
> m := n - 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) * omniabs(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 (reached_interval()) 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 (reached_interval()) 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
> if (reached_interval()) then # if number 2
> display_pole();
> fi;# end if 2
>
> # End Function number 7
> 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_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_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)*omniabs(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 reached_interval() 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 reached_interval() then omniout_str(ALWAYS, "NO POLE") end if
end if;
array_pole[1] := glob_large_float;
array_pole[2] := glob_large_float;
if array_poles[1, 1] < array_pole[1] then
array_pole[1] := array_poles[1, 1];
array_pole[2] := array_poles[1, 2]
end if;
if reached_interval() then display_pole() end if
end proc
> # Begin Function number 8
> get_norms := proc()
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_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 8
> end;
get_norms := proc()
local iii;
global glob_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_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 9
> atomall := proc()
> global
> glob_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_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: arctan of linear function has low precision in testing.");
> #emit pre atan ID_LINEAR iii = 1 $eq_no = 1
> #emit pre atan 1 $eq_no = 1
> array_tmp3[1] := arctan(array_tmp2[1]);
> array_tmp3_a1[1] := sin(array_tmp3[1]);
> array_tmp3_a2[1] := cos(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 atan ID_LINEAR iii = 2 $eq_no = 1
> #emit pre atan 1 $eq_no = 1
> array_tmp3[2] := array_tmp2[2] * array_tmp3_a2[1] / (array_tmp3_a2[1] + array_tmp2[1] * array_tmp3_a1[1]);
> array_tmp3_a1[2] := array_tmp3_a2[1] * array_tmp3[2];
> array_tmp3_a2[2] := array_tmp3_a1[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 atan ID_LINEAR iii = 3 $eq_no = 1
> array_tmp3[3] := (array_tmp2[2] * array_tmp3_a2[2] - array_tmp2[1] * att(2,array_tmp3_a1,array_tmp3,2) - att(2,array_tmp3_a2,array_tmp3,2)) / (array_tmp3_a2[1] + array_tmp2[1] * array_tmp3_a1[1]);
> array_tmp3_a1[3] := att(2,array_tmp3_a2,array_tmp3,1);
> array_tmp3_a2[3] := - att(2,array_tmp3_a1,array_tmp3,1);
> #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 atan ID_LINEAR iii = 4 $eq_no = 1
> array_tmp3[4] := (array_tmp2[2] * array_tmp3_a2[3] - array_tmp2[1] * att(3,array_tmp3_a1,array_tmp3,2) - att(3,array_tmp3_a2,array_tmp3,2)) / (array_tmp3_a2[1] + array_tmp2[1] * array_tmp3_a1[1]);
> array_tmp3_a1[4] := att(3,array_tmp3_a2,array_tmp3,1);
> array_tmp3_a2[4] := - att(3,array_tmp3_a1,array_tmp3,1);
> #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 atan ID_LINEAR iii = 5 $eq_no = 1
> array_tmp3[5] := (array_tmp2[2] * array_tmp3_a2[4] - array_tmp2[1] * att(4,array_tmp3_a1,array_tmp3,2) - att(4,array_tmp3_a2,array_tmp3,2)) / (array_tmp3_a2[1] + array_tmp2[1] * array_tmp3_a1[1]);
> array_tmp3_a1[5] := att(4,array_tmp3_a2,array_tmp3,1);
> array_tmp3_a2[5] := - att(4,array_tmp3_a1,array_tmp3,1);
> #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 pre atan ID_LINEAR $eq_no = 1
> array_tmp3[kkk] := (array_tmp2[2] * array_tmp3_a2[kkk- 1] - array_tmp2[1] * att(kkk-1,array_tmp3_a1,array_tmp3,2) - att(kkk - 1,array_tmp3_a2,array_tmp3,2)) / (array_tmp3_a2[1] + array_tmp2[1] * array_tmp3_a1[1]);
> array_tmp3_a1[kkk] := att(kkk-1,array_tmp3_a2,array_tmp3,1);
> array_tmp3_a2[kkk] := - att(kkk-1,array_tmp3_a1,array_tmp3,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 9
> end;
atomall := proc()
local kkk, order_d, adj2, temporary, term;
global glob_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_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: arctan of linear function has low precision in testing.")
;
array_tmp3[1] := arctan(array_tmp2[1]);
array_tmp3_a1[1] := sin(array_tmp3[1]);
array_tmp3_a2[1] := cos(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_a2[1]/(
array_tmp3_a2[1] + array_tmp2[1]*array_tmp3_a1[1]);
array_tmp3_a1[2] := array_tmp3_a2[1]*array_tmp3[2];
array_tmp3_a2[2] := array_tmp3_a1[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] := (array_tmp2[2]*array_tmp3_a2[2]
- array_tmp2[1]*att(2, array_tmp3_a1, array_tmp3, 2)
- att(2, array_tmp3_a2, array_tmp3, 2))/(
array_tmp3_a2[1] + array_tmp2[1]*array_tmp3_a1[1]);
array_tmp3_a1[3] := att(2, array_tmp3_a2, array_tmp3, 1);
array_tmp3_a2[3] := -att(2, array_tmp3_a1, array_tmp3, 1);
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] := (array_tmp2[2]*array_tmp3_a2[3]
- array_tmp2[1]*att(3, array_tmp3_a1, array_tmp3, 2)
- att(3, array_tmp3_a2, array_tmp3, 2))/(
array_tmp3_a2[1] + array_tmp2[1]*array_tmp3_a1[1]);
array_tmp3_a1[4] := att(3, array_tmp3_a2, array_tmp3, 1);
array_tmp3_a2[4] := -att(3, array_tmp3_a1, array_tmp3, 1);
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] := (array_tmp2[2]*array_tmp3_a2[4]
- array_tmp2[1]*att(4, array_tmp3_a1, array_tmp3, 2)
- att(4, array_tmp3_a2, array_tmp3, 2))/(
array_tmp3_a2[1] + array_tmp2[1]*array_tmp3_a1[1]);
array_tmp3_a1[5] := att(4, array_tmp3_a2, array_tmp3, 1);
array_tmp3_a2[5] := -att(4, array_tmp3_a1, array_tmp3, 1);
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] := (array_tmp2[2]*array_tmp3_a2[kkk - 1]
- array_tmp2[1]*att(kkk - 1, array_tmp3_a1, array_tmp3, 2)
- att(kkk - 1, array_tmp3_a2, array_tmp3, 2))/(
array_tmp3_a2[1] + array_tmp2[1]*array_tmp3_a1[1]);
array_tmp3_a1[kkk] := att(kkk - 1, array_tmp3_a2, array_tmp3, 1);
array_tmp3_a2[kkk] := -att(kkk - 1, array_tmp3_a1, array_tmp3, 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);
> fprintf(fd,"
");
> 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);
> 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;
fprintf(fd, "");
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 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
> logitem_good_digits := proc(file,rel_error)
> global glob_small_float;
>
> local good_digits;
>
>
> fprintf(file,"");
> if (rel_error <> -1.0) then # if number 11
> if (rel_error <> 0.0) then # if number 12
> good_digits := -trunc(log10(rel_error/100.0));
> fprintf(file,"%d",good_digits);
> else
> good_digits := Digits;
> fprintf(file,"%d",good_digits);
> fi;# end if 12
> ;
> else
> fprintf(file,"Unknown");
> fi;# end if 11
> ;
> fprintf(file," | ");
>
> # End Function number 9
> end;
logitem_good_digits := proc(file, rel_error)
local good_digits;
global glob_small_float;
fprintf(file, "");
if rel_error <> -1.0 then
if rel_error <> 0. then
good_digits := -trunc(log10(rel_error/100.0));
fprintf(file, "%d", good_digits)
else good_digits := Digits; fprintf(file, "%d", good_digits)
end if
else fprintf(file, "Unknown")
end if;
fprintf(file, " | ")
end proc
> # Begin Function number 10
> log_revs := proc(file,revs)
> fprintf(file,revs);
> # End Function number 10
> end;
log_revs := proc(file, revs) fprintf(file, revs) end proc
> # Begin Function number 11
> logitem_float := proc(file,x)
> fprintf(file,"");
> fprintf(file,"%g",x);
> fprintf(file," | ");
> # End Function number 11
> end;
logitem_float := proc(file, x)
fprintf(file, ""); fprintf(file, "%g", x); fprintf(file, " | ")
end proc
> # Begin Function number 12
> 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 12
> 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 13
> logstart := proc(file)
> fprintf(file,"");
> # End Function number 13
> end;
logstart := proc(file) fprintf(file, "
") end proc
> # Begin Function number 14
> logend := proc(file)
> fprintf(file,"
\n");
> # End Function number 14
> end;
logend := proc(file) fprintf(file, "\n") end proc
> # Begin Function number 15
> not_reached_end := proc(x,x_end)
> global neg_h;
> local ret;
>
>
>
> if ((glob_neg_h and (x > x_end)) or (( not glob_neg_h) and (x < x_end))) then # if number 13
> ret := true;
> else
> ret := false;
> fi;# end if 13
> ;
>
>
> ret;
>
> # End Function number 15
> end;
not_reached_end := proc(x, x_end)
local ret;
global neg_h;
if glob_neg_h and x_end < x or not glob_neg_h and x < x_end then
ret := true
else ret := false
end if;
ret
end proc
> # Begin Function number 16
> 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 16
> 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 17
> 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 17
> 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 18
> 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 18
> 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 19
> factorial_2 := proc(nnn)
> local ret;
>
>
>
> ret := nnn!;
>
> # End Function number 19
> end;
factorial_2 := proc(nnn) local ret; ret := nnn! end proc
> # Begin Function number 20
> 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 20
> 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 21
> 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 21
> 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 22
> convfp := proc(mmm)
> (mmm);
>
> # End Function number 22
> end;
convfp := proc(mmm) mmm end proc
> # Begin Function number 23
> convfloat := proc(mmm)
> (mmm);
>
> # End Function number 23
> 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) * arctan(0.1 * x + 0.2) - 5.0 * ln(1.0 +
> expt((0.1 * x + 0.2) , 2)));
> end;
exact_soln_y := proc(x)
return 10.0*(0.1*x + 0.2)*arctan(0.1*x + 0.2)
- 5.0*ln(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_max_terms,
> glob_iolevel,
> DEBUGL,
> INFO,
> ALWAYS,
> DEBUGMASSIVE,
> #Top Generate Globals Decl
> glob_normmax,
> glob_disp_incr,
> glob_optimal_done,
> glob_not_yet_finished,
> centuries_in_millinium,
> glob_max_minutes,
> glob_log10relerr,
> glob_max_sec,
> glob_smallish_float,
> glob_max_trunc_err,
> days_in_year,
> glob_display_flag,
> glob_neg_h,
> glob_almost_1,
> glob_subiter_method,
> glob_curr_iter_when_opt,
> glob_log10_relerr,
> glob_hmin,
> glob_h,
> glob_percent_done,
> MAX_UNCHANGED,
> glob_last_good_h,
> glob_large_float,
> glob_hmin_init,
> glob_not_yet_start_msg,
> years_in_century,
> glob_log10normmin,
> glob_log10abserr,
> glob_max_hours,
> glob_display_interval,
> glob_hmax,
> glob_reached_optimal_h,
> min_in_hour,
> djd_debug2,
> glob_optimal_expect_sec,
> glob_max_rel_trunc_err,
> glob_log10_abserr,
> glob_clock_start_sec,
> sec_in_minute,
> djd_debug,
> glob_iter,
> glob_orig_start_sec,
> glob_max_iter,
> glob_dump_analytic,
> glob_clock_sec,
> glob_max_opt_iter,
> glob_good_digits,
> glob_html_log,
> glob_optimal_start,
> glob_no_eqs,
> glob_abserr,
> glob_next_display,
> glob_current_iter,
> glob_start,
> glob_warned2,
> hours_in_day,
> glob_dump,
> glob_warned,
> glob_unchanged_h_cnt,
> glob_small_float,
> glob_optimal_clock_start_sec,
> glob_relerr,
> glob_look_poles,
> glob_initial_pass,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_0D2,
> array_const_0D1,
> array_const_0D0,
> array_const_1,
> #END CONST
> array_tmp3_a1,
> array_tmp3_a2,
> array_1st_rel_error,
> array_norms,
> array_m1,
> array_last_rel_error,
> array_fact_1,
> array_y,
> array_x,
> array_y_init,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_type_pole,
> array_pole,
> array_poles,
> array_y_higher_work2,
> array_y_set_initial,
> array_real_pole,
> array_fact_2,
> array_y_higher,
> array_y_higher_work,
> array_complex_pole,
> glob_last;
> glob_last;
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> glob_iolevel := INFO;
> glob_max_terms := 30;
> glob_iolevel := 5;
> DEBUGL := 3;
> INFO := 2;
> ALWAYS := 1;
> DEBUGMASSIVE := 4;
> glob_normmax := 0.0;
> glob_disp_incr := 0.1;
> glob_optimal_done := false;
> glob_not_yet_finished := true;
> centuries_in_millinium := 10;
> glob_max_minutes := 0.0;
> glob_log10relerr := 0.0;
> glob_max_sec := 10000.0;
> glob_smallish_float := 0.1e-100;
> glob_max_trunc_err := 0.1e-10;
> days_in_year := 365;
> glob_display_flag := true;
> glob_neg_h := false;
> glob_almost_1 := 0.9990;
> glob_subiter_method := 3;
> glob_curr_iter_when_opt := 0;
> glob_log10_relerr := 0.1e-10;
> glob_hmin := 0.00000000001;
> glob_h := 0.1;
> glob_percent_done := 0.0;
> MAX_UNCHANGED := 10;
> glob_last_good_h := 0.1;
> glob_large_float := 9.0e100;
> glob_hmin_init := 0.001;
> glob_not_yet_start_msg := true;
> years_in_century := 100;
> glob_log10normmin := 0.1;
> glob_log10abserr := 0.0;
> glob_max_hours := 0.0;
> glob_display_interval := 0.0;
> glob_hmax := 1.0;
> glob_reached_optimal_h := false;
> min_in_hour := 60;
> djd_debug2 := true;
> glob_optimal_expect_sec := 0.1;
> glob_max_rel_trunc_err := 0.1e-10;
> glob_log10_abserr := 0.1e-10;
> glob_clock_start_sec := 0.0;
> sec_in_minute := 60;
> djd_debug := true;
> glob_iter := 0;
> glob_orig_start_sec := 0.0;
> glob_max_iter := 1000;
> glob_dump_analytic := false;
> glob_clock_sec := 0.0;
> glob_max_opt_iter := 10;
> glob_good_digits := 0;
> glob_html_log := true;
> glob_optimal_start := 0.0;
> glob_no_eqs := 0;
> glob_abserr := 0.1e-10;
> glob_next_display := 0.0;
> glob_current_iter := 0;
> glob_start := 0;
> glob_warned2 := false;
> hours_in_day := 24;
> glob_dump := false;
> glob_warned := false;
> glob_unchanged_h_cnt := 0;
> glob_small_float := 0.1e-50;
> glob_optimal_clock_start_sec := 0.0;
> glob_relerr := 0.1e-10;
> glob_look_poles := false;
> glob_initial_pass := true;
> #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_arctanpostode.ode#################");
> omniout_str(ALWAYS,"diff ( y , x , 1 ) = arctan (0.1 * x + 0.2 ) ;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"Digits := 32;");
> omniout_str(ALWAYS,"max_terms := 30;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"x_start := -1.0;");
> omniout_str(ALWAYS,"x_end := 5.00 ;");
> 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.005 ;");
> omniout_str(ALWAYS,"glob_display_interval := 0.1;");
> omniout_str(ALWAYS,"glob_look_poles := true;");
> omniout_str(ALWAYS,"glob_max_iter := 10000;");
> omniout_str(ALWAYS,"glob_max_minutes := 10;");
> 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) * arctan(0.1 * x + 0.2) - 5.0 * ln(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
> Digits := 32;
> max_terms := 30;
> #END FIRST INPUT BLOCK
> #START OF INITS AFTER INPUT BLOCK
> glob_max_terms := max_terms;
> glob_html_log := true;
> #END OF INITS AFTER INPUT BLOCK
> array_tmp3_a1:= Array(0..(max_terms + 1),[]);
> array_tmp3_a2:= Array(0..(max_terms + 1),[]);
> array_1st_rel_error:= Array(0..(max_terms + 1),[]);
> array_norms:= Array(0..(max_terms + 1),[]);
> array_m1:= Array(0..(max_terms + 1),[]);
> array_last_rel_error:= 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_y_init:= 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_type_pole:= Array(0..(max_terms + 1),[]);
> array_pole:= Array(0..(max_terms + 1),[]);
> array_poles := Array(0..(1+ 1) ,(0..3+ 1),[]);
> array_y_higher_work2 := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_y_set_initial := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_real_pole := Array(0..(1+ 1) ,(0..3+ 1),[]);
> array_fact_2 := Array(0..(max_terms+ 1) ,(0..max_terms+ 1),[]);
> array_y_higher := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_y_higher_work := Array(0..(2+ 1) ,(0..max_terms+ 1),[]);
> array_complex_pole := Array(0..(1+ 1) ,(0..3+ 1),[]);
> 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_tmp3_a2[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_1st_rel_error[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_norms[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_m1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> term := 1;
> while (term <= max_terms) do # do number 2
> array_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_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_y_init[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_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
> ;
> ord := 1;
> while (ord <=1) do # do number 2
> term := 1;
> while (term <= 3) do # do number 3
> array_poles[ord,term] := 0.0;
> term := term + 1;
> od;# end do number 3
> ;
> ord := ord + 1;
> od;# end do number 2
> ;
> ord := 1;
> while (ord <=2) do # do number 2
> term := 1;
> while (term <= max_terms) do # do number 3
> array_y_higher_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_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 <=1) do # do number 2
> term := 1;
> while (term <= 3) do # do number 3
> array_real_pole[ord,term] := 0.0;
> term := term + 1;
> od;# end do number 3
> ;
> ord := ord + 1;
> od;# end do number 2
> ;
> ord := 1;
> while (ord <=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 <=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 <=2) do # do number 2
> term := 1;
> while (term <= max_terms) do # do number 3
> array_y_higher_work[ord,term] := 0.0;
> term := term + 1;
> od;# end do number 3
> ;
> ord := ord + 1;
> od;# end do number 2
> ;
> ord := 1;
> while (ord <=1) do # do number 2
> term := 1;
> while (term <= 3) do # do number 3
> array_complex_pole[ord,term] := 0.0;
> term := term + 1;
> od;# end do number 3
> ;
> ord := ord + 1;
> od;# end do number 2
> ;
> #BEGIN ARRAYS DEFINED AND INITIALIZATED
> array_tmp3_a2 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp3_a2[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> 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_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_tmp4 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp4[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_tmp3 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp3[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_tmp2 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp2[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_tmp1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_tmp0 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_tmp0[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_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_const_1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms + 1) do # do number 2
> array_const_1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_const_1[1] := 1;
> array_m1 := Array(1..(max_terms+1 + 1),[]);
> term := 1;
> while (term <= max_terms) do # do number 2
> array_m1[term] := 0.0;
> term := term + 1;
> od;# end do number 2
> ;
> array_m1[1] := -1.0;
> #END ARRAYS DEFINED AND INITIALIZATED
> #Initing Factorial Tables
> iiif := 0;
> while (iiif <= glob_max_terms) do # do number 2
> jjjf := 0;
> while (jjjf <= glob_max_terms) do # do number 3
> array_fact_1[iiif] := 0;
> array_fact_2[iiif,jjjf] := 0;
> jjjf := jjjf + 1;
> od;# end do number 3
> ;
> iiif := iiif + 1;
> od;# end do number 2
> ;
> #Done Initing Factorial Tables
> #TOP SECOND INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> #END FIRST INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> x_start := -1.0;
> x_end := 5.00 ;
> 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.005 ;
> glob_display_interval := 0.1;
> glob_look_poles := true;
> glob_max_iter := 10000;
> glob_max_minutes := 10;
> #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));
> if (glob_h > 0.0) then # if number 1
> glob_neg_h := false;
> glob_display_interval := omniabs(glob_display_interval);
> else
> glob_neg_h := true;
> glob_display_interval := -omniabs(glob_display_interval);
> fi;# end if 1
> ;
> 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;
> glob_next_display := x_start;
> 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 not_reached_end(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
> if (reached_interval()) then # if number 2
> omniout_str(INFO," ");
> omniout_str(INFO,"TOP MAIN SOLVE Loop");
> fi;# end if 2
> ;
> 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
> if (reached_interval()) then # if number 2
> glob_next_display := glob_next_display + glob_display_interval;
> fi;# end if 2
> ;
> 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 ) = arctan (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-09-20T23:33:33-05:00")
> ;
> logitem_str(html_log_file,"Maple")
> ;
> logitem_str(html_log_file,"lin_arctan")
> ;
> logitem_str(html_log_file,"diff ( y , x , 1 ) = arctan (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_good_digits(html_log_file,array_last_rel_error[1])
> ;
> 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," 130 | ")
> ;
> logitem_str(html_log_file,"lin_arctan diffeq.mxt")
> ;
> logitem_str(html_log_file,"lin_arctan 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 9
> 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_max_terms, glob_iolevel, DEBUGL, INFO, ALWAYS, DEBUGMASSIVE,
glob_normmax, glob_disp_incr, glob_optimal_done, glob_not_yet_finished,
centuries_in_millinium, glob_max_minutes, glob_log10relerr, glob_max_sec,
glob_smallish_float, glob_max_trunc_err, days_in_year, glob_display_flag,
glob_neg_h, glob_almost_1, glob_subiter_method, glob_curr_iter_when_opt,
glob_log10_relerr, glob_hmin, glob_h, glob_percent_done, MAX_UNCHANGED,
glob_last_good_h, glob_large_float, glob_hmin_init, glob_not_yet_start_msg,
years_in_century, glob_log10normmin, glob_log10abserr, glob_max_hours,
glob_display_interval, glob_hmax, glob_reached_optimal_h, min_in_hour,
djd_debug2, glob_optimal_expect_sec, glob_max_rel_trunc_err,
glob_log10_abserr, glob_clock_start_sec, sec_in_minute, djd_debug,
glob_iter, glob_orig_start_sec, glob_max_iter, glob_dump_analytic,
glob_clock_sec, glob_max_opt_iter, glob_good_digits, glob_html_log,
glob_optimal_start, glob_no_eqs, glob_abserr, glob_next_display,
glob_current_iter, glob_start, glob_warned2, hours_in_day, glob_dump,
glob_warned, glob_unchanged_h_cnt, glob_small_float,
glob_optimal_clock_start_sec, glob_relerr, glob_look_poles,
glob_initial_pass, array_const_0D2, array_const_0D1, array_const_0D0,
array_const_1, array_tmp3_a1, array_tmp3_a2, array_1st_rel_error,
array_norms, array_m1, array_last_rel_error, array_fact_1, array_y, array_x,
array_y_init, array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4,
array_type_pole, array_pole, array_poles, array_y_higher_work2,
array_y_set_initial, array_real_pole, array_fact_2, array_y_higher,
array_y_higher_work, array_complex_pole, glob_last;
glob_last;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
glob_iolevel := INFO;
glob_max_terms := 30;
glob_iolevel := 5;
DEBUGL := 3;
INFO := 2;
ALWAYS := 1;
DEBUGMASSIVE := 4;
glob_normmax := 0.;
glob_disp_incr := 0.1;
glob_optimal_done := false;
glob_not_yet_finished := true;
centuries_in_millinium := 10;
glob_max_minutes := 0.;
glob_log10relerr := 0.;
glob_max_sec := 10000.0;
glob_smallish_float := 0.1*10^(-100);
glob_max_trunc_err := 0.1*10^(-10);
days_in_year := 365;
glob_display_flag := true;
glob_neg_h := false;
glob_almost_1 := 0.9990;
glob_subiter_method := 3;
glob_curr_iter_when_opt := 0;
glob_log10_relerr := 0.1*10^(-10);
glob_hmin := 0.1*10^(-10);
glob_h := 0.1;
glob_percent_done := 0.;
MAX_UNCHANGED := 10;
glob_last_good_h := 0.1;
glob_large_float := 0.90*10^101;
glob_hmin_init := 0.001;
glob_not_yet_start_msg := true;
years_in_century := 100;
glob_log10normmin := 0.1;
glob_log10abserr := 0.;
glob_max_hours := 0.;
glob_display_interval := 0.;
glob_hmax := 1.0;
glob_reached_optimal_h := false;
min_in_hour := 60;
djd_debug2 := true;
glob_optimal_expect_sec := 0.1;
glob_max_rel_trunc_err := 0.1*10^(-10);
glob_log10_abserr := 0.1*10^(-10);
glob_clock_start_sec := 0.;
sec_in_minute := 60;
djd_debug := true;
glob_iter := 0;
glob_orig_start_sec := 0.;
glob_max_iter := 1000;
glob_dump_analytic := false;
glob_clock_sec := 0.;
glob_max_opt_iter := 10;
glob_good_digits := 0;
glob_html_log := true;
glob_optimal_start := 0.;
glob_no_eqs := 0;
glob_abserr := 0.1*10^(-10);
glob_next_display := 0.;
glob_current_iter := 0;
glob_start := 0;
glob_warned2 := false;
hours_in_day := 24;
glob_dump := false;
glob_warned := false;
glob_unchanged_h_cnt := 0;
glob_small_float := 0.1*10^(-50);
glob_optimal_clock_start_sec := 0.;
glob_relerr := 0.1*10^(-10);
glob_look_poles := false;
glob_initial_pass := true;
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_arctanpostode.ode#################");
omniout_str(ALWAYS, "diff ( y , x , 1 ) = arctan (0.1 * x + 0.2 ) ;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
omniout_str(ALWAYS, "Digits := 32;");
omniout_str(ALWAYS, "max_terms := 30;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
omniout_str(ALWAYS, "x_start := -1.0;");
omniout_str(ALWAYS, "x_end := 5.00 ;");
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.005 ;");
omniout_str(ALWAYS, "glob_display_interval := 0.1;");
omniout_str(ALWAYS, "glob_look_poles := true;");
omniout_str(ALWAYS, "glob_max_iter := 10000;");
omniout_str(ALWAYS, "glob_max_minutes := 10;");
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) * arctan(0.1 * x +\
0.2) - 5.0 * ln(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;
Digits := 32;
max_terms := 30;
glob_max_terms := max_terms;
glob_html_log := true;
array_tmp3_a1 := Array(0 .. max_terms + 1, []);
array_tmp3_a2 := Array(0 .. max_terms + 1, []);
array_1st_rel_error := Array(0 .. max_terms + 1, []);
array_norms := Array(0 .. max_terms + 1, []);
array_m1 := Array(0 .. max_terms + 1, []);
array_last_rel_error := 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_y_init := 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_type_pole := Array(0 .. max_terms + 1, []);
array_pole := Array(0 .. max_terms + 1, []);
array_poles := Array(0 .. 2, 0 .. 4, []);
array_y_higher_work2 := Array(0 .. 3, 0 .. max_terms + 1, []);
array_y_set_initial := Array(0 .. 3, 0 .. max_terms + 1, []);
array_real_pole := Array(0 .. 2, 0 .. 4, []);
array_fact_2 := Array(0 .. max_terms + 1, 0 .. max_terms + 1, []);
array_y_higher := Array(0 .. 3, 0 .. max_terms + 1, []);
array_y_higher_work := Array(0 .. 3, 0 .. max_terms + 1, []);
array_complex_pole := Array(0 .. 2, 0 .. 4, []);
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_tmp3_a2[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do
array_1st_rel_error[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_norms[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do array_m1[term] := 0.; term := term + 1
end do;
term := 1;
while term <= max_terms do
array_last_rel_error[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_y_init[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_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;
ord := 1;
while ord <= 1 do
term := 1;
while term <= 3 do array_poles[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= max_terms do
array_y_higher_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_set_initial[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;
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 <= 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 <= 2 do
term := 1;
while term <= max_terms do
array_y_higher_work[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 1 do
term := 1;
while term <= 3 do
array_complex_pole[ord, term] := 0.; term := term + 1
end do;
ord := ord + 1
end do;
array_tmp3_a2 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_tmp3_a2[term] := 0.; term := term + 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_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_tmp4 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_tmp4[term] := 0.; term := term + 1
end do;
array_tmp3 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_tmp3[term] := 0.; term := term + 1
end do;
array_tmp2 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_tmp2[term] := 0.; term := term + 1
end do;
array_tmp1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_tmp1[term] := 0.; term := term + 1
end do;
array_tmp0 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do array_tmp0[term] := 0.; term := term + 1
end do;
array_const_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_const_1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms + 1 do
array_const_1[term] := 0.; term := term + 1
end do;
array_const_1[1] := 1;
array_m1 := Array(1 .. max_terms + 2, []);
term := 1;
while term <= max_terms do array_m1[term] := 0.; term := term + 1
end do;
array_m1[1] := -1.0;
iiif := 0;
while iiif <= glob_max_terms do
jjjf := 0;
while jjjf <= glob_max_terms do
array_fact_1[iiif] := 0;
array_fact_2[iiif, jjjf] := 0;
jjjf := jjjf + 1
end do;
iiif := iiif + 1
end do;
x_start := -1.0;
x_end := 5.00;
array_y_init[1] := exact_soln_y(x_start);
glob_h := 0.00001;
glob_look_poles := true;
glob_max_iter := 100;
glob_h := 0.005;
glob_display_interval := 0.1;
glob_look_poles := true;
glob_max_iter := 10000;
glob_max_minutes := 10;
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);
if 0. < glob_h then
glob_neg_h := false;
glob_display_interval := omniabs(glob_display_interval)
else
glob_neg_h := true;
glob_display_interval := -omniabs(glob_display_interval)
end if;
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;
glob_next_display := x_start;
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
not_reached_end(array_x[1], x_end) and
convfloat(glob_clock_sec) - convfloat(glob_orig_start_sec) <
convfloat(glob_max_sec) do
if reached_interval() then
omniout_str(INFO, " ");
omniout_str(INFO, "TOP MAIN SOLVE Loop")
end if;
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;
if reached_interval() then
glob_next_display := glob_next_display + glob_display_interval
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 ) = arctan (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-09-20T23:33:33-05:00");
logitem_str(html_log_file, "Maple");
logitem_str(html_log_file,
"lin_arctan");
logitem_str(html_log_file,
"diff ( y , x , 1 ) = arctan (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_good_digits(html_log_file, array_last_rel_error[1]);
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, " 130 | ");
logitem_str(html_log_file, "lin_arctan diffeq.mxt");
logitem_str(html_log_file, "lin_arctan 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_arctanpostode.ode#################
diff ( y , x , 1 ) = arctan (0.1 * x + 0.2 ) ;
!
#BEGIN FIRST INPUT BLOCK
Digits := 32;
max_terms := 30;
!
#END FIRST INPUT BLOCK
#BEGIN SECOND INPUT BLOCK
x_start := -1.0;
x_end := 5.00 ;
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.005 ;
glob_display_interval := 0.1;
glob_look_poles := true;
glob_max_iter := 10000;
glob_max_minutes := 10;
#END OVERRIDE BLOCK
!
#BEGIN USER DEF BLOCK
exact_soln_y := proc(x)
return(10.0 * (0.1 * x + 0.2) * arctan(0.1 * x + 0.2) - 5.0 * ln(1.0 +
expt((0.1 * x + 0.2) , 2)));
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
x[1] = -1
y[1] (analytic) = 0.049916998225321613137369332156717
y[1] (numeric) = 0.049916998225321613137369332156717
absolute error = 0
relative error = 0 %
Correct digits = 32
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.04
Order of pole = 0.8775
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=3.8MB, alloc=2.9MB, time=0.35
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=7.6MB, alloc=4.0MB, time=0.72
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=11.4MB, alloc=4.1MB, time=1.09
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=15.2MB, alloc=4.3MB, time=1.48
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=19.0MB, alloc=4.3MB, time=1.86
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.9
y[1] (analytic) = 0.06037857838774650779975297353032
y[1] (numeric) = 0.060378579251020533018904384632998
absolute error = 8.63274025219151411102678e-10
relative error = 1.4297687164399154009449401984035e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.05
Order of pole = 0.8708
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=22.8MB, alloc=4.3MB, time=2.26
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=26.7MB, alloc=4.3MB, time=2.64
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=30.5MB, alloc=4.3MB, time=3.03
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=34.3MB, alloc=4.3MB, time=3.42
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.8
y[1] (analytic) = 0.071828187717884016098280550436325
y[1] (numeric) = 0.071828189524743161147877663296043
absolute error = 1.806859145049597112859718e-09
relative error = 2.5155293519952187775885102291852e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=38.1MB, alloc=4.3MB, time=3.81
Complex estimate of poles used
Radius of convergence = 10.06
Order of pole = 0.8639
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=41.9MB, alloc=4.3MB, time=4.19
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=45.7MB, alloc=4.4MB, time=4.57
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=49.5MB, alloc=4.4MB, time=4.95
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=53.4MB, alloc=4.4MB, time=5.34
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.7
y[1] (analytic) = 0.084263586187812438053579197706615
y[1] (numeric) = 0.084263589017994655375766445170253
absolute error = 2.830182217322187247463638e-09
relative error = 3.3587250974745885540394148971918e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.08
Order of pole = 0.8567
WARNING: arctan of linear function has low precision in testing.
memory used=57.2MB, alloc=4.4MB, time=5.72
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=61.0MB, alloc=4.4MB, time=6.12
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=64.8MB, alloc=4.4MB, time=6.51
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=68.6MB, alloc=4.4MB, time=6.90
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=72.4MB, alloc=4.4MB, time=7.29
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.6
y[1] (analytic) = 0.097682350475783228958282207455125
y[1] (numeric) = 0.09768235440840401623688947856229
absolute error = 3.932620787278607271107165e-09
relative error = 4.0259276810231516285285131881009e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.09
Order of pole = 0.8495
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=76.2MB, alloc=4.4MB, time=7.68
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=80.1MB, alloc=4.4MB, time=8.06
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=83.9MB, alloc=4.4MB, time=8.45
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=87.7MB, alloc=4.4MB, time=8.83
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.5
y[1] (analytic) = 0.11208187674014708166442030326728
y[1] (numeric) = 0.11208188185365040850830360054427
absolute error = 5.11350332684388329727699e-09
relative error = 4.5622927413136863585831308673619e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=91.5MB, alloc=4.4MB, time=9.21
Complex estimate of poles used
Radius of convergence = 10.11
Order of pole = 0.8424
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=95.3MB, alloc=4.4MB, time=9.59
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=99.1MB, alloc=4.4MB, time=9.97
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=103.0MB, alloc=4.4MB, time=10.35
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=106.8MB, alloc=4.4MB, time=10.74
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.4
y[1] (analytic) = 0.12745938357689953903008680616577
y[1] (numeric) = 0.12745938994900906758692707170889
absolute error = 6.37210952855684026554312e-09
relative error = 4.9993255496268597307837372829742e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.13
Order of pole = 0.8355
WARNING: arctan of linear function has low precision in testing.
memory used=110.6MB, alloc=4.4MB, time=11.12
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=114.4MB, alloc=4.4MB, time=11.51
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=118.2MB, alloc=4.4MB, time=11.90
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=122.0MB, alloc=4.4MB, time=12.29
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=125.8MB, alloc=4.4MB, time=12.67
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.3
y[1] (analytic) = 0.14381191515266334025922184871182
y[1] (numeric) = 0.14381192286033400053370335283661
absolute error = 7.70767066027448150412479e-09
relative error = 5.3595494170927452994053733632734e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.15
Order of pole = 0.8287
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=129.7MB, alloc=4.4MB, time=13.06
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=133.5MB, alloc=4.4MB, time=13.45
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=137.3MB, alloc=4.4MB, time=13.83
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=141.1MB, alloc=4.4MB, time=14.21
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=144.9MB, alloc=4.4MB, time=14.60
x[1] = -0.2
y[1] (analytic) = 0.16113634450454684808432655321093
y[1] (numeric) = 0.16113635362391683462274361954443
absolute error = 9.11936998653841706633350e-09
relative error = 5.6594122291765730044887808094805e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.17
Order of pole = 0.822
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=148.7MB, alloc=4.4MB, time=14.99
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=152.5MB, alloc=4.4MB, time=15.37
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=156.4MB, alloc=4.4MB, time=15.77
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=160.2MB, alloc=4.4MB, time=16.15
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = -0.1
y[1] (analytic) = 0.17942937699798229240359360273966
y[1] (numeric) = 0.17942938760432555456712927308674
absolute error = 1.060634326216353567034708e-08
relative error = 5.9111520307417694672742957233773e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.19
Order of pole = 0.8153
x[1] = -0.095
y[1] (analytic) = 0.18036939310401654790978627204604
y[1] (numeric) = 0.18036940378666826900405060066363
absolute error = 1.068265172109426432861759e-08
relative error = 5.9226521402850904019996158076869e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=164.0MB, alloc=4.4MB, time=16.54
Complex estimate of poles used
Radius of convergence = 10.19
Order of pole = 0.8149
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=167.8MB, alloc=4.4MB, time=16.93
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=171.6MB, alloc=4.5MB, time=17.32
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=175.4MB, alloc=4.5MB, time=17.71
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=179.2MB, alloc=4.5MB, time=18.09
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=183.1MB, alloc=4.5MB, time=18.48
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=186.9MB, alloc=4.5MB, time=18.86
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=190.7MB, alloc=4.5MB, time=19.24
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=194.5MB, alloc=4.5MB, time=19.64
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.1
y[1] (analytic) = 0.21890725629198612801980124152496
y[1] (numeric) = 0.21890727009440676782901156048368
absolute error = 1.380242063980921031895872e-08
relative error = 6.3051453266579069510737682596897e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=198.3MB, alloc=4.5MB, time=20.03
Complex estimate of poles used
Radius of convergence = 10.24
Order of pole = 0.801
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=202.1MB, alloc=4.5MB, time=20.42
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=205.9MB, alloc=4.5MB, time=20.82
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=209.8MB, alloc=4.5MB, time=21.20
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=213.6MB, alloc=4.5MB, time=21.60
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.2
y[1] (analytic) = 0.24008470861182528779590853745225
y[1] (numeric) = 0.24008472412138954316214343073112
absolute error = 1.550956425536623489327887e-08
relative error = 6.4600383527309397189748248999308e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.26
Order of pole = 0.7934
WARNING: arctan of linear function has low precision in testing.
memory used=217.4MB, alloc=4.5MB, time=21.98
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=221.2MB, alloc=4.5MB, time=22.38
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=225.0MB, alloc=4.5MB, time=22.77
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=228.8MB, alloc=4.5MB, time=23.18
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=232.7MB, alloc=4.5MB, time=23.56
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.3
y[1] (analytic) = 0.2622159829830499755417386454602
y[1] (numeric) = 0.262216000271112390274309590923
absolute error = 1.728806241473257094546280e-08
relative error = 6.5930620315581970349840411302712e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.29
Order of pole = 0.7853
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=236.5MB, alloc=4.5MB, time=23.95
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=240.3MB, alloc=4.5MB, time=24.33
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=244.1MB, alloc=4.5MB, time=24.71
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=247.9MB, alloc=4.5MB, time=25.09
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=251.7MB, alloc=4.5MB, time=25.50
Complex estimate of poles used
x[1] = 0.4
y[1] (analytic) = 0.28529700315364808225567901837124
y[1] (numeric) = 0.28529702229047166708260761003939
absolute error = 1.913682358482692859166815e-08
relative error = 6.7076847542351153275274114932432e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.31
Order of pole = 0.7768
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=255.5MB, alloc=4.5MB, time=25.89
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=259.4MB, alloc=4.5MB, time=26.29
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=263.2MB, alloc=4.5MB, time=26.68
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=267.0MB, alloc=4.5MB, time=27.08
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.5
y[1] (analytic) = 0.3093235487349861725271755428261
y[1] (numeric) = 0.30932356978969962167792198657445
absolute error = 2.105471344915074644374835e-08
relative error = 6.8066959451539953372378050792272e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.34
Order of pole = 0.7679
WARNING: arctan of linear function has low precision in testing.
memory used=270.8MB, alloc=4.5MB, time=27.48
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=274.6MB, alloc=4.5MB, time=27.87
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=278.4MB, alloc=4.5MB, time=28.26
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=282.2MB, alloc=4.5MB, time=28.66
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=286.1MB, alloc=4.5MB, time=29.07
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.6
y[1] (analytic) = 0.3342912594973313195326371283665
y[1] (numeric) = 0.33429128253788733702594173612742
absolute error = 2.304055601749330460776092e-08
relative error = 6.8923596902111763602823057935119e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.37
Order of pole = 0.7588
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=289.9MB, alloc=4.5MB, time=29.46
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=293.7MB, alloc=4.5MB, time=29.86
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=297.5MB, alloc=4.5MB, time=30.25
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=301.3MB, alloc=4.5MB, time=30.65
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=305.1MB, alloc=4.5MB, time=31.05
Complex estimate of poles used
x[1] = 0.7
y[1] (analytic) = 0.36019563974530111364378991284437
y[1] (numeric) = 0.36019566483843594477161559010921
absolute error = 2.509313483112782567726484e-08
relative error = 6.9665293141448070437694870790130e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.4
Order of pole = 0.7495
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=308.9MB, alloc=4.5MB, time=31.45
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=312.8MB, alloc=4.5MB, time=31.84
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=316.6MB, alloc=4.5MB, time=32.24
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=320.4MB, alloc=4.5MB, time=32.63
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.8
y[1] (analytic) = 0.38703206276326201066206079465046
y[1] (numeric) = 0.38703208997445627366352238830107
absolute error = 2.721119426300146159365061e-08
relative error = 7.0307338541215071257803428298713e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=324.2MB, alloc=4.5MB, time=33.02
Complex estimate of poles used
Radius of convergence = 10.43
Order of pole = 0.7404
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=328.0MB, alloc=4.5MB, time=33.42
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=331.8MB, alloc=4.5MB, time=33.79
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=335.7MB, alloc=4.5MB, time=34.19
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=339.5MB, alloc=4.5MB, time=34.59
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 0.9
y[1] (analytic) = 0.41479577532077918049777437070183
y[1] (numeric) = 0.41479580471422009210019999510269
absolute error = 2.939344091160242562440086e-08
relative error = 7.0862440411480155652824299864660e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.46
Order of pole = 0.7319
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=343.3MB, alloc=4.5MB, time=35.01
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=347.1MB, alloc=4.5MB, time=35.40
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=350.9MB, alloc=4.5MB, time=35.80
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=354.7MB, alloc=4.5MB, time=36.20
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=358.5MB, alloc=4.5MB, time=36.59
Complex estimate of poles used
x[1] = 1
y[1] (analytic) = 0.44348190222833961428014615009631
y[1] (numeric) = 0.44348193386688470066080721612868
absolute error = 3.163854508638066106603237e-08
relative error = 7.1341231575422060325316079052193e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.5
Order of pole = 0.725
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=362.4MB, alloc=4.5MB, time=36.99
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=366.2MB, alloc=4.5MB, time=37.39
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=370.0MB, alloc=4.5MB, time=37.79
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=373.8MB, alloc=4.5MB, time=38.18
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.1
y[1] (analytic) = 0.47308545093372247996567471683395
y[1] (numeric) = 0.47308548487886486178053937764538
absolute error = 3.394514238181486466081143e-08
relative error = 7.1752666066601260632631137422697e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=377.6MB, alloc=4.5MB, time=38.58
Complex estimate of poles used
Radius of convergence = 10.54
Order of pole = 0.7219
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=381.4MB, alloc=4.5MB, time=38.99
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=385.2MB, alloc=4.5MB, time=39.39
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=389.1MB, alloc=4.5MB, time=39.79
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=392.9MB, alloc=4.5MB, time=40.19
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.2
y[1] (analytic) = 0.50360131614957448076102235480761
y[1] (numeric) = 0.50360135246140981722917833017954
absolute error = 3.631183533646815597537193e-08
relative error = 7.2104329698938253568883996703090e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.58
Order of pole = 0.7271
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=396.7MB, alloc=4.5MB, time=40.60
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=400.5MB, alloc=4.5MB, time=41.00
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=404.3MB, alloc=4.5MB, time=41.39
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=408.1MB, alloc=4.5MB, time=41.79
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=412.0MB, alloc=4.5MB, time=42.19
Complex estimate of poles used
x[1] = 1.3
y[1] (analytic) = 0.5350242845029610528311706800787
y[1] (numeric) = 0.53502432324015622549723208978928
absolute error = 3.873719517266606140971058e-08
relative error = 7.2402685812015086638375853942724e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.63
Order of pole = 0.7501
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=415.8MB, alloc=4.5MB, time=42.59
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=419.6MB, alloc=4.5MB, time=42.98
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=423.4MB, alloc=4.5MB, time=43.37
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=427.2MB, alloc=4.5MB, time=43.75
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.4
y[1] (analytic) = 0.56734903919790433664636203952965
y[1] (numeric) = 0.56734908041766794841798599064486
absolute error = 4.121976361177162395111521e-08
relative error = 7.2653271203290478312486875157966e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=431.0MB, alloc=4.5MB, time=44.15
Complex estimate of poles used
Radius of convergence = 10.69
Order of pole = 0.8086
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=434.8MB, alloc=4.5MB, time=44.55
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=438.7MB, alloc=4.5MB, time=44.95
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=442.5MB, alloc=4.5MB, time=45.35
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=446.3MB, alloc=4.5MB, time=45.75
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.5
y[1] (analytic) = 0.60057016468218360297307201699105
y[1] (numeric) = 0.60057020844023836240321783199481
absolute error = 4.375805475943014581500376e-08
relative error = 7.2860853456792213021351888407585e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.79
Order of pole = 0.9357
WARNING: arctan of linear function has low precision in testing.
memory used=450.1MB, alloc=4.5MB, time=46.16
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=453.9MB, alloc=4.5MB, time=46.56
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=457.7MB, alloc=4.5MB, time=46.95
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=461.5MB, alloc=4.5MB, time=47.35
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=465.4MB, alloc=4.5MB, time=47.74
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.6
y[1] (analytic) = 0.6346821513099608006294070822722
y[1] (numeric) = 0.63468219766051785524539296270056
absolute error = 4.635055705461598588042836e-08
relative error = 7.3029558116531444062961303096950e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 10.94
Order of pole = 1.19
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=469.2MB, alloc=4.5MB, time=48.14
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=473.0MB, alloc=4.5MB, time=48.54
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=476.8MB, alloc=4.5MB, time=48.94
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=480.6MB, alloc=4.5MB, time=49.33
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.7
y[1] (analytic) = 0.66967939999210068856619731958885
y[1] (numeric) = 0.66967944898783596440667938747649
absolute error = 4.899573527584048206788764e-08
relative error = 7.3162972127287205146438290673770e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=484.4MB, alloc=4.5MB, time=49.73
Complex estimate of poles used
Radius of convergence = 11.18
Order of pole = 1.681
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=488.2MB, alloc=4.5MB, time=50.12
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=492.1MB, alloc=4.5MB, time=50.52
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=495.9MB, alloc=4.5MB, time=50.91
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=499.7MB, alloc=4.5MB, time=51.31
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.8
y[1] (analytic) = 0.70555622682637918903704272254555
y[1] (numeric) = 0.7055562785184117865138533719969
absolute error = 5.169203259747681064945135e-08
relative error = 7.3264228465518178199297495742522e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 11.59
Order of pole = 2.611
WARNING: arctan of linear function has low precision in testing.
memory used=503.5MB, alloc=4.5MB, time=51.71
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=507.3MB, alloc=4.5MB, time=52.11
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=511.1MB, alloc=4.5MB, time=52.50
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=515.0MB, alloc=4.5MB, time=52.89
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=518.8MB, alloc=4.5MB, time=53.29
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 1.9
y[1] (analytic) = 0.742306867700112739727083633541
y[1] (numeric) = 0.74230692213798542855373607768046
absolute error = 5.443787268882665244413946e-08
relative error = 7.3336075762698193550570849357072e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 12.32
Order of pole = 4.415
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=522.6MB, alloc=4.5MB, time=53.69
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=526.4MB, alloc=4.5MB, time=54.09
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=530.2MB, alloc=4.5MB, time=54.49
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
memory used=534.0MB, alloc=4.5MB, time=54.88
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 2
y[1] (analytic) = 0.779925482858093155305584837694
y[1] (numeric) = 0.77992554008975500360161586382313
absolute error = 5.723166184829603102612913e-08
relative error = 7.3380935879369501377727973467442e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=537.8MB, alloc=4.5MB, time=55.28
Complex estimate of poles used
Radius of convergence = 13.68
Order of pole = 8.186
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=541.7MB, alloc=4.5MB, time=55.67
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=545.5MB, alloc=4.5MB, time=56.07
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=549.3MB, alloc=4.5MB, time=56.47
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=553.1MB, alloc=4.5MB, time=56.89
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 2.1
y[1] (analytic) = 0.81840616142907451020429773678935
y[1] (numeric) = 0.81840622150086567506799097148264
absolute error = 6.007179116486369323469329e-08
relative error = 7.3400951747440737821047345885278e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 16.55
Order of pole = 17.67
WARNING: arctan of linear function has low precision in testing.
memory used=556.9MB, alloc=4.5MB, time=57.28
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=560.7MB, alloc=4.5MB, time=57.68
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=564.5MB, alloc=4.5MB, time=58.09
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=568.4MB, alloc=4.5MB, time=58.48
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=572.2MB, alloc=4.5MB, time=58.86
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 2.2
y[1] (analytic) = 0.85774292590442856907041709683485
y[1] (numeric) = 0.85774298886106726798442657823069
absolute error = 6.295663869891400948139584e-08
relative error = 7.3398027308159652462870046410495e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 25.19
Order of pole = 57.9
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=576.0MB, alloc=4.5MB, time=59.27
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=579.8MB, alloc=4.5MB, time=59.66
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=583.6MB, alloc=4.5MB, time=60.06
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=587.4MB, alloc=4.5MB, time=60.45
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.3
y[1] (analytic) = 0.8979297365629611442023997988808
y[1] (numeric) = 0.89792980244753281866817128940501
absolute error = 6.588457167446577149052421e-08
relative error = 7.3373860995688351666130435143453e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=591.2MB, alloc=4.5MB, time=60.84
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=595.1MB, alloc=4.5MB, time=61.24
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=598.9MB, alloc=4.5MB, time=61.63
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=602.7MB, alloc=4.5MB, time=62.02
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=606.5MB, alloc=4.5MB, time=62.41
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.4
y[1] (analytic) = 0.93896049583626136695264792133875
y[1] (numeric) = 0.93896056469021004180848474474057
absolute error = 6.885394867485583682340182e-08
relative error = 7.3329973923485260784636108791074e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=610.3MB, alloc=4.5MB, time=62.80
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=614.1MB, alloc=4.5MB, time=63.18
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=617.9MB, alloc=4.5MB, time=63.58
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=621.8MB, alloc=4.5MB, time=63.98
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=625.6MB, alloc=4.5MB, time=64.36
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
x[1] = 2.5
y[1] (analytic) = 0.9808290526093372405934927578567
y[1] (numeric) = 0.98082912447245907462246773711469
absolute error = 7.186312183402897497925799e-08
relative error = 7.3267733702268248372173018036171e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
Radius of convergence = 18.31
Order of pole = 36.87
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=629.4MB, alloc=4.5MB, time=64.76
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=633.2MB, alloc=4.5MB, time=65.14
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
memory used=637.0MB, alloc=4.5MB, time=65.53
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
Complex estimate of poles used
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=640.8MB, alloc=4.5MB, time=65.93
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.6
y[1] (analytic) = 1.0235292064516721230155127453652
y[1] (numeric) = 1.0235292813621111387540676043385
absolute error = 7.49104390157385548589733e-08
relative error = 7.3188374638995310023154900687153e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=644.7MB, alloc=4.5MB, time=66.32
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=648.5MB, alloc=4.5MB, time=66.71
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=652.3MB, alloc=4.5MB, time=67.10
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=656.1MB, alloc=4.5MB, time=67.48
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=659.9MB, alloc=4.5MB, time=67.87
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.7
y[1] (analytic) = 1.0670547117742162123844221507022
y[1] (numeric) = 1.0670547897684621855568318248608
absolute error = 7.79942459731724096741586e-08
relative error = 7.3093014924688910826998740632015e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=663.7MB, alloc=4.5MB, time=68.26
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=667.5MB, alloc=4.5MB, time=68.65
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=671.4MB, alloc=4.5MB, time=69.03
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=675.2MB, alloc=4.5MB, time=69.42
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=679.0MB, alloc=4.5MB, time=69.81
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.8
y[1] (analytic) = 1.1113992819082030420172875242156
y[1] (numeric) = 1.1113993630210915237967304203224
absolute error = 8.11128884817794428961068e-08
relative error = 7.2982671306493637007311933665706e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=682.8MB, alloc=4.5MB, time=70.20
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=686.6MB, alloc=4.5MB, time=70.59
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=690.4MB, alloc=4.5MB, time=70.98
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=694.2MB, alloc=4.5MB, time=71.37
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 2.9
y[1] (analytic) = 1.1565565931020519212203323903878
y[1] (numeric) = 1.156556677366766359600438345209
absolute error = 8.42647144383801059548212e-08
relative error = 7.2858271649612894780485098172103e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=698.1MB, alloc=4.5MB, time=71.76
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=701.9MB, alloc=4.5MB, time=72.15
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=705.7MB, alloc=4.5MB, time=72.55
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=709.5MB, alloc=4.5MB, time=72.94
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=713.3MB, alloc=4.5MB, time=73.32
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 3
y[1] (analytic) = 1.2025202884329818022398057057568
y[1] (numeric) = 1.2025203758810577222321844024731
absolute error = 8.74480759199923786967163e-08
relative error = 7.2720665722777106104000970990678e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=717.1MB, alloc=4.5MB, time=73.72
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=721.0MB, alloc=4.5MB, time=74.11
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=724.8MB, alloc=4.5MB, time=74.51
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=728.6MB, alloc=4.5MB, time=74.89
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=732.4MB, alloc=4.5MB, time=75.30
x[1] = 3.1
y[1] (analytic) = 1.2492839816303189528591655009277
y[1] (numeric) = 1.2492840722916501490479530621173
absolute error = 9.06613311961887875611896e-08
relative error = 7.2570634482862340668743884214826e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=736.2MB, alloc=4.5MB, time=75.70
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=740.0MB, alloc=4.5MB, time=76.08
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=743.8MB, alloc=4.5MB, time=76.47
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=747.7MB, alloc=4.5MB, time=76.86
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.2
y[1] (analytic) = 1.2968412608078289397119705210849
y[1] (numeric) = 1.2968413547106756289257074354912
absolute error = 9.39028466892137369144063e-08
relative error = 7.2408898087279960191000400049392e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
memory used=751.5MB, alloc=4.5MB, time=77.24
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=755.3MB, alloc=4.5MB, time=77.64
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=759.1MB, alloc=4.5MB, time=78.03
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=762.9MB, alloc=4.5MB, time=78.42
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=766.7MB, alloc=4.5MB, time=78.81
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.3
y[1] (analytic) = 1.3451856921027417749876725621822
y[1] (numeric) = 1.3451857892737406515161522238988
absolute error = 9.71709988765284796617166e-08
relative error = 7.2236122824525858980439769669560e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=770.5MB, alloc=4.5MB, time=79.20
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=774.4MB, alloc=4.5MB, time=79.61
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=778.2MB, alloc=4.5MB, time=80.00
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=782.0MB, alloc=4.5MB, time=80.40
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=785.8MB, alloc=4.5MB, time=80.79
x[1] = 3.4
y[1] (analytic) = 1.3943108232194667681729837375312
y[1] (numeric) = 1.3943109236836428990809829833505
absolute error = 1.004641761309079992458193e-07
relative error = 7.2052927122042985241132995091456e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=789.6MB, alloc=4.5MB, time=81.19
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=793.4MB, alloc=4.5MB, time=81.58
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=797.2MB, alloc=4.5MB, time=81.97
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=801.1MB, alloc=4.5MB, time=82.36
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.5
y[1] (analytic) = 1.4442101868763098942276083896852
y[1] (numeric) = 1.4442102906570903879122837091507
absolute error = 1.037807804936846753194655e-07
relative error = 7.1859886764926296918726358242022e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=804.9MB, alloc=4.5MB, time=82.75
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=808.7MB, alloc=4.5MB, time=83.15
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=812.5MB, alloc=4.5MB, time=83.55
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=816.3MB, alloc=4.5MB, time=83.93
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=820.1MB, alloc=4.5MB, time=84.33
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.6
y[1] (analytic) = 1.4948773041538106957527334675082
y[1] (numeric) = 1.4948774112730400729655798162291
absolute error = 1.071192293772128463487209e-07
relative error = 7.1657539437892991351382268046277e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=824.0MB, alloc=4.5MB, time=84.72
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=827.8MB, alloc=4.5MB, time=85.11
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=831.6MB, alloc=4.5MB, time=85.50
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=835.4MB, alloc=4.5MB, time=85.90
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=839.2MB, alloc=4.5MB, time=86.30
x[1] = 3.7
y[1] (analytic) = 1.5463056877436073464621791062981
y[1] (numeric) = 1.5463057982215645395737029262844
absolute error = 1.104779571931115238199863e-07
relative error = 7.1446388685488592085391891373946e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=843.0MB, alloc=4.5MB, time=86.71
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=846.8MB, alloc=4.5MB, time=87.10
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=850.7MB, alloc=4.5MB, time=87.50
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=854.5MB, alloc=4.5MB, time=87.90
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.8
y[1] (analytic) = 1.5984888450970170902365645097822
y[1] (numeric) = 1.5984889589524339935616888199077
absolute error = 1.138554169033251243101255e-07
relative error = 7.1226907371014463982975350654346e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=858.3MB, alloc=4.5MB, time=88.29
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=862.1MB, alloc=4.5MB, time=88.69
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=865.9MB, alloc=4.5MB, time=89.09
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=869.7MB, alloc=4.5MB, time=89.49
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=873.5MB, alloc=4.5MB, time=89.89
WARNING: arctan of linear function has low precision in testing.
x[1] = 3.9
y[1] (analytic) = 1.6514202814727845087268349174827
y[1] (numeric) = 1.6514203987228660002469109761232
absolute error = 1.172500814915200760586405e-07
relative error = 7.0999540702596344756730384077020e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=877.4MB, alloc=4.5MB, time=90.29
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=881.2MB, alloc=4.5MB, time=90.69
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=885.0MB, alloc=4.5MB, time=91.09
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=888.8MB, alloc=4.5MB, time=91.48
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=892.6MB, alloc=4.5MB, time=91.88
x[1] = 4
y[1] (analytic) = 1.705093502883701730335229823257
y[1] (numeric) = 1.7050936235441470831400243203349
absolute error = 1.206604453528047944970779e-07
relative error = 7.0764708884727131409228561205007e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=896.4MB, alloc=4.5MB, time=92.28
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=900.2MB, alloc=4.5MB, time=92.69
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=904.1MB, alloc=4.5MB, time=93.08
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=907.9MB, alloc=4.5MB, time=93.50
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.1
y[1] (analytic) = 1.7595020189420426327096800836214
y[1] (numeric) = 1.7595021430270682329281290563767
absolute error = 1.240850256002184489727553e-07
relative error = 7.0522809445156860227571866549634e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=911.7MB, alloc=4.5MB, time=93.91
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=915.5MB, alloc=4.5MB, time=94.29
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=919.3MB, alloc=4.5MB, time=94.70
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=923.1MB, alloc=4.5MB, time=95.09
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=927.0MB, alloc=4.5MB, time=95.48
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.2
y[1] (analytic) = 1.8146393456039772504044943786864
y[1] (numeric) = 1.8146394731263405372816786320252
absolute error = 1.275223632868771842533388e-07
relative error = 7.0274219279882942534982119755882e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=930.8MB, alloc=4.5MB, time=95.88
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=934.6MB, alloc=4.5MB, time=96.28
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=938.4MB, alloc=4.5MB, time=96.68
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=942.2MB, alloc=4.5MB, time=97.09
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.3
memory used=946.0MB, alloc=4.5MB, time=97.49
y[1] (analytic) = 1.8704990078133429959350529357812
y[1] (numeric) = 1.8704991387843675390274740556109
absolute error = 1.309710245430924211198297e-07
relative error = 7.0019296452982675531298020780273e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=949.8MB, alloc=4.5MB, time=97.90
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=953.7MB, alloc=4.5MB, time=98.30
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=957.5MB, alloc=4.5MB, time=98.69
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=961.3MB, alloc=4.5MB, time=99.09
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.4
y[1] (analytic) = 1.9270745420453460225970719276674
y[1] (numeric) = 1.9270746764749476507793961099682
absolute error = 1.344296016281823241823008e-07
relative error = 6.9758381782939385136476189271788e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=965.1MB, alloc=4.5MB, time=99.48
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=968.9MB, alloc=4.5MB, time=99.88
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=972.7MB, alloc=4.5MB, time=100.28
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=976.5MB, alloc=4.5MB, time=100.68
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=980.4MB, alloc=4.5MB, time=101.08
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.5
y[1] (analytic) = 1.9843594987509492509205198240642
y[1] (numeric) = 1.9843596366476631480031644740154
absolute error = 1.378967138970826446499512e-07
relative error = 6.9491800242789388615363742410921e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=984.2MB, alloc=4.5MB, time=101.48
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=988.0MB, alloc=4.5MB, time=101.88
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=991.8MB, alloc=4.5MB, time=102.28
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=995.6MB, alloc=4.5MB, time=102.69
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=999.4MB, alloc=4.5MB, time=103.09
x[1] = 4.6
y[1] (analytic) = 2.0423474447028734542674021986566
y[1] (numeric) = 2.0423475860738821364928318975029
absolute error = 1.413710086822254296988463e-07
relative error = 6.9219862197733201193759268398058e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1003.2MB, alloc=4.5MB, time=103.49
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1007.1MB, alloc=4.5MB, time=103.89
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1010.9MB, alloc=4.5MB, time=104.30
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1014.7MB, alloc=4.5MB, time=104.72
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.7
y[1] (analytic) = 2.1010319652442946105000137494237
y[1] (numeric) = 2.1010321100954567019924000397804
absolute error = 1.448511620914923862903567e-07
relative error = 6.8942864500707401688865385922530e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
memory used=1018.5MB, alloc=4.5MB, time=105.16
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1022.3MB, alloc=4.5MB, time=105.59
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1026.1MB, alloc=4.5MB, time=106.02
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1030.0MB, alloc=4.5MB, time=106.40
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1033.8MB, alloc=4.5MB, time=106.78
WARNING: arctan of linear function has low precision in testing.
x[1] = 4.8
y[1] (analytic) = 2.1604066664414647783846538407165
y[1] (numeric) = 2.1604068147773445017478178757525
absolute error = 1.483358797233631640350360e-07
relative error = 6.8661091463717836217950902138207e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1037.6MB, alloc=4.5MB, time=107.15
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1041.4MB, alloc=4.5MB, time=107.52
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1045.2MB, alloc=4.5MB, time=107.89
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1049.0MB, alloc=4.5MB, time=108.26
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1052.8MB, alloc=4.5MB, time=108.63
x[1] = 4.9
y[1] (analytic) = 2.2204651771416153911722942386531
y[1] (numeric) = 2.220465328965512691839240363907
absolute error = 1.518238973006669461252539e-07
relative error = 6.8374815720419658646451781999327e-06 %
Correct digits = 7
h = 0.005
TOP MAIN SOLVE Loop
WARNING: arctan of linear function has low precision in testing.
NO POLE
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1056.7MB, alloc=4.5MB, time=109.03
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1060.5MB, alloc=4.5MB, time=109.42
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1064.3MB, alloc=4.5MB, time=109.79
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
memory used=1068.1MB, alloc=4.6MB, time=110.17
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
WARNING: arctan of linear function has low precision in testing.
x[1] = 5
y[1] (analytic) = 2.2812011509376214510240853067547
y[1] (numeric) = 2.2812013062516026756323379533508
absolute error = 1.553139812246082526465961e-07
relative error = 6.8084298993436397939924146479112e-06 %
Correct digits = 7
h = 0.005
Finished!
diff ( y , x , 1 ) = arctan (0.1 * x + 0.2 ) ;
Iterations = 1200
Total Elapsed Time = 1 Minutes 50 Seconds
Elapsed Time(since restart) = 1 Minutes 50 Seconds
Time to Timeout = 8 Minutes 9 Seconds
Percent Done = 100.1 %
> quit
memory used=1070.9MB, alloc=4.6MB, time=110.42