|\^/| Maple 18 (X86 64 WINDOWS)
._|\| |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2014
\ MAPLE / All rights reserved. Maple is a trademark of
<____ ____> Waterloo Maple Inc.
| Type ? for help.
#BEGIN OUTFILE1
# before write maple top matter
# before write_ats library and user def block
#BEGIN ATS LIBRARY BLOCK
# Begin Function number 2
> omniout_str := proc(iolevel,str)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 1
> printf("%s\n",str);
> fi;# end if 1;
> end;
omniout_str := proc(iolevel, str)
global glob_iolevel;
if iolevel <= glob_iolevel then printf("%s\n", str) end if
end proc
# End Function number 2
# Begin Function number 3
> omniout_str_noeol := proc(iolevel,str)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 1
> printf("%s",str);
> fi;# end if 1;
> end;
omniout_str_noeol := proc(iolevel, str)
global glob_iolevel;
if iolevel <= glob_iolevel then printf("%s", str) end if
end proc
# End Function number 3
# Begin Function number 4
> omniout_labstr := proc(iolevel,label,str)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 1
> print(label,str);
> fi;# end if 1;
> end;
omniout_labstr := proc(iolevel, label, str)
global glob_iolevel;
if iolevel <= glob_iolevel then print(label, str) end if
end proc
# End Function number 4
# Begin Function number 5
> omniout_float := proc(iolevel,prelabel,prelen,value,vallen,postlabel)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 1
> if vallen = 4 then
> printf("%-30s = %-42.4g %s \n",prelabel,value, postlabel);
> else
> printf("%-30s = %-42.32g %s \n",prelabel,value, postlabel);
> fi;# end if 1;
> fi;# end if 0;
> 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
# End Function number 5
# Begin Function number 6
> omniout_int := proc(iolevel,prelabel,prelen,value,vallen,postlabel)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 0
> if vallen = 5 then # if number 1
> printf("%-30s = %-32d %s\n",prelabel,value, postlabel);
> else
> printf("%-30s = %-32d %s \n",prelabel,value, postlabel);
> fi;# end if 1;
> fi;# end if 0;
> 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
# End Function number 6
# Begin Function number 7
> omniout_float_arr := proc(iolevel,prelabel,elemnt,prelen,value,vallen,postlabel)
> global glob_iolevel;
> if (glob_iolevel >= iolevel) then # if number 0
> print(prelabel,"[",elemnt,"]",value, postlabel);
> fi;# end if 0;
> 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
# End Function number 7
# Begin Function number 8
> logitem_time := proc(fd,secs_in)
> global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year;
> local days_int, hours_int,minutes_int, sec_int, sec_temp, years_int;
> fprintf(fd,"
");
> if (secs_in >= 0) then # if number 0
> years_int := int_trunc(secs_in / glob_sec_in_year);
> sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year);
> days_int := int_trunc(sec_temp / glob_sec_in_day) ;
> sec_temp := sec_temp mod int_trunc(glob_sec_in_day) ;
> hours_int := int_trunc(sec_temp / glob_sec_in_hour);
> sec_temp := sec_temp mod int_trunc(glob_sec_in_hour);
> minutes_int := int_trunc(sec_temp / glob_sec_in_minute);
> sec_int := sec_temp mod int_trunc(glob_sec_in_minute);
> if (years_int > 0) then # if number 1
> 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 2
> 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 3
> fprintf(fd,"%d Hours %d Minutes %d Seconds",hours_int,minutes_int,sec_int);
> elif
> (minutes_int > 0) then # if number 4
> fprintf(fd,"%d Minutes %d Seconds",minutes_int,sec_int);
> else
> fprintf(fd,"%d Seconds",sec_int);
> fi;# end if 4
> else
> fprintf(fd," 0.0 Seconds");
> fi;# end if 3
> fprintf(fd," | \n");
> end;
logitem_time := proc(fd, secs_in)
local days_int, hours_int, minutes_int, sec_int, sec_temp, years_int;
global
glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year;
fprintf(fd, "");
if 0 <= secs_in then
years_int := int_trunc(secs_in/glob_sec_in_year);
sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year);
days_int := int_trunc(sec_temp/glob_sec_in_day);
sec_temp := sec_temp mod int_trunc(glob_sec_in_day);
hours_int := int_trunc(sec_temp/glob_sec_in_hour);
sec_temp := sec_temp mod int_trunc(glob_sec_in_hour);
minutes_int := int_trunc(sec_temp/glob_sec_in_minute);
sec_int := sec_temp mod int_trunc(glob_sec_in_minute);
if 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, " 0.0 Seconds")
end if;
fprintf(fd, " | \n")
end proc
# End Function number 8
# Begin Function number 9
> omniout_timestr := proc(secs_in)
> global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year;
> local days_int, hours_int,minutes_int, sec_int, sec_temp, years_int;
> if (secs_in >= 0) then # if number 3
> years_int := int_trunc(secs_in / glob_sec_in_year);
> sec_temp := (int_trunc(secs_in) mod int_trunc(glob_sec_in_year));
> days_int := int_trunc(sec_temp / glob_sec_in_day) ;
> sec_temp := (sec_temp mod int_trunc(glob_sec_in_day)) ;
> hours_int := int_trunc(sec_temp / glob_sec_in_hour);
> sec_temp := (sec_temp mod int_trunc(glob_sec_in_hour));
> minutes_int := int_trunc(sec_temp / glob_sec_in_minute);
> sec_int := (sec_temp mod int_trunc(glob_sec_in_minute));
> if (years_int > 0) then # if number 4
> 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 5
> 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 6
> printf(" = %d Hours %d Minutes %d Seconds\n",hours_int,minutes_int,sec_int);
> elif
> (minutes_int > 0) then # if number 7
> printf(" = %d Minutes %d Seconds\n",minutes_int,sec_int);
> else
> printf(" = %d Seconds\n",sec_int);
> fi;# end if 7
> else
> printf(" 0.0 Seconds\n");
> fi;# end if 6
> end;
omniout_timestr := proc(secs_in)
local days_int, hours_int, minutes_int, sec_int, sec_temp, years_int;
global
glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year;
if 0 <= secs_in then
years_int := int_trunc(secs_in/glob_sec_in_year);
sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year);
days_int := int_trunc(sec_temp/glob_sec_in_day);
sec_temp := sec_temp mod int_trunc(glob_sec_in_day);
hours_int := int_trunc(sec_temp/glob_sec_in_hour);
sec_temp := sec_temp mod int_trunc(glob_sec_in_hour);
minutes_int := int_trunc(sec_temp/glob_sec_in_minute);
sec_int := sec_temp mod int_trunc(glob_sec_in_minute);
if 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(" 0.0 Seconds\n")
end if
end proc
# End Function number 9
# Begin Function number 10
> zero_ats_ar := proc(arr_a)
> global ATS_MAX_TERMS;
> local iii;
> iii := 1;
> while (iii <= ATS_MAX_TERMS) do # do number 1
> arr_a [iii] := glob__0;
> iii := iii + 1;
> od;# end do number 1
> end;
zero_ats_ar := proc(arr_a)
local iii;
global ATS_MAX_TERMS;
iii := 1;
while iii <= ATS_MAX_TERMS do arr_a[iii] := glob__0; iii := iii + 1
end do
end proc
# End Function number 10
# Begin Function number 11
> ats := proc(mmm_ats,arr_a,arr_b,jjj_ats)
> global ATS_MAX_TERMS;
> local iii_ats, lll_ats,ma_ats, ret_ats;
> ret_ats := glob__0;
> if (jjj_ats <= mmm_ats) then # if number 6
> ma_ats := mmm_ats + 1;
> iii_ats := jjj_ats;
> while (iii_ats <= mmm_ats) do # do number 1
> lll_ats := ma_ats - iii_ats;
> if ((lll_ats <= ATS_MAX_TERMS and (iii_ats <= ATS_MAX_TERMS) )) then # if number 7
> ret_ats := ret_ats + c(arr_a[iii_ats])*c(arr_b[lll_ats]);
> fi;# end if 7;
> iii_ats := iii_ats + 1;
> od;# end do number 1
> fi;# end if 6;
> ret_ats;
> end;
ats := proc(mmm_ats, arr_a, arr_b, jjj_ats)
local iii_ats, lll_ats, ma_ats, ret_ats;
global ATS_MAX_TERMS;
ret_ats := glob__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;
if lll_ats <= ATS_MAX_TERMS and iii_ats <= ATS_MAX_TERMS then
ret_ats := ret_ats + c(arr_a[iii_ats])*c(arr_b[lll_ats])
end if;
iii_ats := iii_ats + 1
end do
end if;
ret_ats
end proc
# End Function number 11
# Begin Function number 12
> att := proc(mmm_att,arr_aa,arr_bb,jjj_att)
> global ATS_MAX_TERMS;
> local al_att, iii_att,lll_att, ma_att, ret_att;
> ret_att := glob__0;
> if (jjj_att < mmm_att) then # if number 6
> ma_att := mmm_att + 2;
> iii_att := jjj_att;
> while ((iii_att < mmm_att) and (iii_att <= ATS_MAX_TERMS) ) do # do number 1
> lll_att := ma_att - iii_att;
> al_att := (lll_att - 1);
> if ((lll_att <= ATS_MAX_TERMS and (iii_att <= ATS_MAX_TERMS) )) then # if number 7
> ret_att := ret_att + c(arr_aa[iii_att])*c(arr_bb[lll_att])* c(al_att);
> fi;# end if 7;
> iii_att := iii_att + 1;
> od;# end do number 1;
> ret_att := ret_att / c(mmm_att) ;
> fi;# end if 6;
> ret_att;
> end;
att := proc(mmm_att, arr_aa, arr_bb, jjj_att)
local al_att, iii_att, lll_att, ma_att, ret_att;
global ATS_MAX_TERMS;
ret_att := glob__0;
if jjj_att < mmm_att then
ma_att := mmm_att + 2;
iii_att := jjj_att;
while iii_att < mmm_att and iii_att <= ATS_MAX_TERMS do
lll_att := ma_att - iii_att;
al_att := lll_att - 1;
if lll_att <= ATS_MAX_TERMS and iii_att <= ATS_MAX_TERMS then
ret_att :=
ret_att + c(arr_aa[iii_att])*c(arr_bb[lll_att])*c(al_att)
end if;
iii_att := iii_att + 1
end do;
ret_att := ret_att/c(mmm_att)
end if;
ret_att
end proc
# End Function number 12
# Begin Function number 13
> logditto := proc(file)
> fprintf(file,"");
> fprintf(file,"ditto");
> fprintf(file," | ");
> end;
logditto := proc(file)
fprintf(file, ""); fprintf(file, "ditto"); fprintf(file, " | ")
end proc
# End Function number 13
# Begin Function number 14
> logitem_integer := proc(file,n)
> fprintf(file,"");
> fprintf(file,"%d",n);
> fprintf(file," | ");
> end;
logitem_integer := proc(file, n)
fprintf(file, ""); fprintf(file, "%d", n); fprintf(file, " | ")
end proc
# End Function number 14
# Begin Function number 15
> logitem_str := proc(file,str)
> fprintf(file,"");
> fprintf(file,str);
> fprintf(file," | ");
> end;
logitem_str := proc(file, str)
fprintf(file, ""); fprintf(file, str); fprintf(file, " | ")
end proc
# End Function number 15
# Begin Function number 16
> logitem_good_digits := proc(file,rel_error)
> global glob_small_float,glob_prec;
> local good_digits;
> fprintf(file,"");
> fprintf(file,"%d",glob_min_good_digits);
> fprintf(file," | ");
> end;
logitem_good_digits := proc(file, rel_error)
local good_digits;
global glob_small_float, glob_prec;
fprintf(file, "");
fprintf(file, "%d", glob_min_good_digits);
fprintf(file, " | ")
end proc
# End Function number 16
# Begin Function number 17
> log_revs := proc(file,revs)
> fprintf(file,revs);
> end;
log_revs := proc(file, revs) fprintf(file, revs) end proc
# End Function number 17
# Begin Function number 18
> logitem_float := proc(file,x)
> fprintf(file,"");
> fprintf(file,"%g",x);
> fprintf(file," | ");
> end;
logitem_float := proc(file, x)
fprintf(file, ""); fprintf(file, "%g", x); fprintf(file, " | ")
end proc
# End Function number 18
# Begin Function number 19
> logitem_h_reason := proc(file)
> global glob_h_reason;
> fprintf(file,"");
> if (glob_h_reason = 1) then # if number 6
> fprintf(file,"Max H");
> elif
> (glob_h_reason = 2) then # if number 7
> fprintf(file,"Display Interval");
> elif
> (glob_h_reason = 3) then # if number 8
> fprintf(file,"Optimal");
> elif
> (glob_h_reason = 4) then # if number 9
> fprintf(file,"Pole Accuracy");
> elif
> (glob_h_reason = 5) then # if number 10
> fprintf(file,"Min H (Pole)");
> elif
> (glob_h_reason = 6) then # if number 11
> fprintf(file,"Pole");
> elif
> (glob_h_reason = 7) then # if number 12
> fprintf(file,"Opt Iter");
> else
> fprintf(file,"Impossible");
> fi;# end if 12
> fprintf(file," | ");
> end;
logitem_h_reason := proc(file)
global glob_h_reason;
fprintf(file, "");
if glob_h_reason = 1 then fprintf(file, "Max H")
elif glob_h_reason = 2 then fprintf(file, "Display Interval")
elif glob_h_reason = 3 then fprintf(file, "Optimal")
elif glob_h_reason = 4 then fprintf(file, "Pole Accuracy")
elif glob_h_reason = 5 then fprintf(file, "Min H (Pole)")
elif glob_h_reason = 6 then fprintf(file, "Pole")
elif glob_h_reason = 7 then fprintf(file, "Opt Iter")
else fprintf(file, "Impossible")
end if;
fprintf(file, " | ")
end proc
# End Function number 19
# Begin Function number 20
> logstart := proc(file)
> fprintf(file,"");
> end;
logstart := proc(file) fprintf(file, "
") end proc
# End Function number 20
# Begin Function number 21
> logend := proc(file)
> fprintf(file,"
\n");
> end;
logend := proc(file) fprintf(file, "\n") end proc
# End Function number 21
# Begin Function number 22
> chk_data := proc()
> global glob_max_iter,ALWAYS, ATS_MAX_TERMS;
> local errflag;
> errflag := false;
> if (glob_max_iter < 2) then # if number 12
> omniout_str(ALWAYS,"Illegal max_iter");
> errflag := true;
> fi;# end if 12;
> if (errflag) then # if number 12
> quit;
> fi;# end if 12
> end;
chk_data := proc()
local errflag;
global glob_max_iter, ALWAYS, ATS_MAX_TERMS;
errflag := false;
if glob_max_iter < 2 then
omniout_str(ALWAYS, "Illegal max_iter"); errflag := true
end if;
if errflag then quit end if
end proc
# End Function number 22
# Begin Function number 23
> comp_expect_sec := proc(t_end2,t_start2,t2,clock_sec2)
> global glob_small_float;
> local ms2, rrr, sec_left, sub1, sub2;
> ;
> ms2 := c(clock_sec2);
> sub1 := c(t_end2-t_start2);
> sub2 := c(t2-t_start2);
> if (sub1 = glob__0) then # if number 12
> sec_left := glob__0;
> else
> if (sub2 > glob__0) then # if number 13
> rrr := (sub1/sub2);
> sec_left := rrr * c(ms2) - c(ms2);
> else
> sec_left := glob__0;
> fi;# end if 13
> fi;# end if 12;
> sec_left;
> end;
comp_expect_sec := proc(t_end2, t_start2, t2, clock_sec2)
local ms2, rrr, sec_left, sub1, sub2;
global glob_small_float;
ms2 := c(clock_sec2);
sub1 := c(t_end2 - t_start2);
sub2 := c(t2 - t_start2);
if sub1 = glob__0 then sec_left := glob__0
else
if glob__0 < sub2 then
rrr := sub1/sub2; sec_left := rrr*c(ms2) - c(ms2)
else sec_left := glob__0
end if
end if;
sec_left
end proc
# End Function number 23
# Begin Function number 24
> 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 12
> rrr := (glob__100*sub2)/sub1;
> else
> rrr := 0.0;
> fi;# end if 12;
> rrr;
> 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 := glob__100*sub2/sub1
else rrr := 0.
end if;
rrr
end proc
# End Function number 24
# Begin Function number 25
> comp_rad_from_ratio := proc(term1,term2,last_no)
> #TOP TWO TERM RADIUS ANALYSIS
> global glob_h,glob_larger_float;
> local ret;
> if (float_abs(term2) > glob__0) then # if number 12
> ret := float_abs(term1 * glob_h / term2);
> else
> ret := glob_larger_float;
> fi;# end if 12;
> ret;
> #BOTTOM TWO TERM RADIUS ANALYSIS
> end;
comp_rad_from_ratio := proc(term1, term2, last_no)
local ret;
global glob_h, glob_larger_float;
if glob__0 < float_abs(term2) then ret := float_abs(term1*glob_h/term2)
else ret := glob_larger_float
end if;
ret
end proc
# End Function number 25
# Begin Function number 26
> comp_ord_from_ratio := proc(term1,term2,last_no)
> #TOP TWO TERM ORDER ANALYSIS
> global glob_h,glob_larger_float;
> local ret;
> if (float_abs(term2) > glob__0) then # if number 12
> ret := glob__1 + float_abs(term2) * c(last_no) * ln(float_abs(term1 * glob_h / term2))/ln(c(last_no));
> else
> ret := glob_larger_float;
> fi;# end if 12;
> ret;
> #BOTTOM TWO TERM ORDER ANALYSIS
> end;
comp_ord_from_ratio := proc(term1, term2, last_no)
local ret;
global glob_h, glob_larger_float;
if glob__0 < float_abs(term2) then ret := glob__1 + float_abs(term2)*
c(last_no)*ln(float_abs(term1*glob_h/term2))/ln(c(last_no))
else ret := glob_larger_float
end if;
ret
end proc
# End Function number 26
# Begin Function number 27
> c := proc(in_val)
> #To Force Conversion when needed
> local ret;
> ret := evalf(in_val);
> ret;
> #End Conversion
> end;
c := proc(in_val) local ret; ret := evalf(in_val); ret end proc
# End Function number 27
# Begin Function number 28
> comp_rad_from_three_terms := proc(term1,term2,term3,last_no)
> #TOP THREE TERM RADIUS ANALYSIS
> global glob_h,glob_larger_float;
> local ret,temp;
> temp := float_abs(term2*term2*c(last_no)+glob__m2*term2*term2-term1*term3*c(last_no)+term1*term3);
> if (float_abs(temp) > glob__0) then # if number 12
> ret := float_abs((term2*glob_h*term1)/(temp));
> else
> ret := glob_larger_float;
> fi;# end if 12;
> ret;
> #BOTTOM THREE TERM RADIUS ANALYSIS
> end;
comp_rad_from_three_terms := proc(term1, term2, term3, last_no)
local ret, temp;
global glob_h, glob_larger_float;
temp := float_abs(term2*term2*c(last_no) + glob__m2*term2*term2
- term1*term3*c(last_no) + term1*term3);
if glob__0 < float_abs(temp) then
ret := float_abs(term2*glob_h*term1/temp)
else ret := glob_larger_float
end if;
ret
end proc
# End Function number 28
# Begin Function number 29
> comp_ord_from_three_terms := proc(term1,term2,term3,last_no)
> #TOP THREE TERM ORDER ANALYSIS
> local ret;
> ret := float_abs((glob__4*term1*term3*c(last_no)-glob__3*term1*term3-glob__4*term2*term2*c(last_no)+glob__4*term2*term2+term2*term2*c(last_no*last_no)-term1*term3*c(last_no*last_no))/(term2*term2*c(last_no)-glob__2*term2*term2-term1*term3*c(last_no)+term1*term3));
> ret;
> #TOP THREE TERM ORDER ANALYSIS
> end;
comp_ord_from_three_terms := proc(term1, term2, term3, last_no)
local ret;
ret := float_abs((glob__4*term1*term3*c(last_no) - glob__3*term1*term3
- glob__4*term2*term2*c(last_no) + glob__4*term2*term2
+ term2*term2*c(last_no*last_no) - term1*term3*c(last_no*last_no))
/(term2*term2*c(last_no) - glob__2*term2*term2
- term1*term3*c(last_no) + term1*term3));
ret
end proc
# End Function number 29
# Begin Function number 30
> comp_rad_from_six_terms := proc(term1,term2,term3,term4,term5,term6,last_no)
> #TOP SIX TERM RADIUS ANALYSIS
> global glob_h,glob_larger_float,glob_six_term_ord_save;
> local ret,rm0,rm1,rm2,rm3,rm4,nr1,nr2,dr1,dr2,ds2,rad_c,ord_no,ds1,rcs;
> if ((term5 <> glob__0) and (term4 <> glob__0) and (term3 <> glob__0) and (term2 <> glob__0) and (term1 <> glob__0)) then # if number 12
> rm0 := term6/term5;
> rm1 := term5/term4;
> rm2 := term4/term3;
> rm3 := term3/term2;
> rm4 := term2/term1;
> nr1 := c(last_no-1)*rm0 - glob__2*c(last_no-2)*rm1 + c(last_no-3)*rm2;
> nr2 := c(last_no-2)*rm1 - glob__2*c(last_no-3)*rm2 + c(last_no-4)*rm3;
> dr1 := glob__m1/rm1 + glob__2/rm2 - glob__1/rm3;
> dr2 := glob__m1/rm2 + glob__2/rm3 - glob__1/rm4;
> ds1 := glob__3/rm1 - glob__8/rm2 + glob__5/rm3;
> ds2 := glob__3/rm2 - glob__8/rm3 + glob__5/rm4;
> if ((float_abs(nr1 * dr2 - nr2 * dr1) = glob__0) or (float_abs(dr1) = glob__0)) then # if number 13
> rad_c := glob_larger_float;
> ord_no := glob_larger_float;
> else
> if (float_abs(nr1*dr2 - nr2 * dr1) > glob__0) then # if number 14
> 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)/(glob__2*dr1) -c(last_no)/glob__2;
> if (float_abs(rcs) <> glob__0) then # if number 15
> if (rcs > glob__0) then # if number 16
> rad_c := sqrt(rcs) * float_abs(glob_h);
> else
> rad_c := glob_larger_float;
> ord_no := glob_larger_float;
> fi;# end if 16
> else
> rad_c := glob_larger_float;
> ord_no := glob_larger_float;
> fi;# end if 15
> else
> rad_c := glob_larger_float;
> ord_no := glob_larger_float;
> fi;# end if 14
> fi;# end if 13
> else
> rad_c := glob_larger_float;
> ord_no := glob_larger_float;
> fi;# end if 12;
> glob_six_term_ord_save := ord_no;
> rad_c;
> #BOTTOM SIX TERM RADIUS ANALYSIS
> end;
comp_rad_from_six_terms := proc(
term1, term2, term3, term4, term5, term6, last_no)
local ret, rm0, rm1, rm2, rm3, rm4, nr1, nr2, dr1, dr2, ds2, rad_c, ord_no,
ds1, rcs;
global glob_h, glob_larger_float, glob_six_term_ord_save;
if term5 <> glob__0 and term4 <> glob__0 and term3 <> glob__0 and
term2 <> glob__0 and term1 <> glob__0 then
rm0 := term6/term5;
rm1 := term5/term4;
rm2 := term4/term3;
rm3 := term3/term2;
rm4 := term2/term1;
nr1 := c(last_no - 1)*rm0 - glob__2*c(last_no - 2)*rm1
+ c(last_no - 3)*rm2;
nr2 := c(last_no - 2)*rm1 - glob__2*c(last_no - 3)*rm2
+ c(last_no - 4)*rm3;
dr1 := glob__m1/rm1 + glob__2/rm2 - glob__1/rm3;
dr2 := glob__m1/rm2 + glob__2/rm3 - glob__1/rm4;
ds1 := glob__3/rm1 - glob__8/rm2 + glob__5/rm3;
ds2 := glob__3/rm2 - glob__8/rm3 + glob__5/rm4;
if
float_abs(nr1*dr2 - nr2*dr1) = glob__0 or float_abs(dr1) = glob__0
then rad_c := glob_larger_float; ord_no := glob_larger_float
else
if glob__0 < float_abs(nr1*dr2 - nr2*dr1) then
rcs := (ds1*dr2 - ds2*dr1 + dr1*dr2)/(nr1*dr2 - nr2*dr1);
ord_no :=
(rcs*nr1 - ds1)/(glob__2*dr1) - c(last_no)/glob__2;
if float_abs(rcs) <> glob__0 then
if glob__0 < rcs then
rad_c := sqrt(rcs)*float_abs(glob_h)
else
rad_c := glob_larger_float;
ord_no := glob_larger_float
end if
else
rad_c := glob_larger_float; ord_no := glob_larger_float
end if
else rad_c := glob_larger_float; ord_no := glob_larger_float
end if
end if
else rad_c := glob_larger_float; ord_no := glob_larger_float
end if;
glob_six_term_ord_save := ord_no;
rad_c
end proc
# End Function number 30
# Begin Function number 31
> comp_ord_from_six_terms := proc(term1,term2,term3,term4,term5,term6,last_no)
> global glob_six_term_ord_save;
> #TOP SIX TERM ORDER ANALYSIS
> #TOP SAVED FROM SIX TERM RADIUS ANALYSIS
> glob_six_term_ord_save;
> #BOTTOM SIX TERM ORDER ANALYSIS
> end;
comp_ord_from_six_terms := proc(
term1, term2, term3, term4, term5, term6, last_no)
global glob_six_term_ord_save;
glob_six_term_ord_save
end proc
# End Function number 31
# Begin Function number 32
> factorial_2 := proc(nnn)
> ret := nnn!;
> ret;;
> end;
Warning, `ret` is implicitly declared local to procedure `factorial_2`
factorial_2 := proc(nnn) local ret; ret := nnn!; ret end proc
# End Function number 32
# Begin Function number 33
> factorial_1 := proc(nnn)
> global ATS_MAX_TERMS,array_fact_1;
> local ret;
> if (nnn <= ATS_MAX_TERMS) then # if number 12
> if (array_fact_1[nnn] = 0) then # if number 13
> ret := factorial_2(nnn);
> array_fact_1[nnn] := ret;
> else
> ret := array_fact_1[nnn];
> fi;# end if 13;
> else
> ret := factorial_2(nnn);
> fi;# end if 12;
> ret;
> end;
factorial_1 := proc(nnn)
local ret;
global ATS_MAX_TERMS, array_fact_1;
if nnn <= ATS_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
# End Function number 33
# Begin Function number 34
> factorial_3 := proc(mmm,nnn)
> global ATS_MAX_TERMS,array_fact_2;
> local ret;
> if ((nnn <= ATS_MAX_TERMS) and (mmm <= ATS_MAX_TERMS)) then # if number 12
> if (array_fact_2[mmm,nnn] = 0) then # if number 13
> ret := factorial_1(mmm)/factorial_1(nnn);
> array_fact_2[mmm,nnn] := ret;
> else
> ret := array_fact_2[mmm,nnn];
> fi;# end if 13;
> else
> ret := factorial_2(mmm)/factorial_2(nnn);
> fi;# end if 12;
> ret;
> end;
factorial_3 := proc(mmm, nnn)
local ret;
global ATS_MAX_TERMS, array_fact_2;
if nnn <= ATS_MAX_TERMS and mmm <= ATS_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
# End Function number 34
# Begin Function number 35
> convfloat := proc(mmm)
> (mmm);
> end;
convfloat := proc(mmm) mmm end proc
# End Function number 35
# Begin Function number 36
> elapsed_time_seconds := proc()
> time();
> end;
elapsed_time_seconds := proc() time() end proc
# End Function number 36
# Begin Function number 37
> float_abs := proc(x)
> abs(x);
> end;
float_abs := proc(x) abs(x) end proc
# End Function number 37
# Begin Function number 38
> expt := proc(x,y)
> x^y;
> end;
expt := proc(x, y) x^y end proc
# End Function number 38
# Begin Function number 39
> neg := proc(x)
> -x;
> end;
neg := proc(x) -x end proc
# End Function number 39
# Begin Function number 40
> int_trunc := proc(x)
> trunc(x);
> end;
int_trunc := proc(x) trunc(x) end proc
# End Function number 40
# Begin Function number 41
> estimated_needed_step_error := proc(x_start,x_end,estimated_h,estimated_answer)
> local desired_abs_gbl_error,range,estimated_steps,step_error;
> global glob_desired_digits_correct,ALWAYS,ATS_MAX_TERMS;
> omniout_float(ALWAYS,"glob_desired_digits_correct",32,glob_desired_digits_correct,32,"");
> desired_abs_gbl_error := expt(glob__10,c( -glob_desired_digits_correct)) * c(float_abs(c(estimated_answer)));
> omniout_float(ALWAYS,"estimated_h",32,estimated_h,32,"");
> omniout_float(ALWAYS,"estimated_answer",32,estimated_answer,32,"");
> omniout_float(ALWAYS,"desired_abs_gbl_error",32,desired_abs_gbl_error,32,"");
> range := (x_end - x_start);
> omniout_float(ALWAYS,"range",32,range,32,"");
> estimated_steps := range / estimated_h;
> omniout_float(ALWAYS,"estimated_steps",32,estimated_steps,32,"");
> step_error := (c(float_abs(desired_abs_gbl_error) /sqrt(c( estimated_steps))/c(ATS_MAX_TERMS)));
> omniout_float(ALWAYS,"step_error",32,step_error,32,"");
> (step_error);;
> end;
estimated_needed_step_error := proc(
x_start, x_end, estimated_h, estimated_answer)
local desired_abs_gbl_error, range, estimated_steps, step_error;
global glob_desired_digits_correct, ALWAYS, ATS_MAX_TERMS;
omniout_float(ALWAYS, "glob_desired_digits_correct", 32,
glob_desired_digits_correct, 32, "");
desired_abs_gbl_error :=
expt(glob__10, c(-glob_desired_digits_correct))*
c(float_abs(c(estimated_answer)));
omniout_float(ALWAYS, "estimated_h", 32, estimated_h, 32, "");
omniout_float(ALWAYS, "estimated_answer", 32, estimated_answer, 32, "")
;
omniout_float(ALWAYS, "desired_abs_gbl_error", 32,
desired_abs_gbl_error, 32, "");
range := x_end - x_start;
omniout_float(ALWAYS, "range", 32, range, 32, "");
estimated_steps := range/estimated_h;
omniout_float(ALWAYS, "estimated_steps", 32, estimated_steps, 32, "");
step_error := c(float_abs(desired_abs_gbl_error)/(
sqrt(c(estimated_steps))*c(ATS_MAX_TERMS)));
omniout_float(ALWAYS, "step_error", 32, step_error, 32, "");
step_error
end proc
# End Function number 41
#END ATS LIBRARY BLOCK
#BEGIN USER FUNCTION BLOCK
#BEGIN BLOCK 3
#BEGIN USER DEF BLOCK
> exact_soln_y := proc(x)
> return(c(2.0) - cos(c(x)));
> end;
exact_soln_y := proc(x) return c(2.0) - cos(c(x)) end proc
#END USER DEF BLOCK
#END BLOCK 3
#END USER FUNCTION BLOCK
# before write_aux functions
# Begin Function number 2
> display_poles := proc()
> local rad_given;
> global ALWAYS,glob_display_flag,glob_larger_float, glob_large_float, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_guess_error_ord, glob_guess_error_rc, glob_type_given_pole,array_given_rad_poles,array_given_ord_poles,array_rad_test_poles,array_ord_test_poles,glob_least_3_sing,glob_least_6_sing,glob_least_given_sing,glob_least_ratio_sing,array_x ;
> if ((glob_type_given_pole = 1) or (glob_type_given_pole = 2)) then # if number 1
> rad_given := sqrt((array_x[1] - array_given_rad_poles[1,1]) * (array_x[1] - array_given_rad_poles[1,1]) + array_given_rad_poles[1,2] * array_given_rad_poles[1,2]);
> omniout_float(ALWAYS,"Radius of convergence (given) for eq 1 ",4,rad_given,4," ");
> omniout_float(ALWAYS,"Order of pole (given) ",4,array_given_ord_poles[1,1],4," ");
> if (rad_given < glob_least_given_sing) then # if number 2
> glob_least_given_sing := rad_given;
> fi;# end if 2;
> elif
> (glob_type_given_pole = 3) then # if number 2
> omniout_str(ALWAYS,"NO POLE (given) for Equation 1");
> elif
> (glob_type_given_pole = 5) then # if number 3
> omniout_str(ALWAYS,"SOME POLE (given) for Equation 1");
> else
> omniout_str(ALWAYS,"NO INFO (given) for Equation 1");
> fi;# end if 3;
> if (array_rad_test_poles[1,1] < glob_large_float) then # if number 3
> omniout_float(ALWAYS,"Radius of convergence (ratio test) for eq 1 ",4,array_rad_test_poles[1,1],4," ");
> if (array_rad_test_poles[1,1]< glob_least_ratio_sing) then # if number 4
> glob_least_ratio_sing := array_rad_test_poles[1,1];
> fi;# end if 4;
> omniout_float(ALWAYS,"Order of pole (ratio test) ",4, array_ord_test_poles[1,1],4," ");
> else
> omniout_str(ALWAYS,"NO POLE (ratio test) for Equation 1");
> fi;# end if 3;
> if ((array_rad_test_poles[1,2] > glob__small) and (array_rad_test_poles[1,2] < glob_large_float)) then # if number 3
> omniout_float(ALWAYS,"Radius of convergence (three term test) for eq 1 ",4,array_rad_test_poles[1,2],4," ");
> if (array_rad_test_poles[1,2]< glob_least_3_sing) then # if number 4
> glob_least_3_sing := array_rad_test_poles[1,2];
> fi;# end if 4;
> omniout_float(ALWAYS,"Order of pole (three term test) ",4, array_ord_test_poles[1,2],4," ");
> else
> omniout_str(ALWAYS,"NO REAL POLE (three term test) for Equation 1");
> fi;# end if 3;
> if ((array_rad_test_poles[1,3] > glob__small) and (array_rad_test_poles[1,3] < glob_large_float)) then # if number 3
> omniout_float(ALWAYS,"Radius of convergence (six term test) for eq 1 ",4,array_rad_test_poles[1,3],4," ");
> if (array_rad_test_poles[1,3]< glob_least_6_sing) then # if number 4
> glob_least_6_sing := array_rad_test_poles[1,3];
> fi;# end if 4;
> omniout_float(ALWAYS,"Order of pole (six term test) ",4, array_ord_test_poles[1,3],4," ");
> else
> omniout_str(ALWAYS,"NO COMPLEX POLE (six term test) for Equation 1");
> fi;# end if 3
> ;
> end;
display_poles := proc()
local rad_given;
global ALWAYS, glob_display_flag, glob_larger_float, glob_large_float,
glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_diff_rc_fm,
glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_guess_error_ord,
glob_guess_error_rc, glob_type_given_pole, array_given_rad_poles,
array_given_ord_poles, array_rad_test_poles, array_ord_test_poles,
glob_least_3_sing, glob_least_6_sing, glob_least_given_sing,
glob_least_ratio_sing, array_x;
if glob_type_given_pole = 1 or glob_type_given_pole = 2 then
rad_given := sqrt((array_x[1] - array_given_rad_poles[1, 1])*
(array_x[1] - array_given_rad_poles[1, 1])
+ array_given_rad_poles[1, 2]*array_given_rad_poles[1, 2]);
omniout_float(ALWAYS,
"Radius of convergence (given) for eq 1 ", 4,
rad_given, 4, " ");
omniout_float(ALWAYS,
"Order of pole (given) ", 4,
array_given_ord_poles[1, 1], 4, " ");
if rad_given < glob_least_given_sing then
glob_least_given_sing := rad_given
end if
elif glob_type_given_pole = 3 then
omniout_str(ALWAYS, "NO POLE (given) for Equation 1")
elif glob_type_given_pole = 5 then
omniout_str(ALWAYS, "SOME POLE (given) for Equation 1")
else omniout_str(ALWAYS, "NO INFO (given) for Equation 1")
end if;
if array_rad_test_poles[1, 1] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (ratio test) for eq 1 ", 4,
array_rad_test_poles[1, 1], 4, " ");
if array_rad_test_poles[1, 1] < glob_least_ratio_sing then
glob_least_ratio_sing := array_rad_test_poles[1, 1]
end if;
omniout_float(ALWAYS,
"Order of pole (ratio test) ", 4,
array_ord_test_poles[1, 1], 4, " ")
else omniout_str(ALWAYS, "NO POLE (ratio test) for Equation 1")
end if;
if glob__small < array_rad_test_poles[1, 2] and
array_rad_test_poles[1, 2] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (three term test) for eq 1 ", 4,
array_rad_test_poles[1, 2], 4, " ");
if array_rad_test_poles[1, 2] < glob_least_3_sing then
glob_least_3_sing := array_rad_test_poles[1, 2]
end if;
omniout_float(ALWAYS,
"Order of pole (three term test) ", 4,
array_ord_test_poles[1, 2], 4, " ")
else omniout_str(ALWAYS,
"NO REAL POLE (three term test) for Equation 1")
end if;
if glob__small < array_rad_test_poles[1, 3] and
array_rad_test_poles[1, 3] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (six term test) for eq 1 ", 4,
array_rad_test_poles[1, 3], 4, " ");
if array_rad_test_poles[1, 3] < glob_least_6_sing then
glob_least_6_sing := array_rad_test_poles[1, 3]
end if;
omniout_float(ALWAYS,
"Order of pole (six term test) ", 4,
array_ord_test_poles[1, 3], 4, " ")
else omniout_str(ALWAYS,
"NO COMPLEX POLE (six term test) for Equation 1")
end if
end proc
# End Function number 2
# Begin Function number 3
> my_check_sign := proc( x0 ,xf)
> local ret;
> if (xf > x0) then # if number 3
> ret := glob__1;
> else
> ret := glob__m1;
> fi;# end if 3;
> ret;;
> end;
my_check_sign := proc(x0, xf)
local ret;
if x0 < xf then ret := glob__1 else ret := glob__m1 end if; ret
end proc
# End Function number 3
# Begin Function number 4
> est_size_answer := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local min_size;
> min_size := glob_estimated_size_answer;
> if (float_abs(array_y[1]) < min_size) then # if number 3
> min_size := float_abs(array_y[1]);
> omniout_float(ALWAYS,"min_size",32,min_size,32,"");
> fi;# end if 3;
> if (min_size < glob__1) then # if number 3
> min_size := glob__1;
> omniout_float(ALWAYS,"min_size",32,min_size,32,"");
> fi;# end if 3;
> min_size;
> end;
est_size_answer := proc()
local min_size;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
min_size := glob_estimated_size_answer;
if float_abs(array_y[1]) < min_size then
min_size := float_abs(array_y[1]);
omniout_float(ALWAYS, "min_size", 32, min_size, 32, "")
end if;
if min_size < glob__1 then
min_size := glob__1;
omniout_float(ALWAYS, "min_size", 32, min_size, 32, "")
end if;
min_size
end proc
# End Function number 4
# Begin Function number 5
> test_suggested_h := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local max_estimated_step_error,hn_div_ho,hn_div_ho_2,hn_div_ho_3,no_terms,est_tmp;
> max_estimated_step_error := glob__small;
> no_terms := ATS_MAX_TERMS;
> hn_div_ho := glob__0_5;
> hn_div_ho_2 := glob__0_25;
> hn_div_ho_3 := glob__0_125;
> omniout_float(ALWAYS,"hn_div_ho",32,hn_div_ho,32,"");
> omniout_float(ALWAYS,"hn_div_ho_2",32,hn_div_ho_2,32,"");
> omniout_float(ALWAYS,"hn_div_ho_3",32,hn_div_ho_3,32,"");
> est_tmp := float_abs(array_y[no_terms-3] + array_y[no_terms - 2] * hn_div_ho + array_y[no_terms - 1] * hn_div_ho_2 + array_y[no_terms] * hn_div_ho_3);
> if (est_tmp >= max_estimated_step_error) then # if number 3
> max_estimated_step_error := est_tmp;
> fi;# end if 3;
> omniout_float(ALWAYS,"max_estimated_step_error",32,max_estimated_step_error,32,"");
> max_estimated_step_error;
> end;
test_suggested_h := proc()
local max_estimated_step_error, hn_div_ho, hn_div_ho_2, hn_div_ho_3,
no_terms, est_tmp;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
max_estimated_step_error := glob__small;
no_terms := ATS_MAX_TERMS;
hn_div_ho := glob__0_5;
hn_div_ho_2 := glob__0_25;
hn_div_ho_3 := glob__0_125;
omniout_float(ALWAYS, "hn_div_ho", 32, hn_div_ho, 32, "");
omniout_float(ALWAYS, "hn_div_ho_2", 32, hn_div_ho_2, 32, "");
omniout_float(ALWAYS, "hn_div_ho_3", 32, hn_div_ho_3, 32, "");
est_tmp := float_abs(array_y[no_terms - 3]
+ array_y[no_terms - 2]*hn_div_ho
+ array_y[no_terms - 1]*hn_div_ho_2
+ array_y[no_terms]*hn_div_ho_3);
if max_estimated_step_error <= est_tmp then
max_estimated_step_error := est_tmp
end if;
omniout_float(ALWAYS, "max_estimated_step_error", 32,
max_estimated_step_error, 32, "");
max_estimated_step_error
end proc
# End Function number 5
# Begin Function number 6
> track_estimated_error := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local hn_div_ho,hn_div_ho_2,hn_div_ho_3,no_terms,est_tmp;
> no_terms := ATS_MAX_TERMS;
> hn_div_ho := glob__0_5;
> hn_div_ho_2 := glob__0_25;
> hn_div_ho_3 := glob__0_125;
> est_tmp := c(float_abs(array_y[no_terms-3])) + c(float_abs(array_y[no_terms - 2])) * c(hn_div_ho) + c(float_abs(array_y[no_terms - 1])) * c(hn_div_ho_2) + c(float_abs(array_y[no_terms])) * c(hn_div_ho_3);
> if (glob_prec * c(float_abs(array_y[1])) > c(est_tmp)) then # if number 3
> est_tmp := c(glob_prec) * c(float_abs(array_y[1]));
> fi;# end if 3;
> if (c(est_tmp) >= c(array_max_est_error[1])) then # if number 3
> array_max_est_error[1] := c(est_tmp);
> fi;# end if 3
> ;
> end;
track_estimated_error := proc()
local hn_div_ho, hn_div_ho_2, hn_div_ho_3, no_terms, est_tmp;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
no_terms := ATS_MAX_TERMS;
hn_div_ho := glob__0_5;
hn_div_ho_2 := glob__0_25;
hn_div_ho_3 := glob__0_125;
est_tmp := c(float_abs(array_y[no_terms - 3]))
+ c(float_abs(array_y[no_terms - 2]))*c(hn_div_ho)
+ c(float_abs(array_y[no_terms - 1]))*c(hn_div_ho_2)
+ c(float_abs(array_y[no_terms]))*c(hn_div_ho_3);
if c(est_tmp) < glob_prec*c(float_abs(array_y[1])) then
est_tmp := c(glob_prec)*c(float_abs(array_y[1]))
end if;
if c(array_max_est_error[1]) <= c(est_tmp) then
array_max_est_error[1] := c(est_tmp)
end if
end proc
# End Function number 6
# Begin Function number 7
> reached_interval := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local ret;
> if ((glob_check_sign * array_x[1]) >= (glob_check_sign * glob_next_display - glob_h/glob__10)) then # if number 3
> ret := true;
> else
> ret := false;
> fi;# end if 3;
> return(ret);
> end;
reached_interval := proc()
local ret;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
if glob_check_sign*glob_next_display - glob_h/glob__10 <=
glob_check_sign*array_x[1] then ret := true
else ret := false
end if;
return ret
end proc
# End Function number 7
# Begin Function number 8
> display_alot := proc(iter)
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local abserr, closed_form_val_y, ind_var, numeric_val, relerr, term_no, est_rel_err;
> #TOP DISPLAY ALOT
> if (reached_interval()) then # if number 3
> if (iter >= 0) then # if number 4
> ind_var := array_x[1];
> omniout_float(ALWAYS,"x[1] ",33,ind_var,20," ");
> closed_form_val_y := evalf(exact_soln_y(ind_var));
> omniout_float(ALWAYS,"y[1] (closed_form) ",33,closed_form_val_y,20," ");
> term_no := 1;
> numeric_val := array_y[term_no];
> abserr := float_abs(numeric_val - closed_form_val_y);
> omniout_float(ALWAYS,"y[1] (numeric) ",33,numeric_val,20," ");
> if (c(float_abs(closed_form_val_y)) > c(glob_prec)) then # if number 5
> relerr := abserr*glob__100/float_abs(closed_form_val_y);
> if (c(relerr) > c(glob_prec)) then # if number 6
> glob_good_digits := -int_trunc(log10(c(relerr))) + 3;
> else
> glob_good_digits := Digits;
> fi;# end if 6;
> else
> relerr := glob__m1 ;
> glob_good_digits := -16;
> fi;# end if 5;
> if (glob_good_digits < glob_min_good_digits) then # if number 5
> glob_min_good_digits := glob_good_digits;
> fi;# end if 5;
> if (glob_apfp_est_good_digits < glob_min_apfp_est_good_digits) then # if number 5
> glob_min_apfp_est_good_digits := glob_apfp_est_good_digits;
> fi;# end if 5;
> if (evalf(float_abs(numeric_val)) > glob_prec) then # if number 5
> est_rel_err := evalf(array_max_est_error[1]*100.0 * sqrt(glob_iter)*17*ATS_MAX_TERMS/float_abs(numeric_val));
> if (evalf(est_rel_err) > glob_prec) then # if number 6
> glob_est_digits := -int_trunc(log10(est_rel_err)) + 3;
> else
> glob_est_digits := Digits;
> fi;# end if 6;
> else
> relerr := glob__m1 ;
> glob_est_digits := -16;
> fi;# end if 5;
> array_est_digits[1] := glob_est_digits;
> if (glob_iter = 1) then # if number 5
> array_1st_rel_error[1] := relerr;
> else
> array_last_rel_error[1] := relerr;
> fi;# end if 5;
> array_est_rel_error[1] := est_rel_err;
> omniout_float(ALWAYS,"absolute error ",4,abserr,20," ");
> omniout_float(ALWAYS,"relative error ",4,relerr,20,"%");
> omniout_int(INFO,"Desired digits ",32,glob_desired_digits_correct,4," ");
> omniout_int(INFO,"Estimated correct digits ",32,glob_est_digits,4," ");
> omniout_int(INFO,"Correct digits ",32,glob_good_digits,4," ")
> ;
> omniout_float(ALWAYS,"h ",4,glob_h,20," ");
> fi;# end if 4;
> #BOTTOM DISPLAY ALOT
> fi;# end if 3;
> end;
display_alot := proc(iter)
local abserr, closed_form_val_y, ind_var, numeric_val, relerr, term_no,
est_rel_err;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
if reached_interval() then
if 0 <= iter then
ind_var := array_x[1];
omniout_float(ALWAYS, "x[1] ", 33,
ind_var, 20, " ");
closed_form_val_y := evalf(exact_soln_y(ind_var));
omniout_float(ALWAYS, "y[1] (closed_form) ", 33,
closed_form_val_y, 20, " ");
term_no := 1;
numeric_val := array_y[term_no];
abserr := float_abs(numeric_val - closed_form_val_y);
omniout_float(ALWAYS, "y[1] (numeric) ", 33,
numeric_val, 20, " ");
if c(glob_prec) < c(float_abs(closed_form_val_y)) then
relerr := abserr*glob__100/float_abs(closed_form_val_y);
if c(glob_prec) < c(relerr) then
glob_good_digits := -int_trunc(log10(c(relerr))) + 3
else glob_good_digits := Digits
end if
else relerr := glob__m1; glob_good_digits := -16
end if;
if glob_good_digits < glob_min_good_digits then
glob_min_good_digits := glob_good_digits
end if;
if glob_apfp_est_good_digits < glob_min_apfp_est_good_digits
then glob_min_apfp_est_good_digits := glob_apfp_est_good_digits
end if;
if glob_prec < evalf(float_abs(numeric_val)) then
est_rel_err := evalf(array_max_est_error[1]*100.0*
sqrt(glob_iter)*17*ATS_MAX_TERMS/float_abs(numeric_val))
;
if glob_prec < evalf(est_rel_err) then
glob_est_digits := -int_trunc(log10(est_rel_err)) + 3
else glob_est_digits := Digits
end if
else relerr := glob__m1; glob_est_digits := -16
end if;
array_est_digits[1] := glob_est_digits;
if glob_iter = 1 then array_1st_rel_error[1] := relerr
else array_last_rel_error[1] := relerr
end if;
array_est_rel_error[1] := est_rel_err;
omniout_float(ALWAYS, "absolute error ", 4,
abserr, 20, " ");
omniout_float(ALWAYS, "relative error ", 4,
relerr, 20, "%");
omniout_int(INFO, "Desired digits ", 32,
glob_desired_digits_correct, 4, " ");
omniout_int(INFO, "Estimated correct digits ", 32,
glob_est_digits, 4, " ");
omniout_int(INFO, "Correct digits ", 32,
glob_good_digits, 4, " ");
omniout_float(ALWAYS, "h ", 4,
glob_h, 20, " ")
end if
end if
end proc
# End Function number 8
# Begin Function number 9
> prog_report := proc(x_start,x_end)
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> 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 := (clock_sec1) - (glob_orig_start_sec);
> glob_clock_sec := (clock_sec1) - (glob_clock_start_sec);
> left_sec := (glob_max_sec) + (glob_orig_start_sec) - (clock_sec1);
> expect_sec := comp_expect_sec((x_end),(x_start),(array_x[1]) + (glob_h) ,( clock_sec1) - (glob_orig_start_sec));
> opt_clock_sec := ( clock_sec1) - (glob_optimal_clock_start_sec);
> glob_optimal_expect_sec := comp_expect_sec((x_end),(x_start),(array_x[1]) +( glob_h) ,( opt_clock_sec));
> glob_total_exp_sec := glob_optimal_expect_sec + c(total_clock_sec);
> percent_done := comp_percent((x_end),(x_start),(array_x[1]) + (glob_h));
> glob_percent_done := percent_done;
> omniout_str_noeol(INFO,"Total Elapsed Time ");
> omniout_timestr((total_clock_sec));
> omniout_str_noeol(INFO,"Elapsed Time(since restart) ");
> omniout_timestr((glob_clock_sec));
> if (c(percent_done) < glob__100) then # if number 3
> omniout_str_noeol(INFO,"Expected Time Remaining ");
> omniout_timestr((expect_sec));
> omniout_str_noeol(INFO,"Optimized Time Remaining ");
> omniout_timestr((glob_optimal_expect_sec));
> omniout_str_noeol(INFO,"Expected Total Time ");
> omniout_timestr((glob_total_exp_sec));
> fi;# end if 3;
> omniout_str_noeol(INFO,"Time to Timeout ");
> omniout_timestr((left_sec));
> omniout_float(INFO, "Percent Done ",33,percent_done,4,"%");
> #BOTTOM PROGRESS REPORT
> 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 ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
clock_sec1 := elapsed_time_seconds();
total_clock_sec := clock_sec1 - glob_orig_start_sec;
glob_clock_sec := clock_sec1 - glob_clock_start_sec;
left_sec := glob_max_sec + glob_orig_start_sec - clock_sec1;
expect_sec := comp_expect_sec(x_end, x_start, array_x[1] + glob_h,
clock_sec1 - glob_orig_start_sec);
opt_clock_sec := clock_sec1 - glob_optimal_clock_start_sec;
glob_optimal_expect_sec :=
comp_expect_sec(x_end, x_start, array_x[1] + glob_h, opt_clock_sec)
;
glob_total_exp_sec := glob_optimal_expect_sec + c(total_clock_sec);
percent_done := comp_percent(x_end, x_start, array_x[1] + glob_h);
glob_percent_done := percent_done;
omniout_str_noeol(INFO, "Total Elapsed Time ");
omniout_timestr(total_clock_sec);
omniout_str_noeol(INFO, "Elapsed Time(since restart) ");
omniout_timestr(glob_clock_sec);
if c(percent_done) < glob__100 then
omniout_str_noeol(INFO, "Expected Time Remaining ");
omniout_timestr(expect_sec);
omniout_str_noeol(INFO, "Optimized Time Remaining ");
omniout_timestr(glob_optimal_expect_sec);
omniout_str_noeol(INFO, "Expected Total Time ");
omniout_timestr(glob_total_exp_sec)
end if;
omniout_str_noeol(INFO, "Time to Timeout ");
omniout_timestr(left_sec);
omniout_float(INFO, "Percent Done ", 33,
percent_done, 4, "%")
end proc
# End Function number 9
# Begin Function number 10
> check_for_pole := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, term1, term2, term3, part1, part2, part3, part4, part5, part6, part7, part8, part9, part10, part11, part12, part13, part14, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found_sing, h_new, ratio, term, local_test, tmp_rad,tmp_ord, tmp_ratio, prev_tmp_rad, last_no;
> #TOP CHECK FOR POLE
> tmp_rad := glob_larger_float;
> prev_tmp_rad := glob_larger_float;
> tmp_ratio := glob_larger_float;
> rad_c := glob_larger_float;
> array_rad_test_poles[1,1] := glob_larger_float;
> array_ord_test_poles[1,1] := glob_larger_float;
> found_sing := 1;
> last_no := ATS_MAX_TERMS - 1 - 10;
> cnt := 0;
> while (last_no < ATS_MAX_TERMS-3 and found_sing = 1) do # do number 1
> tmp_rad := comp_rad_from_ratio(array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 3
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 3;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 3
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 4
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 5
> found_sing := 0;
> fi;# end if 5;
> prev_tmp_rad := tmp_rad;;
> cnt := cnt + 1;
> last_no := last_no + 1;
> od;# end do number 1;
> if (found_sing = 1) then # if number 5
> if (rad_c < array_rad_test_poles[1,1]) then # if number 6
> array_rad_test_poles[1,1] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_ratio(array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> array_rad_test_poles[1,1] := rad_c;
> array_ord_test_poles[1,1] := tmp_ord;
> fi;# end if 6;
> fi;# end if 5;
> #BOTTOM general radius test1
> tmp_rad := glob_larger_float;
> prev_tmp_rad := glob_larger_float;
> tmp_ratio := glob_larger_float;
> rad_c := glob_larger_float;
> array_rad_test_poles[1,2] := glob_larger_float;
> array_ord_test_poles[1,2] := glob_larger_float;
> found_sing := 1;
> last_no := ATS_MAX_TERMS - 1 - 10;
> cnt := 0;
> while (last_no < ATS_MAX_TERMS-4 and found_sing = 1) do # do number 1
> tmp_rad := comp_rad_from_three_terms(array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 5
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 5;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 5
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 6
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 7
> found_sing := 0;
> fi;# end if 7;
> prev_tmp_rad := tmp_rad;;
> cnt := cnt + 1;
> last_no := last_no + 1;
> od;# end do number 1;
> if (found_sing = 1) then # if number 7
> if (rad_c < array_rad_test_poles[1,2]) then # if number 8
> array_rad_test_poles[1,2] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_three_terms(array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> array_rad_test_poles[1,2] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 9
> glob_min_pole_est := rad_c;
> fi;# end if 9;
> array_ord_test_poles[1,2] := tmp_ord;
> fi;# end if 8;
> fi;# end if 7;
> #BOTTOM general radius test1
> tmp_rad := glob_larger_float;
> prev_tmp_rad := glob_larger_float;
> tmp_ratio := glob_larger_float;
> rad_c := glob_larger_float;
> array_rad_test_poles[1,3] := glob_larger_float;
> array_ord_test_poles[1,3] := glob_larger_float;
> found_sing := 1;
> last_no := ATS_MAX_TERMS - 1 - 10;
> cnt := 0;
> while (last_no < ATS_MAX_TERMS-7 and found_sing = 1) do # do number 1
> tmp_rad := comp_rad_from_six_terms(array_y_higher[1,last_no-5],array_y_higher[1,last_no-4],array_y_higher[1,last_no-3],array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 7
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 7;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 7
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 8
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 9
> found_sing := 0;
> fi;# end if 9;
> prev_tmp_rad := tmp_rad;;
> cnt := cnt + 1;
> last_no := last_no + 1;
> od;# end do number 1;
> if (found_sing = 1) then # if number 9
> if (rad_c < array_rad_test_poles[1,3]) then # if number 10
> array_rad_test_poles[1,3] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_six_terms(array_y_higher[1,last_no-5],array_y_higher[1,last_no-4],array_y_higher[1,last_no-3],array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no);
> array_rad_test_poles[1,3] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 11
> glob_min_pole_est := rad_c;
> fi;# end if 11;
> array_ord_test_poles[1,3] := tmp_ord;
> fi;# end if 10;
> fi;# end if 9;
> #BOTTOM general radius test1
> #START ADJUST ALL SERIES
> if (float_abs(glob_min_pole_est) * glob_ratio_of_radius < float_abs(glob_h)) then # if number 9
> h_new := glob_check_sign * glob_min_pole_est * glob_ratio_of_radius;
> omniout_str(ALWAYS,"SETTING H FOR POLE");
> glob_h_reason := 6;
> if (glob_check_sign * glob_min_h > glob_check_sign * h_new) then # if number 10
> omniout_str(ALWAYS,"SETTING H FOR MIN H");
> h_new := glob_min_h;
> glob_h_reason := 5;
> fi;# end if 10;
> term := 1;
> ratio := c(1.0);
> while (term <= ATS_MAX_TERMS) do # do number 1
> array_y[term] := array_y[term]* ratio;
> array_y_higher[1,term] := array_y_higher[1,term]* ratio;
> array_x[term] := array_x[term]* ratio;
> ratio := ratio * h_new / float_abs(glob_h);
> term := term + 1;
> od;# end do number 1;
> glob_h := h_new;
> fi;# end if 9;
> #BOTTOM ADJUST ALL SERIES
> ;
> if (reached_interval()) then # if number 9
> display_poles();
> fi;# end if 9
> end;
check_for_pole := proc()
local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, term1, term2,
term3, part1, part2, part3, part4, part5, part6, part7, part8, part9,
part10, part11, part12, part13, part14, rad_c, rcs, rm0, rm1, rm2, rm3, rm4,
found_sing, h_new, ratio, term, local_test, tmp_rad, tmp_ord, tmp_ratio,
prev_tmp_rad, last_no;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
tmp_rad := glob_larger_float;
prev_tmp_rad := glob_larger_float;
tmp_ratio := glob_larger_float;
rad_c := glob_larger_float;
array_rad_test_poles[1, 1] := glob_larger_float;
array_ord_test_poles[1, 1] := glob_larger_float;
found_sing := 1;
last_no := ATS_MAX_TERMS - 11;
cnt := 0;
while last_no < ATS_MAX_TERMS - 3 and found_sing = 1 do
tmp_rad := comp_rad_from_ratio(array_y_higher[1, last_no - 1],
array_y_higher[1, last_no], last_no);
if glob__0 < float_abs(prev_tmp_rad) then
tmp_ratio := tmp_rad/prev_tmp_rad
else tmp_ratio := glob_large_float
end if;
if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and
glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad
elif cnt = 0 then rad_c := tmp_rad
elif 0 < cnt then found_sing := 0
end if;
prev_tmp_rad := tmp_rad;
cnt := cnt + 1;
last_no := last_no + 1
end do;
if found_sing = 1 then
if rad_c < array_rad_test_poles[1, 1] then
array_rad_test_poles[1, 1] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_ratio(array_y_higher[1, last_no - 1],
array_y_higher[1, last_no], last_no);
array_rad_test_poles[1, 1] := rad_c;
array_ord_test_poles[1, 1] := tmp_ord
end if
end if;
tmp_rad := glob_larger_float;
prev_tmp_rad := glob_larger_float;
tmp_ratio := glob_larger_float;
rad_c := glob_larger_float;
array_rad_test_poles[1, 2] := glob_larger_float;
array_ord_test_poles[1, 2] := glob_larger_float;
found_sing := 1;
last_no := ATS_MAX_TERMS - 11;
cnt := 0;
while last_no < ATS_MAX_TERMS - 4 and found_sing = 1 do
tmp_rad := comp_rad_from_three_terms(
array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1],
array_y_higher[1, last_no], last_no);
if glob__0 < float_abs(prev_tmp_rad) then
tmp_ratio := tmp_rad/prev_tmp_rad
else tmp_ratio := glob_large_float
end if;
if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and
glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad
elif cnt = 0 then rad_c := tmp_rad
elif 0 < cnt then found_sing := 0
end if;
prev_tmp_rad := tmp_rad;
cnt := cnt + 1;
last_no := last_no + 1
end do;
if found_sing = 1 then
if rad_c < array_rad_test_poles[1, 2] then
array_rad_test_poles[1, 2] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_three_terms(
array_y_higher[1, last_no - 2],
array_y_higher[1, last_no - 1], array_y_higher[1, last_no],
last_no);
array_rad_test_poles[1, 2] := rad_c;
if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c
end if;
array_ord_test_poles[1, 2] := tmp_ord
end if
end if;
tmp_rad := glob_larger_float;
prev_tmp_rad := glob_larger_float;
tmp_ratio := glob_larger_float;
rad_c := glob_larger_float;
array_rad_test_poles[1, 3] := glob_larger_float;
array_ord_test_poles[1, 3] := glob_larger_float;
found_sing := 1;
last_no := ATS_MAX_TERMS - 11;
cnt := 0;
while last_no < ATS_MAX_TERMS - 7 and found_sing = 1 do
tmp_rad := comp_rad_from_six_terms(array_y_higher[1, last_no - 5],
array_y_higher[1, last_no - 4], array_y_higher[1, last_no - 3],
array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1],
array_y_higher[1, last_no], last_no);
if glob__0 < float_abs(prev_tmp_rad) then
tmp_ratio := tmp_rad/prev_tmp_rad
else tmp_ratio := glob_large_float
end if;
if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and
glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad
elif cnt = 0 then rad_c := tmp_rad
elif 0 < cnt then found_sing := 0
end if;
prev_tmp_rad := tmp_rad;
cnt := cnt + 1;
last_no := last_no + 1
end do;
if found_sing = 1 then
if rad_c < array_rad_test_poles[1, 3] then
array_rad_test_poles[1, 3] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_six_terms(
array_y_higher[1, last_no - 5],
array_y_higher[1, last_no - 4],
array_y_higher[1, last_no - 3],
array_y_higher[1, last_no - 2],
array_y_higher[1, last_no - 1], array_y_higher[1, last_no],
last_no);
array_rad_test_poles[1, 3] := rad_c;
if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c
end if;
array_ord_test_poles[1, 3] := tmp_ord
end if
end if;
if
float_abs(glob_min_pole_est)*glob_ratio_of_radius < float_abs(glob_h)
then
h_new := glob_check_sign*glob_min_pole_est*glob_ratio_of_radius;
omniout_str(ALWAYS, "SETTING H FOR POLE");
glob_h_reason := 6;
if glob_check_sign*h_new < glob_check_sign*glob_min_h then
omniout_str(ALWAYS, "SETTING H FOR MIN H");
h_new := glob_min_h;
glob_h_reason := 5
end if;
term := 1;
ratio := c(1.0);
while term <= ATS_MAX_TERMS do
array_y[term] := array_y[term]*ratio;
array_y_higher[1, term] := array_y_higher[1, term]*ratio;
array_x[term] := array_x[term]*ratio;
ratio := ratio*h_new/float_abs(glob_h);
term := term + 1
end do;
glob_h := h_new
end if;
if reached_interval() then display_poles() end if
end proc
# End Function number 10
# Begin Function number 11
> atomall := proc()
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
#Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
#Bottom Generate Globals Decl
#BEGIN CONST
> array_const_1,
> array_const_0D0,
#END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> local kkk, order_d, adj2, adj3 , temporary, term;
> #TOP ATOMALL
> # before write maple main top matter
> # before generate constants assign
> # before generate globals assign
> #END OUTFILE1
> #BEGIN OUTFILE2
> #END OUTFILE2
> #BEGIN ATOMHDR1
> #emit pre sin 1 $eq_no = 1
> array_tmp1[1] := sin(array_x[1]);
> array_tmp1_g[1] := cos(array_x[1]);
> #emit pre add CONST FULL $eq_no = 1 i = 1
> array_tmp2[1] := array_const_0D0[1] + array_tmp1[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 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp2[1]) * (expt((glob_h) , c(1))) * c(factorial_3(0,1));
> if (2 <= ATS_MAX_TERMS) then # if number 3
> array_y[2] := temporary;
> array_y_higher[1,2] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(1);
> array_y_higher[2,1] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 2;
> #END ATOMHDR1
> #BEGIN ATOMHDR2
> #emit pre sin ID_LINEAR iii = 2 $eq_no = 1
> array_tmp1[2] := array_tmp1_g[1] * array_x[2] / c(1);
> array_tmp1_g[2] := neg(array_tmp1[1]) * array_x[2] / c(1);
> #emit pre add CONST FULL $eq_no = 1 i = 2
> array_tmp2[2] := array_tmp1[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 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp2[2]) * (expt((glob_h) , c(1))) * c(factorial_3(1,2));
> if (3 <= ATS_MAX_TERMS) then # if number 3
> array_y[3] := temporary;
> array_y_higher[1,3] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(2);
> array_y_higher[2,2] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 3;
> #END ATOMHDR2
> #BEGIN ATOMHDR3
> #emit pre sin ID_LINEAR iii = 3 $eq_no = 1
> array_tmp1[3] := array_tmp1_g[2] * array_x[2] / c(2);
> array_tmp1_g[3] := neg(array_tmp1[2]) * array_x[2] / c(2);
> #emit pre add CONST FULL $eq_no = 1 i = 3
> array_tmp2[3] := array_tmp1[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 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp2[3]) * (expt((glob_h) , c(1))) * c(factorial_3(2,3));
> if (4 <= ATS_MAX_TERMS) then # if number 3
> array_y[4] := temporary;
> array_y_higher[1,4] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(3);
> array_y_higher[2,3] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 4;
> #END ATOMHDR3
> #BEGIN ATOMHDR4
> #emit pre sin ID_LINEAR iii = 4 $eq_no = 1
> array_tmp1[4] := array_tmp1_g[3] * array_x[2] / c(3);
> array_tmp1_g[4] := neg(array_tmp1[3]) * array_x[2] / c(3);
> #emit pre add CONST FULL $eq_no = 1 i = 4
> array_tmp2[4] := array_tmp1[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 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp2[4]) * (expt((glob_h) , c(1))) * c(factorial_3(3,4));
> if (5 <= ATS_MAX_TERMS) then # if number 3
> array_y[5] := temporary;
> array_y_higher[1,5] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(4);
> array_y_higher[2,4] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 5;
> #END ATOMHDR4
> #BEGIN ATOMHDR5
> #emit pre sin ID_LINEAR iii = 5 $eq_no = 1
> array_tmp1[5] := array_tmp1_g[4] * array_x[2] / c(4);
> array_tmp1_g[5] := neg(array_tmp1[4]) * array_x[2] / c(4);
> #emit pre add CONST FULL $eq_no = 1 i = 5
> array_tmp2[5] := array_tmp1[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 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp2[5]) * (expt((glob_h) , c(1))) * c(factorial_3(4,5));
> if (6 <= ATS_MAX_TERMS) then # if number 3
> array_y[6] := temporary;
> array_y_higher[1,6] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(5);
> array_y_higher[2,5] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 6;
> #END ATOMHDR5
> #BEGIN OUTFILE3
> #Top Atomall While Loop-- outfile3
> while (kkk <= ATS_MAX_TERMS) do # do number 1
> #END OUTFILE3
> #BEGIN OUTFILE4
> #emit sin LINEAR $eq_no = 1
> array_tmp1[kkk] := array_tmp1_g[kkk - 1] * array_x[2] / c(kkk - 1);
> array_tmp1_g[kkk] := neg(array_tmp1[kkk - 1]) * array_x[2] / c(kkk - 1);
> #emit NOT FULL - FULL add $eq_no = 1
> array_tmp2[kkk] := array_tmp1[kkk];
> #emit assign $eq_no = 1
> order_d := 1;
> if (kkk + order_d <= ATS_MAX_TERMS) then # if number 1
> if ( not array_y_set_initial[1,kkk + order_d]) then # if number 2
> temporary := c(array_tmp2[kkk]) * expt((glob_h) , c(order_d)) * c(factorial_3((kkk - 1),(kkk + order_d - 1)));
> array_y[kkk + order_d] := c(temporary);
> array_y_higher[1,kkk + order_d] := c(temporary);
> term := kkk + order_d - 1;
> adj2 := kkk + order_d - 1;
> adj3 := 2;
> while ((term >= 1) and (term <= ATS_MAX_TERMS) and (adj3 < order_d + 1)) do # do number 1
> if (adj3 <= order_d + 1) then # if number 3
> if (adj2 > 0) then # if number 4
> temporary := c(temporary) / c(glob_h) * c(adj2);
> else
> temporary := c(temporary);
> fi;# end if 4;
> array_y_higher[adj3,term] := c(temporary);
> fi;# end if 3;
> term := term - 1;
> adj2 := adj2 - 1;
> adj3 := adj3 + 1;
> od;# end do number 1
> 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;
atomall := proc()
local kkk, order_d, adj2, adj3, temporary, term;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
array_tmp1[1] := sin(array_x[1]);
array_tmp1_g[1] := cos(array_x[1]);
array_tmp2[1] := array_const_0D0[1] + array_tmp1[1];
if not array_y_set_initial[1, 2] then
if 1 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp2[1])*expt(glob_h, c(1))*c(factorial_3(0, 1));
if 2 <= ATS_MAX_TERMS then
array_y[2] := temporary; array_y_higher[1, 2] := temporary
end if;
temporary := c(temporary)*c(1)/c(glob_h);
array_y_higher[2, 1] := c(temporary)
end if
end if;
kkk := 2;
array_tmp1[2] := array_tmp1_g[1]*array_x[2]/c(1);
array_tmp1_g[2] := neg(array_tmp1[1])*array_x[2]/c(1);
array_tmp2[2] := array_tmp1[2];
if not array_y_set_initial[1, 3] then
if 2 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp2[2])*expt(glob_h, c(1))*c(factorial_3(1, 2));
if 3 <= ATS_MAX_TERMS then
array_y[3] := temporary; array_y_higher[1, 3] := temporary
end if;
temporary := c(temporary)*c(2)/c(glob_h);
array_y_higher[2, 2] := c(temporary)
end if
end if;
kkk := 3;
array_tmp1[3] := array_tmp1_g[2]*array_x[2]/c(2);
array_tmp1_g[3] := neg(array_tmp1[2])*array_x[2]/c(2);
array_tmp2[3] := array_tmp1[3];
if not array_y_set_initial[1, 4] then
if 3 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp2[3])*expt(glob_h, c(1))*c(factorial_3(2, 3));
if 4 <= ATS_MAX_TERMS then
array_y[4] := temporary; array_y_higher[1, 4] := temporary
end if;
temporary := c(temporary)*c(3)/c(glob_h);
array_y_higher[2, 3] := c(temporary)
end if
end if;
kkk := 4;
array_tmp1[4] := array_tmp1_g[3]*array_x[2]/c(3);
array_tmp1_g[4] := neg(array_tmp1[3])*array_x[2]/c(3);
array_tmp2[4] := array_tmp1[4];
if not array_y_set_initial[1, 5] then
if 4 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp2[4])*expt(glob_h, c(1))*c(factorial_3(3, 4));
if 5 <= ATS_MAX_TERMS then
array_y[5] := temporary; array_y_higher[1, 5] := temporary
end if;
temporary := c(temporary)*c(4)/c(glob_h);
array_y_higher[2, 4] := c(temporary)
end if
end if;
kkk := 5;
array_tmp1[5] := array_tmp1_g[4]*array_x[2]/c(4);
array_tmp1_g[5] := neg(array_tmp1[4])*array_x[2]/c(4);
array_tmp2[5] := array_tmp1[5];
if not array_y_set_initial[1, 6] then
if 5 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp2[5])*expt(glob_h, c(1))*c(factorial_3(4, 5));
if 6 <= ATS_MAX_TERMS then
array_y[6] := temporary; array_y_higher[1, 6] := temporary
end if;
temporary := c(temporary)*c(5)/c(glob_h);
array_y_higher[2, 5] := c(temporary)
end if
end if;
kkk := 6;
while kkk <= ATS_MAX_TERMS do
array_tmp1[kkk] := array_tmp1_g[kkk - 1]*array_x[2]/c(kkk - 1);
array_tmp1_g[kkk] := neg(array_tmp1[kkk - 1])*array_x[2]/c(kkk - 1)
;
array_tmp2[kkk] := array_tmp1[kkk];
order_d := 1;
if kkk + order_d <= ATS_MAX_TERMS then
if not array_y_set_initial[1, kkk + order_d] then
temporary := c(array_tmp2[kkk])*expt(glob_h, c(order_d))*
c(factorial_3(kkk - 1, kkk + order_d - 1));
array_y[kkk + order_d] := c(temporary);
array_y_higher[1, kkk + order_d] := c(temporary);
term := kkk + order_d - 1;
adj2 := kkk + order_d - 1;
adj3 := 2;
while
1 <= term and term <= ATS_MAX_TERMS and adj3 < order_d + 1
do
if adj3 <= order_d + 1 then
if 0 < adj2 then
temporary := c(temporary)*c(adj2)/c(glob_h)
else temporary := c(temporary)
end if;
array_y_higher[adj3, term] := c(temporary)
end if;
term := term - 1;
adj2 := adj2 - 1;
adj3 := adj3 + 1
end do
end if
end if;
kkk := kkk + 1
end do
end proc
# End Function number 12
#END OUTFILE5
# Begin Function number 12
> main := proc()
> #BEGIN OUTFIEMAIN
> local d1,d2,d3,d4,est_err_2,niii,done_once,max_terms,display_max,
> 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,last_min_pole_est, opt_iter, tmp,subiter, est_needed_step_err,estimated_step_error,min_value,est_answer,found_h,repeat_it;
> global
> ALWAYS,
> INFO,
> DEBUGL,
> DEBUGMASSIVE,
> glob_iolevel,
> glob_yes_pole,
> glob_no_pole,
> glob_not_given,
> glob_no_sing_tests,
> glob_ratio_test,
> glob_three_term_test,
> glob_six_term_test,
> glob_log_10,
> #Top Generate Globals Decl
> MAX_UNCHANGED,
> glob__small,
> glob_small_float,
> glob_smallish_float,
> glob_large_float,
> glob_larger_float,
> glob__m2,
> glob__m1,
> glob__0,
> glob__1,
> glob__2,
> glob__3,
> glob__4,
> glob__5,
> glob__8,
> glob__10,
> glob__100,
> glob__pi,
> glob__0_5,
> glob__0_8,
> glob__m0_8,
> glob__0_25,
> glob__0_125,
> glob_prec,
> glob_check_sign,
> glob_desired_digits_correct,
> glob_max_estimated_step_error,
> glob_ratio_of_radius,
> glob_percent_done,
> glob_total_exp_sec,
> glob_optimal_expect_sec,
> glob_estimated_size_answer,
> glob_almost_1,
> glob_clock_sec,
> glob_clock_start_sec,
> glob_disp_incr,
> glob_h,
> glob_diff_rc_fm,
> glob_diff_rc_fmm1,
> glob_diff_rc_fmm2,
> glob_diff_ord_fm,
> glob_diff_ord_fmm1,
> glob_diff_ord_fmm2,
> glob_six_term_ord_save,
> glob_guess_error_rc,
> glob_guess_error_ord,
> glob_least_given_sing,
> glob_least_ratio_sing,
> glob_least_3_sing,
> glob_least_6_sing,
> glob_last_good_h,
> glob_max_h,
> glob_min_h,
> glob_display_interval,
> glob_abserr,
> glob_relerr,
> glob_min_pole_est,
> glob_max_rel_trunc_err,
> glob_max_trunc_err,
> glob_max_hours,
> glob_optimal_clock_start_sec,
> glob_optimal_start,
> glob_upper_ratio_limit,
> glob_lower_ratio_limit,
> glob_max_sec,
> glob_orig_start_sec,
> glob_normmax,
> glob_max_minutes,
> glob_next_display,
> glob_est_digits,
> glob_subiter_method,
> glob_html_log,
> glob_min_good_digits,
> glob_good_digits,
> glob_min_apfp_est_good_digits,
> glob_apfp_est_good_digits,
> glob_max_opt_iter,
> glob_dump,
> glob_djd_debug,
> glob_display_flag,
> glob_djd_debug2,
> glob_h_reason,
> glob_sec_in_minute,
> glob_min_in_hour,
> glob_hours_in_day,
> glob_days_in_year,
> glob_sec_in_hour,
> glob_sec_in_day,
> glob_sec_in_year,
> glob_not_yet_finished,
> glob_initial_pass,
> glob_not_yet_start_msg,
> glob_reached_optimal_h,
> glob_optimal_done,
> glob_type_given_pole,
> glob_optimize,
> glob_look_poles,
> glob_dump_closed_form,
> glob_max_iter,
> glob_no_eqs,
> glob_unchanged_h_cnt,
> glob_warned,
> glob_warned2,
> glob_start,
> glob_iter,
> #Bottom Generate Globals Decl
> #BEGIN CONST
> array_const_1,
> array_const_0D0,
> #END CONST
> array_y_init,
> array_norms,
> array_fact_1,
> array_1st_rel_error,
> array_last_rel_error,
> array_est_rel_error,
> array_max_est_error,
> array_type_pole,
> array_type_real_pole,
> array_type_complex_pole,
> array_est_digits,
> array_y,
> array_x,
> array_tmp0,
> array_tmp1_g,
> array_tmp1,
> array_tmp2,
> array_m1,
> array_y_higher,
> array_y_higher_work,
> array_y_higher_work2,
> array_y_set_initial,
> array_given_rad_poles,
> array_given_ord_poles,
> array_rad_test_poles,
> array_ord_test_poles,
> array_fact_2,
> ATS_MAX_TERMS,
> glob_last;
> ATS_MAX_TERMS := 100;
> # before first input block
> #BEGIN FIRST INPUT BLOCK
> #BEGIN BLOCK 1
> #BEGIN FIRST INPUT BLOCK
> Digits:=100;
> max_terms:=100;
> #END BLOCK 1
> #END FIRST INPUT BLOCK
> #START OF INITS AFTER INPUT BLOCK
> glob_html_log := true;
> #END OF INITS AFTER INPUT BLOCK
> # before generate arrays
> array_y_init:= Array(0..(100),[]);
> array_norms:= Array(0..(100),[]);
> array_fact_1:= Array(0..(100),[]);
> array_1st_rel_error:= Array(0..(2),[]);
> array_last_rel_error:= Array(0..(2),[]);
> array_est_rel_error:= Array(0..(2),[]);
> array_max_est_error:= Array(0..(2),[]);
> array_type_pole:= Array(0..(2),[]);
> array_type_real_pole:= Array(0..(2),[]);
> array_type_complex_pole:= Array(0..(2),[]);
> array_est_digits:= Array(0..(2),[]);
> array_y:= Array(0..(100),[]);
> array_x:= Array(0..(100),[]);
> array_tmp0:= Array(0..(100),[]);
> array_tmp1_g:= Array(0..(100),[]);
> array_tmp1:= Array(0..(100),[]);
> array_tmp2:= Array(0..(100),[]);
> array_m1:= Array(0..(100),[]);
> array_y_higher := Array(0..(2) ,(0..100+ 1),[]);
> array_y_higher_work := Array(0..(2) ,(0..100+ 1),[]);
> array_y_higher_work2 := Array(0..(2) ,(0..100+ 1),[]);
> array_y_set_initial := Array(0..(2) ,(0..100+ 1),[]);
> array_given_rad_poles := Array(0..(2) ,(0..3+ 1),[]);
> array_given_ord_poles := Array(0..(2) ,(0..3+ 1),[]);
> array_rad_test_poles := Array(0..(2) ,(0..4+ 1),[]);
> array_ord_test_poles := Array(0..(2) ,(0..4+ 1),[]);
> array_fact_2 := Array(0..(100) ,(0..100+ 1),[]);
> # before generate constants
> # before generate globals definition
> #Top Generate Globals Definition
> #Bottom Generate Globals Deninition
> # before generate const definition
> # before arrays initialized
> term := 1;
> while (term <= 100) do # do number 1
> array_y_init[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_norms[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_fact_1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_1st_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_last_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_est_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_max_est_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_type_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_type_real_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_type_complex_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 2) do # do number 1
> array_est_digits[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_y[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_x[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_tmp0[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_tmp1_g[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_tmp1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_tmp2[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 100) do # do number 1
> array_m1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 100) do # do number 2
> array_y_higher[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 100) do # do number 2
> array_y_higher_work[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 100) do # do number 2
> array_y_higher_work2[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 100) do # do number 2
> array_y_set_initial[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 3) do # do number 2
> array_given_rad_poles[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 3) do # do number 2
> array_given_ord_poles[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 4) do # do number 2
> array_rad_test_poles[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=2) do # do number 1
> term := 1;
> while (term <= 4) do # do number 2
> array_ord_test_poles[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> ord := 1;
> while (ord <=100) do # do number 1
> term := 1;
> while (term <= 100) do # do number 2
> array_fact_2[ord,term] := c(0.0);
> term := term + 1;
> od;# end do number 2;
> ord := ord + 1;
> od;# end do number 1;
> # before symbols initialized
> #BEGIN SYMBOLS INITIALIZATED
> zero_ats_ar(array_y);
> zero_ats_ar(array_x);
> zero_ats_ar(array_tmp0);
> zero_ats_ar(array_tmp1_g);
> zero_ats_ar(array_tmp1);
> zero_ats_ar(array_tmp2);
> zero_ats_ar(array_m1);
> zero_ats_ar(array_const_1);
> array_const_1[1] := c(1);
> zero_ats_ar(array_const_0D0);
> array_const_0D0[1] := c(0.0);
> zero_ats_ar(array_m1);
> array_m1[1] := glob__m1;
> #END SYMBOLS INITIALIZATED
> # before generate factorials init
> #Initing Factorial Tables
> iiif := 0;
> while (iiif <= ATS_MAX_TERMS) do # do number 1
> jjjf := 0;
> while (jjjf <= ATS_MAX_TERMS) do # do number 2
> array_fact_1[iiif] := 0;
> array_fact_2[iiif,jjjf] := 0;
> jjjf := jjjf + 1;
> od;# end do number 2;
> iiif := iiif + 1;
> od;# end do number 1;
> #Done Initing Factorial Table
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> glob_iolevel := 5;
> glob_yes_pole := 4;
> glob_no_pole := 3;
> glob_not_given := 0;
> glob_no_sing_tests := 4;
> glob_ratio_test := 1;
> glob_three_term_test := 2;
> glob_six_term_test := 3;
> glob_log_10 := log(c(10.0));
> MAX_UNCHANGED := 10;
> glob__small := c(0.1e-50);
> glob_small_float := c(0.1e-50);
> glob_smallish_float := c(0.1e-60);
> glob_large_float := c(1.0e100);
> glob_larger_float := c(1.1e100);
> glob__m2 := c(-2);
> glob__m1 := c(-1);
> glob__0 := c(0);
> glob__1 := c(1);
> glob__2 := c(2);
> glob__3 := c(3);
> glob__4 := c(4);
> glob__5 := c(5);
> glob__8 := c(8);
> glob__10 := c(10);
> glob__100 := c(100);
> glob__pi := c(0.0);
> glob__0_5 := c(0.5);
> glob__0_8 := c(0.8);
> glob__m0_8 := c(-0.8);
> glob__0_25 := c(0.25);
> glob__0_125 := c(0.125);
> glob_prec := c(1.0e-16);
> glob_check_sign := c(1.0);
> glob_desired_digits_correct := c(8.0);
> glob_max_estimated_step_error := c(0.0);
> glob_ratio_of_radius := c(0.1);
> glob_percent_done := c(0.0);
> glob_total_exp_sec := c(0.1);
> glob_optimal_expect_sec := c(0.1);
> glob_estimated_size_answer := c(100.0);
> glob_almost_1 := c(0.9990);
> glob_clock_sec := c(0.0);
> glob_clock_start_sec := c(0.0);
> glob_disp_incr := c(0.1);
> glob_h := c(0.1);
> glob_diff_rc_fm := c(0.1);
> glob_diff_rc_fmm1 := c(0.1);
> glob_diff_rc_fmm2 := c(0.1);
> glob_diff_ord_fm := c(0.1);
> glob_diff_ord_fmm1 := c(0.1);
> glob_diff_ord_fmm2 := c(0.1);
> glob_six_term_ord_save := c(0.1);
> glob_guess_error_rc := c(0.1);
> glob_guess_error_ord := c(0.1);
> glob_least_given_sing := c(9.9e200);
> glob_least_ratio_sing := c(9.9e200);
> glob_least_3_sing := c(9.9e100);
> glob_least_6_sing := c(9.9e100);
> glob_last_good_h := c(0.1);
> glob_max_h := c(0.1);
> glob_min_h := c(0.000001);
> glob_display_interval := c(0.1);
> glob_abserr := c(0.1e-10);
> glob_relerr := c(0.1e-10);
> glob_min_pole_est := c(0.1e+10);
> glob_max_rel_trunc_err := c(0.1e-10);
> glob_max_trunc_err := c(0.1e-10);
> glob_max_hours := c(0.0);
> glob_optimal_clock_start_sec := c(0.0);
> glob_optimal_start := c(0.0);
> glob_upper_ratio_limit := c(1.0001);
> glob_lower_ratio_limit := c(0.9999);
> glob_max_sec := c(10000.0);
> glob_orig_start_sec := c(0.0);
> glob_normmax := c(0.0);
> glob_max_minutes := c(0.0);
> glob_next_display := c(0.0);
> glob_est_digits := 1;
> glob_subiter_method := 3;
> glob_html_log := true;
> glob_min_good_digits := 99999;
> glob_good_digits := 0;
> glob_min_apfp_est_good_digits := 99999;
> glob_apfp_est_good_digits := 0;
> glob_max_opt_iter := 10;
> glob_dump := false;
> glob_djd_debug := true;
> glob_display_flag := true;
> glob_djd_debug2 := true;
> glob_h_reason := 0;
> glob_sec_in_minute := 60 ;
> glob_min_in_hour := 60;
> glob_hours_in_day := 24;
> glob_days_in_year := 365;
> glob_sec_in_hour := 3600;
> glob_sec_in_day := 86400;
> glob_sec_in_year := 31536000;
> glob_not_yet_finished := true;
> glob_initial_pass := true;
> glob_not_yet_start_msg := true;
> glob_reached_optimal_h := false;
> glob_optimal_done := false;
> glob_type_given_pole := 0;
> glob_optimize := false;
> glob_look_poles := false;
> glob_dump_closed_form := false;
> glob_max_iter := 1000;
> glob_no_eqs := 0;
> glob_unchanged_h_cnt := 0;
> glob_warned := false;
> glob_warned2 := false;
> glob_start := 0;
> glob_iter := 0;
> # before generate set diff initial
> 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;
> array_y_set_initial[1,31] := false;
> array_y_set_initial[1,32] := false;
> array_y_set_initial[1,33] := false;
> array_y_set_initial[1,34] := false;
> array_y_set_initial[1,35] := false;
> array_y_set_initial[1,36] := false;
> array_y_set_initial[1,37] := false;
> array_y_set_initial[1,38] := false;
> array_y_set_initial[1,39] := false;
> array_y_set_initial[1,40] := false;
> array_y_set_initial[1,41] := false;
> array_y_set_initial[1,42] := false;
> array_y_set_initial[1,43] := false;
> array_y_set_initial[1,44] := false;
> array_y_set_initial[1,45] := false;
> array_y_set_initial[1,46] := false;
> array_y_set_initial[1,47] := false;
> array_y_set_initial[1,48] := false;
> array_y_set_initial[1,49] := false;
> array_y_set_initial[1,50] := false;
> array_y_set_initial[1,51] := false;
> array_y_set_initial[1,52] := false;
> array_y_set_initial[1,53] := false;
> array_y_set_initial[1,54] := false;
> array_y_set_initial[1,55] := false;
> array_y_set_initial[1,56] := false;
> array_y_set_initial[1,57] := false;
> array_y_set_initial[1,58] := false;
> array_y_set_initial[1,59] := false;
> array_y_set_initial[1,60] := false;
> array_y_set_initial[1,61] := false;
> array_y_set_initial[1,62] := false;
> array_y_set_initial[1,63] := false;
> array_y_set_initial[1,64] := false;
> array_y_set_initial[1,65] := false;
> array_y_set_initial[1,66] := false;
> array_y_set_initial[1,67] := false;
> array_y_set_initial[1,68] := false;
> array_y_set_initial[1,69] := false;
> array_y_set_initial[1,70] := false;
> array_y_set_initial[1,71] := false;
> array_y_set_initial[1,72] := false;
> array_y_set_initial[1,73] := false;
> array_y_set_initial[1,74] := false;
> array_y_set_initial[1,75] := false;
> array_y_set_initial[1,76] := false;
> array_y_set_initial[1,77] := false;
> array_y_set_initial[1,78] := false;
> array_y_set_initial[1,79] := false;
> array_y_set_initial[1,80] := false;
> array_y_set_initial[1,81] := false;
> array_y_set_initial[1,82] := false;
> array_y_set_initial[1,83] := false;
> array_y_set_initial[1,84] := false;
> array_y_set_initial[1,85] := false;
> array_y_set_initial[1,86] := false;
> array_y_set_initial[1,87] := false;
> array_y_set_initial[1,88] := false;
> array_y_set_initial[1,89] := false;
> array_y_set_initial[1,90] := false;
> array_y_set_initial[1,91] := false;
> array_y_set_initial[1,92] := false;
> array_y_set_initial[1,93] := false;
> array_y_set_initial[1,94] := false;
> array_y_set_initial[1,95] := false;
> array_y_set_initial[1,96] := false;
> array_y_set_initial[1,97] := false;
> array_y_set_initial[1,98] := false;
> array_y_set_initial[1,99] := false;
> array_y_set_initial[1,100] := false;
> # before generate init omniout const
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> ATS_MAX_TERMS := 100;
> glob_iolevel := INFO;
> # set default block
> #Write Set Defaults
> glob_orig_start_sec := elapsed_time_seconds();
> 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/sinpostode.ode#################");
> omniout_str(ALWAYS,"diff ( y , x , 1 ) = sin ( x ) ; ");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"Digits:=100;");
> omniout_str(ALWAYS,"max_terms:=100;");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"x_start := c(0.0);");
> omniout_str(ALWAYS,"x_end := c(1.0);");
> omniout_str(ALWAYS,"array_y_init[0 + 1] := exact_soln_y(x_start);");
> omniout_str(ALWAYS,"glob_look_poles := false;");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"glob_type_given_pole := 3;");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"#END SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN OVERRIDE BLOCK");
> omniout_str(ALWAYS,"glob_desired_digits_correct:=8;");
> omniout_str(ALWAYS,"glob_max_minutes:=(3.0);");
> omniout_str(ALWAYS,"glob_subiter_method:=3;");
> omniout_str(ALWAYS,"glob_max_iter:=100000;");
> omniout_str(ALWAYS,"glob_upper_ratio_limit:=c(1.0000001);");
> omniout_str(ALWAYS,"glob_lower_ratio_limit:=c(0.9999999);");
> omniout_str(ALWAYS,"glob_look_poles:=true;");
> omniout_str(ALWAYS,"glob_h:=c(0.001);");
> omniout_str(ALWAYS,"glob_display_interval:=c(0.01);");
> omniout_str(ALWAYS,"#END OVERRIDE BLOCK");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN USER DEF BLOCK");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"exact_soln_y := proc(x)");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"return(c(2.0) - cos(c(x)));");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"end;");
> omniout_str(ALWAYS,"#END USER DEF BLOCK");
> omniout_str(ALWAYS,"#######END OF ECHO OF PROBLEM#################");
> glob_unchanged_h_cnt := 0;
> glob_warned := false;
> glob_warned2 := false;
> glob_small_float := glob__0;
> glob_smallish_float := glob__0;
> glob_large_float := c(1.0e100);
> glob_larger_float := c( 1.1e100);
> glob_almost_1 := c( 0.99);
> # before second block
> #TOP SECOND INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> #BEGIN BLOCK 2
> #END FIRST INPUT BLOCK
> #BEGIN SECOND INPUT BLOCK
> x_start := c(0.0);
> x_end := c(1.0);
> array_y_init[0 + 1] := exact_soln_y(x_start);
> glob_look_poles := false;
> glob_type_given_pole := 3;
> #END SECOND INPUT BLOCK
> #BEGIN OVERRIDE BLOCK
> glob_desired_digits_correct:=8;
> glob_max_minutes:=(3.0);
> glob_subiter_method:=3;
> glob_max_iter:=100000;
> glob_upper_ratio_limit:=c(1.0000001);
> glob_lower_ratio_limit:=c(0.9999999);
> glob_look_poles:=true;
> glob_h:=c(0.001);
> glob_display_interval:=c(0.01);
> #END OVERRIDE BLOCK
> #END BLOCK 2
> #END SECOND INPUT BLOCK
> #BEGIN INITS AFTER SECOND INPUT BLOCK
> glob_last_good_h := glob_h;
> glob_max_sec := (60.0) * (glob_max_minutes) + (3600.0) * (glob_max_hours);
> # after second input block
> glob_check_sign := c(my_check_sign(x_start,x_end));
> glob__pi := arccos(glob__m1);
> glob_prec = expt(10.0,c(-Digits));
> if (glob_optimize) then # if number 9
> #BEGIN OPTIMIZE CODE
> omniout_str(ALWAYS,"START of Optimize");
> #Start Series -- INITIALIZE FOR OPTIMIZE
> found_h := false;
> glob_min_pole_est := glob_larger_float;
> last_min_pole_est := glob_larger_float;
> glob_least_given_sing := glob_larger_float;
> glob_least_ratio_sing := glob_larger_float;
> glob_least_3_sing := glob_larger_float;
> glob_least_6_sing := glob_larger_float;
> glob_min_h := float_abs(glob_min_h) * glob_check_sign;
> glob_max_h := float_abs(glob_max_h) * glob_check_sign;
> glob_h := float_abs(glob_min_h) * glob_check_sign;
> glob_display_interval := c((float_abs(c(glob_display_interval))) * (glob_check_sign));
> display_max := c(x_end) - c(x_start)/glob__10;
> if ((glob_display_interval) > (display_max)) then # if number 10
> glob_display_interval := c(display_max);
> fi;# end if 10;
> chk_data();
> min_value := glob_larger_float;
> est_answer := est_size_answer();
> opt_iter := 1;
> est_needed_step_err := estimated_needed_step_error(x_start,x_end,glob_h,est_answer);
> omniout_float(ALWAYS,"est_needed_step_err",32,est_needed_step_err,16,"");
> estimated_step_error := glob_small_float;
> while ((opt_iter <= 100) and ( not found_h)) do # do number 1
> omniout_int(ALWAYS,"opt_iter",32,opt_iter,4,"");
> array_x[1] := c(x_start);
> array_x[2] := c(glob_h);
> glob_next_display := c(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 , c(term_no - 1)) / c(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;
> if (term_no < ATS_MAX_TERMS) then # if number 10
> array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 10;
> term_no := term_no + 1;
> od;# end do number 3;
> r_order := r_order + 1;
> od;# end do number 2
> ;
> atomall();
> if (glob_check_sign * glob_min_h >= glob_check_sign * glob_h) then # if number 10
> omniout_str(ALWAYS,"SETTING H FOR MIN H");
> glob_h := glob_check_sign * float_abs(glob_min_h);
> glob_h_reason := 1;
> found_h := true;
> fi;# end if 10;
> if (glob_check_sign * glob_display_interval <= glob_check_sign * glob_h) then # if number 10
> omniout_str(ALWAYS,"SETTING H FOR DISPLAY INTERVAL");
> glob_h_reason := 2;
> glob_h := glob_display_interval;
> found_h := true;
> fi;# end if 10;
> if (glob_look_poles) then # if number 10
> check_for_pole();
> fi;# end if 10;
> if ( not found_h) then # if number 10
> est_answer := est_size_answer();
> est_needed_step_err := estimated_needed_step_error(x_start,x_end,glob_h,est_answer);
> omniout_float(ALWAYS,"est_needed_step_err",32,est_needed_step_err,16,"");
> estimated_step_error := test_suggested_h();
> omniout_float(ALWAYS,"estimated_step_error",32,estimated_step_error,32,"");
> if (estimated_step_error < est_needed_step_err) then # if number 11
> omniout_str(ALWAYS,"Double H and LOOP");
> glob_h := glob_h*glob__2;
> else
> omniout_str(ALWAYS,"Found H for OPTIMAL");
> found_h := true;
> glob_h_reason := 3;
> glob_h := glob_h/glob__2;
> fi;# end if 11;
> fi;# end if 10;
> opt_iter := opt_iter + 1;
> od;# end do number 1;
> if (( not found_h) and (opt_iter = 1)) then # if number 10
> omniout_str(ALWAYS,"Beginning glob_h too large.");
> found_h := false;
> fi;# end if 10;
> if (glob_check_sign * glob_max_h <= glob_check_sign * glob_h) then # if number 10
> omniout_str(ALWAYS,"SETTING H FOR MAX H");
> glob_h := glob_check_sign * float_abs(glob_max_h);
> glob_h_reason := 1;
> found_h := true;
> fi;# end if 10;
> else
> found_h := true;
> glob_h := glob_h * glob_check_sign;
> fi;# end if 9;
> #END OPTIMIZE CODE
> if (glob_html_log) then # if number 9
> html_log_file := fopen("entry.html",WRITE,TEXT);
> fi;# end if 9;
> #BEGIN SOLUTION CODE
> if (found_h) then # if number 9
> omniout_str(ALWAYS,"START of Soultion");
> #Start Series -- INITIALIZE FOR SOLUTION
> array_x[1] := c(x_start);
> array_x[2] := c(glob_h);
> glob_next_display := c(x_start);
> glob_min_pole_est := glob_larger_float;
> glob_least_given_sing := glob_larger_float;
> glob_least_ratio_sing := glob_larger_float;
> glob_least_3_sing := glob_larger_float;
> glob_least_6_sing := glob_larger_float;
> order_diff := 1;
> #Start Series array_y
> term_no := 1;
> while (term_no <= order_diff) do # do number 1
> array_y[term_no] := array_y_init[term_no] * expt(glob_h , c(term_no - 1)) / c(factorial_1(term_no - 1));
> term_no := term_no + 1;
> od;# end do number 1;
> rows := order_diff;
> r_order := 1;
> while (r_order <= rows) do # do number 1
> term_no := 1;
> while (term_no <= (rows - r_order + 1)) do # do number 2
> it := term_no + r_order - 1;
> if (term_no < ATS_MAX_TERMS) then # if number 10
> array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 10;
> term_no := term_no + 1;
> od;# end do number 2;
> r_order := r_order + 1;
> od;# end do number 1
> ;
> current_iter := 1;
> glob_clock_start_sec := elapsed_time_seconds();
> glob_clock_sec := elapsed_time_seconds();
> glob_iter := 0;
> omniout_str(DEBUGL," ");
> glob_reached_optimal_h := true;
> glob_optimal_clock_start_sec := elapsed_time_seconds();
> while ((glob_iter < glob_max_iter) and (glob_check_sign * array_x[1] < glob_check_sign * x_end ) and (((glob_clock_sec) - (glob_orig_start_sec)) < (glob_max_sec))) do # do number 1
> #left paren 0001C
> if (reached_interval()) then # if number 10
> omniout_str(INFO," ");
> omniout_str(INFO,"TOP MAIN SOLVE Loop");
> fi;# end if 10;
> glob_iter := glob_iter + 1;
> glob_clock_sec := elapsed_time_seconds();
> track_estimated_error();
> atomall();
> track_estimated_error();
> display_alot(current_iter);
> if (glob_look_poles) then # if number 10
> check_for_pole();
> fi;# end if 10;
> if (reached_interval()) then # if number 10
> glob_next_display := glob_next_display + glob_display_interval;
> fi;# end if 10;
> array_x[1] := array_x[1] + glob_h;
> array_x[2] := glob_h;
> #Jump Series array_y;
> order_diff := 2;
> #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 := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y_higher_work[2,iii] := array_y_higher[2,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1));
> iii := iii - 1;
> od;# end do number 2;
> #AFTER ADJUST SUBSERIES EQ =1
> #BEFORE SUM SUBSERIES EQ =1
> temp_sum := glob__0;
> ord := 2;
> calc_term := 1;
> #sum_subseriesarray_y
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =1
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 1;
> calc_term := 2;
> #adjust_subseriesarray_y
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1));
> iii := iii - 1;
> od;# end do number 2;
> #AFTER ADJUST SUBSERIES EQ =1
> #BEFORE SUM SUBSERIES EQ =1
> temp_sum := glob__0;
> ord := 1;
> calc_term := 2;
> #sum_subseriesarray_y
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =1
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 1;
> calc_term := 1;
> #adjust_subseriesarray_y
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1));
> iii := iii - 1;
> od;# end do number 2;
> #AFTER ADJUST SUBSERIES EQ =1
> #BEFORE SUM SUBSERIES EQ =1
> temp_sum := glob__0;
> ord := 1;
> calc_term := 1;
> #sum_subseriesarray_y
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(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 := ATS_MAX_TERMS;
> while (term_no >= 1) do # do number 2
> array_y[term_no] := array_y_higher_work2[1,term_no];
> ord := 1;
> while (ord <= order_diff) do # do number 3
> array_y_higher[ord,term_no] := array_y_higher_work2[ord,term_no];
> ord := ord + 1;
> od;# end do number 3;
> term_no := term_no - 1;
> od;# end do number 2;
> #END PART 2 HEVE MOVED TERMS to REGULAR Array
> ;
> od;# end do number 1;#right paren 0001C
> omniout_str(ALWAYS,"Finished!");
> if (glob_iter >= glob_max_iter) then # if number 10
> omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!");
> fi;# end if 10;
> if (elapsed_time_seconds() - (glob_orig_start_sec) >= (glob_max_sec )) then # if number 10
> omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!");
> fi;# end if 10;
> glob_clock_sec := elapsed_time_seconds();
> omniout_str(INFO,"diff ( y , x , 1 ) = sin ( x ) ; ");
> omniout_int(INFO,"Iterations ",32,glob_iter,4," ")
> ;
> prog_report(x_start,x_end);
> if (glob_html_log) then # if number 10
> logstart(html_log_file);
> logitem_str(html_log_file,"2015-05-19T21:31:33-05:00")
> ;
> logitem_str(html_log_file,"Maple")
> ;
> logitem_str(html_log_file,"sin")
> ;
> logitem_str(html_log_file,"diff ( y , x , 1 ) = sin ( x ) ; ")
> ;
> logitem_float(html_log_file,x_start)
> ;
> logitem_float(html_log_file,x_end)
> ;
> logitem_float(html_log_file,array_x[1])
> ;
> logitem_float(html_log_file,glob_h)
> ;
> logitem_h_reason(html_log_file)
> ;
> logitem_integer(html_log_file,Digits)
> ;
> ;
> logitem_float(html_log_file,glob_desired_digits_correct)
> ;
> if (array_est_digits[1] <> -16) then # if number 11
> logitem_integer(html_log_file,array_est_digits[1])
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 11;
> if (glob_min_good_digits <> -16) then # if number 11
> logitem_integer(html_log_file,glob_min_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 11;
> if (glob_good_digits <> -16) then # if number 11
> logitem_integer(html_log_file,glob_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 11;
> logitem_str(html_log_file,"NA")
> ;
> logitem_str(html_log_file,"NA")
> ;
> logitem_integer(html_log_file,ATS_MAX_TERMS)
> ;
> if (glob_type_given_pole = 0) then # if number 11
> logitem_str(html_log_file,"Not Given")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 4) then # if number 12
> logitem_str(html_log_file,"No Solution")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 5) then # if number 13
> logitem_str(html_log_file,"Some Pole")
> ;
> logitem_str(html_log_file,"????")
> ;
> elif
> (glob_type_given_pole = 3) then # if number 14
> logitem_str(html_log_file,"No Pole")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 1) then # if number 15
> logitem_str(html_log_file,"Real Sing")
> ;
> logitem_float(html_log_file,glob_least_given_sing)
> ;
> elif
> (glob_type_given_pole = 2) then # if number 16
> logitem_str(html_log_file,"Complex Sing")
> ;
> logitem_float(html_log_file,glob_least_given_sing)
> ;
> fi;# end if 16;
> if (glob_least_ratio_sing < glob_large_float) then # if number 16
> logitem_float(html_log_file,glob_least_ratio_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 16;
> if (glob_least_3_sing < glob_large_float) then # if number 16
> logitem_float(html_log_file,glob_least_3_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 16;
> if (glob_least_6_sing < glob_large_float) then # if number 16
> logitem_float(html_log_file,glob_least_6_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 16;
> logitem_integer(html_log_file,glob_iter)
> ;
> logitem_time(html_log_file,(glob_clock_sec))
> ;
> if (c(glob_percent_done) < glob__100) then # if number 16
> logitem_time(html_log_file,(glob_total_exp_sec))
> ;
> 0;
> else
> logitem_str(html_log_file,"Done")
> ;
> 0;
> fi;# end if 16;
> log_revs(html_log_file," 308.maple.seems.ok | ")
> ;
> logitem_str(html_log_file,"sin diffeq.mxt")
> ;
> logitem_str(html_log_file,"sin maple results")
> ;
> logitem_str(html_log_file,"OK")
> ;
> logend(html_log_file)
> ;
> ;
> fi;# end if 15;
> if (glob_html_log) then # if number 15
> fclose(html_log_file);
> fi;# end if 15
> ;
> ;;
> fi;# end if 14
> #END OUTFILEMAIN
> end;
main := proc()
local d1, d2, d3, d4, est_err_2, niii, done_once, max_terms, display_max,
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,
last_min_pole_est, opt_iter, tmp, subiter, est_needed_step_err,
estimated_step_error, min_value, est_answer, found_h, repeat_it;
global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole,
glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test,
glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED,
glob__small, glob_small_float, glob_smallish_float, glob_large_float,
glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3,
glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5,
glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign,
glob_desired_digits_correct, glob_max_estimated_step_error,
glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec,
glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1,
glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h,
glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm,
glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save,
glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing,
glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing,
glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval,
glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err,
glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec,
glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit,
glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes,
glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log,
glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits,
glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug,
glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute,
glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour,
glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass,
glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done,
glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form,
glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2,
glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init,
array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error,
array_est_rel_error, array_max_est_error, array_type_pole,
array_type_real_pole, array_type_complex_pole, array_est_digits, array_y,
array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_m1,
array_y_higher, array_y_higher_work, array_y_higher_work2,
array_y_set_initial, array_given_rad_poles, array_given_ord_poles,
array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS,
glob_last;
ATS_MAX_TERMS := 100;
Digits := 100;
max_terms := 100;
glob_html_log := true;
array_y_init := Array(0 .. 100, []);
array_norms := Array(0 .. 100, []);
array_fact_1 := Array(0 .. 100, []);
array_1st_rel_error := Array(0 .. 2, []);
array_last_rel_error := Array(0 .. 2, []);
array_est_rel_error := Array(0 .. 2, []);
array_max_est_error := Array(0 .. 2, []);
array_type_pole := Array(0 .. 2, []);
array_type_real_pole := Array(0 .. 2, []);
array_type_complex_pole := Array(0 .. 2, []);
array_est_digits := Array(0 .. 2, []);
array_y := Array(0 .. 100, []);
array_x := Array(0 .. 100, []);
array_tmp0 := Array(0 .. 100, []);
array_tmp1_g := Array(0 .. 100, []);
array_tmp1 := Array(0 .. 100, []);
array_tmp2 := Array(0 .. 100, []);
array_m1 := Array(0 .. 100, []);
array_y_higher := Array(0 .. 2, 0 .. 101, []);
array_y_higher_work := Array(0 .. 2, 0 .. 101, []);
array_y_higher_work2 := Array(0 .. 2, 0 .. 101, []);
array_y_set_initial := Array(0 .. 2, 0 .. 101, []);
array_given_rad_poles := Array(0 .. 2, 0 .. 4, []);
array_given_ord_poles := Array(0 .. 2, 0 .. 4, []);
array_rad_test_poles := Array(0 .. 2, 0 .. 5, []);
array_ord_test_poles := Array(0 .. 2, 0 .. 5, []);
array_fact_2 := Array(0 .. 100, 0 .. 101, []);
term := 1;
while term <= 100 do array_y_init[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 100 do array_norms[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 100 do array_fact_1[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 2 do array_1st_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 2 do
array_last_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 2 do array_est_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 2 do array_max_est_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 2 do array_type_pole[term] := 0; term := term + 1 end do;
term := 1;
while term <= 2 do array_type_real_pole[term] := 0; term := term + 1
end do;
term := 1;
while term <= 2 do array_type_complex_pole[term] := 0; term := term + 1
end do;
term := 1;
while term <= 2 do array_est_digits[term] := 0; term := term + 1 end do
;
term := 1;
while term <= 100 do array_y[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 100 do array_x[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 100 do array_tmp0[term] := c(0.); term := term + 1 end do
;
term := 1;
while term <= 100 do array_tmp1_g[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 100 do array_tmp1[term] := c(0.); term := term + 1 end do
;
term := 1;
while term <= 100 do array_tmp2[term] := c(0.); term := term + 1 end do
;
term := 1;
while term <= 100 do array_m1[term] := c(0.); term := term + 1 end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 100 do
array_y_higher[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 100 do
array_y_higher_work[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 100 do
array_y_higher_work2[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 100 do
array_y_set_initial[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 3 do
array_given_rad_poles[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 3 do
array_given_ord_poles[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 4 do
array_rad_test_poles[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 4 do
array_ord_test_poles[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 100 do
term := 1;
while term <= 100 do
array_fact_2[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
zero_ats_ar(array_y);
zero_ats_ar(array_x);
zero_ats_ar(array_tmp0);
zero_ats_ar(array_tmp1_g);
zero_ats_ar(array_tmp1);
zero_ats_ar(array_tmp2);
zero_ats_ar(array_m1);
zero_ats_ar(array_const_1);
array_const_1[1] := c(1);
zero_ats_ar(array_const_0D0);
array_const_0D0[1] := c(0.);
zero_ats_ar(array_m1);
array_m1[1] := glob__m1;
iiif := 0;
while iiif <= ATS_MAX_TERMS do
jjjf := 0;
while jjjf <= ATS_MAX_TERMS do
array_fact_1[iiif] := 0;
array_fact_2[iiif, jjjf] := 0;
jjjf := jjjf + 1
end do;
iiif := iiif + 1
end do;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
glob_iolevel := 5;
glob_yes_pole := 4;
glob_no_pole := 3;
glob_not_given := 0;
glob_no_sing_tests := 4;
glob_ratio_test := 1;
glob_three_term_test := 2;
glob_six_term_test := 3;
glob_log_10 := log(c(10.0));
MAX_UNCHANGED := 10;
glob__small := c(0.1*10^(-50));
glob_small_float := c(0.1*10^(-50));
glob_smallish_float := c(0.1*10^(-60));
glob_large_float := c(0.10*10^101);
glob_larger_float := c(0.11*10^101);
glob__m2 := c(-2);
glob__m1 := c(-1);
glob__0 := c(0);
glob__1 := c(1);
glob__2 := c(2);
glob__3 := c(3);
glob__4 := c(4);
glob__5 := c(5);
glob__8 := c(8);
glob__10 := c(10);
glob__100 := c(100);
glob__pi := c(0.);
glob__0_5 := c(0.5);
glob__0_8 := c(0.8);
glob__m0_8 := c(-0.8);
glob__0_25 := c(0.25);
glob__0_125 := c(0.125);
glob_prec := c(0.10*10^(-15));
glob_check_sign := c(1.0);
glob_desired_digits_correct := c(8.0);
glob_max_estimated_step_error := c(0.);
glob_ratio_of_radius := c(0.1);
glob_percent_done := c(0.);
glob_total_exp_sec := c(0.1);
glob_optimal_expect_sec := c(0.1);
glob_estimated_size_answer := c(100.0);
glob_almost_1 := c(0.9990);
glob_clock_sec := c(0.);
glob_clock_start_sec := c(0.);
glob_disp_incr := c(0.1);
glob_h := c(0.1);
glob_diff_rc_fm := c(0.1);
glob_diff_rc_fmm1 := c(0.1);
glob_diff_rc_fmm2 := c(0.1);
glob_diff_ord_fm := c(0.1);
glob_diff_ord_fmm1 := c(0.1);
glob_diff_ord_fmm2 := c(0.1);
glob_six_term_ord_save := c(0.1);
glob_guess_error_rc := c(0.1);
glob_guess_error_ord := c(0.1);
glob_least_given_sing := c(0.99*10^201);
glob_least_ratio_sing := c(0.99*10^201);
glob_least_3_sing := c(0.99*10^101);
glob_least_6_sing := c(0.99*10^101);
glob_last_good_h := c(0.1);
glob_max_h := c(0.1);
glob_min_h := c(0.1*10^(-5));
glob_display_interval := c(0.1);
glob_abserr := c(0.1*10^(-10));
glob_relerr := c(0.1*10^(-10));
glob_min_pole_est := c(0.1*10^10);
glob_max_rel_trunc_err := c(0.1*10^(-10));
glob_max_trunc_err := c(0.1*10^(-10));
glob_max_hours := c(0.);
glob_optimal_clock_start_sec := c(0.);
glob_optimal_start := c(0.);
glob_upper_ratio_limit := c(1.0001);
glob_lower_ratio_limit := c(0.9999);
glob_max_sec := c(10000.0);
glob_orig_start_sec := c(0.);
glob_normmax := c(0.);
glob_max_minutes := c(0.);
glob_next_display := c(0.);
glob_est_digits := 1;
glob_subiter_method := 3;
glob_html_log := true;
glob_min_good_digits := 99999;
glob_good_digits := 0;
glob_min_apfp_est_good_digits := 99999;
glob_apfp_est_good_digits := 0;
glob_max_opt_iter := 10;
glob_dump := false;
glob_djd_debug := true;
glob_display_flag := true;
glob_djd_debug2 := true;
glob_h_reason := 0;
glob_sec_in_minute := 60;
glob_min_in_hour := 60;
glob_hours_in_day := 24;
glob_days_in_year := 365;
glob_sec_in_hour := 3600;
glob_sec_in_day := 86400;
glob_sec_in_year := 31536000;
glob_not_yet_finished := true;
glob_initial_pass := true;
glob_not_yet_start_msg := true;
glob_reached_optimal_h := false;
glob_optimal_done := false;
glob_type_given_pole := 0;
glob_optimize := false;
glob_look_poles := false;
glob_dump_closed_form := false;
glob_max_iter := 1000;
glob_no_eqs := 0;
glob_unchanged_h_cnt := 0;
glob_warned := false;
glob_warned2 := false;
glob_start := 0;
glob_iter := 0;
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;
array_y_set_initial[1, 31] := false;
array_y_set_initial[1, 32] := false;
array_y_set_initial[1, 33] := false;
array_y_set_initial[1, 34] := false;
array_y_set_initial[1, 35] := false;
array_y_set_initial[1, 36] := false;
array_y_set_initial[1, 37] := false;
array_y_set_initial[1, 38] := false;
array_y_set_initial[1, 39] := false;
array_y_set_initial[1, 40] := false;
array_y_set_initial[1, 41] := false;
array_y_set_initial[1, 42] := false;
array_y_set_initial[1, 43] := false;
array_y_set_initial[1, 44] := false;
array_y_set_initial[1, 45] := false;
array_y_set_initial[1, 46] := false;
array_y_set_initial[1, 47] := false;
array_y_set_initial[1, 48] := false;
array_y_set_initial[1, 49] := false;
array_y_set_initial[1, 50] := false;
array_y_set_initial[1, 51] := false;
array_y_set_initial[1, 52] := false;
array_y_set_initial[1, 53] := false;
array_y_set_initial[1, 54] := false;
array_y_set_initial[1, 55] := false;
array_y_set_initial[1, 56] := false;
array_y_set_initial[1, 57] := false;
array_y_set_initial[1, 58] := false;
array_y_set_initial[1, 59] := false;
array_y_set_initial[1, 60] := false;
array_y_set_initial[1, 61] := false;
array_y_set_initial[1, 62] := false;
array_y_set_initial[1, 63] := false;
array_y_set_initial[1, 64] := false;
array_y_set_initial[1, 65] := false;
array_y_set_initial[1, 66] := false;
array_y_set_initial[1, 67] := false;
array_y_set_initial[1, 68] := false;
array_y_set_initial[1, 69] := false;
array_y_set_initial[1, 70] := false;
array_y_set_initial[1, 71] := false;
array_y_set_initial[1, 72] := false;
array_y_set_initial[1, 73] := false;
array_y_set_initial[1, 74] := false;
array_y_set_initial[1, 75] := false;
array_y_set_initial[1, 76] := false;
array_y_set_initial[1, 77] := false;
array_y_set_initial[1, 78] := false;
array_y_set_initial[1, 79] := false;
array_y_set_initial[1, 80] := false;
array_y_set_initial[1, 81] := false;
array_y_set_initial[1, 82] := false;
array_y_set_initial[1, 83] := false;
array_y_set_initial[1, 84] := false;
array_y_set_initial[1, 85] := false;
array_y_set_initial[1, 86] := false;
array_y_set_initial[1, 87] := false;
array_y_set_initial[1, 88] := false;
array_y_set_initial[1, 89] := false;
array_y_set_initial[1, 90] := false;
array_y_set_initial[1, 91] := false;
array_y_set_initial[1, 92] := false;
array_y_set_initial[1, 93] := false;
array_y_set_initial[1, 94] := false;
array_y_set_initial[1, 95] := false;
array_y_set_initial[1, 96] := false;
array_y_set_initial[1, 97] := false;
array_y_set_initial[1, 98] := false;
array_y_set_initial[1, 99] := false;
array_y_set_initial[1, 100] := false;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
ATS_MAX_TERMS := 100;
glob_iolevel := INFO;
glob_orig_start_sec := elapsed_time_seconds();
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/sinpostode.ode#################");
omniout_str(ALWAYS, "diff ( y , x , 1 ) = sin ( x ) ; ")
;
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "Digits:=100;");
omniout_str(ALWAYS, "max_terms:=100;");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "x_start := c(0.0);");
omniout_str(ALWAYS, "x_end := c(1.0);");
omniout_str(ALWAYS, "array_y_init[0 + 1] := exact_soln_y(x_start);");
omniout_str(ALWAYS, "glob_look_poles := false;");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "glob_type_given_pole := 3;");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "#END SECOND INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN OVERRIDE BLOCK");
omniout_str(ALWAYS, "glob_desired_digits_correct:=8;");
omniout_str(ALWAYS, "glob_max_minutes:=(3.0);");
omniout_str(ALWAYS, "glob_subiter_method:=3;");
omniout_str(ALWAYS, "glob_max_iter:=100000;");
omniout_str(ALWAYS, "glob_upper_ratio_limit:=c(1.0000001);");
omniout_str(ALWAYS, "glob_lower_ratio_limit:=c(0.9999999);");
omniout_str(ALWAYS, "glob_look_poles:=true;");
omniout_str(ALWAYS, "glob_h:=c(0.001);");
omniout_str(ALWAYS, "glob_display_interval:=c(0.01);");
omniout_str(ALWAYS, "#END OVERRIDE BLOCK");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN USER DEF BLOCK");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "exact_soln_y := proc(x)");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "return(c(2.0) - cos(c(x)));");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "end;");
omniout_str(ALWAYS, "#END USER DEF BLOCK");
omniout_str(ALWAYS, "#######END OF ECHO OF PROBLEM#################");
glob_unchanged_h_cnt := 0;
glob_warned := false;
glob_warned2 := false;
glob_small_float := glob__0;
glob_smallish_float := glob__0;
glob_large_float := c(0.10*10^101);
glob_larger_float := c(0.11*10^101);
glob_almost_1 := c(0.99);
x_start := c(0.);
x_end := c(1.0);
array_y_init[1] := exact_soln_y(x_start);
glob_look_poles := false;
glob_type_given_pole := 3;
glob_desired_digits_correct := 8;
glob_max_minutes := 3.0;
glob_subiter_method := 3;
glob_max_iter := 100000;
glob_upper_ratio_limit := c(1.0000001);
glob_lower_ratio_limit := c(0.9999999);
glob_look_poles := true;
glob_h := c(0.001);
glob_display_interval := c(0.01);
glob_last_good_h := glob_h;
glob_max_sec := 60.0*glob_max_minutes + 3600.0*glob_max_hours;
glob_check_sign := c(my_check_sign(x_start, x_end));
glob__pi := arccos(glob__m1);
glob_prec = expt(10.0, c(-Digits));
if glob_optimize then
omniout_str(ALWAYS, "START of Optimize");
found_h := false;
glob_min_pole_est := glob_larger_float;
last_min_pole_est := glob_larger_float;
glob_least_given_sing := glob_larger_float;
glob_least_ratio_sing := glob_larger_float;
glob_least_3_sing := glob_larger_float;
glob_least_6_sing := glob_larger_float;
glob_min_h := float_abs(glob_min_h)*glob_check_sign;
glob_max_h := float_abs(glob_max_h)*glob_check_sign;
glob_h := float_abs(glob_min_h)*glob_check_sign;
glob_display_interval :=
c(float_abs(c(glob_display_interval))*glob_check_sign);
display_max := c(x_end) - c(x_start)/glob__10;
if display_max < glob_display_interval then
glob_display_interval := c(display_max)
end if;
chk_data();
min_value := glob_larger_float;
est_answer := est_size_answer();
opt_iter := 1;
est_needed_step_err :=
estimated_needed_step_error(x_start, x_end, glob_h, est_answer)
;
omniout_float(ALWAYS, "est_needed_step_err", 32,
est_needed_step_err, 16, "");
estimated_step_error := glob_small_float;
while opt_iter <= 100 and not found_h do
omniout_int(ALWAYS, "opt_iter", 32, opt_iter, 4, "");
array_x[1] := c(x_start);
array_x[2] := c(glob_h);
glob_next_display := c(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, c(term_no - 1))/
c(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;
if term_no < ATS_MAX_TERMS then
array_y_higher[r_order, term_no] :=
array_y_init[it]*expt(glob_h, c(term_no - 1))/
c(factorial_1(term_no - 1))
end if;
term_no := term_no + 1
end do;
r_order := r_order + 1
end do;
atomall();
if glob_check_sign*glob_h <= glob_check_sign*glob_min_h then
omniout_str(ALWAYS, "SETTING H FOR MIN H");
glob_h := float_abs(glob_min_h)*glob_check_sign;
glob_h_reason := 1;
found_h := true
end if;
if
glob_check_sign*glob_display_interval <= glob_check_sign*glob_h
then
omniout_str(ALWAYS, "SETTING H FOR DISPLAY INTERVAL");
glob_h_reason := 2;
glob_h := glob_display_interval;
found_h := true
end if;
if glob_look_poles then check_for_pole() end if;
if not found_h then
est_answer := est_size_answer();
est_needed_step_err := estimated_needed_step_error(x_start,
x_end, glob_h, est_answer);
omniout_float(ALWAYS, "est_needed_step_err", 32,
est_needed_step_err, 16, "");
estimated_step_error := test_suggested_h();
omniout_float(ALWAYS, "estimated_step_error", 32,
estimated_step_error, 32, "");
if estimated_step_error < est_needed_step_err then
omniout_str(ALWAYS, "Double H and LOOP");
glob_h := glob_h*glob__2
else
omniout_str(ALWAYS, "Found H for OPTIMAL");
found_h := true;
glob_h_reason := 3;
glob_h := glob_h/glob__2
end if
end if;
opt_iter := opt_iter + 1
end do;
if not found_h and opt_iter = 1 then
omniout_str(ALWAYS, "Beginning glob_h too large.");
found_h := false
end if;
if glob_check_sign*glob_max_h <= glob_check_sign*glob_h then
omniout_str(ALWAYS, "SETTING H FOR MAX H");
glob_h := float_abs(glob_max_h)*glob_check_sign;
glob_h_reason := 1;
found_h := true
end if
else found_h := true; glob_h := glob_check_sign*glob_h
end if;
if glob_html_log then html_log_file := fopen("entry.html", WRITE, TEXT)
end if;
if found_h then
omniout_str(ALWAYS, "START of Soultion");
array_x[1] := c(x_start);
array_x[2] := c(glob_h);
glob_next_display := c(x_start);
glob_min_pole_est := glob_larger_float;
glob_least_given_sing := glob_larger_float;
glob_least_ratio_sing := glob_larger_float;
glob_least_3_sing := glob_larger_float;
glob_least_6_sing := glob_larger_float;
order_diff := 1;
term_no := 1;
while term_no <= order_diff do
array_y[term_no] := array_y_init[term_no]*
expt(glob_h, c(term_no - 1))/c(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;
if term_no < ATS_MAX_TERMS then
array_y_higher[r_order, term_no] := array_y_init[it]*
expt(glob_h, c(term_no - 1))/
c(factorial_1(term_no - 1))
end if;
term_no := term_no + 1
end do;
r_order := r_order + 1
end do;
current_iter := 1;
glob_clock_start_sec := elapsed_time_seconds();
glob_clock_sec := elapsed_time_seconds();
glob_iter := 0;
omniout_str(DEBUGL, " ");
glob_reached_optimal_h := true;
glob_optimal_clock_start_sec := elapsed_time_seconds();
while glob_iter < glob_max_iter and
glob_check_sign*array_x[1] < glob_check_sign*x_end and
glob_clock_sec - glob_orig_start_sec < 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();
track_estimated_error();
atomall();
track_estimated_error();
display_alot(current_iter);
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 := 2;
ord := 2;
calc_term := 1;
iii := ATS_MAX_TERMS;
while calc_term <= iii do
array_y_higher_work[2, iii] := array_y_higher[2, iii]/(
expt(glob_h, c(calc_term - 1))*
c(factorial_3(iii - calc_term, iii - 1)));
iii := iii - 1
end do;
temp_sum := glob__0;
ord := 2;
calc_term := 1;
iii := ATS_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, c(calc_term - 1))/
c(factorial_1(calc_term - 1));
ord := 1;
calc_term := 2;
iii := ATS_MAX_TERMS;
while calc_term <= iii do
array_y_higher_work[1, iii] := array_y_higher[1, iii]/(
expt(glob_h, c(calc_term - 1))*
c(factorial_3(iii - calc_term, iii - 1)));
iii := iii - 1
end do;
temp_sum := glob__0;
ord := 1;
calc_term := 2;
iii := ATS_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, c(calc_term - 1))/
c(factorial_1(calc_term - 1));
ord := 1;
calc_term := 1;
iii := ATS_MAX_TERMS;
while calc_term <= iii do
array_y_higher_work[1, iii] := array_y_higher[1, iii]/(
expt(glob_h, c(calc_term - 1))*
c(factorial_3(iii - calc_term, iii - 1)));
iii := iii - 1
end do;
temp_sum := glob__0;
ord := 1;
calc_term := 1;
iii := ATS_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, c(calc_term - 1))/
c(factorial_1(calc_term - 1));
term_no := ATS_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
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 glob_max_sec <= elapsed_time_seconds() - 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 ) = sin ( x ) ; ");
omniout_int(INFO, "Iterations ", 32, glob_iter,
4, " ");
prog_report(x_start, x_end);
if glob_html_log then
logstart(html_log_file);
logitem_str(html_log_file, "2015-05-19T21:31:33-05:00");
logitem_str(html_log_file, "Maple");
logitem_str(html_log_file, "sin");
logitem_str(html_log_file,
"diff ( y , x , 1 ) = sin ( x ) ; ");
logitem_float(html_log_file, x_start);
logitem_float(html_log_file, x_end);
logitem_float(html_log_file, array_x[1]);
logitem_float(html_log_file, glob_h);
logitem_h_reason(html_log_file);
logitem_integer(html_log_file, Digits);
logitem_float(html_log_file, glob_desired_digits_correct);
if array_est_digits[1] <> -16 then
logitem_integer(html_log_file, array_est_digits[1])
else logitem_str(html_log_file, "Unknown")
end if;
if glob_min_good_digits <> -16 then
logitem_integer(html_log_file, glob_min_good_digits)
else logitem_str(html_log_file, "Unknown")
end if;
if glob_good_digits <> -16 then
logitem_integer(html_log_file, glob_good_digits)
else logitem_str(html_log_file, "Unknown")
end if;
logitem_str(html_log_file, "NA");
logitem_str(html_log_file, "NA");
logitem_integer(html_log_file, ATS_MAX_TERMS);
if glob_type_given_pole = 0 then
logitem_str(html_log_file, "Not Given");
logitem_str(html_log_file, "NA")
elif glob_type_given_pole = 4 then
logitem_str(html_log_file, "No Solution");
logitem_str(html_log_file, "NA")
elif glob_type_given_pole = 5 then
logitem_str(html_log_file, "Some Pole");
logitem_str(html_log_file, "????")
elif glob_type_given_pole = 3 then
logitem_str(html_log_file, "No Pole");
logitem_str(html_log_file, "NA")
elif glob_type_given_pole = 1 then
logitem_str(html_log_file, "Real Sing");
logitem_float(html_log_file, glob_least_given_sing)
elif glob_type_given_pole = 2 then
logitem_str(html_log_file, "Complex Sing");
logitem_float(html_log_file, glob_least_given_sing)
end if;
if glob_least_ratio_sing < glob_large_float then
logitem_float(html_log_file, glob_least_ratio_sing)
else logitem_str(html_log_file, "NONE")
end if;
if glob_least_3_sing < glob_large_float then
logitem_float(html_log_file, glob_least_3_sing)
else logitem_str(html_log_file, "NONE")
end if;
if glob_least_6_sing < glob_large_float then
logitem_float(html_log_file, glob_least_6_sing)
else logitem_str(html_log_file, "NONE")
end if;
logitem_integer(html_log_file, glob_iter);
logitem_time(html_log_file, glob_clock_sec);
if c(glob_percent_done) < glob__100 then
logitem_time(html_log_file, glob_total_exp_sec); 0
else logitem_str(html_log_file, "Done"); 0
end if;
log_revs(html_log_file, " 308.maple.seems.ok | ");
logitem_str(html_log_file,
"sin diffeq.mxt");
logitem_str(html_log_file,
"sin maple results");
logitem_str(html_log_file, "OK");
logend(html_log_file)
end if;
if glob_html_log then fclose(html_log_file) end if
end if
end proc
# End Function number 12
> main();
memory used=3.6MB, alloc=40.3MB, time=0.09
##############ECHO OF PROBLEM#################
##############temp/sinpostode.ode#################
diff ( y , x , 1 ) = sin ( x ) ;
!
#BEGIN FIRST INPUT BLOCK
Digits:=100;
max_terms:=100;
!
#END FIRST INPUT BLOCK
#BEGIN SECOND INPUT BLOCK
x_start := c(0.0);
x_end := c(1.0);
array_y_init[0 + 1] := exact_soln_y(x_start);
glob_look_poles := false;
glob_type_given_pole := 3;
#END SECOND INPUT BLOCK
#BEGIN OVERRIDE BLOCK
glob_desired_digits_correct:=8;
glob_max_minutes:=(3.0);
glob_subiter_method:=3;
glob_max_iter:=100000;
glob_upper_ratio_limit:=c(1.0000001);
glob_lower_ratio_limit:=c(0.9999999);
glob_look_poles:=true;
glob_h:=c(0.001);
glob_display_interval:=c(0.01);
#END OVERRIDE BLOCK
!
#BEGIN USER DEF BLOCK
exact_soln_y := proc(x)
return(c(2.0) - cos(c(x)));
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
TOP MAIN SOLVE Loop
x[1] = 0
y[1] (closed_form) = 1
y[1] (numeric) = 1
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 100
h = 0.001
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
NO REAL POLE (three term test) for Equation 1
NO COMPLEX POLE (six term test) for Equation 1
SETTING H FOR POLE
memory used=45.0MB, alloc=44.3MB, time=0.50
memory used=86.1MB, alloc=44.3MB, time=0.86
TOP MAIN SOLVE Loop
x[1] = 0.0099999940000011999998857142920635
y[1] (closed_form) = 1.0000499995233357522136337445359
y[1] (numeric) = 1.0000499995233357522136337445359
absolute error = 1e-99
relative error = 9.9995000297649159141319340294462e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.009999
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=127.1MB, alloc=44.3MB, time=1.22
memory used=168.2MB, alloc=44.3MB, time=1.59
memory used=209.4MB, alloc=44.3MB, time=1.95
TOP MAIN SOLVE Loop
x[1] = 0.019999987333335866666425396838801
y[1] (closed_form) = 1.0001999930801059076745157721168
y[1] (numeric) = 1.0001999930801059076745157721168
absolute error = 1e-99
relative error = 9.9980004690912861239074294346793e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.01999
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=250.7MB, alloc=44.3MB, time=2.33
memory used=292.0MB, alloc=44.3MB, time=2.69
memory used=333.2MB, alloc=44.3MB, time=3.06
TOP MAIN SOLVE Loop
x[1] = 0.029999980666670533332965079385538
y[1] (closed_form) = 1.0004499656710997826002354327863
y[1] (numeric) = 1.0004499656710997826002354327863
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.02998
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=374.4MB, alloc=44.3MB, time=3.44
memory used=415.6MB, alloc=44.3MB, time=3.80
memory used=456.8MB, alloc=44.3MB, time=4.17
TOP MAIN SOLVE Loop
x[1] = 0.039999974000005199999504761932275
y[1] (closed_form) = 1.0007998922992999165069601390862
y[1] (numeric) = 1.0007998922992999165069601390862
absolute error = 1e-99
relative error = 9.9920074701700637258273983949607e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.03996
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=498.0MB, alloc=44.3MB, time=4.55
memory used=539.1MB, alloc=44.3MB, time=4.91
TOP MAIN SOLVE Loop
x[1] = 0.049999967333339866666044444479012
y[1] (closed_form) = 1.0012497379723817500140490996986
y[1] (numeric) = 1.0012497379723817500140490996986
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.04992
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=580.2MB, alloc=44.3MB, time=5.28
memory used=621.4MB, alloc=44.3MB, time=5.64
memory used=662.6MB, alloc=44.3MB, time=6.01
TOP MAIN SOLVE Loop
x[1] = 0.05999996066667453333258412702575
y[1] (closed_form) = 1.0017994577062128234742550921001
y[1] (numeric) = 1.0017994577062128234742550921001
absolute error = 2e-99
relative error = 1.9964075490511185094196873577568e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.05986
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=703.9MB, alloc=44.3MB, time=6.39
memory used=745.0MB, alloc=44.3MB, time=6.75
memory used=786.2MB, alloc=44.3MB, time=7.13
TOP MAIN SOLVE Loop
x[1] = 0.069999954000009199999123809572487
y[1] (closed_form) = 1.0024489965293511467352559283147
y[1] (numeric) = 1.0024489965293511467352559283147
absolute error = 1e-99
relative error = 9.9755698640247036100985451940559e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.06977
Order of pole (three term test) = 92
NO COMPLEX POLE (six term test) for Equation 1
memory used=827.5MB, alloc=44.3MB, time=7.48
memory used=868.7MB, alloc=44.3MB, time=7.86
memory used=910.0MB, alloc=44.3MB, time=8.22
TOP MAIN SOLVE Loop
x[1] = 0.079999947333343866665663492119224
y[1] (closed_form) = 1.0031982894885422901998878619116
y[1] (numeric) = 1.0031982894885422901998878619116
absolute error = 2e-99
relative error = 1.9936238139118581133808789595284e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.07966
Order of pole (three term test) = 92.01
NO COMPLEX POLE (six term test) for Equation 1
memory used=951.1MB, alloc=44.3MB, time=8.59
memory used=992.2MB, alloc=44.3MB, time=8.97
memory used=1033.4MB, alloc=44.3MB, time=9.34
TOP MAIN SOLVE Loop
x[1] = 0.089999940666678533332203174665961
y[1] (closed_form) = 1.0040472616552146474812887397204
y[1] (numeric) = 1.0040472616552146474812887397204
absolute error = 3e-99
relative error = 2.9879071579303670495345689037409e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.08951
Order of pole (three term test) = 92.01
NO COMPLEX POLE (six term test) for Equation 1
memory used=1074.7MB, alloc=44.3MB, time=9.72
memory used=1116.0MB, alloc=44.3MB, time=10.09
memory used=1157.2MB, alloc=44.3MB, time=10.47
TOP MAIN SOLVE Loop
x[1] = 0.099999934000013199998742857212698
y[1] (closed_form) = 1.0049958281329722201329641049132
y[1] (numeric) = 1.0049958281329722201329641049132
absolute error = 5e-99
relative error = 4.9751450304910558492508696342452e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.09933
Order of pole (three term test) = 92.01
NO COMPLEX POLE (six term test) for Equation 1
memory used=1198.5MB, alloc=44.3MB, time=10.88
memory used=1239.5MB, alloc=44.3MB, time=11.38
TOP MAIN SOLVE Loop
x[1] = 0.10999992733334786666528253975944
y[1] (closed_form) = 1.0060438940660841751825462320824
y[1] (numeric) = 1.0060438940660841751825462320824
absolute error = 4e-99
relative error = 3.9759696605616010273513555851060e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1091
Order of pole (three term test) = 92.01
NO COMPLEX POLE (six term test) for Equation 1
memory used=1280.8MB, alloc=44.3MB, time=11.81
memory used=1322.0MB, alloc=44.3MB, time=12.19
memory used=1363.2MB, alloc=44.3MB, time=12.56
TOP MAIN SOLVE Loop
x[1] = 0.11999992066668253333182222230617
y[1] (closed_form) = 1.0071913546489703265216992476449
y[1] (numeric) = 1.0071913546489703265216992476449
absolute error = 5e-99
relative error = 4.9642999584151678838137152056092e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1189
Order of pole (three term test) = 92.01
NO COMPLEX POLE (six term test) for Equation 1
memory used=1404.5MB, alloc=44.3MB, time=12.94
memory used=1445.7MB, alloc=44.3MB, time=13.34
memory used=1487.0MB, alloc=44.3MB, time=13.78
TOP MAIN SOLVE Loop
x[1] = 0.12999991400001719999836190485291
y[1] (closed_form) = 1.008438095136681591613200595634
y[1] (numeric) = 1.008438095136681591613200595634
absolute error = 1.1e-98
relative error = 1.0907957615890227740564273986350e-96 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1285
Order of pole (three term test) = 92.02
NO COMPLEX POLE (six term test) for Equation 1
memory used=1528.1MB, alloc=44.3MB, time=14.14
memory used=1569.3MB, alloc=44.3MB, time=14.55
memory used=1610.4MB, alloc=44.3MB, time=14.98
TOP MAIN SOLVE Loop
x[1] = 0.13999990733335186666490158739965
y[1] (closed_form) = 1.0097839908563743754796591957367
y[1] (numeric) = 1.0097839908563743754796591957367
absolute error = 1.1e-98
relative error = 1.0893418889193475133160523703241e-96 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1382
Order of pole (three term test) = 92.02
NO COMPLEX POLE (six term test) for Equation 1
memory used=1651.6MB, alloc=44.3MB, time=15.38
memory used=1692.9MB, alloc=44.3MB, time=15.80
memory used=1734.2MB, alloc=44.3MB, time=16.16
TOP MAIN SOLVE Loop
x[1] = 0.14999990066668653333144126994638
y[1] (closed_form) = 1.0112289072197777345465632680932
y[1] (numeric) = 1.0112289072197777345465632680932
absolute error = 7e-99
relative error = 6.9222704671738968383801757753226e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1478
Order of pole (three term test) = 92.02
NO COMPLEX POLE (six term test) for Equation 1
memory used=1775.5MB, alloc=44.3MB, time=16.53
memory used=1816.6MB, alloc=44.3MB, time=16.91
TOP MAIN SOLVE Loop
x[1] = 0.15999989400002119999798095249312
y[1] (closed_form) = 1.012772699736652073635325048572
y[1] (numeric) = 1.012772699736652073635325048572
absolute error = 7e-99
relative error = 6.9117186924767885086947196891945e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1573
Order of pole (three term test) = 92.03
NO COMPLEX POLE (six term test) for Equation 1
memory used=1857.9MB, alloc=44.3MB, time=17.27
memory used=1899.0MB, alloc=44.3MB, time=17.64
memory used=1940.2MB, alloc=44.3MB, time=18.00
TOP MAIN SOLVE Loop
x[1] = 0.16999988733335586666452063503986
y[1] (closed_form) = 1.0144152140292380302496330955551
y[1] (numeric) = 1.0144152140292380302496330955551
absolute error = 7e-99
relative error = 6.9005274203214406547201283276457e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1667
Order of pole (three term test) = 92.03
NO COMPLEX POLE (six term test) for Equation 1
memory used=1981.5MB, alloc=44.3MB, time=18.38
memory used=2022.6MB, alloc=44.3MB, time=18.75
memory used=2064.0MB, alloc=44.3MB, time=19.11
TOP MAIN SOLVE Loop
x[1] = 0.1799998806666905333310603175866
y[1] (closed_form) = 1.016156285847694101280650734545
y[1] (numeric) = 1.016156285847694101280650734545
absolute error = 7e-99
relative error = 6.8887041270039343860094219108056e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1761
Order of pole (three term test) = 92.03
NO COMPLEX POLE (six term test) for Equation 1
memory used=2105.3MB, alloc=44.3MB, time=19.48
memory used=2146.6MB, alloc=44.3MB, time=19.86
memory used=2188.0MB, alloc=44.3MB, time=20.22
TOP MAIN SOLVE Loop
x[1] = 0.18999987400002519999760000013333
y[1] (closed_form) = 1.0179957410865214683833130816079
y[1] (numeric) = 1.0179957410865214683833130816079
absolute error = 4e-99
relative error = 3.9292895230885176176382583570684e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1855
Order of pole (three term test) = 92.04
NO COMPLEX POLE (six term test) for Equation 1
memory used=2229.3MB, alloc=44.3MB, time=20.59
memory used=2270.6MB, alloc=44.3MB, time=20.97
memory used=2311.8MB, alloc=44.3MB, time=21.33
TOP MAIN SOLVE Loop
x[1] = 0.19999986733335986666413968268007
y[1] (closed_form) = 1.0199333958019743795570622638594
y[1] (numeric) = 1.0199333958019743795570622638594
absolute error = 8e-99
relative error = 7.8436494313529111514459675480359e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1947
Order of pole (three term test) = 92.04
NO COMPLEX POLE (six term test) for Equation 1
memory used=2353.2MB, alloc=44.3MB, time=21.70
memory used=2394.3MB, alloc=44.3MB, time=22.08
memory used=2435.6MB, alloc=44.3MB, time=22.44
TOP MAIN SOLVE Loop
x[1] = 0.20999986066669453333067936522681
y[1] (closed_form) = 1.0219690562304543459096927107067
y[1] (numeric) = 1.0219690562304543459096927107067
absolute error = 7e-99
relative error = 6.8495224560121101970097000494935e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2039
Order of pole (three term test) = 92.04
NO COMPLEX POLE (six term test) for Equation 1
memory used=2476.8MB, alloc=44.3MB, time=22.81
memory used=2518.0MB, alloc=44.3MB, time=23.19
TOP MAIN SOLVE Loop
x[1] = 0.21999985400002919999721904777354
y[1] (closed_form) = 1.0241025188078863142024110949127
y[1] (numeric) = 1.0241025188078863142024110949127
absolute error = 4e-99
relative error = 3.9058589609331572801164154307132e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.213
Order of pole (three term test) = 92.05
NO COMPLEX POLE (six term test) for Equation 1
memory used=2559.4MB, alloc=44.3MB, time=23.55
memory used=2600.7MB, alloc=44.3MB, time=23.92
memory used=2641.9MB, alloc=44.3MB, time=24.30
TOP MAIN SOLVE Loop
x[1] = 0.22999984733336386666375873032028
y[1] (closed_form) = 1.0263335701900748775775866193551
y[1] (numeric) = 1.0263335701900748775775866193551
absolute error = 1e-99
relative error = 9.7434209407649215425129411773620e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.222
Order of pole (three term test) = 92.05
NO COMPLEX POLE (six term test) for Equation 1
memory used=2683.1MB, alloc=44.3MB, time=24.66
memory used=2724.3MB, alloc=44.3MB, time=25.03
memory used=2765.5MB, alloc=44.3MB, time=25.39
TOP MAIN SOLVE Loop
x[1] = 0.23999984066669853333029841286702
y[1] (closed_form) = 1.0286619872740384888677964415954
y[1] (numeric) = 1.0286619872740384888677964415954
absolute error = 3e-99
relative error = 2.9164098966561612031273196036348e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2309
Order of pole (three term test) = 92.06
NO COMPLEX POLE (six term test) for Equation 1
memory used=2806.9MB, alloc=44.3MB, time=25.77
memory used=2848.2MB, alloc=44.3MB, time=26.14
memory used=2889.4MB, alloc=44.3MB, time=26.51
TOP MAIN SOLVE Loop
x[1] = 0.24999983400003319999683809541376
y[1] (closed_form) = 1.031087537220319543085458296391
y[1] (numeric) = 1.031087537220319543085458296391
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2397
Order of pole (three term test) = 92.06
NO COMPLEX POLE (six term test) for Equation 1
memory used=2930.7MB, alloc=44.3MB, time=26.88
memory used=2971.9MB, alloc=44.3MB, time=27.28
memory used=3013.1MB, alloc=44.3MB, time=27.67
TOP MAIN SOLVE Loop
x[1] = 0.25999982733336786666337777796049
y[1] (closed_form) = 1.0336099774762680981063676528272
y[1] (numeric) = 1.0336099774762680981063676528272
absolute error = 3e-99
relative error = 2.9024487624674468946698727717918e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2484
Order of pole (three term test) = 92.07
NO COMPLEX POLE (six term test) for Equation 1
memory used=3054.3MB, alloc=44.3MB, time=28.05
memory used=3095.6MB, alloc=44.3MB, time=28.42
TOP MAIN SOLVE Loop
x[1] = 0.26999982066670253332991746050723
y[1] (closed_form) = 1.0362290558002969051975785309381
y[1] (numeric) = 1.0362290558002969051975785309381
absolute error = 2e-99
relative error = 1.9300751979545360193344328400478e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2571
Order of pole (three term test) = 92.07
NO COMPLEX POLE (six term test) for Equation 1
memory used=3137.0MB, alloc=44.3MB, time=28.80
memory used=3178.2MB, alloc=44.3MB, time=29.20
memory used=3219.5MB, alloc=44.3MB, time=29.61
TOP MAIN SOLVE Loop
x[1] = 0.27999981400003719999645714305397
y[1] (closed_form) = 1.0389445102871053239100215962469
y[1] (numeric) = 1.0389445102871053239100215962469
absolute error = 1e-99
relative error = 9.6251531251044074474519745814403e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2656
Order of pole (three term test) = 92.08
NO COMPLEX POLE (six term test) for Equation 1
memory used=3260.8MB, alloc=44.3MB, time=30.02
memory used=3302.2MB, alloc=44.3MB, time=30.53
memory used=3343.4MB, alloc=44.3MB, time=30.94
TOP MAIN SOLVE Loop
x[1] = 0.28999980733337186666299682560071
y[1] (closed_form) = 1.0417560693938695989687532602328
y[1] (numeric) = 1.0417560693938695989687532602328
absolute error = 1e-99
relative error = 9.5991761351756294353855576130917e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.274
Order of pole (three term test) = 92.08
NO COMPLEX POLE (six term test) for Equation 1
memory used=3384.8MB, alloc=44.3MB, time=31.38
memory used=3426.1MB, alloc=44.3MB, time=31.80
memory used=3467.3MB, alloc=44.3MB, time=32.20
TOP MAIN SOLVE Loop
x[1] = 0.29999980066670653332953650814744
y[1] (closed_form) = 1.0446634519673968801584638966606
y[1] (numeric) = 1.0446634519673968801584638966606
absolute error = 1e-99
relative error = 9.5724608544188756480159044421087e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2823
Order of pole (three term test) = 92.09
NO COMPLEX POLE (six term test) for Equation 1
memory used=3508.6MB, alloc=44.3MB, time=32.61
memory used=3549.8MB, alloc=44.3MB, time=33.06
memory used=3591.0MB, alloc=44.3MB, time=33.48
TOP MAIN SOLVE Loop
x[1] = 0.30999979400004119999607619069418
y[1] (closed_form) = 1.0476663672722402698285053711416
y[1] (numeric) = 1.0476663672722402698285053711416
absolute error = 1e-99
relative error = 9.5450234085842905098504633782324e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2905
Order of pole (three term test) = 92.09
NO COMPLEX POLE (six term test) for Equation 1
memory used=3632.3MB, alloc=44.3MB, time=34.00
memory used=3673.6MB, alloc=44.3MB, time=34.44
memory used=3714.8MB, alloc=44.3MB, time=34.88
TOP MAIN SOLVE Loop
x[1] = 0.31999978733337586666261587324092
y[1] (closed_form) = 1.0507645150197720865398651178533
y[1] (numeric) = 1.0507645150197720865398651178533
absolute error = 2e-99
relative error = 1.9033760385050367676803139590698e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2986
Order of pole (three term test) = 92.1
NO COMPLEX POLE (six term test) for Equation 1
memory used=3756.0MB, alloc=44.3MB, time=35.27
memory used=3797.3MB, alloc=44.3MB, time=35.69
TOP MAIN SOLVE Loop
x[1] = 0.32999978066671053332915555578765
y[1] (closed_form) = 1.0539575853982124375558260734341
y[1] (numeric) = 1.0539575853982124375558260734341
absolute error = 1e-99
relative error = 9.4880478479802783892953941166076e-98 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3066
Order of pole (three term test) = 92.11
NO COMPLEX POLE (six term test) for Equation 1
memory used=3838.7MB, alloc=44.3MB, time=36.11
memory used=3879.9MB, alloc=44.3MB, time=36.53
memory used=3921.1MB, alloc=44.3MB, time=36.98
TOP MAIN SOLVE Loop
x[1] = 0.33999977400004519999569523833439
y[1] (closed_form) = 1.0572452591036100973480908698594
y[1] (numeric) = 1.0572452591036100973480908698594
absolute error = 1.0e-98
relative error = 9.4585432414031751302344596885492e-97 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3144
Order of pole (three term test) = 92.11
NO COMPLEX POLE (six term test) for Equation 1
memory used=3962.4MB, alloc=44.3MB, time=37.42
memory used=4003.7MB, alloc=44.3MB, time=37.86
memory used=4045.0MB, alloc=44.3MB, time=38.31
TOP MAIN SOLVE Loop
x[1] = 0.34999976733337986666223492088113
y[1] (closed_form) = 1.0606272073717725940604676993263
y[1] (numeric) = 1.0606272073717725940604676993263
absolute error = 1.5e-98
relative error = 1.4142575162832097842855703413852e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3221
Order of pole (three term test) = 92.12
NO COMPLEX POLE (six term test) for Equation 1
memory used=4086.4MB, alloc=44.3MB, time=38.81
memory used=4127.5MB, alloc=44.3MB, time=39.28
memory used=4168.7MB, alloc=44.3MB, time=39.80
TOP MAIN SOLVE Loop
x[1] = 0.35999976066671453332877460342787
y[1] (closed_form) = 1.0641030920111423109523370708884
y[1] (numeric) = 1.0641030920111423109523370708884
absolute error = 1.6e-98
relative error = 1.5036137118782531161652284188677e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3297
Order of pole (three term test) = 92.12
NO COMPLEX POLE (six term test) for Equation 1
memory used=4210.0MB, alloc=44.3MB, time=40.22
memory used=4251.1MB, alloc=44.3MB, time=40.63
memory used=4292.4MB, alloc=44.3MB, time=41.05
TOP MAIN SOLVE Loop
x[1] = 0.3699997540000491999953142859746
y[1] (closed_form) = 1.0676725654366153152435351768446
y[1] (numeric) = 1.0676725654366153152435351768446
absolute error = 2.0e-98
relative error = 1.8732334844457837798463597934960e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3371
Order of pole (three term test) = 92.13
NO COMPLEX POLE (six term test) for Equation 1
memory used=4333.7MB, alloc=44.3MB, time=41.47
memory used=4375.0MB, alloc=44.3MB, time=41.86
TOP MAIN SOLVE Loop
x[1] = 0.37999974733338386666185396852134
y[1] (closed_form) = 1.0713352707042995325104607435943
y[1] (numeric) = 1.0713352707042995325104607435943
absolute error = 2.1e-98
relative error = 1.9601706929889955898559603432074e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3445
Order of pole (three term test) = 92.14
NO COMPLEX POLE (six term test) for Equation 1
memory used=4416.4MB, alloc=44.3MB, time=42.25
memory used=4457.6MB, alloc=44.3MB, time=42.69
memory used=4498.9MB, alloc=44.3MB, time=43.20
TOP MAIN SOLVE Loop
x[1] = 0.38999974066671853332839365106808
y[1] (closed_form) = 1.0750908415472087908495651485973
y[1] (numeric) = 1.0750908415472087908495651485973
absolute error = 2.2e-98
relative error = 2.0463387045822907087689152773533e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3516
Order of pole (three term test) = 92.14
NO COMPLEX POLE (six term test) for Equation 1
memory used=4540.2MB, alloc=44.3MB, time=43.61
memory used=4581.4MB, alloc=44.3MB, time=44.03
memory used=4622.7MB, alloc=44.3MB, time=44.45
TOP MAIN SOLVE Loop
x[1] = 0.39999973400005319999493333361481
y[1] (closed_form) = 1.078938902411889165438313516108
y[1] (numeric) = 1.078938902411889165438313516108
absolute error = 2.4e-98
relative error = 2.2244076978177125452756194142941e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3587
Order of pole (three term test) = 92.15
NO COMPLEX POLE (six term test) for Equation 1
memory used=4664.0MB, alloc=44.3MB, time=44.84
memory used=4705.2MB, alloc=44.3MB, time=45.23
memory used=4746.5MB, alloc=44.3MB, time=45.63
TOP MAIN SOLVE Loop
x[1] = 0.40999972733338786666147301616155
y[1] (closed_form) = 1.0828790684959739608945659762499
y[1] (numeric) = 1.0828790684959739608945659762499
absolute error = 2.8e-98
relative error = 2.5856996237714332805946279429973e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3656
Order of pole (three term test) = 92.16
NO COMPLEX POLE (six term test) for Equation 1
memory used=4787.7MB, alloc=44.3MB, time=46.02
memory used=4829.0MB, alloc=44.3MB, time=46.45
memory used=4870.3MB, alloc=44.3MB, time=46.86
TOP MAIN SOLVE Loop
x[1] = 0.41999972066672253332801269870829
y[1] (closed_form) = 1.086910945786663575972446108472
y[1] (numeric) = 1.086910945786663575972446108472
absolute error = 3.1e-98
relative error = 2.8521195890214735163967865799555e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3723
Order of pole (three term test) = 92.17
NO COMPLEX POLE (six term test) for Equation 1
memory used=4911.6MB, alloc=44.3MB, time=47.25
memory used=4952.9MB, alloc=44.3MB, time=47.66
memory used=4994.1MB, alloc=44.3MB, time=48.08
TOP MAIN SOLVE Loop
x[1] = 0.42999971400005719999455238125503
y[1] (closed_form) = 1.0910341311001264026454239899484
y[1] (numeric) = 1.0910341311001264026454239899484
absolute error = 3.5e-98
relative error = 3.2079656357503979324017793763383e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3789
Order of pole (three term test) = 92.17
NO COMPLEX POLE (six term test) for Equation 1
memory used=5035.3MB, alloc=44.3MB, time=48.55
memory used=5076.6MB, alloc=44.3MB, time=48.98
TOP MAIN SOLVE Loop
x[1] = 0.43999970733339186666109206380176
y[1] (closed_form) = 1.0952482121218168195247928765898
y[1] (numeric) = 1.0952482121218168195247928765898
absolute error = 3.7e-98
relative error = 3.3782296643351879826363768461107e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3854
Order of pole (three term test) = 92.18
NO COMPLEX POLE (six term test) for Equation 1
memory used=5118.0MB, alloc=44.3MB, time=49.47
memory used=5159.4MB, alloc=44.3MB, time=49.94
memory used=5200.7MB, alloc=44.3MB, time=50.38
TOP MAIN SOLVE Loop
x[1] = 0.4499997006667265333276317463485
y[1] (closed_form) = 1.0995527674477062478531715248481
y[1] (numeric) = 1.0995527674477062478531715248481
absolute error = 4.2e-98
relative error = 3.8197348270507156595487345324364e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3917
Order of pole (three term test) = 92.19
NO COMPLEX POLE (six term test) for Equation 1
memory used=5242.0MB, alloc=44.3MB, time=50.83
memory used=5283.0MB, alloc=44.3MB, time=51.28
memory used=5324.3MB, alloc=44.3MB, time=51.72
TOP MAIN SOLVE Loop
x[1] = 0.45999969400006119999417142889524
y[1] (closed_form) = 1.1039473666264231470072892824559
y[1] (numeric) = 1.1039473666264231470072892824559
absolute error = 4.3e-98
relative error = 3.8951132363678386715084667082106e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3978
Order of pole (three term test) = 92.2
NO COMPLEX POLE (six term test) for Equation 1
memory used=5365.6MB, alloc=44.3MB, time=52.16
memory used=5406.9MB, alloc=44.3MB, time=52.59
memory used=5448.0MB, alloc=44.3MB, time=53.03
TOP MAIN SOLVE Loop
x[1] = 0.46999968733339586666071111144198
y[1] (closed_form) = 1.1084315702022977355512387848802
y[1] (numeric) = 1.1084315702022977355512387848802
absolute error = 3.5e-98
relative error = 3.1576148623782175958755397838049e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4038
Order of pole (three term test) = 92.21
NO COMPLEX POLE (six term test) for Equation 1
memory used=5489.4MB, alloc=44.3MB, time=53.44
memory used=5530.7MB, alloc=44.3MB, time=53.89
memory used=5572.0MB, alloc=44.3MB, time=54.30
TOP MAIN SOLVE Loop
x[1] = 0.47999968066673053332725079398871
y[1] (closed_form) = 1.1130049297593071334097006109577
y[1] (numeric) = 1.1130049297593071334097006109577
absolute error = 3.3e-98
relative error = 2.9649464362333430607748481903946e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4096
Order of pole (three term test) = 92.21
NO COMPLEX POLE (six term test) for Equation 1
memory used=5613.2MB, alloc=44.3MB, time=54.70
memory used=5654.5MB, alloc=44.3MB, time=55.19
TOP MAIN SOLVE Loop
x[1] = 0.48999967400006519999379047653545
y[1] (closed_form) = 1.1176669879659165306894026564954
y[1] (numeric) = 1.1176669879659165306894026564954
absolute error = 3.6e-98
relative error = 3.2209951969251351735763884721764e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4152
Order of pole (three term test) = 92.22
NO COMPLEX POLE (six term test) for Equation 1
memory used=5695.8MB, alloc=44.3MB, time=55.58
memory used=5737.1MB, alloc=44.3MB, time=56.00
memory used=5778.4MB, alloc=44.3MB, time=56.41
TOP MAIN SOLVE Loop
x[1] = 0.49999966733339986666033015908219
y[1] (closed_form) = 1.1224172786208118990752783156993
y[1] (numeric) = 1.1224172786208118990752783156993
absolute error = 4.1e-98
relative error = 3.6528304384604095505552361852182e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4207
Order of pole (three term test) = 92.23
NO COMPLEX POLE (six term test) for Equation 1
memory used=5819.7MB, alloc=44.3MB, time=56.83
memory used=5860.9MB, alloc=44.3MB, time=57.25
memory used=5902.0MB, alloc=44.3MB, time=57.64
TOP MAIN SOLVE Loop
x[1] = 0.50999966066673453332686984162892
y[1] (closed_form) = 1.1272553266995196725743919103822
y[1] (numeric) = 1.1272553266995196725743919103822
absolute error = 4.6e-98
relative error = 4.0807081510701723402562489600116e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4261
Order of pole (three term test) = 92.24
NO COMPLEX POLE (six term test) for Equation 1
memory used=5943.4MB, alloc=44.3MB, time=58.01
memory used=5984.5MB, alloc=44.3MB, time=58.39
memory used=6025.8MB, alloc=44.3MB, time=58.78
TOP MAIN SOLVE Loop
x[1] = 0.51999965400006919999340952417566
y[1] (closed_form) = 1.1321806484019087356846224293807
y[1] (numeric) = 1.1321806484019087356846224293807
absolute error = 4.4e-98
relative error = 3.8863056052147429283070392858154e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4312
Order of pole (three term test) = 92.25
NO COMPLEX POLE (six term test) for Equation 1
memory used=6067.1MB, alloc=44.3MB, time=59.17
memory used=6108.4MB, alloc=44.3MB, time=59.55
memory used=6149.6MB, alloc=44.3MB, time=59.94
TOP MAIN SOLVE Loop
x[1] = 0.5299996473334038666599492067224
y[1] (closed_form) = 1.1371927512005699688352070574823
y[1] (numeric) = 1.1371927512005699688352070574823
absolute error = 4.1e-98
relative error = 3.6053694465353403949626469783360e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4362
Order of pole (three term test) = 92.26
NO COMPLEX POLE (six term test) for Equation 1
memory used=6190.9MB, alloc=44.3MB, time=60.31
memory used=6232.2MB, alloc=44.3MB, time=60.69
TOP MAIN SOLVE Loop
x[1] = 0.53999964066673853332648888926914
y[1] (closed_form) = 1.1422911338900685131913670881001
y[1] (numeric) = 1.1422911338900685131913670881001
absolute error = 4.6e-98
relative error = 4.0269944005734474008664401778159e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.441
Order of pole (three term test) = 92.26
NO COMPLEX POLE (six term test) for Equation 1
memory used=6273.5MB, alloc=44.3MB, time=61.08
memory used=6314.8MB, alloc=44.3MB, time=61.45
memory used=6356.1MB, alloc=44.3MB, time=61.83
TOP MAIN SOLVE Loop
x[1] = 0.54999963400007319999302857181587
y[1] (closed_form) = 1.1474752866370638296441460299839
y[1] (numeric) = 1.1474752866370638296441460299839
absolute error = 5.0e-98
relative error = 4.3573923187954942692562328437334e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4456
Order of pole (three term test) = 92.27
NO COMPLEX POLE (six term test) for Equation 1
memory used=6397.3MB, alloc=44.3MB, time=62.22
memory used=6438.5MB, alloc=44.3MB, time=62.61
memory used=6479.7MB, alloc=44.3MB, time=62.98
TOP MAIN SOLVE Loop
x[1] = 0.55999962733340786665956825436261
y[1] (closed_form) = 1.1527446910312925400280100603524
y[1] (numeric) = 1.1527446910312925400280100603524
absolute error = 5.6e-98
relative error = 4.8579707575924821636095783971698e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4501
Order of pole (three term test) = 92.28
NO COMPLEX POLE (six term test) for Equation 1
memory used=6521.0MB, alloc=44.3MB, time=63.38
memory used=6562.2MB, alloc=44.3MB, time=63.75
memory used=6603.5MB, alloc=44.3MB, time=64.14
TOP MAIN SOLVE Loop
x[1] = 0.56999962066674253332610793690935
y[1] (closed_form) = 1.158098820137408952331372219037
y[1] (numeric) = 1.158098820137408952331372219037
absolute error = 5.9e-98
relative error = 5.0945566107216673560964937308213e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4543
Order of pole (three term test) = 92.29
NO COMPLEX POLE (six term test) for Equation 1
memory used=6644.8MB, alloc=44.3MB, time=64.52
memory used=6686.1MB, alloc=44.3MB, time=64.89
memory used=6727.4MB, alloc=44.3MB, time=65.27
TOP MAIN SOLVE Loop
x[1] = 0.57999961400007719999264761945608
y[1] (closed_form) = 1.1635371385476780858976315360358
y[1] (numeric) = 1.1635371385476780858976315360358
absolute error = 6.4e-98
relative error = 5.5004690335784655015889581767029e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4584
Order of pole (three term test) = 92.3
NO COMPLEX POLE (six term test) for Equation 1
memory used=6768.7MB, alloc=44.3MB, time=65.66
memory used=6809.8MB, alloc=44.3MB, time=66.02
memory used=6851.0MB, alloc=44.3MB, time=66.41
TOP MAIN SOLVE Loop
x[1] = 0.58999960733341186665918730200282
y[1] (closed_form) = 1.1690591024355159273651433123793
y[1] (numeric) = 1.1690591024355159273651433123793
absolute error = 6.4e-98
relative error = 5.4744879764135083840294535318704e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4623
Order of pole (three term test) = 92.31
NO COMPLEX POLE (six term test) for Equation 1
memory used=6892.5MB, alloc=44.3MB, time=66.80
memory used=6933.8MB, alloc=44.3MB, time=67.19
TOP MAIN SOLVE Loop
x[1] = 0.59999960066674653332572698454956
y[1] (closed_form) = 1.1746641596098715633722818665153
y[1] (numeric) = 1.1746641596098715633722818665153
absolute error = 6.6e-98
relative error = 5.6186272016607591451312200992287e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.466
Order of pole (three term test) = 92.32
NO COMPLEX POLE (six term test) for Equation 1
memory used=6975.1MB, alloc=44.3MB, time=67.56
memory used=7016.3MB, alloc=44.3MB, time=67.97
memory used=7057.5MB, alloc=44.3MB, time=68.33
TOP MAIN SOLVE Loop
x[1] = 0.6099995940000811999922666670963
y[1] (closed_form) = 1.1803517495704457518668943591104
y[1] (numeric) = 1.1803517495704457518668943591104
absolute error = 6.4e-98
relative error = 5.4221125205508370424818814506586e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4695
Order of pole (three term test) = 92.33
NO COMPLEX POLE (six term test) for Equation 1
memory used=7098.6MB, alloc=44.3MB, time=68.72
memory used=7139.8MB, alloc=44.3MB, time=69.09
memory used=7181.1MB, alloc=44.3MB, time=69.48
TOP MAIN SOLVE Loop
x[1] = 0.61999958733341586665880634964303
y[1] (closed_form) = 1.1861213035637404102163924231306
y[1] (numeric) = 1.1861213035637404102163924231306
absolute error = 6.5e-98
relative error = 5.4800465858513261098449663880723e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4729
Order of pole (three term test) = 92.34
NO COMPLEX POLE (six term test) for Equation 1
memory used=7222.4MB, alloc=44.3MB, time=69.86
memory used=7263.6MB, alloc=44.3MB, time=70.25
memory used=7304.8MB, alloc=44.3MB, time=70.64
TOP MAIN SOLVE Loop
x[1] = 0.62999958066675053332534603218977
y[1] (closed_form) = 1.1919722446399334152238514776484
y[1] (numeric) = 1.1919722446399334152238514776484
absolute error = 6.6e-98
relative error = 5.5370416800214200352362235389672e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.476
Order of pole (three term test) = 92.35
NO COMPLEX POLE (six term test) for Equation 1
memory used=7346.2MB, alloc=44.3MB, time=71.02
memory used=7387.4MB, alloc=44.3MB, time=71.39
memory used=7428.7MB, alloc=44.3MB, time=71.76
TOP MAIN SOLVE Loop
x[1] = 0.63999957400008519999188571473651
y[1] (closed_form) = 1.1979039877105730276250948003745
y[1] (numeric) = 1.1979039877105730276250948003745
absolute error = 7.3e-98
relative error = 6.0939775431850064681850775550036e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.479
Order of pole (three term test) = 92.36
NO COMPLEX POLE (six term test) for Equation 1
memory used=7470.0MB, alloc=44.3MB, time=72.16
memory used=7511.2MB, alloc=44.3MB, time=72.53
TOP MAIN SOLVE Loop
x[1] = 0.64999956733341986665842539728325
y[1] (closed_form) = 1.2039159396070861716800836349482
y[1] (numeric) = 1.2039159396070861716800836349482
absolute error = 7.5e-98
relative error = 6.2296708210771956482961075091546e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4818
Order of pole (three term test) = 92.37
NO COMPLEX POLE (six term test) for Equation 1
memory used=7552.5MB, alloc=44.3MB, time=72.92
memory used=7593.6MB, alloc=44.3MB, time=73.31
memory used=7634.9MB, alloc=44.3MB, time=73.70
TOP MAIN SOLVE Loop
x[1] = 0.65999956066675453332496507982998
y[1] (closed_form) = 1.2100074991400947190872119008789
y[1] (numeric) = 1.2100074991400947190872119008789
absolute error = 7.9e-98
relative error = 6.5288851561781417257915321695808e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4844
Order of pole (three term test) = 92.38
NO COMPLEX POLE (six term test) for Equation 1
memory used=7676.2MB, alloc=44.3MB, time=74.08
memory used=7717.5MB, alloc=44.3MB, time=74.45
memory used=7758.7MB, alloc=44.3MB, time=74.84
TOP MAIN SOLVE Loop
x[1] = 0.66999955400008919999150476237672
y[1] (closed_form) = 1.2161780571595338456494528503207
y[1] (numeric) = 1.2161780571595338456494528503207
absolute error = 8.0e-98
relative error = 6.5779841635068974853034578273063e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4867
Order of pole (three term test) = 92.39
NO COMPLEX POLE (six term test) for Equation 1
memory used=7800.0MB, alloc=44.3MB, time=75.23
memory used=7841.3MB, alloc=44.3MB, time=75.61
memory used=7882.5MB, alloc=44.3MB, time=75.98
TOP MAIN SOLVE Loop
x[1] = 0.67999954733342386665804444492346
y[1] (closed_form) = 1.222426996615566448914805163592
y[1] (numeric) = 1.222426996615566448914805163592
absolute error = 8.6e-98
relative error = 7.0351849425856234832641574812208e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4889
Order of pole (three term test) = 92.4
NO COMPLEX POLE (six term test) for Equation 1
memory used=7923.8MB, alloc=44.3MB, time=76.38
memory used=7965.0MB, alloc=44.3MB, time=76.75
memory used=8006.3MB, alloc=44.3MB, time=77.13
TOP MAIN SOLVE Loop
x[1] = 0.68999954066675853332458412747019
y[1] (closed_form) = 1.2287536926202875354081580669811
y[1] (numeric) = 1.2287536926202875354081580669811
absolute error = 8.5e-98
relative error = 6.9175783975663629947252644935663e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4909
Order of pole (three term test) = 92.41
NO COMPLEX POLE (six term test) for Equation 1
memory used=8047.6MB, alloc=44.3MB, time=77.52
memory used=8088.9MB, alloc=44.3MB, time=77.91
TOP MAIN SOLVE Loop
x[1] = 0.69999953400009319999112381001693
y[1] (closed_form) = 1.2351575125102124070754995477401
y[1] (numeric) = 1.2351575125102124070754995477401
absolute error = 9.0e-98
relative error = 7.2865200663430261012307197914847e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4927
Order of pole (three term test) = 92.42
NO COMPLEX POLE (six term test) for Equation 1
memory used=8130.2MB, alloc=44.3MB, time=78.31
memory used=8171.4MB, alloc=44.3MB, time=78.69
memory used=8212.6MB, alloc=44.3MB, time=79.08
TOP MAIN SOLVE Loop
x[1] = 0.70999952733342786665766349256367
y[1] (closed_form) = 1.2416378159095423981822281754602
y[1] (numeric) = 1.2416378159095423981822281754602
absolute error = 9.8e-98
relative error = 7.8928008429101871329239085712101e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4943
Order of pole (three term test) = 92.42
NO COMPLEX POLE (six term test) for Equation 1
memory used=8253.9MB, alloc=44.3MB, time=79.45
memory used=8295.1MB, alloc=44.3MB, time=79.84
memory used=8336.4MB, alloc=44.3MB, time=80.23
TOP MAIN SOLVE Loop
x[1] = 0.71999952066676253332420317511041
y[1] (closed_form) = 1.2481939547942018361530352568201
y[1] (numeric) = 1.2481939547942018361530352568201
absolute error = 1.01e-97
relative error = 8.0916911680326597838697454992467e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4957
Order of pole (three term test) = 92.43
NO COMPLEX POLE (six term test) for Equation 1
memory used=8377.6MB, alloc=44.3MB, time=80.63
memory used=8418.9MB, alloc=44.3MB, time=81.00
memory used=8460.2MB, alloc=44.3MB, time=81.39
TOP MAIN SOLVE Loop
x[1] = 0.72999951400009719999074285765714
y[1] (closed_form) = 1.2548252735566398227191754062333
y[1] (numeric) = 1.2548252735566398227191754062333
absolute error = 1.04e-97
relative error = 8.2880064811912387595131996364966e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4969
Order of pole (three term test) = 92.44
NO COMPLEX POLE (six term test) for Equation 1
memory used=8501.5MB, alloc=44.3MB, time=81.78
memory used=8542.8MB, alloc=44.3MB, time=82.16
memory used=8584.0MB, alloc=44.3MB, time=82.55
TOP MAIN SOLVE Loop
x[1] = 0.73999950733343186665728254020388
y[1] (closed_form) = 1.2615311090713903552576521984984
y[1] (numeric) = 1.2615311090713903552576521984984
absolute error = 1.11e-97
relative error = 8.7988317689372559691377796805113e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4979
Order of pole (three term test) = 92.45
NO COMPLEX POLE (six term test) for Equation 1
memory used=8625.3MB, alloc=44.3MB, time=82.94
memory used=8666.5MB, alloc=44.3MB, time=83.34
memory used=8707.8MB, alloc=44.3MB, time=83.73
TOP MAIN SOLVE Loop
x[1] = 0.74999950066676653332382222275062
y[1] (closed_form) = 1.2683107907613842323735594363856
y[1] (numeric) = 1.2683107907613842323735594363856
absolute error = 1.18e-97
relative error = 9.3037133216506810403870626528842e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4987
Order of pole (three term test) = 92.46
NO COMPLEX POLE (six term test) for Equation 1
memory used=8749.0MB, alloc=44.3MB, time=84.12
memory used=8790.2MB, alloc=44.3MB, time=84.52
TOP MAIN SOLVE Loop
x[1] = 0.75999949400010119999036190529735
y[1] (closed_form) = 1.2751636406650061125991209714886
y[1] (numeric) = 1.2751636406650061125991209714886
absolute error = 1.26e-97
relative error = 9.8810847472321420990177271116180e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4994
Order of pole (three term test) = 92.47
NO COMPLEX POLE (six term test) for Equation 1
memory used=8831.4MB, alloc=44.3MB, time=84.92
memory used=8872.7MB, alloc=44.3MB, time=85.30
memory used=8913.9MB, alloc=44.3MB, time=85.70
TOP MAIN SOLVE Loop
x[1] = 0.76999948733343586665690158784409
y[1] (closed_form) = 1.2820889735038900205683806577174
y[1] (numeric) = 1.2820889735038900205683806577174
absolute error = 1.22e-97
relative error = 9.5157202441714811710196934501425e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4998
Order of pole (three term test) = 92.48
NO COMPLEX POLE (six term test) for Equation 1
memory used=8955.2MB, alloc=44.3MB, time=86.08
memory used=8996.5MB, alloc=44.3MB, time=86.45
memory used=9037.5MB, alloc=44.3MB, time=86.83
TOP MAIN SOLVE Loop
x[1] = 0.77999948066677053332344127039083
y[1] (closed_form) = 1.2890860967514465211824602806066
y[1] (numeric) = 1.2890860967514465211824602806066
absolute error = 1.20e-97
relative error = 9.3089205059619571521860703491573e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.5
Order of pole (three term test) = 92.49
NO COMPLEX POLE (six term test) for Equation 1
memory used=9078.8MB, alloc=44.3MB, time=87.23
memory used=9120.0MB, alloc=44.3MB, time=87.61
memory used=9161.2MB, alloc=44.3MB, time=88.00
TOP MAIN SOLVE Loop
x[1] = 0.78999947400010519998998095293757
y[1] (closed_form) = 1.2961543107021147091142115241664
y[1] (numeric) = 1.2961543107021147091142115241664
absolute error = 1.20e-97
relative error = 9.2581569192172125306053120353911e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.5
Order of pole (three term test) = 92.5
NO COMPLEX POLE (six term test) for Equation 1
memory used=9202.5MB, alloc=44.3MB, time=88.39
memory used=9243.9MB, alloc=44.3MB, time=88.78
memory used=9285.1MB, alloc=44.3MB, time=89.14
TOP MAIN SOLVE Loop
x[1] = 0.7999994673334398666565206354843
y[1] (closed_form) = 1.3032929085413320885202547487509
y[1] (numeric) = 1.3032929085413320885202547487509
absolute error = 1.21e-97
relative error = 9.2841754303278829198633007972347e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4998
Order of pole (three term test) = 92.51
NO COMPLEX POLE (six term test) for Equation 1
memory used=9326.4MB, alloc=44.3MB, time=89.56
memory used=9367.7MB, alloc=44.3MB, time=89.95
TOP MAIN SOLVE Loop
x[1] = 0.80999946066677453332306031803104
y[1] (closed_form) = 1.3105011764162153460400705716286
y[1] (numeric) = 1.3105011764162153460400705716286
absolute error = 1.21e-97
relative error = 9.2331088424426094586862956541020e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4994
Order of pole (three term test) = 92.52
NO COMPLEX POLE (six term test) for Equation 1
memory used=9408.9MB, alloc=44.3MB, time=90.34
memory used=9450.3MB, alloc=44.3MB, time=90.73
memory used=9491.5MB, alloc=44.3MB, time=91.12
TOP MAIN SOLVE Loop
x[1] = 0.81999945400010919998960000057778
y[1] (closed_form) = 1.3177783935069449490731687299039
y[1] (numeric) = 1.3177783935069449490731687299039
absolute error = 1.23e-97
relative error = 9.3338910856373641109905972350101e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4988
Order of pole (three term test) = 92.53
NO COMPLEX POLE (six term test) for Equation 1
memory used=9532.9MB, alloc=44.3MB, time=91.52
memory used=9574.2MB, alloc=44.3MB, time=91.89
memory used=9615.4MB, alloc=44.3MB, time=92.28
TOP MAIN SOLVE Loop
x[1] = 0.82999944733344386665613968312451
y[1] (closed_form) = 1.3251238320988464309435112585704
y[1] (numeric) = 1.3251238320988464309435112585704
absolute error = 1.30e-97
relative error = 9.8104038921475503197703285244978e-96 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.498
Order of pole (three term test) = 92.54
NO COMPLEX POLE (six term test) for Equation 1
memory used=9656.8MB, alloc=44.3MB, time=92.66
memory used=9697.9MB, alloc=44.3MB, time=93.05
memory used=9739.1MB, alloc=44.3MB, time=93.44
TOP MAIN SOLVE Loop
x[1] = 0.83999944066677853332267936567125
y[1] (closed_form) = 1.3325367576551611548923517515077
y[1] (numeric) = 1.3325367576551611548923517515077
absolute error = 1.35e-97
relative error = 1.0131052612579097411019860580451e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.497
Order of pole (three term test) = 92.55
NO COMPLEX POLE (six term test) for Equation 1
memory used=9780.3MB, alloc=44.3MB, time=93.81
memory used=9821.6MB, alloc=44.3MB, time=94.22
memory used=9862.8MB, alloc=44.3MB, time=94.61
TOP MAIN SOLVE Loop
x[1] = 0.84999943400011319998921904821799
y[1] (closed_form) = 1.3400164288904992798934361243288
y[1] (numeric) = 1.3400164288904992798934361243288
absolute error = 1.36e-97
relative error = 1.0149129299303043818672695802567e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4958
Order of pole (three term test) = 92.56
NO COMPLEX POLE (six term test) for Equation 1
memory used=9904.0MB, alloc=44.3MB, time=94.98
memory used=9945.3MB, alloc=44.3MB, time=95.37
TOP MAIN SOLVE Loop
x[1] = 0.85999942733344786665575873076473
y[1] (closed_form) = 1.3475620978449675830649875201338
y[1] (numeric) = 1.3475620978449675830649875201338
absolute error = 1.40e-97
relative error = 1.0389131619529011259584671931680e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4944
Order of pole (three term test) = 92.57
NO COMPLEX POLE (six term test) for Equation 1
memory used=9986.6MB, alloc=44.3MB, time=95.75
memory used=10028.0MB, alloc=44.3MB, time=96.13
memory used=10069.1MB, alloc=44.3MB, time=96.53
TOP MAIN SOLVE Loop
x[1] = 0.86999942066678253332229841331146
y[1] (closed_form) = 1.3551730099589647259678906787722
y[1] (numeric) = 1.3551730099589647259678906787722
absolute error = 1.41e-97
relative error = 1.0404575575503053008655005110705e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4929
Order of pole (three term test) = 92.58
NO COMPLEX POLE (six term test) for Equation 1
memory used=10110.5MB, alloc=44.3MB, time=96.91
memory used=10151.7MB, alloc=44.3MB, time=97.30
memory used=10192.9MB, alloc=44.3MB, time=97.69
TOP MAIN SOLVE Loop
x[1] = 0.8799994140001171999888380958582
y[1] (closed_form) = 1.3628484041486364853357476626344
y[1] (numeric) = 1.3628484041486364853357476626344
absolute error = 1.43e-97
relative error = 1.0492729753705165235554283280051e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4911
Order of pole (three term test) = 92.59
NO COMPLEX POLE (six term test) for Equation 1
memory used=10234.1MB, alloc=44.3MB, time=98.06
memory used=10275.3MB, alloc=44.3MB, time=98.44
memory used=10316.6MB, alloc=44.3MB, time=98.83
TOP MAIN SOLVE Loop
x[1] = 0.88999940733345186665537777840494
y[1] (closed_form) = 1.3705875128819834027866716071348
y[1] (numeric) = 1.3705875128819834027866716071348
absolute error = 1.44e-97
relative error = 1.0506443305995546953292829841927e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4891
Order of pole (three term test) = 92.6
NO COMPLEX POLE (six term test) for Equation 1
memory used=10357.9MB, alloc=44.3MB, time=99.22
memory used=10399.3MB, alloc=44.3MB, time=99.61
memory used=10440.5MB, alloc=44.3MB, time=99.97
TOP MAIN SOLVE Loop
x[1] = 0.89999940066678653332191746095168
y[1] (closed_form) = 1.378389562255613242825417658615
y[1] (numeric) = 1.378389562255613242825417658615
absolute error = 1.46e-97
relative error = 1.0592070920871153842703951441121e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4869
Order of pole (three term test) = 92.61
NO COMPLEX POLE (six term test) for Equation 1
memory used=10481.7MB, alloc=44.3MB, time=100.39
memory used=10522.9MB, alloc=44.3MB, time=100.77
memory used=10563.9MB, alloc=44.3MB, time=101.16
TOP MAIN SOLVE Loop
x[1] = 0.90999939400012119998845714349841
y[1] (closed_form) = 1.3862537720721305839642445400913
y[1] (numeric) = 1.3862537720721305839642445400913
absolute error = 1.48e-97
relative error = 1.0676255890634947486409288952664e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4846
Order of pole (three term test) = 92.62
NO COMPLEX POLE (six term test) for Equation 1
memory used=10605.2MB, alloc=44.3MB, time=101.53
memory used=10646.4MB, alloc=44.3MB, time=101.91
TOP MAIN SOLVE Loop
x[1] = 0.91999938733345586665499682604515
y[1] (closed_form) = 1.3941793559181558040782042043233
y[1] (numeric) = 1.3941793559181558040782042043233
absolute error = 1.47e-97
relative error = 1.0543837087817954943512210151208e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.482
Order of pole (three term test) = 92.63
NO COMPLEX POLE (six term test) for Equation 1
memory used=10687.8MB, alloc=44.3MB, time=102.30
memory used=10729.0MB, alloc=44.3MB, time=102.69
memory used=10770.4MB, alloc=44.3MB, time=103.06
TOP MAIN SOLVE Loop
x[1] = 0.92999938066679053332153650859189
y[1] (closed_form) = 1.4021655212429656581717420021066
y[1] (numeric) = 1.4021655212429656581717420021066
absolute error = 1.52e-97
relative error = 1.0840374955537193789048701953584e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4792
Order of pole (three term test) = 92.64
NO COMPLEX POLE (six term test) for Equation 1
memory used=10811.7MB, alloc=44.3MB, time=103.44
memory used=10853.0MB, alloc=44.3MB, time=103.83
memory used=10894.2MB, alloc=44.3MB, time=104.22
TOP MAIN SOLVE Loop
x[1] = 0.93999937400012519998807619113862
y[1] (closed_form) = 1.4102114694377475845748495321535
y[1] (numeric) = 1.4102114694377475845748495321535
absolute error = 1.52e-97
relative error = 1.0778525298805186915671809158767e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4763
Order of pole (three term test) = 92.65
NO COMPLEX POLE (six term test) for Equation 1
memory used=10935.6MB, alloc=44.3MB, time=104.61
memory used=10976.9MB, alloc=44.3MB, time=105.00
memory used=11018.2MB, alloc=44.3MB, time=105.39
TOP MAIN SOLVE Loop
x[1] = 0.94999936733345986665461587368536
y[1] (closed_form) = 1.4183163959154598142147626513619
y[1] (numeric) = 1.4183163959154598142147626513619
absolute error = 1.59e-97
relative error = 1.1210474648526685726565583169600e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4732
Order of pole (three term test) = 92.66
NO COMPLEX POLE (six term test) for Equation 1
memory used=11059.4MB, alloc=44.3MB, time=105.76
memory used=11100.8MB, alloc=44.3MB, time=106.16
memory used=11142.0MB, alloc=44.3MB, time=106.55
TOP MAIN SOLVE Loop
x[1] = 0.9599993606667945333211555562321
y[1] (closed_form) = 1.4264794901912892970294751763193
y[1] (numeric) = 1.4264794901912892970294751763193
absolute error = 1.64e-97
relative error = 1.1496835469958827396030797495643e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4698
Order of pole (three term test) = 92.67
NO COMPLEX POLE (six term test) for Equation 1
memory used=11183.4MB, alloc=44.3MB, time=106.92
memory used=11224.7MB, alloc=44.3MB, time=107.31
TOP MAIN SOLVE Loop
x[1] = 0.96999935400012919998769523877884
y[1] (closed_form) = 1.4346999359636993998082025122
y[1] (numeric) = 1.4346999359636993998082025122
absolute error = 1.69e-97
relative error = 1.1779466616235774132012368366812e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4663
Order of pole (three term test) = 92.68
NO COMPLEX POLE (six term test) for Equation 1
memory used=11265.9MB, alloc=44.3MB, time=107.70
memory used=11307.2MB, alloc=44.3MB, time=108.09
memory used=11348.5MB, alloc=44.3MB, time=108.50
TOP MAIN SOLVE Loop
x[1] = 0.97999934733346386665423492132557
y[1] (closed_form) = 1.4429769111960592707673568595999
y[1] (numeric) = 1.4429769111960592707673568595999
absolute error = 1.72e-97
relative error = 1.1919802643095106451155101375949e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4626
Order of pole (three term test) = 92.69
NO COMPLEX POLE (six term test) for Equation 1
memory used=11389.8MB, alloc=44.3MB, time=108.89
memory used=11431.0MB, alloc=44.3MB, time=109.28
memory used=11472.3MB, alloc=44.3MB, time=109.67
TOP MAIN SOLVE Loop
x[1] = 0.98999934066679853332077460387231
y[1] (closed_form) = 1.4513095881988467080044843735981
y[1] (numeric) = 1.4513095881988467080044843735981
absolute error = 1.78e-97
relative error = 1.2264784953354272119397429043575e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4587
Order of pole (three term test) = 92.7
NO COMPLEX POLE (six term test) for Equation 1
memory used=11513.6MB, alloc=44.3MB, time=110.08
memory used=11554.8MB, alloc=44.3MB, time=110.47
memory used=11596.1MB, alloc=44.3MB, time=110.84
TOP MAIN SOLVE Loop
x[1] = 0.99999933400013319998731428641905
y[1] (closed_form) = 1.4596971337124163116227812373094
y[1] (numeric) = 1.4596971337124163116227812373094
absolute error = 1.79e-97
relative error = 1.2262817804180594064264348975714e-95 %
Desired digits = 8
Estimated correct digits = 11
Correct digits = 100
h = 9.9999933333346666665396825467372e-05
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4546
Order of pole (three term test) = 92.71
NO COMPLEX POLE (six term test) for Equation 1
Finished!
diff ( y , x , 1 ) = sin ( x ) ;
Iterations = 9992
Total Elapsed Time = 1 Minutes 50 Seconds
Elapsed Time(since restart) = 1 Minutes 50 Seconds
Time to Timeout = 1 Minutes 9 Seconds
Percent Done = 100 %
> quit
memory used=11609.7MB, alloc=44.3MB, time=110.97