|\^/| 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_y1 := proc(x)
> return(c(1.0) + cos(c(x)));
> end;
exact_soln_y1 := proc(x) return c(1.0) + cos(c(x)) end proc
> exact_soln_y2 := proc(x)
> return(c(1.0) + sin(c(x)));
> end;
exact_soln_y2 := proc(x) return c(1.0) + sin(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
> ;
> if ((glob_type_given_pole = 1) or (glob_type_given_pole = 2)) then # if number 3
> rad_given := sqrt((array_x[1] - array_given_rad_poles[2,1]) * (array_x[1] - array_given_rad_poles[2,1]) + array_given_rad_poles[2,2] * array_given_rad_poles[2,2]);
> omniout_float(ALWAYS,"Radius of convergence (given) for eq 2 ",4,rad_given,4," ");
> omniout_float(ALWAYS,"Order of pole (given) ",4,array_given_ord_poles[2,1],4," ");
> if (rad_given < glob_least_given_sing) then # if number 4
> glob_least_given_sing := rad_given;
> fi;# end if 4;
> elif
> (glob_type_given_pole = 3) then # if number 4
> omniout_str(ALWAYS,"NO POLE (given) for Equation 2");
> elif
> (glob_type_given_pole = 5) then # if number 5
> omniout_str(ALWAYS,"SOME POLE (given) for Equation 2");
> else
> omniout_str(ALWAYS,"NO INFO (given) for Equation 2");
> fi;# end if 5;
> if (array_rad_test_poles[2,1] < glob_large_float) then # if number 5
> omniout_float(ALWAYS,"Radius of convergence (ratio test) for eq 2 ",4,array_rad_test_poles[2,1],4," ");
> if (array_rad_test_poles[2,1]< glob_least_ratio_sing) then # if number 6
> glob_least_ratio_sing := array_rad_test_poles[2,1];
> fi;# end if 6;
> omniout_float(ALWAYS,"Order of pole (ratio test) ",4, array_ord_test_poles[2,1],4," ");
> else
> omniout_str(ALWAYS,"NO POLE (ratio test) for Equation 2");
> fi;# end if 5;
> if ((array_rad_test_poles[2,2] > glob__small) and (array_rad_test_poles[2,2] < glob_large_float)) then # if number 5
> omniout_float(ALWAYS,"Radius of convergence (three term test) for eq 2 ",4,array_rad_test_poles[2,2],4," ");
> if (array_rad_test_poles[2,2]< glob_least_3_sing) then # if number 6
> glob_least_3_sing := array_rad_test_poles[2,2];
> fi;# end if 6;
> omniout_float(ALWAYS,"Order of pole (three term test) ",4, array_ord_test_poles[2,2],4," ");
> else
> omniout_str(ALWAYS,"NO REAL POLE (three term test) for Equation 2");
> fi;# end if 5;
> if ((array_rad_test_poles[2,3] > glob__small) and (array_rad_test_poles[2,3] < glob_large_float)) then # if number 5
> omniout_float(ALWAYS,"Radius of convergence (six term test) for eq 2 ",4,array_rad_test_poles[2,3],4," ");
> if (array_rad_test_poles[2,3]< glob_least_6_sing) then # if number 6
> glob_least_6_sing := array_rad_test_poles[2,3];
> fi;# end if 6;
> omniout_float(ALWAYS,"Order of pole (six term test) ",4, array_ord_test_poles[2,3],4," ");
> else
> omniout_str(ALWAYS,"NO COMPLEX POLE (six term test) for Equation 2");
> fi;# end if 5
> ;
> 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;
if glob_type_given_pole = 1 or glob_type_given_pole = 2 then
rad_given := sqrt((array_x[1] - array_given_rad_poles[2, 1])*
(array_x[1] - array_given_rad_poles[2, 1])
+ array_given_rad_poles[2, 2]*array_given_rad_poles[2, 2]);
omniout_float(ALWAYS,
"Radius of convergence (given) for eq 2 ", 4,
rad_given, 4, " ");
omniout_float(ALWAYS,
"Order of pole (given) ", 4,
array_given_ord_poles[2, 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 2")
elif glob_type_given_pole = 5 then
omniout_str(ALWAYS, "SOME POLE (given) for Equation 2")
else omniout_str(ALWAYS, "NO INFO (given) for Equation 2")
end if;
if array_rad_test_poles[2, 1] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (ratio test) for eq 2 ", 4,
array_rad_test_poles[2, 1], 4, " ");
if array_rad_test_poles[2, 1] < glob_least_ratio_sing then
glob_least_ratio_sing := array_rad_test_poles[2, 1]
end if;
omniout_float(ALWAYS,
"Order of pole (ratio test) ", 4,
array_ord_test_poles[2, 1], 4, " ")
else omniout_str(ALWAYS, "NO POLE (ratio test) for Equation 2")
end if;
if glob__small < array_rad_test_poles[2, 2] and
array_rad_test_poles[2, 2] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (three term test) for eq 2 ", 4,
array_rad_test_poles[2, 2], 4, " ");
if array_rad_test_poles[2, 2] < glob_least_3_sing then
glob_least_3_sing := array_rad_test_poles[2, 2]
end if;
omniout_float(ALWAYS,
"Order of pole (three term test) ", 4,
array_ord_test_poles[2, 2], 4, " ")
else omniout_str(ALWAYS,
"NO REAL POLE (three term test) for Equation 2")
end if;
if glob__small < array_rad_test_poles[2, 3] and
array_rad_test_poles[2, 3] < glob_large_float then
omniout_float(ALWAYS,
"Radius of convergence (six term test) for eq 2 ", 4,
array_rad_test_poles[2, 3], 4, " ");
if array_rad_test_poles[2, 3] < glob_least_6_sing then
glob_least_6_sing := array_rad_test_poles[2, 3]
end if;
omniout_float(ALWAYS,
"Order of pole (six term test) ", 4,
array_ord_test_poles[2, 3], 4, " ")
else omniout_str(ALWAYS,
"NO COMPLEX POLE (six term test) for Equation 2")
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 5
> ret := glob__1;
> else
> ret := glob__m1;
> fi;# end if 5;
> 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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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_y1[1]) < min_size) then # if number 5
> min_size := float_abs(array_y1[1]);
> omniout_float(ALWAYS,"min_size",32,min_size,32,"");
> fi;# end if 5;
> if (float_abs(array_y2[1]) < min_size) then # if number 5
> min_size := float_abs(array_y2[1]);
> omniout_float(ALWAYS,"min_size",32,min_size,32,"");
> fi;# end if 5;
> if (min_size < glob__1) then # if number 5
> min_size := glob__1;
> omniout_float(ALWAYS,"min_size",32,min_size,32,"");
> fi;# end if 5;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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_y1[1]) < min_size then
min_size := float_abs(array_y1[1]);
omniout_float(ALWAYS, "min_size", 32, min_size, 32, "")
end if;
if float_abs(array_y2[1]) < min_size then
min_size := float_abs(array_y2[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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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_y1[no_terms-3] + array_y1[no_terms - 2] * hn_div_ho + array_y1[no_terms - 1] * hn_div_ho_2 + array_y1[no_terms] * hn_div_ho_3);
> if (est_tmp >= max_estimated_step_error) then # if number 5
> max_estimated_step_error := est_tmp;
> fi;# end if 5;
> est_tmp := float_abs(array_y2[no_terms-3] + array_y2[no_terms - 2] * hn_div_ho + array_y2[no_terms - 1] * hn_div_ho_2 + array_y2[no_terms] * hn_div_ho_3);
> if (est_tmp >= max_estimated_step_error) then # if number 5
> max_estimated_step_error := est_tmp;
> fi;# end if 5;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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_y1[no_terms - 3]
+ array_y1[no_terms - 2]*hn_div_ho
+ array_y1[no_terms - 1]*hn_div_ho_2
+ array_y1[no_terms]*hn_div_ho_3);
if max_estimated_step_error <= est_tmp then
max_estimated_step_error := est_tmp
end if;
est_tmp := float_abs(array_y2[no_terms - 3]
+ array_y2[no_terms - 2]*hn_div_ho
+ array_y2[no_terms - 1]*hn_div_ho_2
+ array_y2[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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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_y1[no_terms-3])) + c(float_abs(array_y1[no_terms - 2])) * c(hn_div_ho) + c(float_abs(array_y1[no_terms - 1])) * c(hn_div_ho_2) + c(float_abs(array_y1[no_terms])) * c(hn_div_ho_3);
> if (glob_prec * c(float_abs(array_y1[1])) > c(est_tmp)) then # if number 5
> est_tmp := c(glob_prec) * c(float_abs(array_y1[1]));
> fi;# end if 5;
> if (c(est_tmp) >= c(array_max_est_error[1])) then # if number 5
> array_max_est_error[1] := c(est_tmp);
> fi;# end if 5
> ;
> est_tmp := c(float_abs(array_y2[no_terms-3])) + c(float_abs(array_y2[no_terms - 2])) * c(hn_div_ho) + c(float_abs(array_y2[no_terms - 1])) * c(hn_div_ho_2) + c(float_abs(array_y2[no_terms])) * c(hn_div_ho_3);
> if (glob_prec * c(float_abs(array_y2[1])) > c(est_tmp)) then # if number 5
> est_tmp := c(glob_prec) * c(float_abs(array_y2[1]));
> fi;# end if 5;
> if (c(est_tmp) >= c(array_max_est_error[2])) then # if number 5
> array_max_est_error[2] := c(est_tmp);
> fi;# end if 5
> ;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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_y1[no_terms - 3]))
+ c(float_abs(array_y1[no_terms - 2]))*c(hn_div_ho)
+ c(float_abs(array_y1[no_terms - 1]))*c(hn_div_ho_2)
+ c(float_abs(array_y1[no_terms]))*c(hn_div_ho_3);
if c(est_tmp) < glob_prec*c(float_abs(array_y1[1])) then
est_tmp := c(glob_prec)*c(float_abs(array_y1[1]))
end if;
if c(array_max_est_error[1]) <= c(est_tmp) then
array_max_est_error[1] := c(est_tmp)
end if;
est_tmp := c(float_abs(array_y2[no_terms - 3]))
+ c(float_abs(array_y2[no_terms - 2]))*c(hn_div_ho)
+ c(float_abs(array_y2[no_terms - 1]))*c(hn_div_ho_2)
+ c(float_abs(array_y2[no_terms]))*c(hn_div_ho_3);
if c(est_tmp) < glob_prec*c(float_abs(array_y2[1])) then
est_tmp := c(glob_prec)*c(float_abs(array_y2[1]))
end if;
if c(array_max_est_error[2]) <= c(est_tmp) then
array_max_est_error[2] := 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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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 5
> ret := true;
> else
> ret := false;
> fi;# end if 5;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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 5
> if (iter >= 0) then # if number 6
> ind_var := array_x[1];
> omniout_float(ALWAYS,"x[1] ",33,ind_var,20," ");
> closed_form_val_y := evalf(exact_soln_y1(ind_var));
> omniout_float(ALWAYS,"y1[1] (closed_form) ",33,closed_form_val_y,20," ");
> term_no := 1;
> numeric_val := array_y1[term_no];
> abserr := float_abs(numeric_val - closed_form_val_y);
> omniout_float(ALWAYS,"y1[1] (numeric) ",33,numeric_val,20," ");
> if (c(float_abs(closed_form_val_y)) > c(glob_prec)) then # if number 7
> relerr := abserr*glob__100/float_abs(closed_form_val_y);
> if (c(relerr) > c(glob_prec)) then # if number 8
> glob_good_digits := -int_trunc(log10(c(relerr))) + 3;
> else
> glob_good_digits := Digits;
> fi;# end if 8;
> else
> relerr := glob__m1 ;
> glob_good_digits := -16;
> fi;# end if 7;
> if (glob_good_digits < glob_min_good_digits) then # if number 7
> glob_min_good_digits := glob_good_digits;
> fi;# end if 7;
> if (glob_apfp_est_good_digits < glob_min_apfp_est_good_digits) then # if number 7
> glob_min_apfp_est_good_digits := glob_apfp_est_good_digits;
> fi;# end if 7;
> if (evalf(float_abs(numeric_val)) > glob_prec) then # if number 7
> est_rel_err := evalf(array_max_est_error[1]*100.0 * sqrt(glob_iter)*33*ATS_MAX_TERMS/float_abs(numeric_val));
> if (evalf(est_rel_err) > glob_prec) then # if number 8
> glob_est_digits := -int_trunc(log10(est_rel_err)) + 3;
> else
> glob_est_digits := Digits;
> fi;# end if 8;
> else
> relerr := glob__m1 ;
> glob_est_digits := -16;
> fi;# end if 7;
> array_est_digits[1] := glob_est_digits;
> if (glob_iter = 1) then # if number 7
> array_1st_rel_error[1] := relerr;
> else
> array_last_rel_error[1] := relerr;
> fi;# end if 7;
> 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," ");
> ;
> closed_form_val_y := evalf(exact_soln_y2(ind_var));
> omniout_float(ALWAYS,"y2[1] (closed_form) ",33,closed_form_val_y,20," ");
> term_no := 1;
> numeric_val := array_y2[term_no];
> abserr := float_abs(numeric_val - closed_form_val_y);
> omniout_float(ALWAYS,"y2[1] (numeric) ",33,numeric_val,20," ");
> if (c(float_abs(closed_form_val_y)) > c(glob_prec)) then # if number 7
> relerr := abserr*glob__100/float_abs(closed_form_val_y);
> if (c(relerr) > c(glob_prec)) then # if number 8
> glob_good_digits := -int_trunc(log10(c(relerr))) + 3;
> else
> glob_good_digits := Digits;
> fi;# end if 8;
> else
> relerr := glob__m1 ;
> glob_good_digits := -16;
> fi;# end if 7;
> if (glob_good_digits < glob_min_good_digits) then # if number 7
> glob_min_good_digits := glob_good_digits;
> fi;# end if 7;
> if (glob_apfp_est_good_digits < glob_min_apfp_est_good_digits) then # if number 7
> glob_min_apfp_est_good_digits := glob_apfp_est_good_digits;
> fi;# end if 7;
> if (evalf(float_abs(numeric_val)) > glob_prec) then # if number 7
> est_rel_err := evalf(array_max_est_error[2]*100.0 * sqrt(glob_iter)*33*ATS_MAX_TERMS/float_abs(numeric_val));
> if (evalf(est_rel_err) > glob_prec) then # if number 8
> glob_est_digits := -int_trunc(log10(est_rel_err)) + 3;
> else
> glob_est_digits := Digits;
> fi;# end if 8;
> else
> relerr := glob__m1 ;
> glob_est_digits := -16;
> fi;# end if 7;
> array_est_digits[2] := glob_est_digits;
> if (glob_iter = 1) then # if number 7
> array_1st_rel_error[2] := relerr;
> else
> array_last_rel_error[2] := relerr;
> fi;# end if 7;
> array_est_rel_error[2] := 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 6;
> #BOTTOM DISPLAY ALOT
> fi;# end if 5;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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_y1(ind_var));
omniout_float(ALWAYS, "y1[1] (closed_form) ", 33,
closed_form_val_y, 20, " ");
term_no := 1;
numeric_val := array_y1[term_no];
abserr := float_abs(numeric_val - closed_form_val_y);
omniout_float(ALWAYS, "y1[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)*33*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, " ");
closed_form_val_y := evalf(exact_soln_y2(ind_var));
omniout_float(ALWAYS, "y2[1] (closed_form) ", 33,
closed_form_val_y, 20, " ");
term_no := 1;
numeric_val := array_y2[term_no];
abserr := float_abs(numeric_val - closed_form_val_y);
omniout_float(ALWAYS, "y2[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[2]*100.0*
sqrt(glob_iter)*33*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[2] := glob_est_digits;
if glob_iter = 1 then array_1st_rel_error[2] := relerr
else array_last_rel_error[2] := relerr
end if;
array_est_rel_error[2] := 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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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 5
> 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 5;
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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_y1_higher[1,last_no-1],array_y1_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,1]) then # if number 8
> array_rad_test_poles[1,1] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_ratio(array_y1_higher[1,last_no-1],array_y1_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 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[2,1] := glob_larger_float;
> array_ord_test_poles[2,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_y2_higher[1,last_no-1],array_y2_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[2,1]) then # if number 10
> array_rad_test_poles[2,1] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_ratio(array_y2_higher[1,last_no-1],array_y2_higher[1,last_no],last_no);
> array_rad_test_poles[2,1] := rad_c;
> array_ord_test_poles[2,1] := tmp_ord;
> fi;# end if 10;
> fi;# end if 9;
> #BOTTOM general radius test2
> 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_y1_higher[1,last_no-2],array_y1_higher[1,last_no-1],array_y1_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 9
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 9;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 9
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 10
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 11
> found_sing := 0;
> fi;# end if 11;
> 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 11
> if (rad_c < array_rad_test_poles[1,2]) then # if number 12
> array_rad_test_poles[1,2] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_three_terms(array_y1_higher[1,last_no-2],array_y1_higher[1,last_no-1],array_y1_higher[1,last_no],last_no);
> array_rad_test_poles[1,2] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 13
> glob_min_pole_est := rad_c;
> fi;# end if 13;
> array_ord_test_poles[1,2] := tmp_ord;
> fi;# end if 12;
> fi;# end if 11;
> #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[2,2] := glob_larger_float;
> array_ord_test_poles[2,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_y2_higher[1,last_no-2],array_y2_higher[1,last_no-1],array_y2_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 11
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 11;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 11
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 12
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 13
> found_sing := 0;
> fi;# end if 13;
> 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 13
> if (rad_c < array_rad_test_poles[2,2]) then # if number 14
> array_rad_test_poles[2,2] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_three_terms(array_y2_higher[1,last_no-2],array_y2_higher[1,last_no-1],array_y2_higher[1,last_no],last_no);
> array_rad_test_poles[2,2] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 15
> glob_min_pole_est := rad_c;
> fi;# end if 15;
> array_ord_test_poles[2,2] := tmp_ord;
> fi;# end if 14;
> fi;# end if 13;
> #BOTTOM general radius test2
> 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_y1_higher[1,last_no-5],array_y1_higher[1,last_no-4],array_y1_higher[1,last_no-3],array_y1_higher[1,last_no-2],array_y1_higher[1,last_no-1],array_y1_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 13
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 13;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 13
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 14
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 15
> found_sing := 0;
> fi;# end if 15;
> 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 15
> if (rad_c < array_rad_test_poles[1,3]) then # if number 16
> array_rad_test_poles[1,3] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_six_terms(array_y1_higher[1,last_no-5],array_y1_higher[1,last_no-4],array_y1_higher[1,last_no-3],array_y1_higher[1,last_no-2],array_y1_higher[1,last_no-1],array_y1_higher[1,last_no],last_no);
> array_rad_test_poles[1,3] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 17
> glob_min_pole_est := rad_c;
> fi;# end if 17;
> array_ord_test_poles[1,3] := tmp_ord;
> fi;# end if 16;
> fi;# end if 15;
> #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[2,3] := glob_larger_float;
> array_ord_test_poles[2,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_y2_higher[1,last_no-5],array_y2_higher[1,last_no-4],array_y2_higher[1,last_no-3],array_y2_higher[1,last_no-2],array_y2_higher[1,last_no-1],array_y2_higher[1,last_no],last_no);
> if (float_abs(prev_tmp_rad) > glob__0) then # if number 15
> tmp_ratio := tmp_rad / prev_tmp_rad;
> else
> tmp_ratio := glob_large_float;
> fi;# end if 15;
> if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 15
> rad_c := tmp_rad;
> elif
> (cnt = 0) then # if number 16
> rad_c := tmp_rad;
> elif
> (cnt > 0) then # if number 17
> found_sing := 0;
> fi;# end if 17;
> 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 17
> if (rad_c < array_rad_test_poles[2,3]) then # if number 18
> array_rad_test_poles[2,3] := rad_c;
> last_no := last_no - 1;
> tmp_ord := comp_ord_from_six_terms(array_y2_higher[1,last_no-5],array_y2_higher[1,last_no-4],array_y2_higher[1,last_no-3],array_y2_higher[1,last_no-2],array_y2_higher[1,last_no-1],array_y2_higher[1,last_no],last_no);
> array_rad_test_poles[2,3] := rad_c;
> if (rad_c < glob_min_pole_est) then # if number 19
> glob_min_pole_est := rad_c;
> fi;# end if 19;
> array_ord_test_poles[2,3] := tmp_ord;
> fi;# end if 18;
> fi;# end if 17;
> #BOTTOM general radius test2
> #START ADJUST ALL SERIES
> if (float_abs(glob_min_pole_est) * glob_ratio_of_radius < float_abs(glob_h)) then # if number 17
> 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 18
> omniout_str(ALWAYS,"SETTING H FOR MIN H");
> h_new := glob_min_h;
> glob_h_reason := 5;
> fi;# end if 18;
> term := 1;
> ratio := c(1.0);
> while (term <= ATS_MAX_TERMS) do # do number 1
> array_y1[term] := array_y1[term]* ratio;
> array_y1_higher[1,term] := array_y1_higher[1,term]* ratio;
> array_x[term] := array_x[term]* ratio;
> array_y2[term] := array_y2[term]* ratio;
> array_y2_higher[1,term] := array_y2_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 17;
> #BOTTOM ADJUST ALL SERIES
> ;
> if (reached_interval()) then # if number 17
> display_poles();
> fi;# end if 17
> 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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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_y1_higher[1, last_no - 1],
array_y1_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_y1_higher[1, last_no - 1],
array_y1_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[2, 1] := glob_larger_float;
array_ord_test_poles[2, 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_y2_higher[1, last_no - 1],
array_y2_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[2, 1] then
array_rad_test_poles[2, 1] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_ratio(array_y2_higher[1, last_no - 1],
array_y2_higher[1, last_no], last_no);
array_rad_test_poles[2, 1] := rad_c;
array_ord_test_poles[2, 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_y1_higher[1, last_no - 2],
array_y1_higher[1, last_no - 1], array_y1_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_y1_higher[1, last_no - 2],
array_y1_higher[1, last_no - 1],
array_y1_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[2, 2] := glob_larger_float;
array_ord_test_poles[2, 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_y2_higher[1, last_no - 2],
array_y2_higher[1, last_no - 1], array_y2_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[2, 2] then
array_rad_test_poles[2, 2] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_three_terms(
array_y2_higher[1, last_no - 2],
array_y2_higher[1, last_no - 1],
array_y2_higher[1, last_no], last_no);
array_rad_test_poles[2, 2] := rad_c;
if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c
end if;
array_ord_test_poles[2, 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_y1_higher[1, last_no - 5],
array_y1_higher[1, last_no - 4],
array_y1_higher[1, last_no - 3],
array_y1_higher[1, last_no - 2],
array_y1_higher[1, last_no - 1], array_y1_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_y1_higher[1, last_no - 5],
array_y1_higher[1, last_no - 4],
array_y1_higher[1, last_no - 3],
array_y1_higher[1, last_no - 2],
array_y1_higher[1, last_no - 1],
array_y1_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;
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[2, 3] := glob_larger_float;
array_ord_test_poles[2, 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_y2_higher[1, last_no - 5],
array_y2_higher[1, last_no - 4],
array_y2_higher[1, last_no - 3],
array_y2_higher[1, last_no - 2],
array_y2_higher[1, last_no - 1], array_y2_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[2, 3] then
array_rad_test_poles[2, 3] := rad_c;
last_no := last_no - 1;
tmp_ord := comp_ord_from_six_terms(
array_y2_higher[1, last_no - 5],
array_y2_higher[1, last_no - 4],
array_y2_higher[1, last_no - 3],
array_y2_higher[1, last_no - 2],
array_y2_higher[1, last_no - 1],
array_y2_higher[1, last_no], last_no);
array_rad_test_poles[2, 3] := rad_c;
if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c
end if;
array_ord_test_poles[2, 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_y1[term] := array_y1[term]*ratio;
array_y1_higher[1, term] := array_y1_higher[1, term]*ratio;
array_x[term] := array_x[term]*ratio;
array_y2[term] := array_y2[term]*ratio;
array_y2_higher[1, term] := array_y2_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,
> array_const_1D0,
#END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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 neg FULL $eq_no = 1
> array_tmp1[1] := neg(array_y2[1]);
> #emit pre add CONST FULL $eq_no = 1 i = 1
> array_tmp2[1] := array_const_0D0[1] + array_tmp1[1];
> #emit pre add FULL - CONST $eq_no = 1 i = 1
> array_tmp3[1] := array_tmp2[1] + array_const_1D0[1];
> #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5
> if ( not array_y1_set_initial[1,2]) then # if number 1
> if (1 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp3[1]) * (expt((glob_h) , c(1))) * c(factorial_3(0,1));
> if (2 <= ATS_MAX_TERMS) then # if number 3
> array_y1[2] := temporary;
> array_y1_higher[1,2] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(1);
> array_y1_higher[2,1] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 2;
> #emit pre sub FULL - CONST $eq_no = 2 i = 1
> array_tmp5[1] := array_y1[1] - array_const_1D0[1];
> #emit pre assign xxx $eq_no = 2 i = 1 $min_hdrs = 5
> if ( not array_y2_set_initial[2,2]) then # if number 1
> if (1 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp5[1]) * (expt((glob_h) , c(1))) * c(factorial_3(0,1));
> if (2 <= ATS_MAX_TERMS) then # if number 3
> array_y2[2] := temporary;
> array_y2_higher[1,2] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(1);
> array_y2_higher[2,1] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 2;
> #END ATOMHDR1
> #BEGIN ATOMHDR2
> #emit pre neg FULL $eq_no = 1
> array_tmp1[2] := neg(array_y2[2]);
> #emit pre add CONST FULL $eq_no = 1 i = 2
> array_tmp2[2] := array_tmp1[2];
> #emit pre add FULL CONST $eq_no = 1 i = 2
> array_tmp3[2] := array_tmp2[2];
> #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5
> if ( not array_y1_set_initial[1,3]) then # if number 1
> if (2 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp3[2]) * (expt((glob_h) , c(1))) * c(factorial_3(1,2));
> if (3 <= ATS_MAX_TERMS) then # if number 3
> array_y1[3] := temporary;
> array_y1_higher[1,3] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(2);
> array_y1_higher[2,2] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 3;
> #emit pre sub FULL CONST $eq_no = 2 i = 2
> array_tmp5[2] := array_y1[2];
> #emit pre assign xxx $eq_no = 2 i = 2 $min_hdrs = 5
> if ( not array_y2_set_initial[2,3]) then # if number 1
> if (2 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp5[2]) * (expt((glob_h) , c(1))) * c(factorial_3(1,2));
> if (3 <= ATS_MAX_TERMS) then # if number 3
> array_y2[3] := temporary;
> array_y2_higher[1,3] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(2);
> array_y2_higher[2,2] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 3;
> #END ATOMHDR2
> #BEGIN ATOMHDR3
> #emit pre neg FULL $eq_no = 1
> array_tmp1[3] := neg(array_y2[3]);
> #emit pre add CONST FULL $eq_no = 1 i = 3
> array_tmp2[3] := array_tmp1[3];
> #emit pre add FULL CONST $eq_no = 1 i = 3
> array_tmp3[3] := array_tmp2[3];
> #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5
> if ( not array_y1_set_initial[1,4]) then # if number 1
> if (3 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp3[3]) * (expt((glob_h) , c(1))) * c(factorial_3(2,3));
> if (4 <= ATS_MAX_TERMS) then # if number 3
> array_y1[4] := temporary;
> array_y1_higher[1,4] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(3);
> array_y1_higher[2,3] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 4;
> #emit pre sub FULL CONST $eq_no = 2 i = 3
> array_tmp5[3] := array_y1[3];
> #emit pre assign xxx $eq_no = 2 i = 3 $min_hdrs = 5
> if ( not array_y2_set_initial[2,4]) then # if number 1
> if (3 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp5[3]) * (expt((glob_h) , c(1))) * c(factorial_3(2,3));
> if (4 <= ATS_MAX_TERMS) then # if number 3
> array_y2[4] := temporary;
> array_y2_higher[1,4] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(3);
> array_y2_higher[2,3] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 4;
> #END ATOMHDR3
> #BEGIN ATOMHDR4
> #emit pre neg FULL $eq_no = 1
> array_tmp1[4] := neg(array_y2[4]);
> #emit pre add CONST FULL $eq_no = 1 i = 4
> array_tmp2[4] := array_tmp1[4];
> #emit pre add FULL CONST $eq_no = 1 i = 4
> array_tmp3[4] := array_tmp2[4];
> #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5
> if ( not array_y1_set_initial[1,5]) then # if number 1
> if (4 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp3[4]) * (expt((glob_h) , c(1))) * c(factorial_3(3,4));
> if (5 <= ATS_MAX_TERMS) then # if number 3
> array_y1[5] := temporary;
> array_y1_higher[1,5] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(4);
> array_y1_higher[2,4] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 5;
> #emit pre sub FULL CONST $eq_no = 2 i = 4
> array_tmp5[4] := array_y1[4];
> #emit pre assign xxx $eq_no = 2 i = 4 $min_hdrs = 5
> if ( not array_y2_set_initial[2,5]) then # if number 1
> if (4 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp5[4]) * (expt((glob_h) , c(1))) * c(factorial_3(3,4));
> if (5 <= ATS_MAX_TERMS) then # if number 3
> array_y2[5] := temporary;
> array_y2_higher[1,5] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(4);
> array_y2_higher[2,4] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 5;
> #END ATOMHDR4
> #BEGIN ATOMHDR5
> #emit pre neg FULL $eq_no = 1
> array_tmp1[5] := neg(array_y2[5]);
> #emit pre add CONST FULL $eq_no = 1 i = 5
> array_tmp2[5] := array_tmp1[5];
> #emit pre add FULL CONST $eq_no = 1 i = 5
> array_tmp3[5] := array_tmp2[5];
> #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5
> if ( not array_y1_set_initial[1,6]) then # if number 1
> if (5 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp3[5]) * (expt((glob_h) , c(1))) * c(factorial_3(4,5));
> if (6 <= ATS_MAX_TERMS) then # if number 3
> array_y1[6] := temporary;
> array_y1_higher[1,6] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(5);
> array_y1_higher[2,5] := c(temporary);
> fi;# end if 2;
> fi;# end if 1;
> kkk := 6;
> #emit pre sub FULL CONST $eq_no = 2 i = 5
> array_tmp5[5] := array_y1[5];
> #emit pre assign xxx $eq_no = 2 i = 5 $min_hdrs = 5
> if ( not array_y2_set_initial[2,6]) then # if number 1
> if (5 <= ATS_MAX_TERMS) then # if number 2
> temporary := c(array_tmp5[5]) * (expt((glob_h) , c(1))) * c(factorial_3(4,5));
> if (6 <= ATS_MAX_TERMS) then # if number 3
> array_y2[6] := temporary;
> array_y2_higher[1,6] := temporary;
> fi;# end if 3;
> temporary := c(temporary) / c(glob_h) * c(5);
> array_y2_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 neg FULL $eq_no = 1
> array_tmp1[kkk] := neg(array_y2[kkk]);
> #emit NOT FULL - FULL add $eq_no = 1
> array_tmp2[kkk] := array_tmp1[kkk];
> #emit FULL - NOT FULL add $eq_no = 1
> array_tmp3[kkk] := array_tmp2[kkk];
> #emit assign $eq_no = 1
> order_d := 1;
> if (kkk + order_d <= ATS_MAX_TERMS) then # if number 1
> if ( not array_y1_set_initial[1,kkk + order_d]) then # if number 2
> temporary := c(array_tmp3[kkk]) * expt((glob_h) , c(order_d)) * c(factorial_3((kkk - 1),(kkk + order_d - 1)));
> array_y1[kkk + order_d] := c(temporary);
> array_y1_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_y1_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;
> #emit FULL - NOT FULL sub $eq_no = 2
> array_tmp5[kkk] := array_y1[kkk];
> #emit assign $eq_no = 2
> order_d := 1;
> if (kkk + order_d <= ATS_MAX_TERMS) then # if number 1
> if ( not array_y2_set_initial[2,kkk + order_d]) then # if number 2
> temporary := c(array_tmp5[kkk]) * expt((glob_h) , c(order_d)) * c(factorial_3((kkk - 1),(kkk + order_d - 1)));
> array_y2[kkk + order_d] := c(temporary);
> array_y2_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_y2_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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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] := neg(array_y2[1]);
array_tmp2[1] := array_const_0D0[1] + array_tmp1[1];
array_tmp3[1] := array_tmp2[1] + array_const_1D0[1];
if not array_y1_set_initial[1, 2] then
if 1 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp3[1])*expt(glob_h, c(1))*c(factorial_3(0, 1));
if 2 <= ATS_MAX_TERMS then
array_y1[2] := temporary;
array_y1_higher[1, 2] := temporary
end if;
temporary := c(temporary)*c(1)/c(glob_h);
array_y1_higher[2, 1] := c(temporary)
end if
end if;
kkk := 2;
array_tmp5[1] := array_y1[1] - array_const_1D0[1];
if not array_y2_set_initial[2, 2] then
if 1 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp5[1])*expt(glob_h, c(1))*c(factorial_3(0, 1));
if 2 <= ATS_MAX_TERMS then
array_y2[2] := temporary;
array_y2_higher[1, 2] := temporary
end if;
temporary := c(temporary)*c(1)/c(glob_h);
array_y2_higher[2, 1] := c(temporary)
end if
end if;
kkk := 2;
array_tmp1[2] := neg(array_y2[2]);
array_tmp2[2] := array_tmp1[2];
array_tmp3[2] := array_tmp2[2];
if not array_y1_set_initial[1, 3] then
if 2 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp3[2])*expt(glob_h, c(1))*c(factorial_3(1, 2));
if 3 <= ATS_MAX_TERMS then
array_y1[3] := temporary;
array_y1_higher[1, 3] := temporary
end if;
temporary := c(temporary)*c(2)/c(glob_h);
array_y1_higher[2, 2] := c(temporary)
end if
end if;
kkk := 3;
array_tmp5[2] := array_y1[2];
if not array_y2_set_initial[2, 3] then
if 2 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp5[2])*expt(glob_h, c(1))*c(factorial_3(1, 2));
if 3 <= ATS_MAX_TERMS then
array_y2[3] := temporary;
array_y2_higher[1, 3] := temporary
end if;
temporary := c(temporary)*c(2)/c(glob_h);
array_y2_higher[2, 2] := c(temporary)
end if
end if;
kkk := 3;
array_tmp1[3] := neg(array_y2[3]);
array_tmp2[3] := array_tmp1[3];
array_tmp3[3] := array_tmp2[3];
if not array_y1_set_initial[1, 4] then
if 3 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp3[3])*expt(glob_h, c(1))*c(factorial_3(2, 3));
if 4 <= ATS_MAX_TERMS then
array_y1[4] := temporary;
array_y1_higher[1, 4] := temporary
end if;
temporary := c(temporary)*c(3)/c(glob_h);
array_y1_higher[2, 3] := c(temporary)
end if
end if;
kkk := 4;
array_tmp5[3] := array_y1[3];
if not array_y2_set_initial[2, 4] then
if 3 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp5[3])*expt(glob_h, c(1))*c(factorial_3(2, 3));
if 4 <= ATS_MAX_TERMS then
array_y2[4] := temporary;
array_y2_higher[1, 4] := temporary
end if;
temporary := c(temporary)*c(3)/c(glob_h);
array_y2_higher[2, 3] := c(temporary)
end if
end if;
kkk := 4;
array_tmp1[4] := neg(array_y2[4]);
array_tmp2[4] := array_tmp1[4];
array_tmp3[4] := array_tmp2[4];
if not array_y1_set_initial[1, 5] then
if 4 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp3[4])*expt(glob_h, c(1))*c(factorial_3(3, 4));
if 5 <= ATS_MAX_TERMS then
array_y1[5] := temporary;
array_y1_higher[1, 5] := temporary
end if;
temporary := c(temporary)*c(4)/c(glob_h);
array_y1_higher[2, 4] := c(temporary)
end if
end if;
kkk := 5;
array_tmp5[4] := array_y1[4];
if not array_y2_set_initial[2, 5] then
if 4 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp5[4])*expt(glob_h, c(1))*c(factorial_3(3, 4));
if 5 <= ATS_MAX_TERMS then
array_y2[5] := temporary;
array_y2_higher[1, 5] := temporary
end if;
temporary := c(temporary)*c(4)/c(glob_h);
array_y2_higher[2, 4] := c(temporary)
end if
end if;
kkk := 5;
array_tmp1[5] := neg(array_y2[5]);
array_tmp2[5] := array_tmp1[5];
array_tmp3[5] := array_tmp2[5];
if not array_y1_set_initial[1, 6] then
if 5 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp3[5])*expt(glob_h, c(1))*c(factorial_3(4, 5));
if 6 <= ATS_MAX_TERMS then
array_y1[6] := temporary;
array_y1_higher[1, 6] := temporary
end if;
temporary := c(temporary)*c(5)/c(glob_h);
array_y1_higher[2, 5] := c(temporary)
end if
end if;
kkk := 6;
array_tmp5[5] := array_y1[5];
if not array_y2_set_initial[2, 6] then
if 5 <= ATS_MAX_TERMS then
temporary :=
c(array_tmp5[5])*expt(glob_h, c(1))*c(factorial_3(4, 5));
if 6 <= ATS_MAX_TERMS then
array_y2[6] := temporary;
array_y2_higher[1, 6] := temporary
end if;
temporary := c(temporary)*c(5)/c(glob_h);
array_y2_higher[2, 5] := c(temporary)
end if
end if;
kkk := 6;
while kkk <= ATS_MAX_TERMS do
array_tmp1[kkk] := neg(array_y2[kkk]);
array_tmp2[kkk] := array_tmp1[kkk];
array_tmp3[kkk] := array_tmp2[kkk];
order_d := 1;
if kkk + order_d <= ATS_MAX_TERMS then
if not array_y1_set_initial[1, kkk + order_d] then
temporary := c(array_tmp3[kkk])*expt(glob_h, c(order_d))*
c(factorial_3(kkk - 1, kkk + order_d - 1));
array_y1[kkk + order_d] := c(temporary);
array_y1_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_y1_higher[adj3, term] := c(temporary)
end if;
term := term - 1;
adj2 := adj2 - 1;
adj3 := adj3 + 1
end do
end if
end if;
array_tmp5[kkk] := array_y1[kkk];
order_d := 1;
if kkk + order_d <= ATS_MAX_TERMS then
if not array_y2_set_initial[2, kkk + order_d] then
temporary := c(array_tmp5[kkk])*expt(glob_h, c(order_d))*
c(factorial_3(kkk - 1, kkk + order_d - 1));
array_y2[kkk + order_d] := c(temporary);
array_y2_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_y2_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,
> array_const_1D0,
> #END CONST
> array_y1_init,
> array_y2_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_y1,
> array_x,
> array_y2,
> array_tmp0,
> array_tmp1,
> array_tmp2,
> array_tmp3,
> array_tmp4,
> array_tmp5,
> array_m1,
> array_y1_higher,
> array_y1_higher_work,
> array_y1_higher_work2,
> array_y1_set_initial,
> array_y2_higher,
> array_y2_higher_work,
> array_y2_higher_work2,
> array_y2_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 := 40;
> # before first input block
> #BEGIN FIRST INPUT BLOCK
> #BEGIN BLOCK 1
> #BEGIN FIRST INPUT BLOCK
> Digits:=32;
> max_terms:=40;
> #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_y1_init:= Array(0..(40),[]);
> array_y2_init:= Array(0..(40),[]);
> array_norms:= Array(0..(40),[]);
> array_fact_1:= Array(0..(40),[]);
> array_1st_rel_error:= Array(0..(3),[]);
> array_last_rel_error:= Array(0..(3),[]);
> array_est_rel_error:= Array(0..(3),[]);
> array_max_est_error:= Array(0..(3),[]);
> array_type_pole:= Array(0..(3),[]);
> array_type_real_pole:= Array(0..(3),[]);
> array_type_complex_pole:= Array(0..(3),[]);
> array_est_digits:= Array(0..(3),[]);
> array_y1:= Array(0..(40),[]);
> array_x:= Array(0..(40),[]);
> array_y2:= Array(0..(40),[]);
> array_tmp0:= Array(0..(40),[]);
> array_tmp1:= Array(0..(40),[]);
> array_tmp2:= Array(0..(40),[]);
> array_tmp3:= Array(0..(40),[]);
> array_tmp4:= Array(0..(40),[]);
> array_tmp5:= Array(0..(40),[]);
> array_m1:= Array(0..(40),[]);
> array_y1_higher := Array(0..(2) ,(0..40+ 1),[]);
> array_y1_higher_work := Array(0..(2) ,(0..40+ 1),[]);
> array_y1_higher_work2 := Array(0..(2) ,(0..40+ 1),[]);
> array_y1_set_initial := Array(0..(3) ,(0..40+ 1),[]);
> array_y2_higher := Array(0..(2) ,(0..40+ 1),[]);
> array_y2_higher_work := Array(0..(2) ,(0..40+ 1),[]);
> array_y2_higher_work2 := Array(0..(2) ,(0..40+ 1),[]);
> array_y2_set_initial := Array(0..(3) ,(0..40+ 1),[]);
> array_given_rad_poles := Array(0..(3) ,(0..3+ 1),[]);
> array_given_ord_poles := Array(0..(3) ,(0..3+ 1),[]);
> array_rad_test_poles := Array(0..(3) ,(0..4+ 1),[]);
> array_ord_test_poles := Array(0..(3) ,(0..4+ 1),[]);
> array_fact_2 := Array(0..(40) ,(0..40+ 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 <= 40) do # do number 1
> array_y1_init[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_y2_init[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_norms[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_fact_1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_1st_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_last_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_est_rel_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_max_est_error[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_type_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_type_real_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_type_complex_pole[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 3) do # do number 1
> array_est_digits[term] := 0;
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_y1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_x[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_y2[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp0[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp1[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp2[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp3[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp4[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) do # do number 1
> array_tmp5[term] := c(0.0);
> term := term + 1;
> od;# end do number 1;
> term := 1;
> while (term <= 40) 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 <= 40) do # do number 2
> array_y1_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 <= 40) do # do number 2
> array_y1_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 <= 40) do # do number 2
> array_y1_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 <=3) do # do number 1
> term := 1;
> while (term <= 40) do # do number 2
> array_y1_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 <= 40) do # do number 2
> array_y2_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 <= 40) do # do number 2
> array_y2_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 <= 40) do # do number 2
> array_y2_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 <=3) do # do number 1
> term := 1;
> while (term <= 40) do # do number 2
> array_y2_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 <=3) 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 <=3) 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 <=3) 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 <=3) 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 <=40) do # do number 1
> term := 1;
> while (term <= 40) 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_y1);
> zero_ats_ar(array_x);
> zero_ats_ar(array_y2);
> zero_ats_ar(array_tmp0);
> zero_ats_ar(array_tmp1);
> zero_ats_ar(array_tmp2);
> zero_ats_ar(array_tmp3);
> zero_ats_ar(array_tmp4);
> zero_ats_ar(array_tmp5);
> 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_const_1D0);
> array_const_1D0[1] := c(1.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_y1_set_initial[1,1] := true;
> array_y1_set_initial[1,2] := false;
> array_y1_set_initial[1,3] := false;
> array_y1_set_initial[1,4] := false;
> array_y1_set_initial[1,5] := false;
> array_y1_set_initial[1,6] := false;
> array_y1_set_initial[1,7] := false;
> array_y1_set_initial[1,8] := false;
> array_y1_set_initial[1,9] := false;
> array_y1_set_initial[1,10] := false;
> array_y1_set_initial[1,11] := false;
> array_y1_set_initial[1,12] := false;
> array_y1_set_initial[1,13] := false;
> array_y1_set_initial[1,14] := false;
> array_y1_set_initial[1,15] := false;
> array_y1_set_initial[1,16] := false;
> array_y1_set_initial[1,17] := false;
> array_y1_set_initial[1,18] := false;
> array_y1_set_initial[1,19] := false;
> array_y1_set_initial[1,20] := false;
> array_y1_set_initial[1,21] := false;
> array_y1_set_initial[1,22] := false;
> array_y1_set_initial[1,23] := false;
> array_y1_set_initial[1,24] := false;
> array_y1_set_initial[1,25] := false;
> array_y1_set_initial[1,26] := false;
> array_y1_set_initial[1,27] := false;
> array_y1_set_initial[1,28] := false;
> array_y1_set_initial[1,29] := false;
> array_y1_set_initial[1,30] := false;
> array_y1_set_initial[1,31] := false;
> array_y1_set_initial[1,32] := false;
> array_y1_set_initial[1,33] := false;
> array_y1_set_initial[1,34] := false;
> array_y1_set_initial[1,35] := false;
> array_y1_set_initial[1,36] := false;
> array_y1_set_initial[1,37] := false;
> array_y1_set_initial[1,38] := false;
> array_y1_set_initial[1,39] := false;
> array_y1_set_initial[1,40] := false;
> array_y2_set_initial[2,1] := true;
> array_y2_set_initial[2,2] := false;
> array_y2_set_initial[2,3] := false;
> array_y2_set_initial[2,4] := false;
> array_y2_set_initial[2,5] := false;
> array_y2_set_initial[2,6] := false;
> array_y2_set_initial[2,7] := false;
> array_y2_set_initial[2,8] := false;
> array_y2_set_initial[2,9] := false;
> array_y2_set_initial[2,10] := false;
> array_y2_set_initial[2,11] := false;
> array_y2_set_initial[2,12] := false;
> array_y2_set_initial[2,13] := false;
> array_y2_set_initial[2,14] := false;
> array_y2_set_initial[2,15] := false;
> array_y2_set_initial[2,16] := false;
> array_y2_set_initial[2,17] := false;
> array_y2_set_initial[2,18] := false;
> array_y2_set_initial[2,19] := false;
> array_y2_set_initial[2,20] := false;
> array_y2_set_initial[2,21] := false;
> array_y2_set_initial[2,22] := false;
> array_y2_set_initial[2,23] := false;
> array_y2_set_initial[2,24] := false;
> array_y2_set_initial[2,25] := false;
> array_y2_set_initial[2,26] := false;
> array_y2_set_initial[2,27] := false;
> array_y2_set_initial[2,28] := false;
> array_y2_set_initial[2,29] := false;
> array_y2_set_initial[2,30] := false;
> array_y2_set_initial[2,31] := false;
> array_y2_set_initial[2,32] := false;
> array_y2_set_initial[2,33] := false;
> array_y2_set_initial[2,34] := false;
> array_y2_set_initial[2,35] := false;
> array_y2_set_initial[2,36] := false;
> array_y2_set_initial[2,37] := false;
> array_y2_set_initial[2,38] := false;
> array_y2_set_initial[2,39] := false;
> array_y2_set_initial[2,40] := false;
> # before generate init omniout const
> ALWAYS := 1;
> INFO := 2;
> DEBUGL := 3;
> DEBUGMASSIVE := 4;
> ATS_MAX_TERMS := 40;
> glob_iolevel := INFO;
> # set default block
> #Write Set Defaults
> glob_orig_start_sec := elapsed_time_seconds();
> glob_display_flag := true;
> glob_no_eqs := 2;
> glob_iter := -1;
> opt_iter := -1;
> glob_max_iter := 50000;
> glob_max_hours := (0.0);
> glob_max_minutes := (15.0);
> omniout_str(ALWAYS,"##############ECHO OF PROBLEM#################");
> omniout_str(ALWAYS,"##############temp/mtest1postode.ode#################");
> omniout_str(ALWAYS,"diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ");
> omniout_str(ALWAYS,"diff ( y2 , x , 1 ) = y1 - 1.0 ; ");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"Digits:=32;");
> omniout_str(ALWAYS,"max_terms:=40;");
> omniout_str(ALWAYS,"!");
> omniout_str(ALWAYS,"#END FIRST INPUT BLOCK");
> omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK");
> omniout_str(ALWAYS,"x_start := c(0.1);");
> omniout_str(ALWAYS,"x_end := c(10.0);");
> omniout_str(ALWAYS,"array_y1_init[0 + 1] := exact_soln_y1(x_start);");
> omniout_str(ALWAYS,"array_y2_init[0 + 1] := exact_soln_y2(x_start);");
> omniout_str(ALWAYS,"glob_look_poles := true;");
> 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,"#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.005);");
> 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,"exact_soln_y1 := proc(x)");
> omniout_str(ALWAYS,"return(c(1.0) + cos(c(x)));");
> omniout_str(ALWAYS,"end;");
> omniout_str(ALWAYS,"exact_soln_y2 := proc(x)");
> omniout_str(ALWAYS,"return(c(1.0) + sin(c(x)));");
> omniout_str(ALWAYS,"end;");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"");
> omniout_str(ALWAYS,"#END USER DEF BLOCK");
> omniout_str(ALWAYS,"#######END OF ECHO OF PROBLEM#################");
> glob_unchanged_h_cnt := 0;
> glob_warned := false;
> glob_warned2 := false;
> glob_small_float := 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.1);
> x_end := c(10.0);
> array_y1_init[0 + 1] := exact_soln_y1(x_start);
> array_y2_init[0 + 1] := exact_soln_y2(x_start);
> glob_look_poles := true;
> 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.005);
> 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 17
> #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 18
> glob_display_interval := c(display_max);
> fi;# end if 18;
> 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_y1
> term_no := 1;
> while (term_no <= order_diff) do # do number 2
> array_y1[term_no] := array_y1_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 18
> array_y1_higher[r_order,term_no] := array_y1_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 18;
> term_no := term_no + 1;
> od;# end do number 3;
> r_order := r_order + 1;
> od;# end do number 2
> ;
> order_diff := 1;
> #Start Series array_y2
> term_no := 1;
> while (term_no <= order_diff) do # do number 2
> array_y2[term_no] := array_y2_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 18
> array_y2_higher[r_order,term_no] := array_y2_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 18;
> term_no := term_no + 1;
> od;# end do number 3;
> r_order := r_order + 1;
> od;# end do number 2
> ;
> if (glob_subiter_method = 1 ) then # if number 18
> atomall();
> elif
> (glob_subiter_method = 2 ) then # if number 19
> subiter := 1;
> while (subiter <= 2) do # do number 2
> atomall();
> subiter := subiter + 1;
> od;# end do number 2;
> else
> subiter := 1;
> while (subiter <= 2 + ATS_MAX_TERMS) do # do number 2
> atomall();
> subiter := subiter + 1;
> od;# end do number 2;
> fi;# end if 19;
> if (glob_check_sign * glob_min_h >= glob_check_sign * glob_h) then # if number 19
> 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 19;
> if (glob_check_sign * glob_display_interval <= glob_check_sign * glob_h) then # if number 19
> omniout_str(ALWAYS,"SETTING H FOR DISPLAY INTERVAL");
> glob_h_reason := 2;
> glob_h := glob_display_interval;
> found_h := true;
> fi;# end if 19;
> if (glob_look_poles) then # if number 19
> check_for_pole();
> fi;# end if 19;
> if ( not found_h) then # if number 19
> 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 20
> 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 20;
> fi;# end if 19;
> opt_iter := opt_iter + 1;
> od;# end do number 1;
> if (( not found_h) and (opt_iter = 1)) then # if number 19
> omniout_str(ALWAYS,"Beginning glob_h too large.");
> found_h := false;
> fi;# end if 19;
> if (glob_check_sign * glob_max_h <= glob_check_sign * glob_h) then # if number 19
> 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 19;
> else
> found_h := true;
> glob_h := glob_h * glob_check_sign;
> fi;# end if 18;
> #END OPTIMIZE CODE
> if (glob_html_log) then # if number 18
> html_log_file := fopen("entry.html",WRITE,TEXT);
> fi;# end if 18;
> #BEGIN SOLUTION CODE
> if (found_h) then # if number 18
> 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_y1
> term_no := 1;
> while (term_no <= order_diff) do # do number 1
> array_y1[term_no] := array_y1_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 19
> array_y1_higher[r_order,term_no] := array_y1_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 19;
> term_no := term_no + 1;
> od;# end do number 2;
> r_order := r_order + 1;
> od;# end do number 1
> ;
> order_diff := 1;
> #Start Series array_y2
> term_no := 1;
> while (term_no <= order_diff) do # do number 1
> array_y2[term_no] := array_y2_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 19
> array_y2_higher[r_order,term_no] := array_y2_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1)));
> fi;# end if 19;
> 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 19
> omniout_str(INFO," ");
> omniout_str(INFO,"TOP MAIN SOLVE Loop");
> fi;# end if 19;
> glob_iter := glob_iter + 1;
> glob_clock_sec := elapsed_time_seconds();
> track_estimated_error();
> if (glob_subiter_method = 1 ) then # if number 19
> atomall();
> elif
> (glob_subiter_method = 2 ) then # if number 20
> subiter := 1;
> while (subiter <= 2) do # do number 2
> atomall();
> subiter := subiter + 1;
> od;# end do number 2;
> else
> subiter := 1;
> while (subiter <= 2 + ATS_MAX_TERMS) do # do number 2
> atomall();
> subiter := subiter + 1;
> od;# end do number 2;
> fi;# end if 20;
> track_estimated_error();
> display_alot(current_iter);
> if (glob_look_poles) then # if number 20
> check_for_pole();
> fi;# end if 20;
> if (reached_interval()) then # if number 20
> glob_next_display := glob_next_display + glob_display_interval;
> fi;# end if 20;
> array_x[1] := array_x[1] + glob_h;
> array_x[2] := glob_h;
> #Jump Series array_y1;
> order_diff := 2;
> #START PART 1 SUM AND ADJUST
> #START SUM AND ADJUST EQ =1
> #sum_and_adjust array_y1
> #BEFORE ADJUST SUBSERIES EQ =1
> ord := 2;
> calc_term := 1;
> #adjust_subseriesarray_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y1_higher_work[2,iii] := array_y1_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_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y1_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y1_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_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y1_higher_work[1,iii] := array_y1_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_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y1_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y1_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_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y1_higher_work[1,iii] := array_y1_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_y1
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y1_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y1_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_y1[term_no] := array_y1_higher_work2[1,term_no];
> ord := 1;
> while (ord <= order_diff) do # do number 3
> array_y1_higher[ord,term_no] := array_y1_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
> #Jump Series array_y2;
> order_diff := 2;
> #START PART 1 SUM AND ADJUST
> #START SUM AND ADJUST EQ =2
> #sum_and_adjust array_y2
> #BEFORE ADJUST SUBSERIES EQ =2
> ord := 2;
> calc_term := 1;
> #adjust_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y2_higher_work[2,iii] := array_y2_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 =2
> #BEFORE SUM SUBSERIES EQ =2
> temp_sum := glob__0;
> ord := 2;
> calc_term := 1;
> #sum_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y2_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y2_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =2
> #BEFORE ADJUST SUBSERIES EQ =2
> ord := 1;
> calc_term := 2;
> #adjust_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y2_higher_work[1,iii] := array_y2_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 =2
> #BEFORE SUM SUBSERIES EQ =2
> temp_sum := glob__0;
> ord := 1;
> calc_term := 2;
> #sum_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y2_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y2_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =2
> #BEFORE ADJUST SUBSERIES EQ =2
> ord := 1;
> calc_term := 1;
> #adjust_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> array_y2_higher_work[1,iii] := array_y2_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 =2
> #BEFORE SUM SUBSERIES EQ =2
> temp_sum := glob__0;
> ord := 1;
> calc_term := 1;
> #sum_subseriesarray_y2
> iii := ATS_MAX_TERMS;
> while (iii >= calc_term) do # do number 2
> temp_sum := temp_sum + array_y2_higher_work[ord,iii];
> iii := iii - 1;
> od;# end do number 2;
> array_y2_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1));
> #AFTER SUM SUBSERIES EQ =2
> #END SUM AND ADJUST EQ =2
> #END PART 1
> #START PART 2 MOVE TERMS to REGULAR Array
> term_no := ATS_MAX_TERMS;
> while (term_no >= 1) do # do number 2
> array_y2[term_no] := array_y2_higher_work2[1,term_no];
> ord := 1;
> while (ord <= order_diff) do # do number 3
> array_y2_higher[ord,term_no] := array_y2_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 20
> omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!");
> fi;# end if 20;
> if (elapsed_time_seconds() - (glob_orig_start_sec) >= (glob_max_sec )) then # if number 20
> omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!");
> fi;# end if 20;
> glob_clock_sec := elapsed_time_seconds();
> omniout_str(INFO,"diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ");
> omniout_str(INFO,"diff ( y2 , x , 1 ) = y1 - 1.0 ; ");
> omniout_int(INFO,"Iterations ",32,glob_iter,4," ")
> ;
> prog_report(x_start,x_end);
> if (glob_html_log) then # if number 20
> logstart(html_log_file);
> logitem_str(html_log_file,"2015-05-02T21:34:56-05:00")
> ;
> logitem_str(html_log_file,"Maple")
> ;
> logitem_str(html_log_file,"mtest1")
> ;
> logitem_str(html_log_file,"diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ")
> ;
> 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 21
> logitem_integer(html_log_file,array_est_digits[1])
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 21;
> if (glob_min_good_digits <> -16) then # if number 21
> logitem_integer(html_log_file,glob_min_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 21;
> if (glob_good_digits <> -16) then # if number 21
> logitem_integer(html_log_file,glob_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 21;
> 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 21
> logitem_str(html_log_file,"Not Given")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 4) then # if number 22
> logitem_str(html_log_file,"No Solution")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 5) then # if number 23
> logitem_str(html_log_file,"Some Pole")
> ;
> logitem_str(html_log_file,"????")
> ;
> elif
> (glob_type_given_pole = 3) then # if number 24
> logitem_str(html_log_file,"No Pole")
> ;
> logitem_str(html_log_file,"NA")
> ;
> elif
> (glob_type_given_pole = 1) then # if number 25
> 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 26
> logitem_str(html_log_file,"Complex Sing")
> ;
> logitem_float(html_log_file,glob_least_given_sing)
> ;
> fi;# end if 26;
> if (glob_least_ratio_sing < glob_large_float) then # if number 26
> logitem_float(html_log_file,glob_least_ratio_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 26;
> if (glob_least_3_sing < glob_large_float) then # if number 26
> logitem_float(html_log_file,glob_least_3_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 26;
> if (glob_least_6_sing < glob_large_float) then # if number 26
> logitem_float(html_log_file,glob_least_6_sing)
> ;
> else
> logitem_str(html_log_file,"NONE")
> ;
> fi;# end if 26;
> 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 26
> logitem_time(html_log_file,(glob_total_exp_sec))
> ;
> 0;
> else
> logitem_str(html_log_file,"Done")
> ;
> 0;
> fi;# end if 26;
> log_revs(html_log_file," 308.maple.seems.ok | ")
> ;
> logitem_str(html_log_file,"mtest1 diffeq.mxt")
> ;
> logitem_str(html_log_file,"mtest1 maple results")
> ;
> logitem_str(html_log_file,"OK")
> ;
> logend(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logitem_str(html_log_file,"diff ( y2 , x , 1 ) = y1 - 1.0 ; ")
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> ;
> logditto(html_log_file)
> ;
> if (array_est_digits[2] <> -16) then # if number 26
> logitem_integer(html_log_file,array_est_digits[2])
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 26;
> if (glob_min_good_digits <> -16) then # if number 26
> logitem_integer(html_log_file,glob_min_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 26;
> if (glob_good_digits <> -16) then # if number 26
> logitem_integer(html_log_file,glob_good_digits)
> ;
> else
> logitem_str(html_log_file,"Unknown")
> ;
> fi;# end if 26;
> logitem_str(html_log_file,"NA")
> ;
> logitem_str(html_log_file,"NA")
> ;
> logditto(html_log_file)
> ;
> if (glob_type_given_pole = 0) then # if number 26
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> elif
> (glob_type_given_pole = 4) then # if number 27
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> elif
> (glob_type_given_pole = 5) then # if number 28
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> elif
> (glob_type_given_pole = 3) then # if number 29
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> elif
> (glob_type_given_pole = 1) then # if number 30
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> elif
> (glob_type_given_pole = 2) then # if number 31
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> fi;# end if 31;
> if (glob_least_ratio_sing < glob_large_float) then # if number 31
> logditto(html_log_file)
> ;
> else
> logditto(html_log_file)
> ;
> fi;# end if 31;
> if (glob_least_3_sing < glob_large_float) then # if number 31
> logditto(html_log_file)
> ;
> else
> logditto(html_log_file)
> ;
> fi;# end if 31;
> if (glob_least_6_sing < glob_large_float) then # if number 31
> logditto(html_log_file)
> ;
> else
> logditto(html_log_file)
> ;
> fi;# end if 31;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> if (c(glob_percent_done) < glob__100) then # if number 31
> logditto(html_log_file)
> ;
> 0;
> else
> logditto(html_log_file)
> ;
> 0;
> fi;# end if 31;
> logditto(html_log_file);
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logditto(html_log_file)
> ;
> logend(html_log_file)
> ;
> ;
> fi;# end if 30;
> if (glob_html_log) then # if number 30
> fclose(html_log_file);
> fi;# end if 30
> ;
> ;;
> fi;# end if 29
> #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_const_1D0,
array_y1_init, array_y2_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_y1, array_x, array_y2,
array_tmp0, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5,
array_m1, array_y1_higher, array_y1_higher_work, array_y1_higher_work2,
array_y1_set_initial, array_y2_higher, array_y2_higher_work,
array_y2_higher_work2, array_y2_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 := 40;
Digits := 32;
max_terms := 40;
glob_html_log := true;
array_y1_init := Array(0 .. 40, []);
array_y2_init := Array(0 .. 40, []);
array_norms := Array(0 .. 40, []);
array_fact_1 := Array(0 .. 40, []);
array_1st_rel_error := Array(0 .. 3, []);
array_last_rel_error := Array(0 .. 3, []);
array_est_rel_error := Array(0 .. 3, []);
array_max_est_error := Array(0 .. 3, []);
array_type_pole := Array(0 .. 3, []);
array_type_real_pole := Array(0 .. 3, []);
array_type_complex_pole := Array(0 .. 3, []);
array_est_digits := Array(0 .. 3, []);
array_y1 := Array(0 .. 40, []);
array_x := Array(0 .. 40, []);
array_y2 := Array(0 .. 40, []);
array_tmp0 := Array(0 .. 40, []);
array_tmp1 := Array(0 .. 40, []);
array_tmp2 := Array(0 .. 40, []);
array_tmp3 := Array(0 .. 40, []);
array_tmp4 := Array(0 .. 40, []);
array_tmp5 := Array(0 .. 40, []);
array_m1 := Array(0 .. 40, []);
array_y1_higher := Array(0 .. 2, 0 .. 41, []);
array_y1_higher_work := Array(0 .. 2, 0 .. 41, []);
array_y1_higher_work2 := Array(0 .. 2, 0 .. 41, []);
array_y1_set_initial := Array(0 .. 3, 0 .. 41, []);
array_y2_higher := Array(0 .. 2, 0 .. 41, []);
array_y2_higher_work := Array(0 .. 2, 0 .. 41, []);
array_y2_higher_work2 := Array(0 .. 2, 0 .. 41, []);
array_y2_set_initial := Array(0 .. 3, 0 .. 41, []);
array_given_rad_poles := Array(0 .. 3, 0 .. 4, []);
array_given_ord_poles := Array(0 .. 3, 0 .. 4, []);
array_rad_test_poles := Array(0 .. 3, 0 .. 5, []);
array_ord_test_poles := Array(0 .. 3, 0 .. 5, []);
array_fact_2 := Array(0 .. 40, 0 .. 41, []);
term := 1;
while term <= 40 do array_y1_init[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 40 do array_y2_init[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 40 do array_norms[term] := c(0.); term := term + 1 end do
;
term := 1;
while term <= 40 do array_fact_1[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 3 do array_1st_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 3 do
array_last_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 3 do array_est_rel_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 3 do array_max_est_error[term] := c(0.); term := term + 1
end do;
term := 1;
while term <= 3 do array_type_pole[term] := 0; term := term + 1 end do;
term := 1;
while term <= 3 do array_type_real_pole[term] := 0; term := term + 1
end do;
term := 1;
while term <= 3 do array_type_complex_pole[term] := 0; term := term + 1
end do;
term := 1;
while term <= 3 do array_est_digits[term] := 0; term := term + 1 end do
;
term := 1;
while term <= 40 do array_y1[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_x[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_y2[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp0[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp1[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp2[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp3[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp4[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_tmp5[term] := c(0.); term := term + 1 end do;
term := 1;
while term <= 40 do array_m1[term] := c(0.); term := term + 1 end do;
ord := 1;
while ord <= 2 do
term := 1;
while term <= 40 do
array_y1_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 <= 40 do
array_y1_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 <= 40 do
array_y1_higher_work2[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 3 do
term := 1;
while term <= 40 do
array_y1_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 <= 40 do
array_y2_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 <= 40 do
array_y2_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 <= 40 do
array_y2_higher_work2[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 3 do
term := 1;
while term <= 40 do
array_y2_set_initial[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
ord := 1;
while ord <= 3 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 <= 3 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 <= 3 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 <= 3 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 <= 40 do
term := 1;
while term <= 40 do
array_fact_2[ord, term] := c(0.); term := term + 1
end do;
ord := ord + 1
end do;
zero_ats_ar(array_y1);
zero_ats_ar(array_x);
zero_ats_ar(array_y2);
zero_ats_ar(array_tmp0);
zero_ats_ar(array_tmp1);
zero_ats_ar(array_tmp2);
zero_ats_ar(array_tmp3);
zero_ats_ar(array_tmp4);
zero_ats_ar(array_tmp5);
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_const_1D0);
array_const_1D0[1] := c(1.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_y1_set_initial[1, 1] := true;
array_y1_set_initial[1, 2] := false;
array_y1_set_initial[1, 3] := false;
array_y1_set_initial[1, 4] := false;
array_y1_set_initial[1, 5] := false;
array_y1_set_initial[1, 6] := false;
array_y1_set_initial[1, 7] := false;
array_y1_set_initial[1, 8] := false;
array_y1_set_initial[1, 9] := false;
array_y1_set_initial[1, 10] := false;
array_y1_set_initial[1, 11] := false;
array_y1_set_initial[1, 12] := false;
array_y1_set_initial[1, 13] := false;
array_y1_set_initial[1, 14] := false;
array_y1_set_initial[1, 15] := false;
array_y1_set_initial[1, 16] := false;
array_y1_set_initial[1, 17] := false;
array_y1_set_initial[1, 18] := false;
array_y1_set_initial[1, 19] := false;
array_y1_set_initial[1, 20] := false;
array_y1_set_initial[1, 21] := false;
array_y1_set_initial[1, 22] := false;
array_y1_set_initial[1, 23] := false;
array_y1_set_initial[1, 24] := false;
array_y1_set_initial[1, 25] := false;
array_y1_set_initial[1, 26] := false;
array_y1_set_initial[1, 27] := false;
array_y1_set_initial[1, 28] := false;
array_y1_set_initial[1, 29] := false;
array_y1_set_initial[1, 30] := false;
array_y1_set_initial[1, 31] := false;
array_y1_set_initial[1, 32] := false;
array_y1_set_initial[1, 33] := false;
array_y1_set_initial[1, 34] := false;
array_y1_set_initial[1, 35] := false;
array_y1_set_initial[1, 36] := false;
array_y1_set_initial[1, 37] := false;
array_y1_set_initial[1, 38] := false;
array_y1_set_initial[1, 39] := false;
array_y1_set_initial[1, 40] := false;
array_y2_set_initial[2, 1] := true;
array_y2_set_initial[2, 2] := false;
array_y2_set_initial[2, 3] := false;
array_y2_set_initial[2, 4] := false;
array_y2_set_initial[2, 5] := false;
array_y2_set_initial[2, 6] := false;
array_y2_set_initial[2, 7] := false;
array_y2_set_initial[2, 8] := false;
array_y2_set_initial[2, 9] := false;
array_y2_set_initial[2, 10] := false;
array_y2_set_initial[2, 11] := false;
array_y2_set_initial[2, 12] := false;
array_y2_set_initial[2, 13] := false;
array_y2_set_initial[2, 14] := false;
array_y2_set_initial[2, 15] := false;
array_y2_set_initial[2, 16] := false;
array_y2_set_initial[2, 17] := false;
array_y2_set_initial[2, 18] := false;
array_y2_set_initial[2, 19] := false;
array_y2_set_initial[2, 20] := false;
array_y2_set_initial[2, 21] := false;
array_y2_set_initial[2, 22] := false;
array_y2_set_initial[2, 23] := false;
array_y2_set_initial[2, 24] := false;
array_y2_set_initial[2, 25] := false;
array_y2_set_initial[2, 26] := false;
array_y2_set_initial[2, 27] := false;
array_y2_set_initial[2, 28] := false;
array_y2_set_initial[2, 29] := false;
array_y2_set_initial[2, 30] := false;
array_y2_set_initial[2, 31] := false;
array_y2_set_initial[2, 32] := false;
array_y2_set_initial[2, 33] := false;
array_y2_set_initial[2, 34] := false;
array_y2_set_initial[2, 35] := false;
array_y2_set_initial[2, 36] := false;
array_y2_set_initial[2, 37] := false;
array_y2_set_initial[2, 38] := false;
array_y2_set_initial[2, 39] := false;
array_y2_set_initial[2, 40] := false;
ALWAYS := 1;
INFO := 2;
DEBUGL := 3;
DEBUGMASSIVE := 4;
ATS_MAX_TERMS := 40;
glob_iolevel := INFO;
glob_orig_start_sec := elapsed_time_seconds();
glob_display_flag := true;
glob_no_eqs := 2;
glob_iter := -1;
opt_iter := -1;
glob_max_iter := 50000;
glob_max_hours := 0.;
glob_max_minutes := 15.0;
omniout_str(ALWAYS, "##############ECHO OF PROBLEM#################");
omniout_str(ALWAYS,
"##############temp/mtest1postode.ode#################");
omniout_str(ALWAYS,
"diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ");
omniout_str(ALWAYS, "diff ( y2 , x , 1 ) = y1 - 1.0 ; ");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK");
omniout_str(ALWAYS, "Digits:=32;");
omniout_str(ALWAYS, "max_terms:=40;");
omniout_str(ALWAYS, "!");
omniout_str(ALWAYS, "#END FIRST INPUT BLOCK");
omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK");
omniout_str(ALWAYS, "x_start := c(0.1);");
omniout_str(ALWAYS, "x_end := c(10.0);");
omniout_str(ALWAYS, "array_y1_init[0 + 1] := exact_soln_y1(x_start);");
omniout_str(ALWAYS, "array_y2_init[0 + 1] := exact_soln_y2(x_start);");
omniout_str(ALWAYS, "glob_look_poles := true;");
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, "#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.005);");
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, "exact_soln_y1 := proc(x)");
omniout_str(ALWAYS, "return(c(1.0) + cos(c(x)));");
omniout_str(ALWAYS, "end;");
omniout_str(ALWAYS, "exact_soln_y2 := proc(x)");
omniout_str(ALWAYS, "return(c(1.0) + sin(c(x)));");
omniout_str(ALWAYS, "end;");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "");
omniout_str(ALWAYS, "#END USER DEF BLOCK");
omniout_str(ALWAYS, "#######END OF ECHO OF PROBLEM#################");
glob_unchanged_h_cnt := 0;
glob_warned := false;
glob_warned2 := false;
glob_small_float := 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.1);
x_end := c(10.0);
array_y1_init[1] := exact_soln_y1(x_start);
array_y2_init[1] := exact_soln_y2(x_start);
glob_look_poles := true;
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.005);
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_y1[term_no] := array_y1_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_y1_higher[r_order, term_no] :=
array_y1_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;
order_diff := 1;
term_no := 1;
while term_no <= order_diff do
array_y2[term_no] := array_y2_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_y2_higher[r_order, term_no] :=
array_y2_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;
if glob_subiter_method = 1 then atomall()
elif glob_subiter_method = 2 then
subiter := 1;
while subiter <= 2 do atomall(); subiter := subiter + 1
end do
else
subiter := 1;
while subiter <= 2 + ATS_MAX_TERMS do
atomall(); subiter := subiter + 1
end do
end if;
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_y1[term_no] := array_y1_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_y1_higher[r_order, term_no] := array_y1_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;
order_diff := 1;
term_no := 1;
while term_no <= order_diff do
array_y2[term_no] := array_y2_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_y2_higher[r_order, term_no] := array_y2_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();
if glob_subiter_method = 1 then atomall()
elif glob_subiter_method = 2 then
subiter := 1;
while subiter <= 2 do atomall(); subiter := subiter + 1
end do
else
subiter := 1;
while subiter <= 2 + ATS_MAX_TERMS do
atomall(); subiter := subiter + 1
end do
end if;
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_y1_higher_work[2, iii] := array_y1_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_y1_higher_work[ord, iii];
iii := iii - 1
end do;
array_y1_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_y1_higher_work[1, iii] := array_y1_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_y1_higher_work[ord, iii];
iii := iii - 1
end do;
array_y1_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_y1_higher_work[1, iii] := array_y1_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_y1_higher_work[ord, iii];
iii := iii - 1
end do;
array_y1_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_y1[term_no] := array_y1_higher_work2[1, term_no];
ord := 1;
while ord <= order_diff do
array_y1_higher[ord, term_no] :=
array_y1_higher_work2[ord, term_no];
ord := ord + 1
end do;
term_no := term_no - 1
end do;
order_diff := 2;
ord := 2;
calc_term := 1;
iii := ATS_MAX_TERMS;
while calc_term <= iii do
array_y2_higher_work[2, iii] := array_y2_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_y2_higher_work[ord, iii];
iii := iii - 1
end do;
array_y2_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_y2_higher_work[1, iii] := array_y2_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_y2_higher_work[ord, iii];
iii := iii - 1
end do;
array_y2_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_y2_higher_work[1, iii] := array_y2_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_y2_higher_work[ord, iii];
iii := iii - 1
end do;
array_y2_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_y2[term_no] := array_y2_higher_work2[1, term_no];
ord := 1;
while ord <= order_diff do
array_y2_higher[ord, term_no] :=
array_y2_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 ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ");
omniout_str(INFO, "diff ( y2 , x , 1 ) = y1 - 1.0 ; ");
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-02T21:34:56-05:00");
logitem_str(html_log_file, "Maple");
logitem_str(html_log_file,
"mtest1");
logitem_str(html_log_file,
"diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ; ");
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,
"mtest1 diffeq.mxt");
logitem_str(html_log_file, "mtest1 maple results");
logitem_str(html_log_file, "OK");
logend(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logitem_str(html_log_file,
"diff ( y2 , x , 1 ) = y1 - 1.0 ; ");
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
if array_est_digits[2] <> -16 then
logitem_integer(html_log_file, array_est_digits[2])
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");
logditto(html_log_file);
if glob_type_given_pole = 0 then
logditto(html_log_file); logditto(html_log_file)
elif glob_type_given_pole = 4 then
logditto(html_log_file); logditto(html_log_file)
elif glob_type_given_pole = 5 then
logditto(html_log_file); logditto(html_log_file)
elif glob_type_given_pole = 3 then
logditto(html_log_file); logditto(html_log_file)
elif glob_type_given_pole = 1 then
logditto(html_log_file); logditto(html_log_file)
elif glob_type_given_pole = 2 then
logditto(html_log_file); logditto(html_log_file)
end if;
if glob_least_ratio_sing < glob_large_float then
logditto(html_log_file)
else logditto(html_log_file)
end if;
if glob_least_3_sing < glob_large_float then
logditto(html_log_file)
else logditto(html_log_file)
end if;
if glob_least_6_sing < glob_large_float then
logditto(html_log_file)
else logditto(html_log_file)
end if;
logditto(html_log_file);
logditto(html_log_file);
if c(glob_percent_done) < glob__100 then
logditto(html_log_file); 0
else logditto(html_log_file); 0
end if;
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logditto(html_log_file);
logend(html_log_file)
end if;
if glob_html_log then fclose(html_log_file) end if
end if
end proc
# End Function number 12
> main();
##############ECHO OF PROBLEM#################
##############temp/mtest1postode.ode#################
diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ;
diff ( y2 , x , 1 ) = y1 - 1.0 ;
!
#BEGIN FIRST INPUT BLOCK
Digits:=32;
max_terms:=40;
!
#END FIRST INPUT BLOCK
#BEGIN SECOND INPUT BLOCK
x_start := c(0.1);
x_end := c(10.0);
array_y1_init[0 + 1] := exact_soln_y1(x_start);
array_y2_init[0 + 1] := exact_soln_y2(x_start);
glob_look_poles := true;
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.005);
glob_display_interval:=c(0.01);
#END OVERRIDE BLOCK
!
#BEGIN USER DEF BLOCK
exact_soln_y1 := proc(x)
return(c(1.0) + cos(c(x)));
end;
exact_soln_y2 := proc(x)
return(c(1.0) + sin(c(x)));
end;
#END USER DEF BLOCK
#######END OF ECHO OF PROBLEM#################
START of Soultion
memory used=3.6MB, alloc=40.3MB, time=0.11
TOP MAIN SOLVE Loop
x[1] = 0.1
y1[1] (closed_form) = 1.9950041652780257660955619878039
y1[1] (numeric) = 1.9950041652780257660955619878039
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.0998334166468281523068141984106
y2[1] (numeric) = 1.0998334166468281523068141984106
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.01
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.09933
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.11
y1[1] (closed_form) = 1.9939560979566968503578396114198
y1[1] (numeric) = 1.9939560979566968503578396114199
absolute error = 1e-31
relative error = 5.0151555544515163299513758223921e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1097783008371748086649494900834
y2[1] (numeric) = 1.1097783008371748086649494900835
absolute error = 1e-31
relative error = 9.0108087286049636460847024873501e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.01
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1091
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.12
y1[1] (closed_form) = 1.9928086358538662522480981678576
y1[1] (numeric) = 1.9928086358538662522480981678576
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.119712207288919359967350614271
y2[1] (numeric) = 1.119712207288919359967350614271
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.01
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1189
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 2
memory used=45.4MB, alloc=40.3MB, time=0.58
TOP MAIN SOLVE Loop
x[1] = 0.13
y1[1] (closed_form) = 1.9915618937147880395945121711518
y1[1] (numeric) = 1.9915618937147880395945121711518
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1296341426196948595412058107083
y2[1] (numeric) = 1.1296341426196948595412058107083
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.02
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1285
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.14
y1[1] (closed_form) = 1.9902159962126371718989482270114
y1[1] (numeric) = 1.9902159962126371718989482270114
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1395431146442364817179883517054
y2[1] (numeric) = 1.1395431146442364817179883517053
absolute error = 1e-31
relative error = 8.7754468185453288747766003261553e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.02
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1382
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.15
y1[1] (closed_form) = 1.9887710779360422867349809986543
y1[1] (numeric) = 1.9887710779360422867349809986544
absolute error = 1e-31
relative error = 5.0282308059196314117533356413881e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1494381324735992214977254386876
y2[1] (numeric) = 1.1494381324735992214977254386875
absolute error = 1e-31
relative error = 8.6999027763938257948745204743370e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.02
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1478
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 2
memory used=87.1MB, alloc=40.3MB, time=1.03
TOP MAIN SOLVE Loop
x[1] = 0.16
y1[1] (closed_form) = 1.9872272833756269490409525240183
y1[1] (numeric) = 1.9872272833756269490409525240184
absolute error = 1e-31
relative error = 5.0321370301505636686694704794453e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.159318206614245963311463159686
y2[1] (numeric) = 1.1593182066142459633114631596859
absolute error = 1e-31
relative error = 8.6257594704776525046338123046309e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.03
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1573
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.17
y1[1] (closed_form) = 1.9855847669095607091719299902125
y1[1] (numeric) = 1.9855847669095607091719299902126
absolute error = 1e-31
relative error = 5.0362997171681461508806471945451e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1691823490669960101576243766708
y2[1] (numeric) = 1.1691823490669960101576243766708
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.03
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1667
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=128.6MB, alloc=40.3MB, time=1.50
x[1] = 0.18
y1[1] (closed_form) = 1.9838436927881214145927160246115
y1[1] (numeric) = 1.9838436927881214145927160246116
absolute error = 1e-31
relative error = 5.0407197080864074714095761345369e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1790295734258241783418027396992
y2[1] (numeric) = 1.1790295734258241783418027396992
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.03
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1761
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.19
y1[1] (closed_form) = 1.9820042351172703189678775041899
y1[1] (numeric) = 1.98200423511727031896787750419
absolute error = 1e-31
relative error = 5.0453978971484511380378270067106e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1888588949765005779928511529813
y2[1] (numeric) = 1.1888588949765005779928511529813
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.04
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1855
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.2
y1[1] (closed_form) = 1.9800665778412416311241965167482
y1[1] (numeric) = 1.9800665778412416311241965167482
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.1986693307950612154594126271184
y2[1] (numeric) = 1.1986693307950612154594126271183
absolute error = 1e-31
relative error = 8.3425843500702022187891560514118e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.04
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1947
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=170.3MB, alloc=40.3MB, time=1.95
x[1] = 0.21
y1[1] (closed_form) = 1.9780309147241482449161385680994
y1[1] (numeric) = 1.9780309147241482449161385680994
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2084598998460995706087124262276
y2[1] (numeric) = 1.2084598998460995706087124262276
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.04
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2039
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.22
y1[1] (closed_form) = 1.9758974493306054894060229810447
y1[1] (numeric) = 1.9758974493306054894060229810448
absolute error = 1e-31
relative error = 5.0609914008380343129064224226209e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.218229623080869319951791005457
y2[1] (numeric) = 1.218229623080869319951791005457
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.05
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.213
Order of pole (three term test) = 32.95
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.23
y1[1] (closed_form) = 1.9736663950053748369677306480716
y1[1] (numeric) = 1.9736663950053748369677306480717
absolute error = 1e-31
relative error = 5.0667124015012513028472330778856e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2279775235351883954046172123601
y2[1] (numeric) = 1.2279775235351883954046172123601
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.05
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.222
Order of pole (three term test) = 32.95
NO COMPLEX POLE (six term test) for Equation 2
memory used=211.9MB, alloc=40.3MB, time=2.42
TOP MAIN SOLVE Loop
x[1] = 0.24
y1[1] (closed_form) = 1.9713379748520296049261752469634
y1[1] (numeric) = 1.9713379748520296049261752469635
absolute error = 1e-31
relative error = 5.0726968828115883892711953865450e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2377026264271345883607920844898
y2[1] (numeric) = 1.2377026264271345883607920844898
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.06
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2309
Order of pole (three term test) = 32.94
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.25
y1[1] (closed_form) = 1.9689124217106447841445954494942
y1[1] (numeric) = 1.9689124217106447841445954494943
absolute error = 1e-31
relative error = 5.0789460667385740814118841642323e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2474039592545229295968487048494
y2[1] (numeric) = 1.2474039592545229295968487048494
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.06
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2397
Order of pole (three term test) = 32.94
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.26
y1[1] (closed_form) = 1.9663899781345132255582176464501
y1[1] (numeric) = 1.9663899781345132255582176464502
absolute error = 1e-31
relative error = 5.0854612315949965680138809769495e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2570805518921550973533884643652
y2[1] (numeric) = 1.2570805518921550973533884643652
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.07
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2484
Order of pole (three term test) = 32.93
NO COMPLEX POLE (six term test) for Equation 2
memory used=253.7MB, alloc=40.3MB, time=2.88
TOP MAIN SOLVE Loop
x[1] = 0.27
y1[1] (closed_form) = 1.9637708963658905130162327094922
y1[1] (numeric) = 1.9637708963658905130162327094923
absolute error = 1e-31
relative error = 5.0922437125969079111936446018648e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2667314366888311287322865210205
y2[1] (numeric) = 1.2667314366888311287322865210205
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.07
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2571
Order of pole (three term test) = 32.93
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.28
y1[1] (closed_form) = 1.9610554383107709479245900535965
y1[1] (numeric) = 1.9610554383107709479245900535966
absolute error = 1e-31
relative error = 5.0992949024500179833358581186582e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2763556485641137333196695584578
y2[1] (numeric) = 1.2763556485641137333196695584578
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.08
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2656
Order of pole (three term test) = 32.92
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=295.2MB, alloc=40.3MB, time=3.34
x[1] = 0.29
y1[1] (closed_form) = 1.9582438755126971680701247779319
y1[1] (numeric) = 1.958243875512697168070124777932
absolute error = 1e-31
relative error = 5.1066162519629238259191461445522e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.2859522251048355326839402055044
y2[1] (numeric) = 1.2859522251048355326839402055044
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.08
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.274
Order of pole (three term test) = 32.92
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.3
y1[1] (closed_form) = 1.955336489125606019642310227568
y1[1] (numeric) = 1.9553364891256060196423102275682
absolute error = 2e-31
relative error = 1.0228418541375284006057458660781e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.295520206661339575105320745685
y2[1] (numeric) = 1.2955202066613395751053207456851
absolute error = 1e-31
relative error = 7.7189070062988900384443781475276e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.09
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2823
Order of pole (three term test) = 32.91
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.31
y1[1] (closed_form) = 1.9523335698857133978428054362022
y1[1] (numeric) = 1.9523335698857133978428054362024
absolute error = 2e-31
relative error = 1.0244151055175867931257817440931e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.305058636443443501565643323959
y2[1] (numeric) = 1.305058636443443501565643323959
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.09
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2905
Order of pole (three term test) = 32.91
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=336.9MB, alloc=40.3MB, time=3.80
x[1] = 0.32
y1[1] (closed_form) = 1.9492354180824408675753072737661
y1[1] (numeric) = 1.9492354180824408675753072737663
absolute error = 2e-31
relative error = 1.0260433303471874928122818774541e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3145665606161177666617575434172
y2[1] (numeric) = 1.3145665606161177666617575434172
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.1
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2986
Order of pole (three term test) = 32.9
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.33
y1[1] (closed_form) = 1.9460423435283869715294105783662
y1[1] (numeric) = 1.9460423435283869715294105783664
absolute error = 2e-31
relative error = 1.0277268666075281350616725445343e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3240430283948683467001956961702
y2[1] (numeric) = 1.3240430283948683467001956961703
absolute error = 1e-31
relative error = 7.5526246394899695022278642984592e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.11
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3066
Order of pole (three term test) = 32.89
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.34
y1[1] (closed_form) = 1.9427546655283462285026440600266
y1[1] (numeric) = 1.9427546655283462285026440600268
absolute error = 2e-31
relative error = 1.0294660645975519957886314289830e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3334870921408143967817714870308
y2[1] (numeric) = 1.3334870921408143967817714870309
absolute error = 1e-31
relative error = 7.4991352064351394557937651507292e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.11
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3144
Order of pole (three term test) = 32.89
NO COMPLEX POLE (six term test) for Equation 2
memory used=378.6MB, alloc=40.3MB, time=4.26
TOP MAIN SOLVE Loop
x[1] = 0.35
y1[1] (closed_form) = 1.9393727128473789200350323573037
y1[1] (numeric) = 1.9393727128473789200350323573039
absolute error = 2e-31
relative error = 1.0312612870909214506215850713097e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3428978074554513491896349069176
y2[1] (numeric) = 1.3428978074554513491896349069177
absolute error = 1e-31
relative error = 7.4465830121118395126555205393477e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.12
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3221
Order of pole (three term test) = 32.88
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.36
y1[1] (closed_form) = 1.9358968236779348583509123681247
y1[1] (numeric) = 1.935896823677934858350912368125
absolute error = 3e-31
relative error = 1.5496693642486674606507844875758e-29 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3522742332750899768499134359207
y2[1] (numeric) = 1.3522742332750899768499134359208
absolute error = 1e-31
relative error = 7.3949497475677505164259935311850e-30 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.12
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3297
Order of pole (three term test) = 32.88
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.37
y1[1] (closed_form) = 1.9323273456060344232038129044909
y1[1] (numeric) = 1.9323273456060344232038129044911
absolute error = 2e-31
relative error = 1.0350213200407519209978648165456e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3616154319649619780372924691272
y2[1] (numeric) = 1.3616154319649619780372924691272
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.13
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3371
Order of pole (three term test) = 32.87
NO COMPLEX POLE (six term test) for Equation 2
memory used=420.3MB, alloc=40.3MB, time=4.73
TOP MAIN SOLVE Loop
x[1] = 0.38
y1[1] (closed_form) = 1.9286646355765102494925308077246
y1[1] (numeric) = 1.9286646355765102494925308077248
absolute error = 2e-31
relative error = 1.0369869199173481044712361719667e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3709204694129826718454854663492
y2[1] (numeric) = 1.3709204694129826718454854663492
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 13
Correct digits = 32
h = 0.005
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) = 32.14
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3445
Order of pole (three term test) = 32.86
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.39
y1[1] (closed_form) = 1.9249090598573130414506767528811
y1[1] (numeric) = 1.9249090598573130414506767528813
absolute error = 2e-31
relative error = 1.0390101234955240921477781782337e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3801884151231614282311820978472
y2[1] (numeric) = 1.3801884151231614282311820978472
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.14
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3516
Order of pole (three term test) = 32.86
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=461.9MB, alloc=40.3MB, time=5.19
x[1] = 0.4
y1[1] (closed_form) = 1.9210609940028850827985267320518
y1[1] (numeric) = 1.921060994002885082798526732052
absolute error = 2e-31
relative error = 1.0410913584959272590539665982747e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3894183423086504916663117567957
y2[1] (numeric) = 1.3894183423086504916663117567957
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.15
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3587
Order of pole (three term test) = 32.85
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.41
y1[1] (closed_form) = 1.917120822816605105475642058277
y1[1] (numeric) = 1.9171208228166051054756420582772
absolute error = 2e-31
relative error = 1.0432310661889478894613496025689e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.3986093279844228935937976400511
y2[1] (numeric) = 1.3986093279844228935937976400511
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.16
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3656
Order of pole (three term test) = 32.84
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.42
y1[1] (closed_form) = 1.9130889403123082724360887896657
y1[1] (numeric) = 1.9130889403123082724360887896659
absolute error = 2e-31
relative error = 1.0454297015974090864488178763314e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4077604530595701859727871580863
y2[1] (numeric) = 1.4077604530595701859727871580863
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.17
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3723
Order of pole (three term test) = 32.83
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=503.5MB, alloc=40.3MB, time=5.66
x[1] = 0.43
y1[1] (closed_form) = 1.9089657496748851224759104776634
y1[1] (numeric) = 1.9089657496748851224759104776637
absolute error = 3e-31
relative error = 1.5715316005595848452708833587064e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4168708024292107662169186726246
y2[1] (numeric) = 1.4168708024292107662169186726246
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.17
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3789
Order of pole (three term test) = 32.83
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.44
y1[1] (closed_form) = 1.9047516632199634171655373889984
y1[1] (numeric) = 1.9047516632199634171655373889987
absolute error = 3e-31
relative error = 1.5750084685205263712110303038599e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4259394650659996027697207507799
y2[1] (numeric) = 1.4259394650659996027697207507799
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.18
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3854
Order of pole (three term test) = 32.82
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.45
y1[1] (closed_form) = 1.9004471023526769216688406114864
y1[1] (numeric) = 1.9004471023526769216688406114867
absolute error = 3e-31
relative error = 1.5785759026316075331831431243503e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4349655341112302104208442462319
y2[1] (numeric) = 1.4349655341112302104208442462319
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.19
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3917
Order of pole (three term test) = 32.81
NO COMPLEX POLE (six term test) for Equation 2
memory used=545.1MB, alloc=40.3MB, time=6.14
TOP MAIN SOLVE Loop
x[1] = 0.46
y1[1] (closed_form) = 1.8960524975255252425363899035004
y1[1] (numeric) = 1.8960524975255252425363899035006
absolute error = 2e-31
relative error = 1.0548231141332495642983950217470e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4439481069655197652415136439289
y2[1] (numeric) = 1.4439481069655197652415136439289
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.2
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3978
Order of pole (three term test) = 32.8
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.47
y1[1] (closed_form) = 1.8915682881953289364540192765334
y1[1] (numeric) = 1.8915682881953289364540192765336
absolute error = 2e-31
relative error = 1.0573237098979500782675499140116e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4528862853790682907032748003964
y2[1] (numeric) = 1.4528862853790682907032748003964
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.21
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4038
Order of pole (three term test) = 32.79
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.48
y1[1] (closed_form) = 1.8869949227792841943999548311587
y1[1] (numeric) = 1.8869949227792841943999548311589
absolute error = 2e-31
relative error = 1.0598862645874398310359626801090e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4617791755414828891366429425886
y2[1] (numeric) = 1.4617791755414828891366429425886
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.21
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4096
Order of pole (three term test) = 32.79
NO COMPLEX POLE (six term test) for Equation 2
memory used=586.9MB, alloc=40.3MB, time=6.66
TOP MAIN SOLVE Loop
x[1] = 0.49
y1[1] (closed_form) = 1.8823328586101214957054681591367
y1[1] (numeric) = 1.8823328586101214957054681591368
absolute error = 1e-31
relative error = 5.3125566789413687071833591327687e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.470625888171158036181358337188
y2[1] (numeric) = 1.4706258881711580361813583371879
absolute error = 1e-31
relative error = 6.7998258975542766679485161382967e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.22
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4152
Order of pole (three term test) = 32.78
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.5
y1[1] (closed_form) = 1.8775825618903727161162815826038
y1[1] (numeric) = 1.877582561890372716116281582604
absolute error = 2e-31
relative error = 1.0651994967328498908487019298620e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4794255386042030002732879352156
y2[1] (numeric) = 1.4794255386042030002732879352155
absolute error = 1e-31
relative error = 6.7593804075024437477288862816615e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.23
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4207
Order of pole (three term test) = 32.77
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=628.5MB, alloc=40.3MB, time=7.19
x[1] = 0.51
y1[1] (closed_form) = 1.8727445076457512631058084735755
y1[1] (numeric) = 1.8727445076457512631058084735757
absolute error = 2e-31
relative error = 1.0679513365729867151987633282656e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4881772468829074945001302376746
y2[1] (numeric) = 1.4881772468829074945001302376745
absolute error = 1e-31
relative error = 6.7196296818444895062143521595631e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.24
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4261
Order of pole (three term test) = 32.76
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.52
y1[1] (closed_form) = 1.8678191796776499003878475719885
y1[1] (numeric) = 1.8678191796776499003878475719887
absolute error = 2e-31
relative error = 1.0707674606624191521611756445069e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.4968801378437367143344589425478
y2[1] (numeric) = 1.4968801378437367143344589425477
absolute error = 1e-31
relative error = 6.6805616209224672797258116287453e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.25
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4312
Order of pole (three term test) = 32.75
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.53
y1[1] (closed_form) = 1.8628070705147610118066950185642
y1[1] (numeric) = 1.8628070705147610118066950185644
absolute error = 2e-31
relative error = 1.0736484908484525005190792269169e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5055333412048469618136610224661
y2[1] (numeric) = 1.505533341204846961813661022466
absolute error = 1e-31
relative error = 6.6421644252642112677183443406037e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.26
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4362
Order of pole (three term test) = 32.74
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=670.1MB, alloc=40.3MB, time=7.70
x[1] = 0.54
y1[1] (closed_form) = 1.8577086813638241425379687789178
y1[1] (numeric) = 1.857708681363824142537968778918
absolute error = 2e-31
relative error = 1.0765950657730218806758766578607e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5141359916531131046772806829582
y2[1] (numeric) = 1.5141359916531131046772806829581
absolute error = 1e-31
relative error = 6.6044265872592697963164134977544e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.26
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.441
Order of pole (three term test) = 32.74
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.55
y1[1] (closed_form) = 1.8525245220595057428049817976178
y1[1] (numeric) = 1.852524522059505742804981797618
absolute error = 2e-31
relative error = 1.0796078411834146471138038153385e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5226872289306591677883781077573
y2[1] (numeric) = 1.5226872289306591677883781077572
absolute error = 1e-31
relative error = 6.5673368831120501930006458127376e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.27
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4456
Order of pole (three term test) = 32.73
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.56
y1[1] (closed_form) = 1.8472551110134161260945255038663
y1[1] (numeric) = 1.8472551110134161260945255038665
absolute error = 2e-31
relative error = 1.0826874902529229099584834949339e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.531186197920883403851869441112
y2[1] (numeric) = 1.5311861979208834038518694411119
absolute error = 1e-31
relative error = 6.5308843650618520927921390642438e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.28
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4501
Order of pole (three term test) = 32.72
NO COMPLEX POLE (six term test) for Equation 2
memory used=711.9MB, alloc=40.3MB, time=8.17
TOP MAIN SOLVE Loop
x[1] = 0.57
y1[1] (closed_form) = 1.841900975162268740133756363916
y1[1] (numeric) = 1.8419009751622687401337563639162
absolute error = 2e-31
relative error = 1.0858347039117034891643604791244e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5396320487339692409944634930788
y2[1] (numeric) = 1.5396320487339692409944634930787
absolute error = 1e-31
relative error = 6.4950583538599002648213903104095e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.29
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4543
Order of pole (three term test) = 32.71
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.58
y1[1] (closed_form) = 1.83646264991518693465788732805
y1[1] (numeric) = 1.8364626499151869346578873280502
absolute error = 2e-31
relative error = 1.0890501911881331673290929365454e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5480239367918735561826960595765
y2[1] (numeric) = 1.5480239367918735561826960595764
absolute error = 1e-31
relative error = 6.4598484314939022042044913285792e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.3
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4584
Order of pole (three term test) = 32.7
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.59
y1[1] (closed_form) = 1.8309406791001634952479965224907
y1[1] (numeric) = 1.8309406791001634952479965224908
absolute error = 1e-31
relative error = 5.4616733978047902132895212575369e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5563610229127837757225433788758
y2[1] (numeric) = 1.5563610229127837757225433788757
absolute error = 1e-31
relative error = 6.4252444341510507999957782976453e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.31
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4623
Order of pole (three term test) = 32.69
NO COMPLEX POLE (six term test) for Equation 2
memory used=753.7MB, alloc=40.3MB, time=8.64
TOP MAIN SOLVE Loop
x[1] = 0.6
y1[1] (closed_form) = 1.8253356149096782972409524989554
y1[1] (numeric) = 1.8253356149096782972409524989555
absolute error = 1e-31
relative error = 5.4784445766127356489621396798197e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5646424733950353572009454456587
y2[1] (numeric) = 1.5646424733950353572009454456586
absolute error = 1e-31
relative error = 6.3912364454107693316027321403364e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.32
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.466
Order of pole (three term test) = 32.68
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.61
y1[1] (closed_form) = 1.8196480178454795179007465786548
y1[1] (numeric) = 1.819648017845479517900746578655
absolute error = 2e-31
relative error = 1.0991136639535721315725263428320e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5728674601004812611909760321627
y2[1] (numeric) = 1.5728674601004812611909760321626
absolute error = 1e-31
relative error = 6.3578147896588557763897271865595e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4695
Order of pole (three term test) = 32.67
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=795.3MB, alloc=40.3MB, time=9.11
x[1] = 0.62
y1[1] (closed_form) = 1.8138784566625339286839996543607
y1[1] (numeric) = 1.8138784566625339286839996543609
absolute error = 2e-31
relative error = 1.1026097105094475286557172642480e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5810351605373050758429632275822
y2[1] (numeric) = 1.5810351605373050758429632275821
absolute error = 1e-31
relative error = 6.3249700257150267933501987728942e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.34
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4729
Order of pole (three term test) = 32.66
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.63
y1[1] (closed_form) = 1.8080275083121518725237089657771
y1[1] (numeric) = 1.8080275083121518725237089657773
absolute error = 2e-31
relative error = 1.1061778600188778265263196803500e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5891447579422695131181120907946
y2[1] (numeric) = 1.5891447579422695131181120907945
absolute error = 1e-31
relative error = 6.2926929406661895978534122377087e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.35
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.476
Order of pole (three term test) = 32.65
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.64
y1[1] (closed_form) = 1.8020957578842926135861107792603
y1[1] (numeric) = 1.8020957578842926135861107792606
absolute error = 3e-31
relative error = 1.6647284068423079729843529839840e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.5971954413623920518835462392079
y2[1] (numeric) = 1.5971954413623920518835462392078
absolute error = 1e-31
relative error = 6.2609745438980830325611501935312e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.36
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.479
Order of pole (three term test) = 32.64
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=837.0MB, alloc=40.3MB, time=9.58
x[1] = 0.65
y1[1] (closed_form) = 1.7960837985490558289176045706799
y1[1] (numeric) = 1.7960837985490558289176045706802
absolute error = 3e-31
relative error = 1.6703006855378980889622980697507e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6051864057360395603725216786059
y2[1] (numeric) = 1.6051864057360395603725216786058
absolute error = 1e-31
relative error = 6.2298060613182282000583355827126e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.37
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4818
Order of pole (three term test) = 32.63
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.66
y1[1] (closed_form) = 1.7899922314973650927838170912302
y1[1] (numeric) = 1.7899922314973650927838170912305
absolute error = 3e-31
relative error = 1.6759849273147060944544637298514e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6131168519734337886151454793963
y2[1] (numeric) = 1.6131168519734337886151454793961
absolute error = 2e-31
relative error = 1.2398357859526829489548511754486e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.38
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4844
Order of pole (three term test) = 32.62
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.67
y1[1] (closed_form) = 1.7838216658808492853029421448381
y1[1] (numeric) = 1.7838216658808492853029421448384
absolute error = 3e-31
relative error = 1.6817824659162905260838480918837e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6209859870365596803574439141266
y2[1] (numeric) = 1.6209859870365596803574439141264
absolute error = 2e-31
relative error = 1.2338169583170443819415541659175e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.39
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4867
Order of pole (three term test) = 32.61
NO COMPLEX POLE (six term test) for Equation 2
memory used=878.7MB, alloc=40.3MB, time=10.03
TOP MAIN SOLVE Loop
x[1] = 0.68
y1[1] (closed_form) = 1.7775727187509279371823940840443
y1[1] (numeric) = 1.7775727187509279371823940840446
absolute error = 3e-31
relative error = 1.6876946683272976088279824975587e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6287930240184685137041781874202
y2[1] (numeric) = 1.62879302401846851370417818742
absolute error = 2e-31
relative error = 1.2279030978814668933708383063574e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.4
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4889
Order of pole (three term test) = 32.6
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.69
y1[1] (closed_form) = 1.7712460149971066019735393154978
y1[1] (numeric) = 1.7712460149971066019735393154981
absolute error = 3e-31
relative error = 1.6937229354923351032063858840259e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6365371822219679402374292070087
y2[1] (numeric) = 1.6365371822219679402374292070085
absolute error = 2e-31
relative error = 1.2220926122097326231653112064013e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.41
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4909
Order of pole (three term test) = 32.59
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.7
y1[1] (closed_form) = 1.7648421872844884262558599901919
y1[1] (numeric) = 1.7648421872844884262558599901922
absolute error = 3e-31
relative error = 1.6998687030572479327442855138583e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6442176872376910536726143513987
y2[1] (numeric) = 1.6442176872376910536726143513985
absolute error = 2e-31
relative error = 1.2163839469213035037652054904255e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.42
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4927
Order of pole (three term test) = 32.58
NO COMPLEX POLE (six term test) for Equation 2
memory used=920.4MB, alloc=40.3MB, time=10.50
TOP MAIN SOLVE Loop
x[1] = 0.71
y1[1] (closed_form) = 1.7583618759905081665414579441396
y1[1] (numeric) = 1.7583618759905081665414579441399
absolute error = 3e-31
relative error = 1.7061334421334976296374047746554e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6518337710215366812101279728528
y2[1] (numeric) = 1.6518337710215366812101279728526
absolute error = 2e-31
relative error = 1.2107755847388616637106354746180e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.42
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4943
Order of pole (three term test) = 32.58
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.72
y1[1] (closed_form) = 1.751805729140894979445486962252
y1[1] (numeric) = 1.7518057291408949794454869622523
absolute error = 3e-31
relative error = 1.7125186600863746339461351151240e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6593846719714731536180038326482
y2[1] (numeric) = 1.659384671971473153618003832648
absolute error = 2e-31
relative error = 1.2052660445656945536150895065502e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.43
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4957
Order of pole (three term test) = 32.57
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.73
y1[1] (closed_form) = 1.7451744023448703887901321585503
y1[1] (numeric) = 1.7451744023448703887901321585506
absolute error = 3e-31
relative error = 1.7190259013478005787652371521656e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6668696350036978737325941307615
y2[1] (numeric) = 1.6668696350036978737325941307614
memory used=962.1MB, alloc=40.3MB, time=10.97
absolute error = 1e-31
relative error = 5.9992694029595274613422544528161e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.44
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4969
Order of pole (three term test) = 32.56
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.74
y1[1] (closed_form) = 1.7384685587295879097914245606988
y1[1] (numeric) = 1.7384685587295879097914245606991
absolute error = 3e-31
relative error = 1.7256567482545069417490884219023e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6742879116281450674838811576082
y2[1] (numeric) = 1.6742879116281450674838811576081
absolute error = 1e-31
relative error = 5.9726884071423515387464163167308e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.45
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4979
Order of pole (three term test) = 32.55
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.75
y1[1] (closed_form) = 1.7316888688738208863118387530001
y1[1] (numeric) = 1.7316888688738208863118387530004
absolute error = 3e-31
relative error = 1.7324128219124068957741356444844e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6816387600233341667332419527799
y2[1] (numeric) = 1.6816387600233341667332419527799
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.46
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4987
Order of pole (three term test) = 32.54
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1003.7MB, alloc=40.3MB, time=11.42
x[1] = 0.76
y1[1] (closed_form) = 1.724836010740905172339688366667
y1[1] (numeric) = 1.7248360107409051723396883666673
absolute error = 3e-31
relative error = 1.7392957830880089047314622841127e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6889214451105513391477556387697
y2[1] (numeric) = 1.6889214451105513391477556387697
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.47
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4994
Order of pole (three term test) = 32.53
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.77
y1[1] (closed_form) = 1.7179106696109433633712905653243
y1[1] (numeric) = 1.7179106696109433633712905653247
absolute error = 4e-31
relative error = 2.3284097775036715248581465042172e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.6961352386273567470198837344522
y2[1] (numeric) = 1.6961352386273567470198837344521
absolute error = 1e-31
relative error = 5.8957562889223208941784104220670e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.48
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4998
Order of pole (three term test) = 32.52
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.78
y1[1] (closed_form) = 1.7109135380122773572162650237646
y1[1] (numeric) = 1.7109135380122773572162650237649
absolute error = 3e-31
relative error = 1.7534492149061902376670639476877e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7032794192004101843678973251179
y2[1] (numeric) = 1.7032794192004101843678973251179
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.49
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.5
Order of pole (three term test) = 32.51
NO COMPLEX POLE (six term test) for Equation 2
memory used=1045.4MB, alloc=40.3MB, time=11.89
TOP MAIN SOLVE Loop
x[1] = 0.79
y1[1] (closed_form) = 1.703845315652236096912780861085
y1[1] (numeric) = 1.7038453156522360969127808610853
absolute error = 3e-31
relative error = 1.7607232138039436774134558190288e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7103532724176078098140288749692
y2[1] (numeric) = 1.7103532724176078098140288749692
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.5
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.5
Order of pole (three term test) = 32.5
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.8
y1[1] (closed_form) = 1.6967067093471654209207499816423
y1[1] (numeric) = 1.6967067093471654209207499816427
absolute error = 4e-31
relative error = 2.3575082116219501961008283703198e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7173560908995227616271746105814
y2[1] (numeric) = 1.7173560908995227616271746105814
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.51
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4998
Order of pole (three term test) = 32.49
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.81
y1[1] (closed_form) = 1.6894984329517470175496392406801
y1[1] (numeric) = 1.6894984329517470175496392406805
absolute error = 4e-31
relative error = 2.3675665641261012923761839836826e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7242871743701425109281768525145
y2[1] (numeric) = 1.7242871743701425109281768525146
absolute error = 1e-31
relative error = 5.7994979888734933269737662144258e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.52
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4994
Order of pole (three term test) = 32.48
NO COMPLEX POLE (six term test) for Equation 2
memory used=1087.0MB, alloc=40.3MB, time=12.34
TOP MAIN SOLVE Loop
x[1] = 0.82
y1[1] (closed_form) = 1.6822212072876135516665579784369
y1[1] (numeric) = 1.6822212072876135516665579784373
absolute error = 4e-31
relative error = 2.3778085680239020031373752737322e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7311458297268958793813133646877
y2[1] (numeric) = 1.7311458297268958793813133646878
absolute error = 1e-31
relative error = 5.7765208616639718042472695734813e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.53
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4988
Order of pole (three term test) = 32.47
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.83
y1[1] (closed_form) = 1.6748757600712671021124629178644
y1[1] (numeric) = 1.6748757600712671021124629178648
absolute error = 4e-31
relative error = 2.3882368444031916020691418513914e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7379313711099627187285802261381
y2[1] (numeric) = 1.7379313711099627187285802261382
absolute error = 1e-31
relative error = 5.7539671394580506308555960959128e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.54
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.498
Order of pole (three term test) = 32.46
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.84
y1[1] (closed_form) = 1.6674628258413081179226710368709
y1[1] (numeric) = 1.6674628258413081179226710368712
absolute error = 3e-31
relative error = 1.7991405586426602600450780880416e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7446431199708593212565726706296
y2[1] (numeric) = 1.7446431199708593212565726706298
absolute error = 2e-31
relative error = 1.1463662551418572589008316556134e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.55
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.497
Order of pole (three term test) = 32.45
NO COMPLEX POLE (six term test) for Equation 2
memory used=1128.8MB, alloc=40.3MB, time=12.81
TOP MAIN SOLVE Loop
x[1] = 0.85
y1[1] (closed_form) = 1.6599831458849821703954160294615
y1[1] (numeric) = 1.6599831458849821703954160294618
absolute error = 3e-31
relative error = 1.8072472647911243660031087991173e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7512804051402927027120715242355
y2[1] (numeric) = 1.7512804051402927027120715242357
absolute error = 2e-31
relative error = 1.1420215712627600074198630719120e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.56
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4958
Order of pole (three term test) = 32.44
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.86
y1[1] (closed_form) = 1.6524374681640518462720306642239
y1[1] (numeric) = 1.6524374681640518462720306642242
absolute error = 3e-31
relative error = 1.8154998647744072426691891521376e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7578425628952769722945887295286
y2[1] (numeric) = 1.7578425628952769722945887295289
absolute error = 3e-31
relative error = 1.7066374789894789024944712549379e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.57
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4944
Order of pole (three term test) = 32.43
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1170.5MB, alloc=40.3MB, time=13.27
x[1] = 0.87
y1[1] (closed_form) = 1.6448265472400011947776638054828
y1[1] (numeric) = 1.6448265472400011947776638054832
absolute error = 4e-31
relative error = 2.4318673641983411683418008682630e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7643289370255050781448028237228
y2[1] (numeric) = 1.7643289370255050781448028237231
absolute error = 3e-31
relative error = 1.7003632015794751450416008056913e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.58
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4929
Order of pole (three term test) = 32.42
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.88
y1[1] (closed_form) = 1.6371511441985802080154986057221
y1[1] (numeric) = 1.6371511441985802080154986057225
absolute error = 4e-31
relative error = 2.4432686097275910471724636865038e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.770738878898969291209645130756
y2[1] (numeric) = 1.7707388788989692912096451307563
absolute error = 3e-31
relative error = 1.6942080143772384163768237507404e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.59
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4911
Order of pole (three term test) = 32.41
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.89
y1[1] (closed_form) = 1.6294120265736968802035530573802
y1[1] (numeric) = 1.6294120265736968802035530573806
absolute error = 4e-31
relative error = 2.4548732516790979387410939579439e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7770717475268238654903337129732
y2[1] (numeric) = 1.7770717475268238654903337129735
absolute error = 3e-31
relative error = 1.6881704434135216271571042322522e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.6
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4891
Order of pole (three term test) = 32.4
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1212.3MB, alloc=40.3MB, time=13.73
x[1] = 0.9
y1[1] (closed_form) = 1.6216099682706644564847161514071
y1[1] (numeric) = 1.6216099682706644564847161514075
absolute error = 4e-31
relative error = 2.4666843928356736701397732916790e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7833269096274833884613823157136
y2[1] (numeric) = 1.7833269096274833884613823157139
absolute error = 3e-31
relative error = 1.6822490502465785793373763728809e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.61
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4869
Order of pole (three term test) = 32.39
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.91
y1[1] (closed_form) = 1.6137457494888115465211782261747
y1[1] (numeric) = 1.613745749488811546521178226175
absolute error = 3e-31
relative error = 1.8590289089531694276748317068891e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7895037396899504118789575178716
y2[1] (numeric) = 1.7895037396899504118789575178719
absolute error = 3e-31
relative error = 1.6764424311959137259478050328249e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.62
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4846
Order of pole (three term test) = 32.38
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.92
y1[1] (closed_form) = 1.6058201566434628417974047066744
y1[1] (numeric) = 1.6058201566434628417974047066747
absolute error = 3e-31
relative error = 1.8682042242331151813099074201194e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.7956016200363660302682761024816
y2[1] (numeric) = 1.795601620036366030268276102482
absolute error = 4e-31
relative error = 2.2276656221322570674434679028524e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.63
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.482
Order of pole (three term test) = 32.37
NO COMPLEX POLE (six term test) for Equation 2
memory used=1254.0MB, alloc=40.3MB, time=14.20
TOP MAIN SOLVE Loop
x[1] = 0.93
y1[1] (closed_form) = 1.597833982287298238494907084433
y1[1] (numeric) = 1.5978339822872982384949070844333
absolute error = 3e-31
relative error = 1.8775417429196881134791861746737e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8016199408837771520843192159106
y2[1] (numeric) = 1.801619940883777152084319215911
absolute error = 4e-31
relative error = 2.2202240934554802239238794693859e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.64
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4792
Order of pole (three term test) = 32.36
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.94
y1[1] (closed_form) = 1.589788025031098229960989815224
y1[1] (numeric) = 1.5897880250310982299609898152243
absolute error = 3e-31
relative error = 1.8870440289933095142290138514012e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8075581004051142868702197986342
y2[1] (numeric) = 1.8075581004051142868702197986345
absolute error = 3e-31
relative error = 1.6596976879070347751164341466741e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.65
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4763
Order of pole (three term test) = 32.35
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.95
y1[1] (closed_form) = 1.5816830894638834941661809737605
y1[1] (numeric) = 1.5816830894638834941661809737607
absolute error = 2e-31
relative error = 1.2644758063879322064650124534699e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8134155047893737506854221021026
y2[1] (numeric) = 1.8134155047893737506854221021029
absolute error = 3e-31
relative error = 1.6543367982002816033648135468284e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.66
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4732
Order of pole (three term test) = 32.34
NO COMPLEX POLE (six term test) for Equation 2
memory used=1295.7MB, alloc=40.3MB, time=14.66
TOP MAIN SOLVE Loop
x[1] = 0.96
y1[1] (closed_form) = 1.5735199860724566621250508003519
y1[1] (numeric) = 1.5735199860724566621250508003521
absolute error = 2e-31
relative error = 1.2710356510895343653297020475909e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8191915683009982716332221464304
y2[1] (numeric) = 1.8191915683009982716332221464308
absolute error = 4e-31
relative error = 2.1987788805198394352165869683459e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.67
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4698
Order of pole (three term test) = 32.33
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.97
y1[1] (closed_form) = 1.5652995311603543130365277548499
y1[1] (numeric) = 1.5652995311603543130365277548501
absolute error = 2e-31
relative error = 1.2777107257659515482921316588080e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8248857133384500574766200378563
y2[1] (numeric) = 1.8248857133384500574766200378567
absolute error = 4e-31
relative error = 2.1919180860276400212027427112133e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.68
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4663
Order of pole (three term test) = 32.32
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1337.3MB, alloc=40.3MB, time=15.13
x[1] = 0.98
y1[1] (closed_form) = 1.5570225467662173008766582673599
y1[1] (numeric) = 1.5570225467662173008766582673601
absolute error = 2e-31
relative error = 1.2845029149730704307483639366537e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8304973704919704680845332877192
y2[1] (numeric) = 1.8304973704919704680845332877195
absolute error = 3e-31
relative error = 1.6388988306460719881525192878224e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.69
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4626
Order of pole (three term test) = 32.31
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 0.99
y1[1] (closed_form) = 1.5486898605815875753431264086536
y1[1] (numeric) = 1.5486898605815875753431264086538
absolute error = 2e-31
relative error = 1.2914141500538587988858994933764e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8360259786005205167892594115471
y2[1] (numeric) = 1.8360259786005205167892594115474
absolute error = 3e-31
relative error = 1.6339638082281922971069528092607e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.7
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4587
Order of pole (three term test) = 32.3
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1
y1[1] (closed_form) = 1.540302305868139717400936607443
y1[1] (numeric) = 1.5403023058681397174009366074432
absolute error = 2e-31
relative error = 1.2984464104095248368837664988543e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8414709848078965066525023216303
y2[1] (numeric) = 1.8414709848078965066525023216306
absolute error = 3e-31
relative error = 1.6291323755573384831095083817743e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
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) = 32.71
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4546
Order of pole (three term test) = 32.29
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1379.1MB, alloc=40.3MB, time=15.58
x[1] = 1.01
y1[1] (closed_form) = 1.5318607213743554662067313557792
y1[1] (numeric) = 1.5318607213743554662067313557794
absolute error = 2e-31
relative error = 1.3056017248132318013964077817385e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.846831844618015190123098784782
y2[1] (numeric) = 1.8468318446180151901230987847823
absolute error = 3e-31
relative error = 1.6244034391883130209300307003103e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4504
Order of pole (three term test) = 32.72
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4504
Order of pole (three term test) = 32.28
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.02
y1[1] (closed_form) = 1.5233659512516495698896138080338
y1[1] (numeric) = 1.523365951251649569889613808034
absolute error = 2e-31
relative error = 1.3128821727679626770830986927370e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8521080219493629236165499854554
y2[1] (numeric) = 1.8521080219493629236165499854556
absolute error = 2e-31
relative error = 1.0798506222628306711379488779528e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.446
Order of pole (three term test) = 32.73
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.446
Order of pole (three term test) = 32.27
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.03
y1[1] (closed_form) = 1.5148188449699553475335022998374
y1[1] (numeric) = 1.5148188449699553475335022998376
absolute error = 2e-31
relative error = 1.3202898859101978301419954888288e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8572989891886033721462743852944
y2[1] (numeric) = 1.8572989891886033721462743852947
absolute error = 3e-31
relative error = 1.6152488196370620141231126033706e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4414
Order of pole (three term test) = 32.73
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4414
Order of pole (three term test) = 32.27
NO COMPLEX POLE (six term test) for Equation 2
memory used=1420.9MB, alloc=40.3MB, time=16.05
TOP MAIN SOLVE Loop
x[1] = 1.04
y1[1] (closed_form) = 1.5062202572327784037344734209922
y1[1] (numeric) = 1.5062202572327784037344734209924
absolute error = 2e-31
relative error = 1.3278270494611403563077827214457e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8624042272433384032807916921162
y2[1] (numeric) = 1.8624042272433384032807916921165
absolute error = 3e-31
relative error = 1.6108210860541745156533874337196e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4366
Order of pole (three term test) = 32.74
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4366
Order of pole (three term test) = 32.26
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.05
y1[1] (closed_form) = 1.4975710478917269902908495728121
y1[1] (numeric) = 1.4975710478917269902908495728123
absolute error = 2e-31
relative error = 1.3354959037272989274234396530284e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8674232255940168943814094850003
y2[1] (numeric) = 1.8674232255940168943814094850006
absolute error = 3e-31
relative error = 1.6064917469609583342420336456748e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4316
Order of pole (three term test) = 32.75
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4316
Order of pole (three term test) = 32.25
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.06
y1[1] (closed_form) = 1.4888720818605275619186375399564
y1[1] (numeric) = 1.4888720818605275619186375399566
absolute error = 2e-31
relative error = 1.3432987456523166582740481496900e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8723554823449862622829459219974
y2[1] (numeric) = 1.8723554823449862622829459219977
absolute error = 3e-31
relative error = 1.6022598423685670421078757209356e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4265
Order of pole (three term test) = 32.76
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4265
Order of pole (three term test) = 32.24
NO COMPLEX POLE (six term test) for Equation 2
memory used=1462.6MB, alloc=40.3MB, time=16.50
TOP MAIN SOLVE Loop
x[1] = 1.07
y1[1] (closed_form) = 1.4801242290285341243650930681759
y1[1] (numeric) = 1.4801242290285341243650930681761
absolute error = 2e-31
relative error = 1.3512379304220170351974605718951e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8772005042746816103070632577768
y2[1] (numeric) = 1.8772005042746816103070632577771
absolute error = 3e-31
relative error = 1.5981244375166780831163942443525e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4212
Order of pole (three term test) = 32.77
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4212
Order of pole (three term test) = 32.23
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.08
y1[1] (closed_form) = 1.471328364173740023913524788526
y1[1] (numeric) = 1.4713283641737400239135247885262
absolute error = 2e-31
relative error = 1.3593158731247244736031450166152e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8819578068849474737353349876248
y2[1] (numeric) = 1.881957806884947473735334987625
absolute error = 2e-31
relative error = 1.0627230816138424591468231301519e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4157
Order of pole (three term test) = 32.78
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4157
Order of pole (three term test) = 32.22
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1504.3MB, alloc=40.3MB, time=16.97
x[1] = 1.09
y1[1] (closed_form) = 1.4624853668753008770278970738751
y1[1] (numeric) = 1.4624853668753008770278970738753
absolute error = 2e-31
relative error = 1.3675350504690078184058136885999e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.886626914449487231608600628636
y2[1] (numeric) = 1.8866269144494872316086006286363
absolute error = 3e-31
relative error = 1.5901395114335004091510077726878e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4101
Order of pole (three term test) = 32.79
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4101
Order of pole (three term test) = 32.21
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.1
y1[1] (closed_form) = 1.4535961214255773877713700517847
y1[1] (numeric) = 1.4535961214255773877713700517849
absolute error = 2e-31
relative error = 1.3758980025610902976743740015516e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8912073600614353399518025778717
y2[1] (numeric) = 1.8912073600614353399518025778719
absolute error = 2e-31
relative error = 1.0575254952132962097259777888867e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.4042
Order of pole (three term test) = 32.79
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.4042
Order of pole (three term test) = 32.21
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.11
y1[1] (closed_form) = 1.4446615167417068486437375119336
y1[1] (numeric) = 1.4446615167417068486437375119338
absolute error = 2e-31
relative error = 1.3844073347442693271740424613815e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.8956986856800476292406259593394
y2[1] (numeric) = 1.8956986856800476292406259593395
absolute error = 1e-31
relative error = 5.2750999278203755255959132055767e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3983
Order of pole (three term test) = 32.8
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3983
Order of pole (three term test) = 32.2
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1546.0MB, alloc=40.3MB, time=17.42
x[1] = 1.12
y1[1] (closed_form) = 1.4356824462767121676139887939611
y1[1] (numeric) = 1.4356824462767121676139887939614
absolute error = 3e-31
relative error = 2.0895985792541915969706446406115e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9001004421765049971191032473392
y2[1] (numeric) = 1.9001004421765049971191032473393
absolute error = 1e-31
relative error = 5.2628796762687535009278191791115e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3922
Order of pole (three term test) = 32.81
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3922
Order of pole (three term test) = 32.19
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.13
y1[1] (closed_form) = 1.4266598079301573103712158356535
y1[1] (numeric) = 1.4266598079301573103712158356538
absolute error = 3e-31
relative error = 2.1028138476491419984745714892156e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9044121893788259160370815224114
y2[1] (numeric) = 1.9044121893788259160370815224116
absolute error = 2e-31
relative error = 1.0501928160060520093956115387760e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3859
Order of pole (three term test) = 32.82
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3859
Order of pole (three term test) = 32.18
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.14
y1[1] (closed_form) = 1.4175945039583580921751867408226
y1[1] (numeric) = 1.4175945039583580921751867408228
absolute error = 2e-31
relative error = 1.4108406842826967518564790674677e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9086334961158832645942155781022
y2[1] (numeric) = 1.9086334961158832645942155781024
absolute error = 2e-31
relative error = 1.0478701144405407575786964273514e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3794
Order of pole (three term test) = 32.83
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3794
Order of pole (three term test) = 32.17
NO COMPLEX POLE (six term test) for Equation 2
memory used=1587.6MB, alloc=40.3MB, time=17.89
TOP MAIN SOLVE Loop
x[1] = 1.15
y1[1] (closed_form) = 1.4084874408841572981525767188099
y1[1] (numeric) = 1.4084874408841572981525767188102
absolute error = 3e-31
relative error = 2.1299444445999419594735077591822e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9127639402605210809440330497537
y2[1] (numeric) = 1.9127639402605210809440330497538
absolute error = 1e-31
relative error = 5.2280366591593033891786913326237e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3729
Order of pole (three term test) = 32.83
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3729
Order of pole (three term test) = 32.17
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.16
y1[1] (closed_form) = 1.399339529406273154451639623394
y1[1] (numeric) = 1.3993395294062731544516396233943
absolute error = 3e-31
relative error = 2.1438685443788415725841780900984e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9168031087717669266186616668743
y2[1] (numeric) = 1.9168031087717669266186616668744
absolute error = 1e-31
relative error = 5.2170199193842691592236632260232e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3661
Order of pole (three term test) = 32.84
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3661
Order of pole (three term test) = 32.16
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.17
y1[1] (closed_form) = 1.3901516843082302153326619350505
y1[1] (numeric) = 1.3901516843082302153326619350508
absolute error = 3e-31
relative error = 2.1580378845441354859740031675453e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.920750597736135639573013008962
y2[1] (numeric) = 1.9207505977361356395730130089621
absolute error = 1e-31
relative error = 5.2062980023467661534376518088767e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3592
Order of pole (three term test) = 32.85
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3592
Order of pole (three term test) = 32.15
NO COMPLEX POLE (six term test) for Equation 2
memory used=1629.3MB, alloc=40.3MB, time=18.36
TOP MAIN SOLVE Loop
x[1] = 1.18
y1[1] (closed_form) = 1.3809248243668817730295994667128
y1[1] (numeric) = 1.3809248243668817730295994667131
absolute error = 3e-31
relative error = 2.1724571439835055577105851384952e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9246060124080203461075380258748
y2[1] (numeric) = 1.9246060124080203461075380258748
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3522
Order of pole (three term test) = 32.85
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3522
Order of pole (three term test) = 32.15
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.19
y1[1] (closed_form) = 1.3716598722605329380656795583505
y1[1] (numeric) = 1.3716598722605329380656795583508
absolute error = 3e-31
relative error = 2.1871311253393438209297156583831e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9283689672491666926020211116027
y2[1] (numeric) = 1.9283689672491666926020211116027
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.345
Order of pole (three term test) = 32.86
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.345
Order of pole (three term test) = 32.14
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1670.9MB, alloc=40.3MB, time=18.81
x[1] = 1.2
y1[1] (closed_form) = 1.3623577544766735776383733556231
y1[1] (numeric) = 1.3623577544766735776383733556235
absolute error = 4e-31
relative error = 2.9360863450559148927096145779283e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9320390859672263496701344354948
y2[1] (numeric) = 1.9320390859672263496701344354949
absolute error = 1e-31
relative error = 5.1758787245206034302078445797472e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3377
Order of pole (three term test) = 32.87
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3377
Order of pole (three term test) = 32.13
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.21
y1[1] (closed_form) = 1.3530194012193303387030107136648
y1[1] (numeric) = 1.3530194012193303387030107136652
absolute error = 4e-31
relative error = 2.9563508079745432829621517267472e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9356160015533859334164648885436
y2[1] (numeric) = 1.9356160015533859334164648885437
absolute error = 1e-31
relative error = 5.1663139754862124217132026262847e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3303
Order of pole (three term test) = 32.88
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3303
Order of pole (three term test) = 32.12
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.22
y1[1] (closed_form) = 1.3436457463160470204755229744352
y1[1] (numeric) = 1.3436457463160470204755229744356
absolute error = 4e-31
relative error = 2.9769751520942454374807709852952e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9390993563190675809352452718884
y2[1] (numeric) = 1.9390993563190675809352452718885
absolute error = 1e-31
relative error = 5.1570333244721875160883779481034e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3227
Order of pole (three term test) = 32.88
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3227
Order of pole (three term test) = 32.12
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1712.6MB, alloc=40.3MB, time=19.28
x[1] = 1.23
y1[1] (closed_form) = 1.3342377271245025982395472454977
y1[1] (numeric) = 1.3342377271245025982395472454981
absolute error = 4e-31
relative error = 2.9979664932880026275486508522914e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9424888019316975100238235653892
y2[1] (numeric) = 1.9424888019316975100238235653894
absolute error = 2e-31
relative error = 1.0296069650497396892637074186704e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.315
Order of pole (three term test) = 32.89
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.315
Order of pole (three term test) = 32.11
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.24
y1[1] (closed_form) = 1.3247962844387762365776934156974
y1[1] (numeric) = 1.3247962844387762365776934156978
absolute error = 4e-31
relative error = 3.0193321395783661534015365454805e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9457839994495389862847059630818
y2[1] (numeric) = 1.945783999449538986284705963082
absolute error = 2e-31
relative error = 1.0278633191380948165950190065184e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.3072
Order of pole (three term test) = 32.89
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.3072
Order of pole (three term test) = 32.11
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.25
y1[1] (closed_form) = 1.315322362395268665447538552438
y1[1] (numeric) = 1.3153223623952686654475385524384
absolute error = 4e-31
relative error = 3.0410795971839156841624316026615e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.948984619355586214348490847036
y2[1] (numeric) = 1.9489846193555862143484908470363
absolute error = 3e-31
relative error = 1.5392630450782737967385088966532e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2992
Order of pole (three term test) = 32.9
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2992
Order of pole (three term test) = 32.1
NO COMPLEX POLE (six term test) for Equation 2
memory used=1754.3MB, alloc=40.3MB, time=19.73
TOP MAIN SOLVE Loop
x[1] = 1.26
y1[1] (closed_form) = 1.3058169083782893268863424891765
y1[1] (numeric) = 1.3058169083782893268863424891769
absolute error = 4e-31
relative error = 3.0632165767922633324167130913002e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9520903415905157638568162214254
y2[1] (numeric) = 1.9520903415905157638568162214256
absolute error = 2e-31
relative error = 1.0245427465054965698656393611049e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2912
Order of pole (three term test) = 32.91
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2912
Order of pole (three term test) = 32.09
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.27
y1[1] (closed_form) = 1.296280872925318733551137016088
y1[1] (numeric) = 1.2962808729253187335511370160884
absolute error = 4e-31
relative error = 3.0857510000692942359190548534503e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9551008555846922350901817421829
y2[1] (numeric) = 1.9551008555846922350901817421831
absolute error = 2e-31
relative error = 1.0229651295415551500994207361943e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.283
Order of pole (three term test) = 32.91
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.283
Order of pole (three term test) = 32.09
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.28
y1[1] (closed_form) = 1.2867152096319555127793868935926
y1[1] (numeric) = 1.2867152096319555127793868935931
absolute error = 5e-31
relative error = 3.8858637580185056911148858948558e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9580158602892249637007538591603
y2[1] (numeric) = 1.9580158602892249637007538591605
absolute error = 2e-31
relative error = 1.0214421857157854793443467116100e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2747
Order of pole (three term test) = 32.92
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2747
Order of pole (three term test) = 32.08
NO COMPLEX POLE (six term test) for Equation 2
memory used=1796.0MB, alloc=40.3MB, time=20.20
TOP MAIN SOLVE Loop
x[1] = 1.29
y1[1] (closed_form) = 1.2771208750565576413866060900612
y1[1] (numeric) = 1.2771208750565576413866060900617
absolute error = 5e-31
relative error = 3.9150561999689917020843817828455e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9608350642060726589055612912854
y2[1] (numeric) = 1.9608350642060726589055612912856
absolute error = 2e-31
relative error = 1.0199736002832981408660400151615e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2663
Order of pole (three term test) = 32.92
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2663
Order of pole (three term test) = 32.08
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.3
y1[1] (closed_form) = 1.2674988286245874069979841092929
y1[1] (numeric) = 1.2674988286245874069979841092934
absolute error = 5e-31
relative error = 3.9447768211554843931490763461198e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9635581854171929647013486300396
y2[1] (numeric) = 1.9635581854171929647013486300398
absolute error = 2e-31
relative error = 1.0185590703924387764957058377219e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2578
Order of pole (three term test) = 32.93
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2578
Order of pole (three term test) = 32.07
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1837.3MB, alloc=40.3MB, time=20.67
x[1] = 1.31
y1[1] (closed_form) = 1.2578500325326696613381769786162
y1[1] (numeric) = 1.2578500325326696613381769786167
absolute error = 5e-31
relative error = 3.9750366662809120675566437863813e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9661849516127340291692578059375
y2[1] (numeric) = 1.9661849516127340291692578059378
absolute error = 3e-31
relative error = 1.5257974574260140272099709127253e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2491
Order of pole (three term test) = 32.93
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2491
Order of pole (three term test) = 32.07
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.32
y1[1] (closed_form) = 1.2481754516523729595739827294274
y1[1] (numeric) = 1.2481754516523729595739827294279
absolute error = 5e-31
relative error = 4.0058470893501763629220752979980e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9687151001182652627358998459728
y2[1] (numeric) = 1.9687151001182652627358998459731
absolute error = 3e-31
relative error = 1.5238365367440840330911248672796e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2404
Order of pole (three term test) = 32.94
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2404
Order of pole (three term test) = 32.06
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.33
y1[1] (closed_form) = 1.2384760534337232075157849860106
y1[1] (numeric) = 1.2384760534337232075157849860111
absolute error = 5e-31
relative error = 4.0372197638681061316968435110434e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9711483779210445623376830377638
y2[1] (numeric) = 1.9711483779210445623376830377642
absolute error = 4e-31
relative error = 2.0292739221482504807458698754311e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2316
Order of pole (three term test) = 32.94
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2316
Order of pole (three term test) = 32.06
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=1878.8MB, alloc=40.3MB, time=21.13
x[1] = 1.34
y1[1] (closed_form) = 1.2287528078084594652326394923001
y1[1] (numeric) = 1.2287528078084594652326394923007
absolute error = 6e-31
relative error = 4.8830000321230537016375129565286e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9734845416953193747878703480896
y2[1] (numeric) = 1.9734845416953193747878703480899
absolute error = 3e-31
relative error = 1.5201537871803413427986673744932e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2227
Order of pole (three term test) = 32.95
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2227
Order of pole (three term test) = 32.05
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.35
y1[1] (closed_form) = 1.2190066870930415814200221730106
y1[1] (numeric) = 1.2190066870930415814200221730112
absolute error = 6e-31
relative error = 4.9220402673164709142533578817631e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9757233578266590692611135392652
y2[1] (numeric) = 1.9757233578266590692611135392656
absolute error = 4e-31
relative error = 2.0245749406941726831426941862872e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2137
Order of pole (three term test) = 32.95
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2137
Order of pole (three term test) = 32.05
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.36
y1[1] (closed_form) = 1.2092386658914193576759752523919
y1[1] (numeric) = 1.2092386658914193576759752523924
absolute error = 5e-31
relative error = 4.1348330491186615995753397830937e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9778646024353161856784924394266
y2[1] (numeric) = 1.977864602435316185678492439427
absolute error = 4e-31
relative error = 2.0223831272751722420754618029620e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.2046
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.2046
Order of pole (three term test) = 32.04
NO COMPLEX POLE (six term test) for Equation 2
memory used=1920.2MB, alloc=40.3MB, time=21.58
TOP MAIN SOLVE Loop
x[1] = 1.37
y1[1] (closed_form) = 1.1994497209975729656881983896453
y1[1] (numeric) = 1.1994497209975729656881983896458
absolute error = 5e-31
relative error = 4.1685782342268911848835204614146e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9799080613986142228876885048919
y2[1] (numeric) = 1.9799080613986142228876885048924
absolute error = 5e-31
relative error = 2.5253697873566825609832035597813e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1954
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1954
Order of pole (three term test) = 32.04
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.38
y1[1] (closed_form) = 1.1896408312978343632091500735982
y1[1] (numeric) = 1.1896408312978343632091500735987
absolute error = 5e-31
relative error = 4.2029492166516074265932558355357e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.981853530372359727878131085206
y2[1] (numeric) = 1.9818535303723597278781310852065
absolute error = 5e-31
relative error = 2.5228907804607422605652357461232e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1862
Order of pole (three term test) = 32.96
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1862
Order of pole (three term test) = 32.04
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.39
y1[1] (closed_form) = 1.179812977672999476596163217804
y1[1] (numeric) = 1.1798129776729994765961632178045
absolute error = 5e-31
relative error = 4.2379598246679187494332188902706e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9837008148112765448400382244429
y2[1] (numeric) = 1.9837008148112765448400382244434
absolute error = 5e-31
relative error = 2.5205413854083057777681723276662e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1769
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1769
Order of pole (three term test) = 32.03
NO COMPLEX POLE (six term test) for Equation 2
memory used=1961.7MB, alloc=40.3MB, time=22.05
TOP MAIN SOLVE Loop
x[1] = 1.4
y1[1] (closed_form) = 1.1699671429002409386167480352036
y1[1] (numeric) = 1.169967142900240938616748035204
absolute error = 4e-31
relative error = 3.4188994317262345531294486042984e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9854497299884601806594745788061
y2[1] (numeric) = 1.9854497299884601806594745788066
absolute error = 5e-31
relative error = 2.5183211261808481904185786217706e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1675
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1675
Order of pole (three term test) = 32.03
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.41
y1[1] (closed_form) = 1.1601043115548311901635625493609
y1[1] (numeric) = 1.1601043115548311901635625493612
absolute error = 3e-31
relative error = 2.5859743560294560187284095730097e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9871001010138503414290888619422
y2[1] (numeric) = 1.9871001010138503414290888619427
absolute error = 5e-31
relative error = 2.5162295535332718306623448532494e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.158
Order of pole (three term test) = 32.97
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.158
Order of pole (three term test) = 32.03
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=2003.1MB, alloc=40.3MB, time=22.50
x[1] = 1.42
y1[1] (closed_form) = 1.1502254699116857734869821029759
y1[1] (numeric) = 1.1502254699116857734869821029761
absolute error = 2e-31
relative error = 1.7387895263296159248557909237100e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9886517628517197927362734733357
y2[1] (numeric) = 1.9886517628517197927362734733362
absolute error = 5e-31
relative error = 2.5142662447999529015051230936282e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1485
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1485
Order of pole (three term test) = 32.02
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.43
y1[1] (closed_form) = 1.1403316058467366625338976245749
y1[1] (numeric) = 1.1403316058467366625338976245751
absolute error = 2e-31
relative error = 1.7538757934495107360946728244579e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9901045603371777948572914954818
y2[1] (numeric) = 1.9901045603371777948572914954823
absolute error = 5e-31
relative error = 2.5124308037125768516769092605299e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1389
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1389
Order of pole (three term test) = 32.02
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.44
y1[1] (closed_form) = 1.1304237087381454929775201561292
y1[1] (numeric) = 1.1304237087381454929775201561294
absolute error = 2e-31
relative error = 1.7692481009908520852559526468439e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.991458348191686462527604463958
y2[1] (numeric) = 1.9914583481916864625276044639585
absolute error = 5e-31
relative error = 2.5107228602296272663672068188859e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1293
Order of pole (three term test) = 32.98
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1293
Order of pole (three term test) = 32.02
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
memory used=2044.4MB, alloc=40.3MB, time=22.97
x[1] = 1.45
y1[1] (closed_form) = 1.120502769367366570532866627248
y1[1] (numeric) = 1.1205027693673665705328666272483
absolute error = 3e-31
relative error = 2.6773695541098871919499383718269e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.992712991037588497665354134323
y2[1] (numeric) = 1.9927129910375884976653541343235
absolute error = 5e-31
relative error = 2.5091420703774019402403630880791e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1196
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1196
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.46
y1[1] (closed_form) = 1.1105697798200695511746481091234
y1[1] (numeric) = 1.1105697798200695511746481091236
absolute error = 2e-31
relative error = 1.8008773841514332183699371263908e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.99386836341164484228683230125
y2[1] (numeric) = 1.9938683634116448422868323012505
absolute error = 5e-31
relative error = 2.5076881161024385645174350299552e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1099
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1099
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.47
y1[1] (closed_form) = 1.1006257333869317009069746014624
y1[1] (numeric) = 1.1006257333869317009069746014626
absolute error = 2e-31
relative error = 1.8171481361292938086225480976158e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9949243497775808978599284627356
y2[1] (numeric) = 1.994924349777580897859928462736
absolute error = 4e-31
relative error = 2.0050885641081928736497048258125e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.1001
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.1001
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
memory used=2085.9MB, alloc=40.3MB, time=23.42
TOP MAIN SOLVE Loop
x[1] = 1.48
y1[1] (closed_form) = 1.0906716244643096557762265406478
y1[1] (numeric) = 1.090671624464309655776226540648
absolute error = 2e-31
relative error = 1.8337324957750805994206295932907e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9958808445376400564840751325627
y2[1] (numeric) = 1.9958808445376400564840751325631
absolute error = 4e-31
relative error = 2.0041276566921650827040690957641e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.0903
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.0903
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.49
y1[1] (closed_form) = 1.0807084484548006148683184845637
y1[1] (numeric) = 1.0807084484548006148683184845638
absolute error = 1e-31
relative error = 9.2531894372603662245462113142182e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9967377520431433885532007170437
y2[1] (numeric) = 1.9967377520431433885532007170441
absolute error = 4e-31
relative error = 2.0032675777813271136648249062209e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.08045
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.08045
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.5
y1[1] (closed_form) = 1.0707372016677029100881898514343
y1[1] (numeric) = 1.0707372016677029100881898514343
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9974949866040544309417233711415
y2[1] (numeric) = 1.9974949866040544309417233711419
absolute error = 4e-31
relative error = 2.0025081548767282242628755624216e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.07056
Order of pole (three term test) = 32.99
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.07056
Order of pole (three term test) = 32.01
NO COMPLEX POLE (six term test) for Equation 2
memory used=2127.3MB, alloc=40.3MB, time=23.89
TOP MAIN SOLVE Loop
x[1] = 1.51
y1[1] (closed_form) = 1.0607588812193859065815955149162
y1[1] (numeric) = 1.0607588812193859065815955149162
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9981524724975481192427378648367
y2[1] (numeric) = 1.9981524724975481192427378648371
absolute error = 4e-31
relative error = 2.0018492357594138980903512698752e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.06065
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.06065
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
TOP MAIN SOLVE Loop
x[1] = 1.52
y1[1] (closed_form) = 1.0507744849335791967261292701527
y1[1] (numeric) = 1.0507744849335791967261292701528
absolute error = 1e-31
relative error = 9.5167898948670349845863684406231e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
y2[1] (closed_form) = 1.9987101439755830071723123941168
y2[1] (numeric) = 1.9987101439755830071723123941172
absolute error = 4e-31
relative error = 2.0012906884255376553416863751633e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.005
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.05071
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.05071
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
TOP MAIN SOLVE Loop
memory used=2168.9MB, alloc=40.3MB, time=24.34
x[1] = 1.5295732321116218510026700794348
y1[1] (closed_form) = 1.0412114203086819518220271951387
y1[1] (numeric) = 1.0412114203086819518220271951387
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0045732321116218510026700794348227
y2[1] (closed_form) = 1.9991504485492368314872334919759
y2[1] (numeric) = 1.9991504485492368314872334919762
absolute error = 3e-31
relative error = 1.5006374343547127826489055735201e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0045732321116218510026700794348227
SETTING H FOR POLE
TOP MAIN SOLVE Loop
x[1] = 1.5336908730202989210390622783871
y1[1] (closed_form) = 1.0370969398050267041466639790075
y1[1] (numeric) = 1.0370969398050267041466639790076
absolute error = 1e-31
relative error = 9.6423001709753295038574170493582e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.004117640908677070036392198952292
y2[1] (closed_form) = 1.999311671630579037778546269655
y2[1] (numeric) = 1.9993116716305790377785462696553
absolute error = 3e-31
relative error = 1.5005164240117146783643158240374e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.004117640908677070036392198952292
SETTING H FOR POLE
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.03707
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.03707
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
TOP MAIN SOLVE Loop
x[1] = 1.5407353617914117549724962276967
y1[1] (closed_form) = 1.0300564377180061034185253043823
y1[1] (numeric) = 1.0300564377180061034185253043823
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0033373482782188136807131692197971
y2[1] (closed_form) = 1.9995482032156846511843104107952
y2[1] (numeric) = 1.9995482032156846511843104107955
absolute error = 3e-31
relative error = 1.5003389241506572084805709208132e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0033373482782188136807131692197971
SETTING H FOR POLE
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.03004
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.03004
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2211.7MB, alloc=40.3MB, time=24.81
SETTING H FOR POLE
TOP MAIN SOLVE Loop
x[1] = 1.5510693699425273269041131743915
y1[1] (closed_form) = 1.0197256774104277342216985831942
y1[1] (numeric) = 1.0197256774104277342216985831942
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0021911042091072126909989137502671
y2[1] (closed_form) = 1.9998054298965872994841890101891
y2[1] (numeric) = 1.9998054298965872994841890101893
absolute error = 2e-31
relative error = 1.0000972945170084681711061345645e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.0021911042091072126909989137502671
SETTING H FOR POLE
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.01972
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.01972
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2254.3MB, alloc=40.3MB, time=25.27
SETTING H FOR POLE
SETTING H FOR POLE
TOP MAIN SOLVE Loop
x[1] = 1.5603114716964416830381220255679
y1[1] (closed_form) = 1.0104846629956699475983719105279
y1[1] (numeric) = 1.0104846629956699475983719105279
absolute error = 0
relative error = 0 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.00116486678790428521655293749583
y2[1] (closed_form) = 1.9999450344103255905124185969785
y2[1] (numeric) = 1.9999450344103255905124185969788
absolute error = 3e-31
relative error = 1.5000412253252429628650722804205e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 0.00116486678790428521655293749583
SETTING H FOR POLE
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.01048
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.01048
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2297.0MB, alloc=40.3MB, time=25.75
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2339.4MB, alloc=40.3MB, time=26.20
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2382.0MB, alloc=40.3MB, time=26.66
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2424.5MB, alloc=40.3MB, time=27.11
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
TOP MAIN SOLVE Loop
memory used=2467.0MB, alloc=40.3MB, time=27.56
x[1] = 1.5700435890621976307931942460508
y1[1] (closed_form) = 1.0007527376616136890178427251251
y1[1] (numeric) = 1.000752737661613689017842725125
absolute error = 1e-31
relative error = 9.9924782852618264478023961973228e-30 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 8.3637482517366379525470504329593e-05
y2[1] (closed_form) = 1.9999997166929662627400209368907
y2[1] (numeric) = 1.9999997166929662627400209368912
absolute error = 5e-31
relative error = 2.5000003541338423358791829071016e-29 %
Desired digits = 8
Estimated correct digits = 12
Correct digits = 32
h = 8.3637482517366379525470504329593e-05
SETTING H FOR POLE
NO POLE (given) for Equation 1
NO POLE (ratio test) for Equation 1
Radius of convergence (three term test) for eq 1 = 0.0007527
Order of pole (three term test) = 33
NO COMPLEX POLE (six term test) for Equation 1
NO POLE (given) for Equation 2
NO POLE (ratio test) for Equation 2
Radius of convergence (three term test) for eq 2 = 0.0007527
Order of pole (three term test) = 32
NO COMPLEX POLE (six term test) for Equation 2
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2509.6MB, alloc=40.3MB, time=28.01
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2552.1MB, alloc=40.3MB, time=28.48
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2594.6MB, alloc=40.3MB, time=28.94
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2637.0MB, alloc=40.3MB, time=29.39
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2679.5MB, alloc=40.3MB, time=29.84
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2722.0MB, alloc=40.3MB, time=30.30
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2764.5MB, alloc=40.3MB, time=30.75
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
SETTING H FOR POLE
memory used=2807.0MB, alloc=40.3MB, time=31.20
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=2848.4MB, alloc=40.3MB, time=31.67
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=2889.9MB, alloc=40.3MB, time=32.13
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=2931.4MB, alloc=40.3MB, time=32.58
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=2972.8MB, alloc=40.3MB, time=33.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3014.2MB, alloc=40.3MB, time=33.50
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3055.7MB, alloc=40.3MB, time=33.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3097.1MB, alloc=40.3MB, time=34.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3138.5MB, alloc=40.3MB, time=34.88
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3180.0MB, alloc=40.3MB, time=35.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3221.4MB, alloc=40.3MB, time=35.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3262.7MB, alloc=40.3MB, time=36.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3304.2MB, alloc=40.3MB, time=36.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3345.5MB, alloc=40.3MB, time=37.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3386.9MB, alloc=40.3MB, time=37.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3428.3MB, alloc=40.3MB, time=38.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3469.7MB, alloc=40.3MB, time=38.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3511.1MB, alloc=40.3MB, time=38.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3552.5MB, alloc=40.3MB, time=39.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3594.0MB, alloc=40.3MB, time=39.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3635.4MB, alloc=40.3MB, time=40.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3677.0MB, alloc=40.3MB, time=40.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3718.3MB, alloc=40.3MB, time=41.28
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3759.6MB, alloc=40.3MB, time=41.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3801.1MB, alloc=40.3MB, time=42.20
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3842.4MB, alloc=40.3MB, time=42.66
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3883.9MB, alloc=40.3MB, time=43.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3925.2MB, alloc=40.3MB, time=43.58
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=3966.6MB, alloc=40.3MB, time=44.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4008.1MB, alloc=40.3MB, time=44.48
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4049.5MB, alloc=40.3MB, time=44.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4091.0MB, alloc=40.3MB, time=45.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4132.4MB, alloc=40.3MB, time=45.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4173.9MB, alloc=40.3MB, time=46.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4215.4MB, alloc=40.3MB, time=46.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4256.8MB, alloc=40.3MB, time=47.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4298.2MB, alloc=40.3MB, time=47.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4339.6MB, alloc=40.3MB, time=48.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4381.0MB, alloc=40.3MB, time=48.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4422.3MB, alloc=40.3MB, time=49.06
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4463.7MB, alloc=40.3MB, time=49.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4505.2MB, alloc=40.3MB, time=49.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4546.6MB, alloc=40.3MB, time=50.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4588.1MB, alloc=40.3MB, time=50.89
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4629.5MB, alloc=40.3MB, time=51.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4670.9MB, alloc=40.3MB, time=51.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4712.5MB, alloc=40.3MB, time=52.27
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4754.0MB, alloc=40.3MB, time=52.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4795.5MB, alloc=40.3MB, time=53.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4836.8MB, alloc=40.3MB, time=53.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4878.3MB, alloc=40.3MB, time=54.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4919.8MB, alloc=40.3MB, time=54.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=4961.2MB, alloc=40.3MB, time=55.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5002.7MB, alloc=40.3MB, time=55.48
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5044.1MB, alloc=40.3MB, time=55.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5085.6MB, alloc=40.3MB, time=56.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5127.0MB, alloc=40.3MB, time=56.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5168.5MB, alloc=40.3MB, time=57.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5210.0MB, alloc=40.3MB, time=57.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5251.5MB, alloc=40.3MB, time=58.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5293.0MB, alloc=40.3MB, time=58.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5334.5MB, alloc=40.3MB, time=59.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5375.9MB, alloc=40.3MB, time=59.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5417.3MB, alloc=40.3MB, time=60.06
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5458.8MB, alloc=40.3MB, time=60.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5500.2MB, alloc=40.3MB, time=60.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5541.7MB, alloc=40.3MB, time=61.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5583.2MB, alloc=40.3MB, time=61.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5624.7MB, alloc=40.3MB, time=62.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5666.0MB, alloc=40.3MB, time=62.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5707.5MB, alloc=40.3MB, time=63.28
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5749.0MB, alloc=40.3MB, time=63.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5790.5MB, alloc=40.3MB, time=64.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5831.9MB, alloc=40.3MB, time=64.66
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5873.5MB, alloc=40.3MB, time=65.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5914.9MB, alloc=40.3MB, time=65.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5956.4MB, alloc=40.3MB, time=66.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=5997.8MB, alloc=40.3MB, time=66.48
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6039.3MB, alloc=40.3MB, time=66.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6080.7MB, alloc=40.3MB, time=67.39
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6122.1MB, alloc=40.3MB, time=67.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6163.6MB, alloc=40.3MB, time=68.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6205.0MB, alloc=40.3MB, time=68.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6246.5MB, alloc=40.3MB, time=69.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6287.9MB, alloc=40.3MB, time=69.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6329.4MB, alloc=40.3MB, time=70.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6370.9MB, alloc=40.3MB, time=70.63
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6412.2MB, alloc=40.3MB, time=71.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6453.7MB, alloc=40.3MB, time=71.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6495.2MB, alloc=40.3MB, time=72.00
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6536.6MB, alloc=40.3MB, time=72.45
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6578.0MB, alloc=40.3MB, time=72.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6619.5MB, alloc=40.3MB, time=73.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6661.0MB, alloc=40.3MB, time=73.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6702.3MB, alloc=40.3MB, time=74.34
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6743.7MB, alloc=40.3MB, time=74.80
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6785.3MB, alloc=40.3MB, time=75.27
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6826.7MB, alloc=40.3MB, time=75.72
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6868.2MB, alloc=40.3MB, time=76.17
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6909.6MB, alloc=40.3MB, time=76.62
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6951.1MB, alloc=40.3MB, time=77.09
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=6992.5MB, alloc=40.3MB, time=77.55
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7034.0MB, alloc=40.3MB, time=78.00
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7075.5MB, alloc=40.3MB, time=78.47
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7116.9MB, alloc=40.3MB, time=78.92
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7158.3MB, alloc=40.3MB, time=79.37
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7199.7MB, alloc=40.3MB, time=79.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7241.2MB, alloc=40.3MB, time=80.30
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7282.8MB, alloc=40.3MB, time=80.75
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7324.3MB, alloc=40.3MB, time=81.22
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7365.7MB, alloc=40.3MB, time=81.67
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7407.2MB, alloc=40.3MB, time=82.13
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7448.7MB, alloc=40.3MB, time=82.59
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7490.0MB, alloc=40.3MB, time=83.05
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7531.4MB, alloc=40.3MB, time=83.50
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7572.9MB, alloc=40.3MB, time=83.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7614.3MB, alloc=40.3MB, time=84.42
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7655.8MB, alloc=40.3MB, time=84.87
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7697.2MB, alloc=40.3MB, time=85.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7738.7MB, alloc=40.3MB, time=85.80
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7780.1MB, alloc=40.3MB, time=86.25
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7821.6MB, alloc=40.3MB, time=86.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7863.1MB, alloc=40.3MB, time=87.17
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7904.6MB, alloc=40.3MB, time=87.63
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7945.9MB, alloc=40.3MB, time=88.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=7987.3MB, alloc=40.3MB, time=88.55
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8028.7MB, alloc=40.3MB, time=89.00
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8070.1MB, alloc=40.3MB, time=89.45
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8111.5MB, alloc=40.3MB, time=89.92
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8153.1MB, alloc=40.3MB, time=90.38
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8194.5MB, alloc=40.3MB, time=90.84
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8235.9MB, alloc=40.3MB, time=91.30
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8277.2MB, alloc=40.3MB, time=91.75
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8318.6MB, alloc=40.3MB, time=92.20
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8360.1MB, alloc=40.3MB, time=92.66
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8401.5MB, alloc=40.3MB, time=93.12
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8443.0MB, alloc=40.3MB, time=93.58
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8484.4MB, alloc=40.3MB, time=94.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8525.9MB, alloc=40.3MB, time=94.50
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8567.4MB, alloc=40.3MB, time=94.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8608.9MB, alloc=40.3MB, time=95.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8650.4MB, alloc=40.3MB, time=95.87
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8691.8MB, alloc=40.3MB, time=96.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8733.1MB, alloc=40.3MB, time=96.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8774.5MB, alloc=40.3MB, time=97.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8815.9MB, alloc=40.3MB, time=97.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8857.4MB, alloc=40.3MB, time=98.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8898.8MB, alloc=40.3MB, time=98.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8940.3MB, alloc=40.3MB, time=99.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=8981.8MB, alloc=40.3MB, time=99.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9023.3MB, alloc=40.3MB, time=99.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9064.9MB, alloc=40.3MB, time=100.45
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9106.3MB, alloc=40.3MB, time=100.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9147.6MB, alloc=40.3MB, time=101.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9189.1MB, alloc=40.3MB, time=101.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9230.4MB, alloc=40.3MB, time=102.28
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9271.9MB, alloc=40.3MB, time=102.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9313.3MB, alloc=40.3MB, time=103.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9354.8MB, alloc=40.3MB, time=103.66
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9396.3MB, alloc=40.3MB, time=104.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9437.8MB, alloc=40.3MB, time=104.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9479.1MB, alloc=40.3MB, time=105.02
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9520.6MB, alloc=40.3MB, time=105.47
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9562.2MB, alloc=40.3MB, time=105.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9603.5MB, alloc=40.3MB, time=106.39
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9645.0MB, alloc=40.3MB, time=106.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9686.4MB, alloc=40.3MB, time=107.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9727.9MB, alloc=40.3MB, time=107.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9769.3MB, alloc=40.3MB, time=108.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9810.8MB, alloc=40.3MB, time=108.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9852.3MB, alloc=40.3MB, time=109.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9893.6MB, alloc=40.3MB, time=109.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9935.0MB, alloc=40.3MB, time=110.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=9976.5MB, alloc=40.3MB, time=110.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10017.9MB, alloc=40.3MB, time=110.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10059.4MB, alloc=40.3MB, time=111.45
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10100.9MB, alloc=40.3MB, time=111.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10142.2MB, alloc=40.3MB, time=112.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10183.6MB, alloc=40.3MB, time=112.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10225.1MB, alloc=40.3MB, time=113.26
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10266.4MB, alloc=40.3MB, time=113.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10307.9MB, alloc=40.3MB, time=114.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10349.4MB, alloc=40.3MB, time=114.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10390.9MB, alloc=40.3MB, time=115.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10432.3MB, alloc=40.3MB, time=115.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10473.8MB, alloc=40.3MB, time=116.01
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10515.3MB, alloc=40.3MB, time=116.47
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10556.6MB, alloc=40.3MB, time=116.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10598.0MB, alloc=40.3MB, time=117.39
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10639.5MB, alloc=40.3MB, time=117.84
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10680.9MB, alloc=40.3MB, time=118.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10722.3MB, alloc=40.3MB, time=118.77
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10763.7MB, alloc=40.3MB, time=119.22
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10805.2MB, alloc=40.3MB, time=119.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10846.8MB, alloc=40.3MB, time=120.14
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10888.1MB, alloc=40.3MB, time=120.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10929.5MB, alloc=40.3MB, time=121.06
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=10970.9MB, alloc=40.3MB, time=121.52
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11012.3MB, alloc=40.3MB, time=121.97
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11053.7MB, alloc=40.3MB, time=122.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11095.1MB, alloc=40.3MB, time=122.89
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11136.6MB, alloc=40.3MB, time=123.34
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11178.1MB, alloc=40.3MB, time=123.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11219.6MB, alloc=40.3MB, time=124.27
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11261.0MB, alloc=40.3MB, time=124.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11302.4MB, alloc=40.3MB, time=125.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11343.8MB, alloc=40.3MB, time=125.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11385.2MB, alloc=40.3MB, time=126.09
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11426.6MB, alloc=40.3MB, time=126.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11468.0MB, alloc=40.3MB, time=127.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11509.5MB, alloc=40.3MB, time=127.48
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11550.8MB, alloc=40.3MB, time=127.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11592.2MB, alloc=40.3MB, time=128.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11633.6MB, alloc=40.3MB, time=128.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11675.1MB, alloc=40.3MB, time=129.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11716.5MB, alloc=40.3MB, time=129.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11757.9MB, alloc=40.3MB, time=130.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11799.3MB, alloc=40.3MB, time=130.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11840.7MB, alloc=40.3MB, time=131.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11882.1MB, alloc=40.3MB, time=131.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11923.6MB, alloc=40.3MB, time=132.06
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=11965.1MB, alloc=40.3MB, time=132.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12006.6MB, alloc=40.3MB, time=132.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12047.9MB, alloc=40.3MB, time=133.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12089.3MB, alloc=40.3MB, time=133.89
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12130.9MB, alloc=40.3MB, time=134.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12172.3MB, alloc=40.3MB, time=134.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12213.8MB, alloc=40.3MB, time=135.26
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12255.2MB, alloc=40.3MB, time=135.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12296.6MB, alloc=40.3MB, time=136.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12338.0MB, alloc=40.3MB, time=136.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12379.5MB, alloc=40.3MB, time=137.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12420.9MB, alloc=40.3MB, time=137.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12462.4MB, alloc=40.3MB, time=138.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12503.9MB, alloc=40.3MB, time=138.50
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12545.3MB, alloc=40.3MB, time=138.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12586.6MB, alloc=40.3MB, time=139.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12628.1MB, alloc=40.3MB, time=139.88
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12669.6MB, alloc=40.3MB, time=140.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12711.0MB, alloc=40.3MB, time=140.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12752.4MB, alloc=40.3MB, time=141.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12793.9MB, alloc=40.3MB, time=141.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12835.3MB, alloc=40.3MB, time=142.16
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12876.7MB, alloc=40.3MB, time=142.61
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12918.1MB, alloc=40.3MB, time=143.06
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=12959.6MB, alloc=40.3MB, time=143.53
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13001.1MB, alloc=40.3MB, time=143.98
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13042.5MB, alloc=40.3MB, time=144.44
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13083.9MB, alloc=40.3MB, time=144.89
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13125.4MB, alloc=40.3MB, time=145.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13166.8MB, alloc=40.3MB, time=145.81
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13208.2MB, alloc=40.3MB, time=146.26
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13249.7MB, alloc=40.3MB, time=146.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13291.2MB, alloc=40.3MB, time=147.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13332.5MB, alloc=40.3MB, time=147.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13373.9MB, alloc=40.3MB, time=148.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13415.4MB, alloc=40.3MB, time=148.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13456.8MB, alloc=40.3MB, time=149.01
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13498.3MB, alloc=40.3MB, time=149.47
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13539.8MB, alloc=40.3MB, time=149.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13581.2MB, alloc=40.3MB, time=150.39
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13622.5MB, alloc=40.3MB, time=150.84
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13663.9MB, alloc=40.3MB, time=151.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13705.3MB, alloc=40.3MB, time=151.76
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13746.8MB, alloc=40.3MB, time=152.22
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13788.3MB, alloc=40.3MB, time=152.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13829.6MB, alloc=40.3MB, time=153.14
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13871.1MB, alloc=40.3MB, time=153.59
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13912.6MB, alloc=40.3MB, time=154.05
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13954.1MB, alloc=40.3MB, time=154.52
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=13995.6MB, alloc=40.3MB, time=154.97
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14037.0MB, alloc=40.3MB, time=155.42
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14078.5MB, alloc=40.3MB, time=155.89
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14120.0MB, alloc=40.3MB, time=156.34
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14161.5MB, alloc=40.3MB, time=156.80
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14203.0MB, alloc=40.3MB, time=157.25
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14244.4MB, alloc=40.3MB, time=157.72
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14285.9MB, alloc=40.3MB, time=158.17
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14327.4MB, alloc=40.3MB, time=158.63
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14368.8MB, alloc=40.3MB, time=159.08
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14410.3MB, alloc=40.3MB, time=159.55
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14451.7MB, alloc=40.3MB, time=160.00
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14493.1MB, alloc=40.3MB, time=160.45
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14534.6MB, alloc=40.3MB, time=160.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14576.1MB, alloc=40.3MB, time=161.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14617.5MB, alloc=40.3MB, time=161.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14659.0MB, alloc=40.3MB, time=162.28
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14700.4MB, alloc=40.3MB, time=162.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14741.8MB, alloc=40.3MB, time=163.19
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14783.3MB, alloc=40.3MB, time=163.64
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14824.7MB, alloc=40.3MB, time=164.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14866.1MB, alloc=40.3MB, time=164.56
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14907.5MB, alloc=40.3MB, time=165.01
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14948.8MB, alloc=40.3MB, time=165.47
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=14990.3MB, alloc=40.3MB, time=165.94
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15031.8MB, alloc=40.3MB, time=166.39
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15073.2MB, alloc=40.3MB, time=166.91
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15114.6MB, alloc=40.3MB, time=167.36
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15156.1MB, alloc=40.3MB, time=167.83
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15197.6MB, alloc=40.3MB, time=168.28
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15239.1MB, alloc=40.3MB, time=168.73
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15280.6MB, alloc=40.3MB, time=169.20
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15322.1MB, alloc=40.3MB, time=169.66
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15363.6MB, alloc=40.3MB, time=170.11
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15405.0MB, alloc=40.3MB, time=170.58
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15446.4MB, alloc=40.3MB, time=171.03
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15487.9MB, alloc=40.3MB, time=171.48
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15529.2MB, alloc=40.3MB, time=171.95
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15570.7MB, alloc=40.3MB, time=172.41
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15612.1MB, alloc=40.3MB, time=172.86
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15653.5MB, alloc=40.3MB, time=173.31
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15694.9MB, alloc=40.3MB, time=173.78
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15736.4MB, alloc=40.3MB, time=174.23
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15777.8MB, alloc=40.3MB, time=174.69
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15819.2MB, alloc=40.3MB, time=175.14
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15860.6MB, alloc=40.3MB, time=175.59
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15902.0MB, alloc=40.3MB, time=176.05
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15943.4MB, alloc=40.3MB, time=176.52
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=15984.9MB, alloc=40.3MB, time=176.97
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16026.3MB, alloc=40.3MB, time=177.42
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16067.8MB, alloc=40.3MB, time=177.88
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16109.2MB, alloc=40.3MB, time=178.33
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16150.6MB, alloc=40.3MB, time=178.80
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16192.1MB, alloc=40.3MB, time=179.25
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16233.6MB, alloc=40.3MB, time=179.70
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
SETTING H FOR POLE
SETTING H FOR MIN H
memory used=16275.1MB, alloc=40.3MB, time=180.17
SETTING H FOR POLE
SETTING H FOR MIN H
Finished!
Maximum Time Reached before Solution Completed!
diff ( y1 , x , 1 ) = neg ( y2 ) + 1.0 ;
diff ( y2 , x , 1 ) = y1 - 1.0 ;
Iterations = 2212
Total Elapsed Time = 3 Minutes 0 Seconds
Elapsed Time(since restart) = 3 Minutes 0 Seconds
Expected Time Remaining = 17 Minutes 10 Seconds
Optimized Time Remaining = 17 Minutes 10 Seconds
Expected Total Time = 20 Minutes 10 Seconds
Time to Timeout 0.0 Seconds
Percent Done = 14.88 %
> quit
memory used=16280.6MB, alloc=40.3MB, time=180.23