|\^/| Maple 18 (X86 64 WINDOWS) ._|\| |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2014 \ MAPLE / All rights reserved. Maple is a trademark of <____ ____> Waterloo Maple Inc. | Type ? for help. #BEGIN OUTFILE1 # before write maple top matter # before write_ats library and user def block #BEGIN ATS LIBRARY BLOCK # Begin Function number 2 > omniout_str := proc(iolevel,str) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 1 > printf("%s\n",str); > fi;# end if 1; > end; omniout_str := proc(iolevel, str) global glob_iolevel; if iolevel <= glob_iolevel then printf("%s\n", str) end if end proc # End Function number 2 # Begin Function number 3 > omniout_str_noeol := proc(iolevel,str) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 1 > printf("%s",str); > fi;# end if 1; > end; omniout_str_noeol := proc(iolevel, str) global glob_iolevel; if iolevel <= glob_iolevel then printf("%s", str) end if end proc # End Function number 3 # Begin Function number 4 > omniout_labstr := proc(iolevel,label,str) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 1 > print(label,str); > fi;# end if 1; > end; omniout_labstr := proc(iolevel, label, str) global glob_iolevel; if iolevel <= glob_iolevel then print(label, str) end if end proc # End Function number 4 # Begin Function number 5 > omniout_float := proc(iolevel,prelabel,prelen,value,vallen,postlabel) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 1 > if vallen = 4 then > printf("%-30s = %-42.4g %s \n",prelabel,value, postlabel); > else > printf("%-30s = %-42.32g %s \n",prelabel,value, postlabel); > fi;# end if 1; > fi;# end if 0; > end; omniout_float := proc(iolevel, prelabel, prelen, value, vallen, postlabel) global glob_iolevel; if iolevel <= glob_iolevel then if vallen = 4 then printf("%-30s = %-42.4g %s \n", prelabel, value, postlabel) else printf("%-30s = %-42.32g %s \n", prelabel, value, postlabel) end if end if end proc # End Function number 5 # Begin Function number 6 > omniout_int := proc(iolevel,prelabel,prelen,value,vallen,postlabel) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 0 > if vallen = 5 then # if number 1 > printf("%-30s = %-32d %s\n",prelabel,value, postlabel); > else > printf("%-30s = %-32d %s \n",prelabel,value, postlabel); > fi;# end if 1; > fi;# end if 0; > end; omniout_int := proc(iolevel, prelabel, prelen, value, vallen, postlabel) global glob_iolevel; if iolevel <= glob_iolevel then if vallen = 5 then printf("%-30s = %-32d %s\n", prelabel, value, postlabel) else printf("%-30s = %-32d %s \n", prelabel, value, postlabel) end if end if end proc # End Function number 6 # Begin Function number 7 > omniout_float_arr := proc(iolevel,prelabel,elemnt,prelen,value,vallen,postlabel) > global glob_iolevel; > if (glob_iolevel >= iolevel) then # if number 0 > print(prelabel,"[",elemnt,"]",value, postlabel); > fi;# end if 0; > end; omniout_float_arr := proc( iolevel, prelabel, elemnt, prelen, value, vallen, postlabel) global glob_iolevel; if iolevel <= glob_iolevel then print(prelabel, "[", elemnt, "]", value, postlabel) end if end proc # End Function number 7 # Begin Function number 8 > logitem_time := proc(fd,secs_in) > global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year; > local days_int, hours_int,minutes_int, sec_int, sec_temp, years_int; > fprintf(fd,""); > if (secs_in >= 0) then # if number 0 > years_int := int_trunc(secs_in / glob_sec_in_year); > sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year); > days_int := int_trunc(sec_temp / glob_sec_in_day) ; > sec_temp := sec_temp mod int_trunc(glob_sec_in_day) ; > hours_int := int_trunc(sec_temp / glob_sec_in_hour); > sec_temp := sec_temp mod int_trunc(glob_sec_in_hour); > minutes_int := int_trunc(sec_temp / glob_sec_in_minute); > sec_int := sec_temp mod int_trunc(glob_sec_in_minute); > if (years_int > 0) then # if number 1 > fprintf(fd,"%d Years %d Days %d Hours %d Minutes %d Seconds",years_int,days_int,hours_int,minutes_int,sec_int); > elif > (days_int > 0) then # if number 2 > fprintf(fd,"%d Days %d Hours %d Minutes %d Seconds",days_int,hours_int,minutes_int,sec_int); > elif > (hours_int > 0) then # if number 3 > fprintf(fd,"%d Hours %d Minutes %d Seconds",hours_int,minutes_int,sec_int); > elif > (minutes_int > 0) then # if number 4 > fprintf(fd,"%d Minutes %d Seconds",minutes_int,sec_int); > else > fprintf(fd,"%d Seconds",sec_int); > fi;# end if 4 > else > fprintf(fd," 0.0 Seconds"); > fi;# end if 3 > fprintf(fd,"\n"); > end; logitem_time := proc(fd, secs_in) local days_int, hours_int, minutes_int, sec_int, sec_temp, years_int; global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year; fprintf(fd, ""); if 0 <= secs_in then years_int := int_trunc(secs_in/glob_sec_in_year); sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year); days_int := int_trunc(sec_temp/glob_sec_in_day); sec_temp := sec_temp mod int_trunc(glob_sec_in_day); hours_int := int_trunc(sec_temp/glob_sec_in_hour); sec_temp := sec_temp mod int_trunc(glob_sec_in_hour); minutes_int := int_trunc(sec_temp/glob_sec_in_minute); sec_int := sec_temp mod int_trunc(glob_sec_in_minute); if 0 < years_int then fprintf(fd, "%d Years %d Days %d Hours %d Minutes %d Seconds", years_int, days_int, hours_int, minutes_int, sec_int) elif 0 < days_int then fprintf(fd, "%d Days %d Hours %d Minutes %d Seconds", days_int, hours_int, minutes_int, sec_int) elif 0 < hours_int then fprintf(fd, "%d Hours %d Minutes %d Seconds", hours_int, minutes_int, sec_int) elif 0 < minutes_int then fprintf(fd, "%d Minutes %d Seconds", minutes_int, sec_int) else fprintf(fd, "%d Seconds", sec_int) end if else fprintf(fd, " 0.0 Seconds") end if; fprintf(fd, "\n") end proc # End Function number 8 # Begin Function number 9 > omniout_timestr := proc(secs_in) > global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year; > local days_int, hours_int,minutes_int, sec_int, sec_temp, years_int; > if (secs_in >= 0) then # if number 3 > years_int := int_trunc(secs_in / glob_sec_in_year); > sec_temp := (int_trunc(secs_in) mod int_trunc(glob_sec_in_year)); > days_int := int_trunc(sec_temp / glob_sec_in_day) ; > sec_temp := (sec_temp mod int_trunc(glob_sec_in_day)) ; > hours_int := int_trunc(sec_temp / glob_sec_in_hour); > sec_temp := (sec_temp mod int_trunc(glob_sec_in_hour)); > minutes_int := int_trunc(sec_temp / glob_sec_in_minute); > sec_int := (sec_temp mod int_trunc(glob_sec_in_minute)); > if (years_int > 0) then # if number 4 > printf(" = %d Years %d Days %d Hours %d Minutes %d Seconds\n",years_int,days_int,hours_int,minutes_int,sec_int); > elif > (days_int > 0) then # if number 5 > printf(" = %d Days %d Hours %d Minutes %d Seconds\n",days_int,hours_int,minutes_int,sec_int); > elif > (hours_int > 0) then # if number 6 > printf(" = %d Hours %d Minutes %d Seconds\n",hours_int,minutes_int,sec_int); > elif > (minutes_int > 0) then # if number 7 > printf(" = %d Minutes %d Seconds\n",minutes_int,sec_int); > else > printf(" = %d Seconds\n",sec_int); > fi;# end if 7 > else > printf(" 0.0 Seconds\n"); > fi;# end if 6 > end; omniout_timestr := proc(secs_in) local days_int, hours_int, minutes_int, sec_int, sec_temp, years_int; global glob_sec_in_day, glob_sec_in_hour, glob_sec_in_minute, glob_sec_in_year; if 0 <= secs_in then years_int := int_trunc(secs_in/glob_sec_in_year); sec_temp := int_trunc(secs_in) mod int_trunc(glob_sec_in_year); days_int := int_trunc(sec_temp/glob_sec_in_day); sec_temp := sec_temp mod int_trunc(glob_sec_in_day); hours_int := int_trunc(sec_temp/glob_sec_in_hour); sec_temp := sec_temp mod int_trunc(glob_sec_in_hour); minutes_int := int_trunc(sec_temp/glob_sec_in_minute); sec_int := sec_temp mod int_trunc(glob_sec_in_minute); if 0 < years_int then printf( " = %d Years %d Days %d Hours %d Minutes %d Seconds\n", years_int, days_int, hours_int, minutes_int, sec_int) elif 0 < days_int then printf( " = %d Days %d Hours %d Minutes %d Seconds\n", days_int, hours_int, minutes_int, sec_int) elif 0 < hours_int then printf( " = %d Hours %d Minutes %d Seconds\n", hours_int, minutes_int, sec_int) elif 0 < minutes_int then printf(" = %d Minutes %d Seconds\n", minutes_int, sec_int) else printf(" = %d Seconds\n", sec_int) end if else printf(" 0.0 Seconds\n") end if end proc # End Function number 9 # Begin Function number 10 > zero_ats_ar := proc(arr_a) > global ATS_MAX_TERMS; > local iii; > iii := 1; > while (iii <= ATS_MAX_TERMS) do # do number 1 > arr_a [iii] := glob__0; > iii := iii + 1; > od;# end do number 1 > end; zero_ats_ar := proc(arr_a) local iii; global ATS_MAX_TERMS; iii := 1; while iii <= ATS_MAX_TERMS do arr_a[iii] := glob__0; iii := iii + 1 end do end proc # End Function number 10 # Begin Function number 11 > ats := proc(mmm_ats,arr_a,arr_b,jjj_ats) > global ATS_MAX_TERMS; > local iii_ats, lll_ats,ma_ats, ret_ats; > ret_ats := glob__0; > if (jjj_ats <= mmm_ats) then # if number 6 > ma_ats := mmm_ats + 1; > iii_ats := jjj_ats; > while (iii_ats <= mmm_ats) do # do number 1 > lll_ats := ma_ats - iii_ats; > if ((lll_ats <= ATS_MAX_TERMS and (iii_ats <= ATS_MAX_TERMS) )) then # if number 7 > ret_ats := ret_ats + c(arr_a[iii_ats])*c(arr_b[lll_ats]); > fi;# end if 7; > iii_ats := iii_ats + 1; > od;# end do number 1 > fi;# end if 6; > ret_ats; > end; ats := proc(mmm_ats, arr_a, arr_b, jjj_ats) local iii_ats, lll_ats, ma_ats, ret_ats; global ATS_MAX_TERMS; ret_ats := glob__0; if jjj_ats <= mmm_ats then ma_ats := mmm_ats + 1; iii_ats := jjj_ats; while iii_ats <= mmm_ats do lll_ats := ma_ats - iii_ats; if lll_ats <= ATS_MAX_TERMS and iii_ats <= ATS_MAX_TERMS then ret_ats := ret_ats + c(arr_a[iii_ats])*c(arr_b[lll_ats]) end if; iii_ats := iii_ats + 1 end do end if; ret_ats end proc # End Function number 11 # Begin Function number 12 > att := proc(mmm_att,arr_aa,arr_bb,jjj_att) > global ATS_MAX_TERMS; > local al_att, iii_att,lll_att, ma_att, ret_att; > ret_att := glob__0; > if (jjj_att < mmm_att) then # if number 6 > ma_att := mmm_att + 2; > iii_att := jjj_att; > while ((iii_att < mmm_att) and (iii_att <= ATS_MAX_TERMS) ) do # do number 1 > lll_att := ma_att - iii_att; > al_att := (lll_att - 1); > if ((lll_att <= ATS_MAX_TERMS and (iii_att <= ATS_MAX_TERMS) )) then # if number 7 > ret_att := ret_att + c(arr_aa[iii_att])*c(arr_bb[lll_att])* c(al_att); > fi;# end if 7; > iii_att := iii_att + 1; > od;# end do number 1; > ret_att := ret_att / c(mmm_att) ; > fi;# end if 6; > ret_att; > end; att := proc(mmm_att, arr_aa, arr_bb, jjj_att) local al_att, iii_att, lll_att, ma_att, ret_att; global ATS_MAX_TERMS; ret_att := glob__0; if jjj_att < mmm_att then ma_att := mmm_att + 2; iii_att := jjj_att; while iii_att < mmm_att and iii_att <= ATS_MAX_TERMS do lll_att := ma_att - iii_att; al_att := lll_att - 1; if lll_att <= ATS_MAX_TERMS and iii_att <= ATS_MAX_TERMS then ret_att := ret_att + c(arr_aa[iii_att])*c(arr_bb[lll_att])*c(al_att) end if; iii_att := iii_att + 1 end do; ret_att := ret_att/c(mmm_att) end if; ret_att end proc # End Function number 12 # Begin Function number 13 > logditto := proc(file) > fprintf(file,""); > fprintf(file,"ditto"); > fprintf(file,""); > end; logditto := proc(file) fprintf(file, ""); fprintf(file, "ditto"); fprintf(file, "") end proc # End Function number 13 # Begin Function number 14 > logitem_integer := proc(file,n) > fprintf(file,""); > fprintf(file,"%d",n); > fprintf(file,""); > end; logitem_integer := proc(file, n) fprintf(file, ""); fprintf(file, "%d", n); fprintf(file, "") end proc # End Function number 14 # Begin Function number 15 > logitem_str := proc(file,str) > fprintf(file,""); > fprintf(file,str); > fprintf(file,""); > end; logitem_str := proc(file, str) fprintf(file, ""); fprintf(file, str); fprintf(file, "") end proc # End Function number 15 # Begin Function number 16 > logitem_good_digits := proc(file,rel_error) > global glob_small_float,glob_prec; > local good_digits; > fprintf(file,""); > fprintf(file,"%d",glob_min_good_digits); > fprintf(file,""); > end; logitem_good_digits := proc(file, rel_error) local good_digits; global glob_small_float, glob_prec; fprintf(file, ""); fprintf(file, "%d", glob_min_good_digits); fprintf(file, "") end proc # End Function number 16 # Begin Function number 17 > log_revs := proc(file,revs) > fprintf(file,revs); > end; log_revs := proc(file, revs) fprintf(file, revs) end proc # End Function number 17 # Begin Function number 18 > logitem_float := proc(file,x) > fprintf(file,""); > fprintf(file,"%g",x); > fprintf(file,""); > end; logitem_float := proc(file, x) fprintf(file, ""); fprintf(file, "%g", x); fprintf(file, "") end proc # End Function number 18 # Begin Function number 19 > logitem_h_reason := proc(file) > global glob_h_reason; > fprintf(file,""); > if (glob_h_reason = 1) then # if number 6 > fprintf(file,"Max H"); > elif > (glob_h_reason = 2) then # if number 7 > fprintf(file,"Display Interval"); > elif > (glob_h_reason = 3) then # if number 8 > fprintf(file,"Optimal"); > elif > (glob_h_reason = 4) then # if number 9 > fprintf(file,"Pole Accuracy"); > elif > (glob_h_reason = 5) then # if number 10 > fprintf(file,"Min H (Pole)"); > elif > (glob_h_reason = 6) then # if number 11 > fprintf(file,"Pole"); > elif > (glob_h_reason = 7) then # if number 12 > fprintf(file,"Opt Iter"); > else > fprintf(file,"Impossible"); > fi;# end if 12 > fprintf(file,""); > end; logitem_h_reason := proc(file) global glob_h_reason; fprintf(file, ""); if glob_h_reason = 1 then fprintf(file, "Max H") elif glob_h_reason = 2 then fprintf(file, "Display Interval") elif glob_h_reason = 3 then fprintf(file, "Optimal") elif glob_h_reason = 4 then fprintf(file, "Pole Accuracy") elif glob_h_reason = 5 then fprintf(file, "Min H (Pole)") elif glob_h_reason = 6 then fprintf(file, "Pole") elif glob_h_reason = 7 then fprintf(file, "Opt Iter") else fprintf(file, "Impossible") end if; fprintf(file, "") end proc # End Function number 19 # Begin Function number 20 > logstart := proc(file) > fprintf(file,""); > end; logstart := proc(file) fprintf(file, "") end proc # End Function number 20 # Begin Function number 21 > logend := proc(file) > fprintf(file,"\n"); > end; logend := proc(file) fprintf(file, "\n") end proc # End Function number 21 # Begin Function number 22 > chk_data := proc() > global glob_max_iter,ALWAYS, ATS_MAX_TERMS; > local errflag; > errflag := false; > if (glob_max_iter < 2) then # if number 12 > omniout_str(ALWAYS,"Illegal max_iter"); > errflag := true; > fi;# end if 12; > if (errflag) then # if number 12 > quit; > fi;# end if 12 > end; chk_data := proc() local errflag; global glob_max_iter, ALWAYS, ATS_MAX_TERMS; errflag := false; if glob_max_iter < 2 then omniout_str(ALWAYS, "Illegal max_iter"); errflag := true end if; if errflag then quit end if end proc # End Function number 22 # Begin Function number 23 > comp_expect_sec := proc(t_end2,t_start2,t2,clock_sec2) > global glob_small_float; > local ms2, rrr, sec_left, sub1, sub2; > ; > ms2 := c(clock_sec2); > sub1 := c(t_end2-t_start2); > sub2 := c(t2-t_start2); > if (sub1 = glob__0) then # if number 12 > sec_left := glob__0; > else > if (sub2 > glob__0) then # if number 13 > rrr := (sub1/sub2); > sec_left := rrr * c(ms2) - c(ms2); > else > sec_left := glob__0; > fi;# end if 13 > fi;# end if 12; > sec_left; > end; comp_expect_sec := proc(t_end2, t_start2, t2, clock_sec2) local ms2, rrr, sec_left, sub1, sub2; global glob_small_float; ms2 := c(clock_sec2); sub1 := c(t_end2 - t_start2); sub2 := c(t2 - t_start2); if sub1 = glob__0 then sec_left := glob__0 else if glob__0 < sub2 then rrr := sub1/sub2; sec_left := rrr*c(ms2) - c(ms2) else sec_left := glob__0 end if end if; sec_left end proc # End Function number 23 # Begin Function number 24 > comp_percent := proc(t_end2,t_start2, t2) > global glob_small_float; > local rrr, sub1, sub2; > sub1 := (t_end2-t_start2); > sub2 := (t2-t_start2); > if (sub2 > glob_small_float) then # if number 12 > rrr := (glob__100*sub2)/sub1; > else > rrr := 0.0; > fi;# end if 12; > rrr; > end; comp_percent := proc(t_end2, t_start2, t2) local rrr, sub1, sub2; global glob_small_float; sub1 := t_end2 - t_start2; sub2 := t2 - t_start2; if glob_small_float < sub2 then rrr := glob__100*sub2/sub1 else rrr := 0. end if; rrr end proc # End Function number 24 # Begin Function number 25 > comp_rad_from_ratio := proc(term1,term2,last_no) > #TOP TWO TERM RADIUS ANALYSIS > global glob_h,glob_larger_float; > local ret; > if (float_abs(term2) > glob__0) then # if number 12 > ret := float_abs(term1 * glob_h / term2); > else > ret := glob_larger_float; > fi;# end if 12; > ret; > #BOTTOM TWO TERM RADIUS ANALYSIS > end; comp_rad_from_ratio := proc(term1, term2, last_no) local ret; global glob_h, glob_larger_float; if glob__0 < float_abs(term2) then ret := float_abs(term1*glob_h/term2) else ret := glob_larger_float end if; ret end proc # End Function number 25 # Begin Function number 26 > comp_ord_from_ratio := proc(term1,term2,last_no) > #TOP TWO TERM ORDER ANALYSIS > global glob_h,glob_larger_float; > local ret; > if (float_abs(term2) > glob__0) then # if number 12 > ret := glob__1 + float_abs(term2) * c(last_no) * ln(float_abs(term1 * glob_h / term2))/ln(c(last_no)); > else > ret := glob_larger_float; > fi;# end if 12; > ret; > #BOTTOM TWO TERM ORDER ANALYSIS > end; comp_ord_from_ratio := proc(term1, term2, last_no) local ret; global glob_h, glob_larger_float; if glob__0 < float_abs(term2) then ret := glob__1 + float_abs(term2)* c(last_no)*ln(float_abs(term1*glob_h/term2))/ln(c(last_no)) else ret := glob_larger_float end if; ret end proc # End Function number 26 # Begin Function number 27 > c := proc(in_val) > #To Force Conversion when needed > local ret; > ret := evalf(in_val); > ret; > #End Conversion > end; c := proc(in_val) local ret; ret := evalf(in_val); ret end proc # End Function number 27 # Begin Function number 28 > comp_rad_from_three_terms := proc(term1,term2,term3,last_no) > #TOP THREE TERM RADIUS ANALYSIS > global glob_h,glob_larger_float; > local ret,temp; > temp := float_abs(term2*term2*c(last_no)+glob__m2*term2*term2-term1*term3*c(last_no)+term1*term3); > if (float_abs(temp) > glob__0) then # if number 12 > ret := float_abs((term2*glob_h*term1)/(temp)); > else > ret := glob_larger_float; > fi;# end if 12; > ret; > #BOTTOM THREE TERM RADIUS ANALYSIS > end; comp_rad_from_three_terms := proc(term1, term2, term3, last_no) local ret, temp; global glob_h, glob_larger_float; temp := float_abs(term2*term2*c(last_no) + glob__m2*term2*term2 - term1*term3*c(last_no) + term1*term3); if glob__0 < float_abs(temp) then ret := float_abs(term2*glob_h*term1/temp) else ret := glob_larger_float end if; ret end proc # End Function number 28 # Begin Function number 29 > comp_ord_from_three_terms := proc(term1,term2,term3,last_no) > #TOP THREE TERM ORDER ANALYSIS > local ret; > ret := float_abs((glob__4*term1*term3*c(last_no)-glob__3*term1*term3-glob__4*term2*term2*c(last_no)+glob__4*term2*term2+term2*term2*c(last_no*last_no)-term1*term3*c(last_no*last_no))/(term2*term2*c(last_no)-glob__2*term2*term2-term1*term3*c(last_no)+term1*term3)); > ret; > #TOP THREE TERM ORDER ANALYSIS > end; comp_ord_from_three_terms := proc(term1, term2, term3, last_no) local ret; ret := float_abs((glob__4*term1*term3*c(last_no) - glob__3*term1*term3 - glob__4*term2*term2*c(last_no) + glob__4*term2*term2 + term2*term2*c(last_no*last_no) - term1*term3*c(last_no*last_no)) /(term2*term2*c(last_no) - glob__2*term2*term2 - term1*term3*c(last_no) + term1*term3)); ret end proc # End Function number 29 # Begin Function number 30 > comp_rad_from_six_terms := proc(term1,term2,term3,term4,term5,term6,last_no) > #TOP SIX TERM RADIUS ANALYSIS > global glob_h,glob_larger_float,glob_six_term_ord_save; > local ret,rm0,rm1,rm2,rm3,rm4,nr1,nr2,dr1,dr2,ds2,rad_c,ord_no,ds1,rcs; > if ((term5 <> glob__0) and (term4 <> glob__0) and (term3 <> glob__0) and (term2 <> glob__0) and (term1 <> glob__0)) then # if number 12 > rm0 := term6/term5; > rm1 := term5/term4; > rm2 := term4/term3; > rm3 := term3/term2; > rm4 := term2/term1; > nr1 := c(last_no-1)*rm0 - glob__2*c(last_no-2)*rm1 + c(last_no-3)*rm2; > nr2 := c(last_no-2)*rm1 - glob__2*c(last_no-3)*rm2 + c(last_no-4)*rm3; > dr1 := glob__m1/rm1 + glob__2/rm2 - glob__1/rm3; > dr2 := glob__m1/rm2 + glob__2/rm3 - glob__1/rm4; > ds1 := glob__3/rm1 - glob__8/rm2 + glob__5/rm3; > ds2 := glob__3/rm2 - glob__8/rm3 + glob__5/rm4; > if ((float_abs(nr1 * dr2 - nr2 * dr1) = glob__0) or (float_abs(dr1) = glob__0)) then # if number 13 > rad_c := glob_larger_float; > ord_no := glob_larger_float; > else > if (float_abs(nr1*dr2 - nr2 * dr1) > glob__0) then # if number 14 > rcs := ((ds1*dr2 - ds2*dr1 +dr1*dr2)/(nr1*dr2 - nr2 * dr1)); > #(Manuels) rcs := (ds1*dr2 - ds2*dr1)/(nr1*dr2 - nr2 * dr1) > ord_no := (rcs*nr1 - ds1)/(glob__2*dr1) -c(last_no)/glob__2; > if (float_abs(rcs) <> glob__0) then # if number 15 > if (rcs > glob__0) then # if number 16 > rad_c := sqrt(rcs) * float_abs(glob_h); > else > rad_c := glob_larger_float; > ord_no := glob_larger_float; > fi;# end if 16 > else > rad_c := glob_larger_float; > ord_no := glob_larger_float; > fi;# end if 15 > else > rad_c := glob_larger_float; > ord_no := glob_larger_float; > fi;# end if 14 > fi;# end if 13 > else > rad_c := glob_larger_float; > ord_no := glob_larger_float; > fi;# end if 12; > glob_six_term_ord_save := ord_no; > rad_c; > #BOTTOM SIX TERM RADIUS ANALYSIS > end; comp_rad_from_six_terms := proc( term1, term2, term3, term4, term5, term6, last_no) local ret, rm0, rm1, rm2, rm3, rm4, nr1, nr2, dr1, dr2, ds2, rad_c, ord_no, ds1, rcs; global glob_h, glob_larger_float, glob_six_term_ord_save; if term5 <> glob__0 and term4 <> glob__0 and term3 <> glob__0 and term2 <> glob__0 and term1 <> glob__0 then rm0 := term6/term5; rm1 := term5/term4; rm2 := term4/term3; rm3 := term3/term2; rm4 := term2/term1; nr1 := c(last_no - 1)*rm0 - glob__2*c(last_no - 2)*rm1 + c(last_no - 3)*rm2; nr2 := c(last_no - 2)*rm1 - glob__2*c(last_no - 3)*rm2 + c(last_no - 4)*rm3; dr1 := glob__m1/rm1 + glob__2/rm2 - glob__1/rm3; dr2 := glob__m1/rm2 + glob__2/rm3 - glob__1/rm4; ds1 := glob__3/rm1 - glob__8/rm2 + glob__5/rm3; ds2 := glob__3/rm2 - glob__8/rm3 + glob__5/rm4; if float_abs(nr1*dr2 - nr2*dr1) = glob__0 or float_abs(dr1) = glob__0 then rad_c := glob_larger_float; ord_no := glob_larger_float else if glob__0 < float_abs(nr1*dr2 - nr2*dr1) then rcs := (ds1*dr2 - ds2*dr1 + dr1*dr2)/(nr1*dr2 - nr2*dr1); ord_no := (rcs*nr1 - ds1)/(glob__2*dr1) - c(last_no)/glob__2; if float_abs(rcs) <> glob__0 then if glob__0 < rcs then rad_c := sqrt(rcs)*float_abs(glob_h) else rad_c := glob_larger_float; ord_no := glob_larger_float end if else rad_c := glob_larger_float; ord_no := glob_larger_float end if else rad_c := glob_larger_float; ord_no := glob_larger_float end if end if else rad_c := glob_larger_float; ord_no := glob_larger_float end if; glob_six_term_ord_save := ord_no; rad_c end proc # End Function number 30 # Begin Function number 31 > comp_ord_from_six_terms := proc(term1,term2,term3,term4,term5,term6,last_no) > global glob_six_term_ord_save; > #TOP SIX TERM ORDER ANALYSIS > #TOP SAVED FROM SIX TERM RADIUS ANALYSIS > glob_six_term_ord_save; > #BOTTOM SIX TERM ORDER ANALYSIS > end; comp_ord_from_six_terms := proc( term1, term2, term3, term4, term5, term6, last_no) global glob_six_term_ord_save; glob_six_term_ord_save end proc # End Function number 31 # Begin Function number 32 > factorial_2 := proc(nnn) > ret := nnn!; > ret;; > end; Warning, `ret` is implicitly declared local to procedure `factorial_2` factorial_2 := proc(nnn) local ret; ret := nnn!; ret end proc # End Function number 32 # Begin Function number 33 > factorial_1 := proc(nnn) > global ATS_MAX_TERMS,array_fact_1; > local ret; > if (nnn <= ATS_MAX_TERMS) then # if number 12 > if (array_fact_1[nnn] = 0) then # if number 13 > ret := factorial_2(nnn); > array_fact_1[nnn] := ret; > else > ret := array_fact_1[nnn]; > fi;# end if 13; > else > ret := factorial_2(nnn); > fi;# end if 12; > ret; > end; factorial_1 := proc(nnn) local ret; global ATS_MAX_TERMS, array_fact_1; if nnn <= ATS_MAX_TERMS then if array_fact_1[nnn] = 0 then ret := factorial_2(nnn); array_fact_1[nnn] := ret else ret := array_fact_1[nnn] end if else ret := factorial_2(nnn) end if; ret end proc # End Function number 33 # Begin Function number 34 > factorial_3 := proc(mmm,nnn) > global ATS_MAX_TERMS,array_fact_2; > local ret; > if ((nnn <= ATS_MAX_TERMS) and (mmm <= ATS_MAX_TERMS)) then # if number 12 > if (array_fact_2[mmm,nnn] = 0) then # if number 13 > ret := factorial_1(mmm)/factorial_1(nnn); > array_fact_2[mmm,nnn] := ret; > else > ret := array_fact_2[mmm,nnn]; > fi;# end if 13; > else > ret := factorial_2(mmm)/factorial_2(nnn); > fi;# end if 12; > ret; > end; factorial_3 := proc(mmm, nnn) local ret; global ATS_MAX_TERMS, array_fact_2; if nnn <= ATS_MAX_TERMS and mmm <= ATS_MAX_TERMS then if array_fact_2[mmm, nnn] = 0 then ret := factorial_1(mmm)/factorial_1(nnn); array_fact_2[mmm, nnn] := ret else ret := array_fact_2[mmm, nnn] end if else ret := factorial_2(mmm)/factorial_2(nnn) end if; ret end proc # End Function number 34 # Begin Function number 35 > convfloat := proc(mmm) > (mmm); > end; convfloat := proc(mmm) mmm end proc # End Function number 35 # Begin Function number 36 > elapsed_time_seconds := proc() > time(); > end; elapsed_time_seconds := proc() time() end proc # End Function number 36 # Begin Function number 37 > float_abs := proc(x) > abs(x); > end; float_abs := proc(x) abs(x) end proc # End Function number 37 # Begin Function number 38 > expt := proc(x,y) > x^y; > end; expt := proc(x, y) x^y end proc # End Function number 38 # Begin Function number 39 > neg := proc(x) > -x; > end; neg := proc(x) -x end proc # End Function number 39 # Begin Function number 40 > int_trunc := proc(x) > trunc(x); > end; int_trunc := proc(x) trunc(x) end proc # End Function number 40 # Begin Function number 41 > estimated_needed_step_error := proc(x_start,x_end,estimated_h,estimated_answer) > local desired_abs_gbl_error,range,estimated_steps,step_error; > global glob_desired_digits_correct,ALWAYS,ATS_MAX_TERMS; > omniout_float(ALWAYS,"glob_desired_digits_correct",32,glob_desired_digits_correct,32,""); > desired_abs_gbl_error := expt(glob__10,c( -glob_desired_digits_correct)) * c(float_abs(c(estimated_answer))); > omniout_float(ALWAYS,"estimated_h",32,estimated_h,32,""); > omniout_float(ALWAYS,"estimated_answer",32,estimated_answer,32,""); > omniout_float(ALWAYS,"desired_abs_gbl_error",32,desired_abs_gbl_error,32,""); > range := (x_end - x_start); > omniout_float(ALWAYS,"range",32,range,32,""); > estimated_steps := range / estimated_h; > omniout_float(ALWAYS,"estimated_steps",32,estimated_steps,32,""); > step_error := (c(float_abs(desired_abs_gbl_error) /sqrt(c( estimated_steps))/c(ATS_MAX_TERMS))); > omniout_float(ALWAYS,"step_error",32,step_error,32,""); > (step_error);; > end; estimated_needed_step_error := proc( x_start, x_end, estimated_h, estimated_answer) local desired_abs_gbl_error, range, estimated_steps, step_error; global glob_desired_digits_correct, ALWAYS, ATS_MAX_TERMS; omniout_float(ALWAYS, "glob_desired_digits_correct", 32, glob_desired_digits_correct, 32, ""); desired_abs_gbl_error := expt(glob__10, c(-glob_desired_digits_correct))* c(float_abs(c(estimated_answer))); omniout_float(ALWAYS, "estimated_h", 32, estimated_h, 32, ""); omniout_float(ALWAYS, "estimated_answer", 32, estimated_answer, 32, "") ; omniout_float(ALWAYS, "desired_abs_gbl_error", 32, desired_abs_gbl_error, 32, ""); range := x_end - x_start; omniout_float(ALWAYS, "range", 32, range, 32, ""); estimated_steps := range/estimated_h; omniout_float(ALWAYS, "estimated_steps", 32, estimated_steps, 32, ""); step_error := c(float_abs(desired_abs_gbl_error)/( sqrt(c(estimated_steps))*c(ATS_MAX_TERMS))); omniout_float(ALWAYS, "step_error", 32, step_error, 32, ""); step_error end proc # End Function number 41 #END ATS LIBRARY BLOCK #BEGIN USER FUNCTION BLOCK #BEGIN BLOCK 3 #BEGIN USER DEF BLOCK > exact_soln_y := proc(x) > return(neg(ln(cos(c(x))))); > end; exact_soln_y := proc(x) return neg(ln(cos(c(x)))) end proc #END USER DEF BLOCK #END BLOCK 3 #END USER FUNCTION BLOCK # before write_aux functions # Begin Function number 2 > display_poles := proc() > local rad_given; > global ALWAYS,glob_display_flag,glob_larger_float, glob_large_float, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_guess_error_ord, glob_guess_error_rc, glob_type_given_pole,array_given_rad_poles,array_given_ord_poles,array_rad_test_poles,array_ord_test_poles,glob_least_3_sing,glob_least_6_sing,glob_least_given_sing,glob_least_ratio_sing,array_x ; > if ((glob_type_given_pole = 1) or (glob_type_given_pole = 2)) then # if number 1 > rad_given := sqrt((array_x[1] - array_given_rad_poles[1,1]) * (array_x[1] - array_given_rad_poles[1,1]) + array_given_rad_poles[1,2] * array_given_rad_poles[1,2]); > omniout_float(ALWAYS,"Radius of convergence (given) for eq 1 ",4,rad_given,4," "); > omniout_float(ALWAYS,"Order of pole (given) ",4,array_given_ord_poles[1,1],4," "); > if (rad_given < glob_least_given_sing) then # if number 2 > glob_least_given_sing := rad_given; > fi;# end if 2; > elif > (glob_type_given_pole = 3) then # if number 2 > omniout_str(ALWAYS,"NO POLE (given) for Equation 1"); > elif > (glob_type_given_pole = 5) then # if number 3 > omniout_str(ALWAYS,"SOME POLE (given) for Equation 1"); > else > omniout_str(ALWAYS,"NO INFO (given) for Equation 1"); > fi;# end if 3; > if (array_rad_test_poles[1,1] < glob_large_float) then # if number 3 > omniout_float(ALWAYS,"Radius of convergence (ratio test) for eq 1 ",4,array_rad_test_poles[1,1],4," "); > if (array_rad_test_poles[1,1]< glob_least_ratio_sing) then # if number 4 > glob_least_ratio_sing := array_rad_test_poles[1,1]; > fi;# end if 4; > omniout_float(ALWAYS,"Order of pole (ratio test) ",4, array_ord_test_poles[1,1],4," "); > else > omniout_str(ALWAYS,"NO POLE (ratio test) for Equation 1"); > fi;# end if 3; > if ((array_rad_test_poles[1,2] > glob__small) and (array_rad_test_poles[1,2] < glob_large_float)) then # if number 3 > omniout_float(ALWAYS,"Radius of convergence (three term test) for eq 1 ",4,array_rad_test_poles[1,2],4," "); > if (array_rad_test_poles[1,2]< glob_least_3_sing) then # if number 4 > glob_least_3_sing := array_rad_test_poles[1,2]; > fi;# end if 4; > omniout_float(ALWAYS,"Order of pole (three term test) ",4, array_ord_test_poles[1,2],4," "); > else > omniout_str(ALWAYS,"NO REAL POLE (three term test) for Equation 1"); > fi;# end if 3; > if ((array_rad_test_poles[1,3] > glob__small) and (array_rad_test_poles[1,3] < glob_large_float)) then # if number 3 > omniout_float(ALWAYS,"Radius of convergence (six term test) for eq 1 ",4,array_rad_test_poles[1,3],4," "); > if (array_rad_test_poles[1,3]< glob_least_6_sing) then # if number 4 > glob_least_6_sing := array_rad_test_poles[1,3]; > fi;# end if 4; > omniout_float(ALWAYS,"Order of pole (six term test) ",4, array_ord_test_poles[1,3],4," "); > else > omniout_str(ALWAYS,"NO COMPLEX POLE (six term test) for Equation 1"); > fi;# end if 3 > ; > end; display_poles := proc() local rad_given; global ALWAYS, glob_display_flag, glob_larger_float, glob_large_float, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_guess_error_ord, glob_guess_error_rc, glob_type_given_pole, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, glob_least_3_sing, glob_least_6_sing, glob_least_given_sing, glob_least_ratio_sing, array_x; if glob_type_given_pole = 1 or glob_type_given_pole = 2 then rad_given := sqrt((array_x[1] - array_given_rad_poles[1, 1])* (array_x[1] - array_given_rad_poles[1, 1]) + array_given_rad_poles[1, 2]*array_given_rad_poles[1, 2]); omniout_float(ALWAYS, "Radius of convergence (given) for eq 1 ", 4, rad_given, 4, " "); omniout_float(ALWAYS, "Order of pole (given) ", 4, array_given_ord_poles[1, 1], 4, " "); if rad_given < glob_least_given_sing then glob_least_given_sing := rad_given end if elif glob_type_given_pole = 3 then omniout_str(ALWAYS, "NO POLE (given) for Equation 1") elif glob_type_given_pole = 5 then omniout_str(ALWAYS, "SOME POLE (given) for Equation 1") else omniout_str(ALWAYS, "NO INFO (given) for Equation 1") end if; if array_rad_test_poles[1, 1] < glob_large_float then omniout_float(ALWAYS, "Radius of convergence (ratio test) for eq 1 ", 4, array_rad_test_poles[1, 1], 4, " "); if array_rad_test_poles[1, 1] < glob_least_ratio_sing then glob_least_ratio_sing := array_rad_test_poles[1, 1] end if; omniout_float(ALWAYS, "Order of pole (ratio test) ", 4, array_ord_test_poles[1, 1], 4, " ") else omniout_str(ALWAYS, "NO POLE (ratio test) for Equation 1") end if; if glob__small < array_rad_test_poles[1, 2] and array_rad_test_poles[1, 2] < glob_large_float then omniout_float(ALWAYS, "Radius of convergence (three term test) for eq 1 ", 4, array_rad_test_poles[1, 2], 4, " "); if array_rad_test_poles[1, 2] < glob_least_3_sing then glob_least_3_sing := array_rad_test_poles[1, 2] end if; omniout_float(ALWAYS, "Order of pole (three term test) ", 4, array_ord_test_poles[1, 2], 4, " ") else omniout_str(ALWAYS, "NO REAL POLE (three term test) for Equation 1") end if; if glob__small < array_rad_test_poles[1, 3] and array_rad_test_poles[1, 3] < glob_large_float then omniout_float(ALWAYS, "Radius of convergence (six term test) for eq 1 ", 4, array_rad_test_poles[1, 3], 4, " "); if array_rad_test_poles[1, 3] < glob_least_6_sing then glob_least_6_sing := array_rad_test_poles[1, 3] end if; omniout_float(ALWAYS, "Order of pole (six term test) ", 4, array_ord_test_poles[1, 3], 4, " ") else omniout_str(ALWAYS, "NO COMPLEX POLE (six term test) for Equation 1") end if end proc # End Function number 2 # Begin Function number 3 > my_check_sign := proc( x0 ,xf) > local ret; > if (xf > x0) then # if number 3 > ret := glob__1; > else > ret := glob__m1; > fi;# end if 3; > ret;; > end; my_check_sign := proc(x0, xf) local ret; if x0 < xf then ret := glob__1 else ret := glob__m1 end if; ret end proc # End Function number 3 # Begin Function number 4 > est_size_answer := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local min_size; > min_size := glob_estimated_size_answer; > if (float_abs(array_y[1]) < min_size) then # if number 3 > min_size := float_abs(array_y[1]); > omniout_float(ALWAYS,"min_size",32,min_size,32,""); > fi;# end if 3; > if (min_size < glob__1) then # if number 3 > min_size := glob__1; > omniout_float(ALWAYS,"min_size",32,min_size,32,""); > fi;# end if 3; > min_size; > end; est_size_answer := proc() local min_size; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; min_size := glob_estimated_size_answer; if float_abs(array_y[1]) < min_size then min_size := float_abs(array_y[1]); omniout_float(ALWAYS, "min_size", 32, min_size, 32, "") end if; if min_size < glob__1 then min_size := glob__1; omniout_float(ALWAYS, "min_size", 32, min_size, 32, "") end if; min_size end proc # End Function number 4 # Begin Function number 5 > test_suggested_h := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local max_estimated_step_error,hn_div_ho,hn_div_ho_2,hn_div_ho_3,no_terms,est_tmp; > max_estimated_step_error := glob__small; > no_terms := ATS_MAX_TERMS; > hn_div_ho := glob__0_5; > hn_div_ho_2 := glob__0_25; > hn_div_ho_3 := glob__0_125; > omniout_float(ALWAYS,"hn_div_ho",32,hn_div_ho,32,""); > omniout_float(ALWAYS,"hn_div_ho_2",32,hn_div_ho_2,32,""); > omniout_float(ALWAYS,"hn_div_ho_3",32,hn_div_ho_3,32,""); > est_tmp := float_abs(array_y[no_terms-3] + array_y[no_terms - 2] * hn_div_ho + array_y[no_terms - 1] * hn_div_ho_2 + array_y[no_terms] * hn_div_ho_3); > if (est_tmp >= max_estimated_step_error) then # if number 3 > max_estimated_step_error := est_tmp; > fi;# end if 3; > omniout_float(ALWAYS,"max_estimated_step_error",32,max_estimated_step_error,32,""); > max_estimated_step_error; > end; test_suggested_h := proc() local max_estimated_step_error, hn_div_ho, hn_div_ho_2, hn_div_ho_3, no_terms, est_tmp; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; max_estimated_step_error := glob__small; no_terms := ATS_MAX_TERMS; hn_div_ho := glob__0_5; hn_div_ho_2 := glob__0_25; hn_div_ho_3 := glob__0_125; omniout_float(ALWAYS, "hn_div_ho", 32, hn_div_ho, 32, ""); omniout_float(ALWAYS, "hn_div_ho_2", 32, hn_div_ho_2, 32, ""); omniout_float(ALWAYS, "hn_div_ho_3", 32, hn_div_ho_3, 32, ""); est_tmp := float_abs(array_y[no_terms - 3] + array_y[no_terms - 2]*hn_div_ho + array_y[no_terms - 1]*hn_div_ho_2 + array_y[no_terms]*hn_div_ho_3); if max_estimated_step_error <= est_tmp then max_estimated_step_error := est_tmp end if; omniout_float(ALWAYS, "max_estimated_step_error", 32, max_estimated_step_error, 32, ""); max_estimated_step_error end proc # End Function number 5 # Begin Function number 6 > track_estimated_error := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local hn_div_ho,hn_div_ho_2,hn_div_ho_3,no_terms,est_tmp; > no_terms := ATS_MAX_TERMS; > hn_div_ho := glob__0_5; > hn_div_ho_2 := glob__0_25; > hn_div_ho_3 := glob__0_125; > est_tmp := c(float_abs(array_y[no_terms-3])) + c(float_abs(array_y[no_terms - 2])) * c(hn_div_ho) + c(float_abs(array_y[no_terms - 1])) * c(hn_div_ho_2) + c(float_abs(array_y[no_terms])) * c(hn_div_ho_3); > if (glob_prec * c(float_abs(array_y[1])) > c(est_tmp)) then # if number 3 > est_tmp := c(glob_prec) * c(float_abs(array_y[1])); > fi;# end if 3; > if (c(est_tmp) >= c(array_max_est_error[1])) then # if number 3 > array_max_est_error[1] := c(est_tmp); > fi;# end if 3 > ; > end; track_estimated_error := proc() local hn_div_ho, hn_div_ho_2, hn_div_ho_3, no_terms, est_tmp; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; no_terms := ATS_MAX_TERMS; hn_div_ho := glob__0_5; hn_div_ho_2 := glob__0_25; hn_div_ho_3 := glob__0_125; est_tmp := c(float_abs(array_y[no_terms - 3])) + c(float_abs(array_y[no_terms - 2]))*c(hn_div_ho) + c(float_abs(array_y[no_terms - 1]))*c(hn_div_ho_2) + c(float_abs(array_y[no_terms]))*c(hn_div_ho_3); if c(est_tmp) < glob_prec*c(float_abs(array_y[1])) then est_tmp := c(glob_prec)*c(float_abs(array_y[1])) end if; if c(array_max_est_error[1]) <= c(est_tmp) then array_max_est_error[1] := c(est_tmp) end if end proc # End Function number 6 # Begin Function number 7 > reached_interval := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local ret; > if ((glob_check_sign * array_x[1]) >= (glob_check_sign * glob_next_display - glob_h/glob__10)) then # if number 3 > ret := true; > else > ret := false; > fi;# end if 3; > return(ret); > end; reached_interval := proc() local ret; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; if glob_check_sign*glob_next_display - glob_h/glob__10 <= glob_check_sign*array_x[1] then ret := true else ret := false end if; return ret end proc # End Function number 7 # Begin Function number 8 > display_alot := proc(iter) > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local abserr, closed_form_val_y, ind_var, numeric_val, relerr, term_no, est_rel_err; > #TOP DISPLAY ALOT > if (reached_interval()) then # if number 3 > if (iter >= 0) then # if number 4 > ind_var := array_x[1]; > omniout_float(ALWAYS,"x[1] ",33,ind_var,20," "); > closed_form_val_y := evalf(exact_soln_y(ind_var)); > omniout_float(ALWAYS,"y[1] (closed_form) ",33,closed_form_val_y,20," "); > term_no := 1; > numeric_val := array_y[term_no]; > abserr := float_abs(numeric_val - closed_form_val_y); > omniout_float(ALWAYS,"y[1] (numeric) ",33,numeric_val,20," "); > if (c(float_abs(closed_form_val_y)) > c(glob_prec)) then # if number 5 > relerr := abserr*glob__100/float_abs(closed_form_val_y); > if (c(relerr) > c(glob_prec)) then # if number 6 > glob_good_digits := -int_trunc(log10(c(relerr))) + 3; > else > glob_good_digits := Digits; > fi;# end if 6; > else > relerr := glob__m1 ; > glob_good_digits := -16; > fi;# end if 5; > if (glob_good_digits < glob_min_good_digits) then # if number 5 > glob_min_good_digits := glob_good_digits; > fi;# end if 5; > if (glob_apfp_est_good_digits < glob_min_apfp_est_good_digits) then # if number 5 > glob_min_apfp_est_good_digits := glob_apfp_est_good_digits; > fi;# end if 5; > if (evalf(float_abs(numeric_val)) > glob_prec) then # if number 5 > est_rel_err := evalf(array_max_est_error[1]*100.0 * sqrt(glob_iter)*17*ATS_MAX_TERMS/float_abs(numeric_val)); > if (evalf(est_rel_err) > glob_prec) then # if number 6 > glob_est_digits := -int_trunc(log10(est_rel_err)) + 3; > else > glob_est_digits := Digits; > fi;# end if 6; > else > relerr := glob__m1 ; > glob_est_digits := -16; > fi;# end if 5; > array_est_digits[1] := glob_est_digits; > if (glob_iter = 1) then # if number 5 > array_1st_rel_error[1] := relerr; > else > array_last_rel_error[1] := relerr; > fi;# end if 5; > array_est_rel_error[1] := est_rel_err; > omniout_float(ALWAYS,"absolute error ",4,abserr,20," "); > omniout_float(ALWAYS,"relative error ",4,relerr,20,"%"); > omniout_int(INFO,"Desired digits ",32,glob_desired_digits_correct,4," "); > omniout_int(INFO,"Estimated correct digits ",32,glob_est_digits,4," "); > omniout_int(INFO,"Correct digits ",32,glob_good_digits,4," ") > ; > omniout_float(ALWAYS,"h ",4,glob_h,20," "); > fi;# end if 4; > #BOTTOM DISPLAY ALOT > fi;# end if 3; > end; display_alot := proc(iter) local abserr, closed_form_val_y, ind_var, numeric_val, relerr, term_no, est_rel_err; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; if reached_interval() then if 0 <= iter then ind_var := array_x[1]; omniout_float(ALWAYS, "x[1] ", 33, ind_var, 20, " "); closed_form_val_y := evalf(exact_soln_y(ind_var)); omniout_float(ALWAYS, "y[1] (closed_form) ", 33, closed_form_val_y, 20, " "); term_no := 1; numeric_val := array_y[term_no]; abserr := float_abs(numeric_val - closed_form_val_y); omniout_float(ALWAYS, "y[1] (numeric) ", 33, numeric_val, 20, " "); if c(glob_prec) < c(float_abs(closed_form_val_y)) then relerr := abserr*glob__100/float_abs(closed_form_val_y); if c(glob_prec) < c(relerr) then glob_good_digits := -int_trunc(log10(c(relerr))) + 3 else glob_good_digits := Digits end if else relerr := glob__m1; glob_good_digits := -16 end if; if glob_good_digits < glob_min_good_digits then glob_min_good_digits := glob_good_digits end if; if glob_apfp_est_good_digits < glob_min_apfp_est_good_digits then glob_min_apfp_est_good_digits := glob_apfp_est_good_digits end if; if glob_prec < evalf(float_abs(numeric_val)) then est_rel_err := evalf(array_max_est_error[1]*100.0* sqrt(glob_iter)*17*ATS_MAX_TERMS/float_abs(numeric_val)) ; if glob_prec < evalf(est_rel_err) then glob_est_digits := -int_trunc(log10(est_rel_err)) + 3 else glob_est_digits := Digits end if else relerr := glob__m1; glob_est_digits := -16 end if; array_est_digits[1] := glob_est_digits; if glob_iter = 1 then array_1st_rel_error[1] := relerr else array_last_rel_error[1] := relerr end if; array_est_rel_error[1] := est_rel_err; omniout_float(ALWAYS, "absolute error ", 4, abserr, 20, " "); omniout_float(ALWAYS, "relative error ", 4, relerr, 20, "%"); omniout_int(INFO, "Desired digits ", 32, glob_desired_digits_correct, 4, " "); omniout_int(INFO, "Estimated correct digits ", 32, glob_est_digits, 4, " "); omniout_int(INFO, "Correct digits ", 32, glob_good_digits, 4, " "); omniout_float(ALWAYS, "h ", 4, glob_h, 20, " ") end if end if end proc # End Function number 8 # Begin Function number 9 > prog_report := proc(x_start,x_end) > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec; > #TOP PROGRESS REPORT > clock_sec1 := elapsed_time_seconds(); > total_clock_sec := (clock_sec1) - (glob_orig_start_sec); > glob_clock_sec := (clock_sec1) - (glob_clock_start_sec); > left_sec := (glob_max_sec) + (glob_orig_start_sec) - (clock_sec1); > expect_sec := comp_expect_sec((x_end),(x_start),(array_x[1]) + (glob_h) ,( clock_sec1) - (glob_orig_start_sec)); > opt_clock_sec := ( clock_sec1) - (glob_optimal_clock_start_sec); > glob_optimal_expect_sec := comp_expect_sec((x_end),(x_start),(array_x[1]) +( glob_h) ,( opt_clock_sec)); > glob_total_exp_sec := glob_optimal_expect_sec + c(total_clock_sec); > percent_done := comp_percent((x_end),(x_start),(array_x[1]) + (glob_h)); > glob_percent_done := percent_done; > omniout_str_noeol(INFO,"Total Elapsed Time "); > omniout_timestr((total_clock_sec)); > omniout_str_noeol(INFO,"Elapsed Time(since restart) "); > omniout_timestr((glob_clock_sec)); > if (c(percent_done) < glob__100) then # if number 3 > omniout_str_noeol(INFO,"Expected Time Remaining "); > omniout_timestr((expect_sec)); > omniout_str_noeol(INFO,"Optimized Time Remaining "); > omniout_timestr((glob_optimal_expect_sec)); > omniout_str_noeol(INFO,"Expected Total Time "); > omniout_timestr((glob_total_exp_sec)); > fi;# end if 3; > omniout_str_noeol(INFO,"Time to Timeout "); > omniout_timestr((left_sec)); > omniout_float(INFO, "Percent Done ",33,percent_done,4,"%"); > #BOTTOM PROGRESS REPORT > end; prog_report := proc(x_start, x_end) local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; clock_sec1 := elapsed_time_seconds(); total_clock_sec := clock_sec1 - glob_orig_start_sec; glob_clock_sec := clock_sec1 - glob_clock_start_sec; left_sec := glob_max_sec + glob_orig_start_sec - clock_sec1; expect_sec := comp_expect_sec(x_end, x_start, array_x[1] + glob_h, clock_sec1 - glob_orig_start_sec); opt_clock_sec := clock_sec1 - glob_optimal_clock_start_sec; glob_optimal_expect_sec := comp_expect_sec(x_end, x_start, array_x[1] + glob_h, opt_clock_sec) ; glob_total_exp_sec := glob_optimal_expect_sec + c(total_clock_sec); percent_done := comp_percent(x_end, x_start, array_x[1] + glob_h); glob_percent_done := percent_done; omniout_str_noeol(INFO, "Total Elapsed Time "); omniout_timestr(total_clock_sec); omniout_str_noeol(INFO, "Elapsed Time(since restart) "); omniout_timestr(glob_clock_sec); if c(percent_done) < glob__100 then omniout_str_noeol(INFO, "Expected Time Remaining "); omniout_timestr(expect_sec); omniout_str_noeol(INFO, "Optimized Time Remaining "); omniout_timestr(glob_optimal_expect_sec); omniout_str_noeol(INFO, "Expected Total Time "); omniout_timestr(glob_total_exp_sec) end if; omniout_str_noeol(INFO, "Time to Timeout "); omniout_timestr(left_sec); omniout_float(INFO, "Percent Done ", 33, percent_done, 4, "%") end proc # End Function number 9 # Begin Function number 10 > check_for_pole := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, term1, term2, term3, part1, part2, part3, part4, part5, part6, part7, part8, part9, part10, part11, part12, part13, part14, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found_sing, h_new, ratio, term, local_test, tmp_rad,tmp_ord, tmp_ratio, prev_tmp_rad, last_no; > #TOP CHECK FOR POLE > tmp_rad := glob_larger_float; > prev_tmp_rad := glob_larger_float; > tmp_ratio := glob_larger_float; > rad_c := glob_larger_float; > array_rad_test_poles[1,1] := glob_larger_float; > array_ord_test_poles[1,1] := glob_larger_float; > found_sing := 1; > last_no := ATS_MAX_TERMS - 1 - 10; > cnt := 0; > while (last_no < ATS_MAX_TERMS-3 and found_sing = 1) do # do number 1 > tmp_rad := comp_rad_from_ratio(array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > if (float_abs(prev_tmp_rad) > glob__0) then # if number 3 > tmp_ratio := tmp_rad / prev_tmp_rad; > else > tmp_ratio := glob_large_float; > fi;# end if 3; > if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 3 > rad_c := tmp_rad; > elif > (cnt = 0) then # if number 4 > rad_c := tmp_rad; > elif > (cnt > 0) then # if number 5 > found_sing := 0; > fi;# end if 5; > prev_tmp_rad := tmp_rad;; > cnt := cnt + 1; > last_no := last_no + 1; > od;# end do number 1; > if (found_sing = 1) then # if number 5 > if (rad_c < array_rad_test_poles[1,1]) then # if number 6 > array_rad_test_poles[1,1] := rad_c; > last_no := last_no - 1; > tmp_ord := comp_ord_from_ratio(array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > array_rad_test_poles[1,1] := rad_c; > array_ord_test_poles[1,1] := tmp_ord; > fi;# end if 6; > fi;# end if 5; > #BOTTOM general radius test1 > tmp_rad := glob_larger_float; > prev_tmp_rad := glob_larger_float; > tmp_ratio := glob_larger_float; > rad_c := glob_larger_float; > array_rad_test_poles[1,2] := glob_larger_float; > array_ord_test_poles[1,2] := glob_larger_float; > found_sing := 1; > last_no := ATS_MAX_TERMS - 1 - 10; > cnt := 0; > while (last_no < ATS_MAX_TERMS-4 and found_sing = 1) do # do number 1 > tmp_rad := comp_rad_from_three_terms(array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > if (float_abs(prev_tmp_rad) > glob__0) then # if number 5 > tmp_ratio := tmp_rad / prev_tmp_rad; > else > tmp_ratio := glob_large_float; > fi;# end if 5; > if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 5 > rad_c := tmp_rad; > elif > (cnt = 0) then # if number 6 > rad_c := tmp_rad; > elif > (cnt > 0) then # if number 7 > found_sing := 0; > fi;# end if 7; > prev_tmp_rad := tmp_rad;; > cnt := cnt + 1; > last_no := last_no + 1; > od;# end do number 1; > if (found_sing = 1) then # if number 7 > if (rad_c < array_rad_test_poles[1,2]) then # if number 8 > array_rad_test_poles[1,2] := rad_c; > last_no := last_no - 1; > tmp_ord := comp_ord_from_three_terms(array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > array_rad_test_poles[1,2] := rad_c; > if (rad_c < glob_min_pole_est) then # if number 9 > glob_min_pole_est := rad_c; > fi;# end if 9; > array_ord_test_poles[1,2] := tmp_ord; > fi;# end if 8; > fi;# end if 7; > #BOTTOM general radius test1 > tmp_rad := glob_larger_float; > prev_tmp_rad := glob_larger_float; > tmp_ratio := glob_larger_float; > rad_c := glob_larger_float; > array_rad_test_poles[1,3] := glob_larger_float; > array_ord_test_poles[1,3] := glob_larger_float; > found_sing := 1; > last_no := ATS_MAX_TERMS - 1 - 10; > cnt := 0; > while (last_no < ATS_MAX_TERMS-7 and found_sing = 1) do # do number 1 > tmp_rad := comp_rad_from_six_terms(array_y_higher[1,last_no-5],array_y_higher[1,last_no-4],array_y_higher[1,last_no-3],array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > if (float_abs(prev_tmp_rad) > glob__0) then # if number 7 > tmp_ratio := tmp_rad / prev_tmp_rad; > else > tmp_ratio := glob_large_float; > fi;# end if 7; > if ((cnt > 0 ) and (tmp_ratio < glob_upper_ratio_limit) and (tmp_ratio > glob_lower_ratio_limit)) then # if number 7 > rad_c := tmp_rad; > elif > (cnt = 0) then # if number 8 > rad_c := tmp_rad; > elif > (cnt > 0) then # if number 9 > found_sing := 0; > fi;# end if 9; > prev_tmp_rad := tmp_rad;; > cnt := cnt + 1; > last_no := last_no + 1; > od;# end do number 1; > if (found_sing = 1) then # if number 9 > if (rad_c < array_rad_test_poles[1,3]) then # if number 10 > array_rad_test_poles[1,3] := rad_c; > last_no := last_no - 1; > tmp_ord := comp_ord_from_six_terms(array_y_higher[1,last_no-5],array_y_higher[1,last_no-4],array_y_higher[1,last_no-3],array_y_higher[1,last_no-2],array_y_higher[1,last_no-1],array_y_higher[1,last_no],last_no); > array_rad_test_poles[1,3] := rad_c; > if (rad_c < glob_min_pole_est) then # if number 11 > glob_min_pole_est := rad_c; > fi;# end if 11; > array_ord_test_poles[1,3] := tmp_ord; > fi;# end if 10; > fi;# end if 9; > #BOTTOM general radius test1 > #START ADJUST ALL SERIES > if (float_abs(glob_min_pole_est) * glob_ratio_of_radius < float_abs(glob_h)) then # if number 9 > h_new := glob_check_sign * glob_min_pole_est * glob_ratio_of_radius; > omniout_str(ALWAYS,"SETTING H FOR POLE"); > glob_h_reason := 6; > if (glob_check_sign * glob_min_h > glob_check_sign * h_new) then # if number 10 > omniout_str(ALWAYS,"SETTING H FOR MIN H"); > h_new := glob_min_h; > glob_h_reason := 5; > fi;# end if 10; > term := 1; > ratio := c(1.0); > while (term <= ATS_MAX_TERMS) do # do number 1 > array_y[term] := array_y[term]* ratio; > array_y_higher[1,term] := array_y_higher[1,term]* ratio; > array_x[term] := array_x[term]* ratio; > ratio := ratio * h_new / float_abs(glob_h); > term := term + 1; > od;# end do number 1; > glob_h := h_new; > fi;# end if 9; > #BOTTOM ADJUST ALL SERIES > ; > if (reached_interval()) then # if number 9 > display_poles(); > fi;# end if 9 > end; check_for_pole := proc() local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, term1, term2, term3, part1, part2, part3, part4, part5, part6, part7, part8, part9, part10, part11, part12, part13, part14, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found_sing, h_new, ratio, term, local_test, tmp_rad, tmp_ord, tmp_ratio, prev_tmp_rad, last_no; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; tmp_rad := glob_larger_float; prev_tmp_rad := glob_larger_float; tmp_ratio := glob_larger_float; rad_c := glob_larger_float; array_rad_test_poles[1, 1] := glob_larger_float; array_ord_test_poles[1, 1] := glob_larger_float; found_sing := 1; last_no := ATS_MAX_TERMS - 11; cnt := 0; while last_no < ATS_MAX_TERMS - 3 and found_sing = 1 do tmp_rad := comp_rad_from_ratio(array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); if glob__0 < float_abs(prev_tmp_rad) then tmp_ratio := tmp_rad/prev_tmp_rad else tmp_ratio := glob_large_float end if; if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad elif cnt = 0 then rad_c := tmp_rad elif 0 < cnt then found_sing := 0 end if; prev_tmp_rad := tmp_rad; cnt := cnt + 1; last_no := last_no + 1 end do; if found_sing = 1 then if rad_c < array_rad_test_poles[1, 1] then array_rad_test_poles[1, 1] := rad_c; last_no := last_no - 1; tmp_ord := comp_ord_from_ratio(array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); array_rad_test_poles[1, 1] := rad_c; array_ord_test_poles[1, 1] := tmp_ord end if end if; tmp_rad := glob_larger_float; prev_tmp_rad := glob_larger_float; tmp_ratio := glob_larger_float; rad_c := glob_larger_float; array_rad_test_poles[1, 2] := glob_larger_float; array_ord_test_poles[1, 2] := glob_larger_float; found_sing := 1; last_no := ATS_MAX_TERMS - 11; cnt := 0; while last_no < ATS_MAX_TERMS - 4 and found_sing = 1 do tmp_rad := comp_rad_from_three_terms( array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); if glob__0 < float_abs(prev_tmp_rad) then tmp_ratio := tmp_rad/prev_tmp_rad else tmp_ratio := glob_large_float end if; if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad elif cnt = 0 then rad_c := tmp_rad elif 0 < cnt then found_sing := 0 end if; prev_tmp_rad := tmp_rad; cnt := cnt + 1; last_no := last_no + 1 end do; if found_sing = 1 then if rad_c < array_rad_test_poles[1, 2] then array_rad_test_poles[1, 2] := rad_c; last_no := last_no - 1; tmp_ord := comp_ord_from_three_terms( array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); array_rad_test_poles[1, 2] := rad_c; if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c end if; array_ord_test_poles[1, 2] := tmp_ord end if end if; tmp_rad := glob_larger_float; prev_tmp_rad := glob_larger_float; tmp_ratio := glob_larger_float; rad_c := glob_larger_float; array_rad_test_poles[1, 3] := glob_larger_float; array_ord_test_poles[1, 3] := glob_larger_float; found_sing := 1; last_no := ATS_MAX_TERMS - 11; cnt := 0; while last_no < ATS_MAX_TERMS - 7 and found_sing = 1 do tmp_rad := comp_rad_from_six_terms(array_y_higher[1, last_no - 5], array_y_higher[1, last_no - 4], array_y_higher[1, last_no - 3], array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); if glob__0 < float_abs(prev_tmp_rad) then tmp_ratio := tmp_rad/prev_tmp_rad else tmp_ratio := glob_large_float end if; if 0 < cnt and tmp_ratio < glob_upper_ratio_limit and glob_lower_ratio_limit < tmp_ratio then rad_c := tmp_rad elif cnt = 0 then rad_c := tmp_rad elif 0 < cnt then found_sing := 0 end if; prev_tmp_rad := tmp_rad; cnt := cnt + 1; last_no := last_no + 1 end do; if found_sing = 1 then if rad_c < array_rad_test_poles[1, 3] then array_rad_test_poles[1, 3] := rad_c; last_no := last_no - 1; tmp_ord := comp_ord_from_six_terms( array_y_higher[1, last_no - 5], array_y_higher[1, last_no - 4], array_y_higher[1, last_no - 3], array_y_higher[1, last_no - 2], array_y_higher[1, last_no - 1], array_y_higher[1, last_no], last_no); array_rad_test_poles[1, 3] := rad_c; if rad_c < glob_min_pole_est then glob_min_pole_est := rad_c end if; array_ord_test_poles[1, 3] := tmp_ord end if end if; if float_abs(glob_min_pole_est)*glob_ratio_of_radius < float_abs(glob_h) then h_new := glob_check_sign*glob_min_pole_est*glob_ratio_of_radius; omniout_str(ALWAYS, "SETTING H FOR POLE"); glob_h_reason := 6; if glob_check_sign*h_new < glob_check_sign*glob_min_h then omniout_str(ALWAYS, "SETTING H FOR MIN H"); h_new := glob_min_h; glob_h_reason := 5 end if; term := 1; ratio := c(1.0); while term <= ATS_MAX_TERMS do array_y[term] := array_y[term]*ratio; array_y_higher[1, term] := array_y_higher[1, term]*ratio; array_x[term] := array_x[term]*ratio; ratio := ratio*h_new/float_abs(glob_h); term := term + 1 end do; glob_h := h_new end if; if reached_interval() then display_poles() end if end proc # End Function number 10 # Begin Function number 11 > atomall := proc() > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, #Bottom Generate Globals Decl #BEGIN CONST > array_const_1, > array_const_0D0, #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > local kkk, order_d, adj2, adj3 , temporary, term; > #TOP ATOMALL > # before write maple main top matter > # before generate constants assign > # before generate globals assign > #END OUTFILE1 > #BEGIN OUTFILE2 > #END OUTFILE2 > #BEGIN ATOMHDR1 > #emit pre tan $eq_no = 1 > array_tmp1_a1[1] := sin(array_x[1]); > array_tmp1_a2[1] := cos(array_x[1]); > array_tmp1[1] := (array_tmp1_a1[1] / array_tmp1_a2[1]); > #emit pre add CONST FULL $eq_no = 1 i = 1 > array_tmp2[1] := array_const_0D0[1] + array_tmp1[1]; > #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5 > if ( not array_y_set_initial[1,2]) then # if number 1 > if (1 <= ATS_MAX_TERMS) then # if number 2 > temporary := c(array_tmp2[1]) * (expt((glob_h) , c(1))) * c(factorial_3(0,1)); > if (2 <= ATS_MAX_TERMS) then # if number 3 > array_y[2] := temporary; > array_y_higher[1,2] := temporary; > fi;# end if 3; > temporary := c(temporary) / c(glob_h) * c(1); > array_y_higher[2,1] := c(temporary); > fi;# end if 2; > fi;# end if 1; > kkk := 2; > #END ATOMHDR1 > #BEGIN ATOMHDR2 > #emit pre tan $eq_no = 1 > array_tmp1_a1[2] := array_tmp1_a2[1] * array_x[2] / c(1); > array_tmp1_a2[2] := neg(array_tmp1_a1[1]) * array_x[2] / c(1); > array_tmp1[2] := (array_tmp1_a1[2] - ats(2,array_tmp1_a2,array_tmp1,2)) / array_tmp1_a2[1]; > #emit pre add CONST FULL $eq_no = 1 i = 2 > array_tmp2[2] := array_tmp1[2]; > #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5 > if ( not array_y_set_initial[1,3]) then # if number 1 > if (2 <= ATS_MAX_TERMS) then # if number 2 > temporary := c(array_tmp2[2]) * (expt((glob_h) , c(1))) * c(factorial_3(1,2)); > if (3 <= ATS_MAX_TERMS) then # if number 3 > array_y[3] := temporary; > array_y_higher[1,3] := temporary; > fi;# end if 3; > temporary := c(temporary) / c(glob_h) * c(2); > array_y_higher[2,2] := c(temporary); > fi;# end if 2; > fi;# end if 1; > kkk := 3; > #END ATOMHDR2 > #BEGIN ATOMHDR3 > #emit pre tan $eq_no = 1 > array_tmp1_a1[3] := array_tmp1_a2[2] * array_x[2] / c(2); > array_tmp1_a2[3] := neg(array_tmp1_a1[2]) * array_x[2] / c(2); > array_tmp1[3] := (array_tmp1_a1[3] - ats(3,array_tmp1_a2,array_tmp1,2)) / array_tmp1_a2[1]; > #emit pre add CONST FULL $eq_no = 1 i = 3 > array_tmp2[3] := array_tmp1[3]; > #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5 > if ( not array_y_set_initial[1,4]) then # if number 1 > if (3 <= ATS_MAX_TERMS) then # if number 2 > temporary := c(array_tmp2[3]) * (expt((glob_h) , c(1))) * c(factorial_3(2,3)); > if (4 <= ATS_MAX_TERMS) then # if number 3 > array_y[4] := temporary; > array_y_higher[1,4] := temporary; > fi;# end if 3; > temporary := c(temporary) / c(glob_h) * c(3); > array_y_higher[2,3] := c(temporary); > fi;# end if 2; > fi;# end if 1; > kkk := 4; > #END ATOMHDR3 > #BEGIN ATOMHDR4 > #emit pre tan $eq_no = 1 > array_tmp1_a1[4] := array_tmp1_a2[3] * array_x[2] / c(3); > array_tmp1_a2[4] := neg(array_tmp1_a1[3]) * array_x[2] / c(3); > array_tmp1[4] := (array_tmp1_a1[4] - ats(4,array_tmp1_a2,array_tmp1,2)) / array_tmp1_a2[1]; > #emit pre add CONST FULL $eq_no = 1 i = 4 > array_tmp2[4] := array_tmp1[4]; > #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5 > if ( not array_y_set_initial[1,5]) then # if number 1 > if (4 <= ATS_MAX_TERMS) then # if number 2 > temporary := c(array_tmp2[4]) * (expt((glob_h) , c(1))) * c(factorial_3(3,4)); > if (5 <= ATS_MAX_TERMS) then # if number 3 > array_y[5] := temporary; > array_y_higher[1,5] := temporary; > fi;# end if 3; > temporary := c(temporary) / c(glob_h) * c(4); > array_y_higher[2,4] := c(temporary); > fi;# end if 2; > fi;# end if 1; > kkk := 5; > #END ATOMHDR4 > #BEGIN ATOMHDR5 > #emit pre tan $eq_no = 1 > array_tmp1_a1[5] := array_tmp1_a2[4] * array_x[2] / c(4); > array_tmp1_a2[5] := neg(array_tmp1_a1[4]) * array_x[2] / c(4); > array_tmp1[5] := (array_tmp1_a1[5] - ats(5,array_tmp1_a2,array_tmp1,2)) / array_tmp1_a2[1]; > #emit pre add CONST FULL $eq_no = 1 i = 5 > array_tmp2[5] := array_tmp1[5]; > #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5 > if ( not array_y_set_initial[1,6]) then # if number 1 > if (5 <= ATS_MAX_TERMS) then # if number 2 > temporary := c(array_tmp2[5]) * (expt((glob_h) , c(1))) * c(factorial_3(4,5)); > if (6 <= ATS_MAX_TERMS) then # if number 3 > array_y[6] := temporary; > array_y_higher[1,6] := temporary; > fi;# end if 3; > temporary := c(temporary) / c(glob_h) * c(5); > array_y_higher[2,5] := c(temporary); > fi;# end if 2; > fi;# end if 1; > kkk := 6; > #END ATOMHDR5 > #BEGIN OUTFILE3 > #Top Atomall While Loop-- outfile3 > while (kkk <= ATS_MAX_TERMS) do # do number 1 > #END OUTFILE3 > #BEGIN OUTFILE4 > array_tmp1_a1[kkk] := array_tmp1_a2[kkk-1] * array_x[2] / c(kkk - 1); > array_tmp1_a2[kkk] := neg(array_tmp1_a1[kkk-1]) * array_x[2] / c(kkk - 1); > array_tmp1[kkk] := (array_tmp1_a1[kkk] - ats(kkk ,array_tmp1_a2,array_tmp1,2)) / array_tmp1_a2[1]; > #emit NOT FULL - FULL add $eq_no = 1 > array_tmp2[kkk] := array_tmp1[kkk]; > #emit assign $eq_no = 1 > order_d := 1; > if (kkk + order_d <= ATS_MAX_TERMS) then # if number 1 > if ( not array_y_set_initial[1,kkk + order_d]) then # if number 2 > temporary := c(array_tmp2[kkk]) * expt((glob_h) , c(order_d)) * c(factorial_3((kkk - 1),(kkk + order_d - 1))); > array_y[kkk + order_d] := c(temporary); > array_y_higher[1,kkk + order_d] := c(temporary); > term := kkk + order_d - 1; > adj2 := kkk + order_d - 1; > adj3 := 2; > while ((term >= 1) and (term <= ATS_MAX_TERMS) and (adj3 < order_d + 1)) do # do number 1 > if (adj3 <= order_d + 1) then # if number 3 > if (adj2 > 0) then # if number 4 > temporary := c(temporary) / c(glob_h) * c(adj2); > else > temporary := c(temporary); > fi;# end if 4; > array_y_higher[adj3,term] := c(temporary); > fi;# end if 3; > term := term - 1; > adj2 := adj2 - 1; > adj3 := adj3 + 1; > od;# end do number 1 > fi;# end if 2 > fi;# end if 1; > kkk := kkk + 1; > od;# end do number 1; > #BOTTOM ATOMALL > #END OUTFILE4 > #BEGIN OUTFILE5 > #BOTTOM ATOMALL ??? > end; atomall := proc() local kkk, order_d, adj2, adj3, temporary, term; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; array_tmp1_a1[1] := sin(array_x[1]); array_tmp1_a2[1] := cos(array_x[1]); array_tmp1[1] := array_tmp1_a1[1]/array_tmp1_a2[1]; array_tmp2[1] := array_const_0D0[1] + array_tmp1[1]; if not array_y_set_initial[1, 2] then if 1 <= ATS_MAX_TERMS then temporary := c(array_tmp2[1])*expt(glob_h, c(1))*c(factorial_3(0, 1)); if 2 <= ATS_MAX_TERMS then array_y[2] := temporary; array_y_higher[1, 2] := temporary end if; temporary := c(temporary)*c(1)/c(glob_h); array_y_higher[2, 1] := c(temporary) end if end if; kkk := 2; array_tmp1_a1[2] := array_tmp1_a2[1]*array_x[2]/c(1); array_tmp1_a2[2] := neg(array_tmp1_a1[1])*array_x[2]/c(1); array_tmp1[2] := ( array_tmp1_a1[2] - ats(2, array_tmp1_a2, array_tmp1, 2))/ array_tmp1_a2[1]; array_tmp2[2] := array_tmp1[2]; if not array_y_set_initial[1, 3] then if 2 <= ATS_MAX_TERMS then temporary := c(array_tmp2[2])*expt(glob_h, c(1))*c(factorial_3(1, 2)); if 3 <= ATS_MAX_TERMS then array_y[3] := temporary; array_y_higher[1, 3] := temporary end if; temporary := c(temporary)*c(2)/c(glob_h); array_y_higher[2, 2] := c(temporary) end if end if; kkk := 3; array_tmp1_a1[3] := array_tmp1_a2[2]*array_x[2]/c(2); array_tmp1_a2[3] := neg(array_tmp1_a1[2])*array_x[2]/c(2); array_tmp1[3] := ( array_tmp1_a1[3] - ats(3, array_tmp1_a2, array_tmp1, 2))/ array_tmp1_a2[1]; array_tmp2[3] := array_tmp1[3]; if not array_y_set_initial[1, 4] then if 3 <= ATS_MAX_TERMS then temporary := c(array_tmp2[3])*expt(glob_h, c(1))*c(factorial_3(2, 3)); if 4 <= ATS_MAX_TERMS then array_y[4] := temporary; array_y_higher[1, 4] := temporary end if; temporary := c(temporary)*c(3)/c(glob_h); array_y_higher[2, 3] := c(temporary) end if end if; kkk := 4; array_tmp1_a1[4] := array_tmp1_a2[3]*array_x[2]/c(3); array_tmp1_a2[4] := neg(array_tmp1_a1[3])*array_x[2]/c(3); array_tmp1[4] := ( array_tmp1_a1[4] - ats(4, array_tmp1_a2, array_tmp1, 2))/ array_tmp1_a2[1]; array_tmp2[4] := array_tmp1[4]; if not array_y_set_initial[1, 5] then if 4 <= ATS_MAX_TERMS then temporary := c(array_tmp2[4])*expt(glob_h, c(1))*c(factorial_3(3, 4)); if 5 <= ATS_MAX_TERMS then array_y[5] := temporary; array_y_higher[1, 5] := temporary end if; temporary := c(temporary)*c(4)/c(glob_h); array_y_higher[2, 4] := c(temporary) end if end if; kkk := 5; array_tmp1_a1[5] := array_tmp1_a2[4]*array_x[2]/c(4); array_tmp1_a2[5] := neg(array_tmp1_a1[4])*array_x[2]/c(4); array_tmp1[5] := ( array_tmp1_a1[5] - ats(5, array_tmp1_a2, array_tmp1, 2))/ array_tmp1_a2[1]; array_tmp2[5] := array_tmp1[5]; if not array_y_set_initial[1, 6] then if 5 <= ATS_MAX_TERMS then temporary := c(array_tmp2[5])*expt(glob_h, c(1))*c(factorial_3(4, 5)); if 6 <= ATS_MAX_TERMS then array_y[6] := temporary; array_y_higher[1, 6] := temporary end if; temporary := c(temporary)*c(5)/c(glob_h); array_y_higher[2, 5] := c(temporary) end if end if; kkk := 6; while kkk <= ATS_MAX_TERMS do array_tmp1_a1[kkk] := array_tmp1_a2[kkk - 1]*array_x[2]/c(kkk - 1); array_tmp1_a2[kkk] := neg(array_tmp1_a1[kkk - 1])*array_x[2]/c(kkk - 1); array_tmp1[kkk] := ( array_tmp1_a1[kkk] - ats(kkk, array_tmp1_a2, array_tmp1, 2))/ array_tmp1_a2[1]; array_tmp2[kkk] := array_tmp1[kkk]; order_d := 1; if kkk + order_d <= ATS_MAX_TERMS then if not array_y_set_initial[1, kkk + order_d] then temporary := c(array_tmp2[kkk])*expt(glob_h, c(order_d))* c(factorial_3(kkk - 1, kkk + order_d - 1)); array_y[kkk + order_d] := c(temporary); array_y_higher[1, kkk + order_d] := c(temporary); term := kkk + order_d - 1; adj2 := kkk + order_d - 1; adj3 := 2; while 1 <= term and term <= ATS_MAX_TERMS and adj3 < order_d + 1 do if adj3 <= order_d + 1 then if 0 < adj2 then temporary := c(temporary)*c(adj2)/c(glob_h) else temporary := c(temporary) end if; array_y_higher[adj3, term] := c(temporary) end if; term := term - 1; adj2 := adj2 - 1; adj3 := adj3 + 1 end do end if end if; kkk := kkk + 1 end do end proc # End Function number 12 #END OUTFILE5 # Begin Function number 12 > main := proc() > #BEGIN OUTFIEMAIN > local d1,d2,d3,d4,est_err_2,niii,done_once,max_terms,display_max, > term,ord,order_diff,term_no,html_log_file,iiif,jjjf, > rows,r_order,sub_iter,calc_term,iii,temp_sum,current_iter, > x_start,x_end > ,it,last_min_pole_est, opt_iter, tmp,subiter, est_needed_step_err,estimated_step_error,min_value,est_answer,found_h,repeat_it; > global > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > glob_no_sing_tests, > glob_ratio_test, > glob_three_term_test, > glob_six_term_test, > glob_log_10, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob__small, > glob_small_float, > glob_smallish_float, > glob_large_float, > glob_larger_float, > glob__m2, > glob__m1, > glob__0, > glob__1, > glob__2, > glob__3, > glob__4, > glob__5, > glob__8, > glob__10, > glob__100, > glob__pi, > glob__0_5, > glob__0_8, > glob__m0_8, > glob__0_25, > glob__0_125, > glob_prec, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_estimated_size_answer, > glob_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_disp_incr, > glob_h, > glob_diff_rc_fm, > glob_diff_rc_fmm1, > glob_diff_rc_fmm2, > glob_diff_ord_fm, > glob_diff_ord_fmm1, > glob_diff_ord_fmm2, > glob_six_term_ord_save, > glob_guess_error_rc, > glob_guess_error_ord, > glob_least_given_sing, > glob_least_ratio_sing, > glob_least_3_sing, > glob_least_6_sing, > glob_last_good_h, > glob_max_h, > glob_min_h, > glob_display_interval, > glob_abserr, > glob_relerr, > glob_min_pole_est, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_max_hours, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_upper_ratio_limit, > glob_lower_ratio_limit, > glob_max_sec, > glob_orig_start_sec, > glob_normmax, > glob_max_minutes, > glob_next_display, > glob_est_digits, > glob_subiter_method, > glob_html_log, > glob_min_good_digits, > glob_good_digits, > glob_min_apfp_est_good_digits, > glob_apfp_est_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > glob_h_reason, > glob_sec_in_minute, > glob_min_in_hour, > glob_hours_in_day, > glob_days_in_year, > glob_sec_in_hour, > glob_sec_in_day, > glob_sec_in_year, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_type_given_pole, > glob_optimize, > glob_look_poles, > glob_dump_closed_form, > glob_max_iter, > glob_no_eqs, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_start, > glob_iter, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_1st_rel_error, > array_last_rel_error, > array_est_rel_error, > array_max_est_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_est_digits, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1_a1, > array_tmp1_a2, > array_tmp1, > array_tmp2, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_given_rad_poles, > array_given_ord_poles, > array_rad_test_poles, > array_ord_test_poles, > array_fact_2, > ATS_MAX_TERMS, > glob_last; > ATS_MAX_TERMS := 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_y_init:= Array(0..(40),[]); > array_norms:= Array(0..(40),[]); > array_fact_1:= Array(0..(40),[]); > array_1st_rel_error:= Array(0..(2),[]); > array_last_rel_error:= Array(0..(2),[]); > array_est_rel_error:= Array(0..(2),[]); > array_max_est_error:= Array(0..(2),[]); > array_type_pole:= Array(0..(2),[]); > array_type_real_pole:= Array(0..(2),[]); > array_type_complex_pole:= Array(0..(2),[]); > array_est_digits:= Array(0..(2),[]); > array_y:= Array(0..(40),[]); > array_x:= Array(0..(40),[]); > array_tmp0:= Array(0..(40),[]); > array_tmp1_g:= Array(0..(40),[]); > array_tmp1_a1:= Array(0..(40),[]); > array_tmp1_a2:= Array(0..(40),[]); > array_tmp1:= Array(0..(40),[]); > array_tmp2:= Array(0..(40),[]); > array_m1:= Array(0..(40),[]); > array_y_higher := Array(0..(2) ,(0..40+ 1),[]); > array_y_higher_work := Array(0..(2) ,(0..40+ 1),[]); > array_y_higher_work2 := Array(0..(2) ,(0..40+ 1),[]); > array_y_set_initial := Array(0..(2) ,(0..40+ 1),[]); > array_given_rad_poles := Array(0..(2) ,(0..3+ 1),[]); > array_given_ord_poles := Array(0..(2) ,(0..3+ 1),[]); > array_rad_test_poles := Array(0..(2) ,(0..4+ 1),[]); > array_ord_test_poles := Array(0..(2) ,(0..4+ 1),[]); > array_fact_2 := Array(0..(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_y_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 <= 2) do # do number 1 > array_1st_rel_error[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_last_rel_error[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_est_rel_error[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_max_est_error[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_pole[term] := 0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_real_pole[term] := 0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_complex_pole[term] := 0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_est_digits[term] := 0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 40) do # do number 1 > array_y[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_tmp0[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 40) do # do number 1 > array_tmp1_g[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 40) do # do number 1 > array_tmp1_a1[term] := c(0.0); > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 40) do # do number 1 > array_tmp1_a2[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_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_y_higher[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 40) do # do number 2 > array_y_higher_work[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 40) do # do number 2 > array_y_higher_work2[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 40) do # do number 2 > array_y_set_initial[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 3) do # do number 2 > array_given_rad_poles[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 3) do # do number 2 > array_given_ord_poles[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 4) do # do number 2 > array_rad_test_poles[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= 4) do # do number 2 > array_ord_test_poles[ord,term] := c(0.0); > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=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_y); > zero_ats_ar(array_x); > zero_ats_ar(array_tmp0); > zero_ats_ar(array_tmp1_g); > zero_ats_ar(array_tmp1_a1); > zero_ats_ar(array_tmp1_a2); > zero_ats_ar(array_tmp1); > zero_ats_ar(array_tmp2); > zero_ats_ar(array_m1); > zero_ats_ar(array_const_1); > array_const_1[1] := c(1); > zero_ats_ar(array_const_0D0); > array_const_0D0[1] := c(0.0); > zero_ats_ar(array_m1); > array_m1[1] := glob__m1; > #END SYMBOLS INITIALIZATED > # before generate factorials init > #Initing Factorial Tables > iiif := 0; > while (iiif <= ATS_MAX_TERMS) do # do number 1 > jjjf := 0; > while (jjjf <= ATS_MAX_TERMS) do # do number 2 > array_fact_1[iiif] := 0; > array_fact_2[iiif,jjjf] := 0; > jjjf := jjjf + 1; > od;# end do number 2; > iiif := iiif + 1; > od;# end do number 1; > #Done Initing Factorial Table > ALWAYS := 1; > INFO := 2; > DEBUGL := 3; > DEBUGMASSIVE := 4; > glob_iolevel := 5; > glob_yes_pole := 4; > glob_no_pole := 3; > glob_not_given := 0; > glob_no_sing_tests := 4; > glob_ratio_test := 1; > glob_three_term_test := 2; > glob_six_term_test := 3; > glob_log_10 := log(c(10.0)); > MAX_UNCHANGED := 10; > glob__small := c(0.1e-50); > glob_small_float := c(0.1e-50); > glob_smallish_float := c(0.1e-60); > glob_large_float := c(1.0e100); > glob_larger_float := c(1.1e100); > glob__m2 := c(-2); > glob__m1 := c(-1); > glob__0 := c(0); > glob__1 := c(1); > glob__2 := c(2); > glob__3 := c(3); > glob__4 := c(4); > glob__5 := c(5); > glob__8 := c(8); > glob__10 := c(10); > glob__100 := c(100); > glob__pi := c(0.0); > glob__0_5 := c(0.5); > glob__0_8 := c(0.8); > glob__m0_8 := c(-0.8); > glob__0_25 := c(0.25); > glob__0_125 := c(0.125); > glob_prec := c(1.0e-16); > glob_check_sign := c(1.0); > glob_desired_digits_correct := c(8.0); > glob_max_estimated_step_error := c(0.0); > glob_ratio_of_radius := c(0.1); > glob_percent_done := c(0.0); > glob_total_exp_sec := c(0.1); > glob_optimal_expect_sec := c(0.1); > glob_estimated_size_answer := c(100.0); > glob_almost_1 := c(0.9990); > glob_clock_sec := c(0.0); > glob_clock_start_sec := c(0.0); > glob_disp_incr := c(0.1); > glob_h := c(0.1); > glob_diff_rc_fm := c(0.1); > glob_diff_rc_fmm1 := c(0.1); > glob_diff_rc_fmm2 := c(0.1); > glob_diff_ord_fm := c(0.1); > glob_diff_ord_fmm1 := c(0.1); > glob_diff_ord_fmm2 := c(0.1); > glob_six_term_ord_save := c(0.1); > glob_guess_error_rc := c(0.1); > glob_guess_error_ord := c(0.1); > glob_least_given_sing := c(9.9e200); > glob_least_ratio_sing := c(9.9e200); > glob_least_3_sing := c(9.9e100); > glob_least_6_sing := c(9.9e100); > glob_last_good_h := c(0.1); > glob_max_h := c(0.1); > glob_min_h := c(0.000001); > glob_display_interval := c(0.1); > glob_abserr := c(0.1e-10); > glob_relerr := c(0.1e-10); > glob_min_pole_est := c(0.1e+10); > glob_max_rel_trunc_err := c(0.1e-10); > glob_max_trunc_err := c(0.1e-10); > glob_max_hours := c(0.0); > glob_optimal_clock_start_sec := c(0.0); > glob_optimal_start := c(0.0); > glob_upper_ratio_limit := c(1.0001); > glob_lower_ratio_limit := c(0.9999); > glob_max_sec := c(10000.0); > glob_orig_start_sec := c(0.0); > glob_normmax := c(0.0); > glob_max_minutes := c(0.0); > glob_next_display := c(0.0); > glob_est_digits := 1; > glob_subiter_method := 3; > glob_html_log := true; > glob_min_good_digits := 99999; > glob_good_digits := 0; > glob_min_apfp_est_good_digits := 99999; > glob_apfp_est_good_digits := 0; > glob_max_opt_iter := 10; > glob_dump := false; > glob_djd_debug := true; > glob_display_flag := true; > glob_djd_debug2 := true; > glob_h_reason := 0; > glob_sec_in_minute := 60 ; > glob_min_in_hour := 60; > glob_hours_in_day := 24; > glob_days_in_year := 365; > glob_sec_in_hour := 3600; > glob_sec_in_day := 86400; > glob_sec_in_year := 31536000; > glob_not_yet_finished := true; > glob_initial_pass := true; > glob_not_yet_start_msg := true; > glob_reached_optimal_h := false; > glob_optimal_done := false; > glob_type_given_pole := 0; > glob_optimize := false; > glob_look_poles := false; > glob_dump_closed_form := false; > glob_max_iter := 1000; > glob_no_eqs := 0; > glob_unchanged_h_cnt := 0; > glob_warned := false; > glob_warned2 := false; > glob_start := 0; > glob_iter := 0; > # before generate set diff initial > array_y_set_initial[1,1] := true; > array_y_set_initial[1,2] := false; > array_y_set_initial[1,3] := false; > array_y_set_initial[1,4] := false; > array_y_set_initial[1,5] := false; > array_y_set_initial[1,6] := false; > array_y_set_initial[1,7] := false; > array_y_set_initial[1,8] := false; > array_y_set_initial[1,9] := false; > array_y_set_initial[1,10] := false; > array_y_set_initial[1,11] := false; > array_y_set_initial[1,12] := false; > array_y_set_initial[1,13] := false; > array_y_set_initial[1,14] := false; > array_y_set_initial[1,15] := false; > array_y_set_initial[1,16] := false; > array_y_set_initial[1,17] := false; > array_y_set_initial[1,18] := false; > array_y_set_initial[1,19] := false; > array_y_set_initial[1,20] := false; > array_y_set_initial[1,21] := false; > array_y_set_initial[1,22] := false; > array_y_set_initial[1,23] := false; > array_y_set_initial[1,24] := false; > array_y_set_initial[1,25] := false; > array_y_set_initial[1,26] := false; > array_y_set_initial[1,27] := false; > array_y_set_initial[1,28] := false; > array_y_set_initial[1,29] := false; > array_y_set_initial[1,30] := false; > array_y_set_initial[1,31] := false; > array_y_set_initial[1,32] := false; > array_y_set_initial[1,33] := false; > array_y_set_initial[1,34] := false; > array_y_set_initial[1,35] := false; > array_y_set_initial[1,36] := false; > array_y_set_initial[1,37] := false; > array_y_set_initial[1,38] := false; > array_y_set_initial[1,39] := false; > array_y_set_initial[1,40] := false; > # 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 := 1; > glob_iter := -1; > opt_iter := -1; > glob_max_iter := 50000; > glob_max_hours := (0.0); > glob_max_minutes := (15.0); > omniout_str(ALWAYS,"##############ECHO OF PROBLEM#################"); > omniout_str(ALWAYS,"##############temp/tanpostode.ode#################"); > omniout_str(ALWAYS,"diff ( y , x , 1 ) = tan ( x ) ; "); > 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(1.5) ;"); > omniout_str(ALWAYS,"array_y_init[0 + 1] := exact_soln_y(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 := 1;"); > omniout_str(ALWAYS,""); > omniout_str(ALWAYS,"array_given_rad_poles[1,1] := c(1.570796327);"); > omniout_str(ALWAYS,""); > omniout_str(ALWAYS,"array_given_rad_poles[1,2] := c(0.0);"); > omniout_str(ALWAYS,""); > omniout_str(ALWAYS,"array_given_ord_poles[1,1] := c(0.0);"); > omniout_str(ALWAYS,""); > omniout_str(ALWAYS,"array_given_ord_poles[1,2] := c(0.0);"); > omniout_str(ALWAYS,""); > omniout_str(ALWAYS,"#END SECOND INPUT BLOCK"); > omniout_str(ALWAYS,"#BEGIN OVERRIDE BLOCK"); > omniout_str(ALWAYS,"glob_desired_digits_correct:=8;"); > omniout_str(ALWAYS,"glob_max_minutes:=(3.0);"); > omniout_str(ALWAYS,"glob_subiter_method:=3;"); > omniout_str(ALWAYS,"glob_max_iter:=100000;"); > omniout_str(ALWAYS,"glob_upper_ratio_limit:=c(1.000001);"); > omniout_str(ALWAYS,"glob_lower_ratio_limit:=c(0.999999);"); > omniout_str(ALWAYS,"glob_look_poles:=true;"); > omniout_str(ALWAYS,"glob_h:=c(0.001);"); > omniout_str(ALWAYS,"glob_display_interval:=c(0.01);"); > omniout_str(ALWAYS,"#END OVERRIDE BLOCK"); > omniout_str(ALWAYS,"!"); > omniout_str(ALWAYS,"#BEGIN USER DEF BLOCK"); > omniout_str(ALWAYS,"exact_soln_y := proc(x)"); > omniout_str(ALWAYS,"return(neg(ln(cos(c(x)))));"); > omniout_str(ALWAYS,"end;"); > omniout_str(ALWAYS,"#END USER DEF BLOCK"); > omniout_str(ALWAYS,"#######END OF ECHO OF PROBLEM#################"); > glob_unchanged_h_cnt := 0; > glob_warned := false; > glob_warned2 := false; > glob_small_float := glob__0; > glob_smallish_float := glob__0; > glob_large_float := c(1.0e100); > glob_larger_float := c( 1.1e100); > glob_almost_1 := c( 0.99); > # before second block > #TOP SECOND INPUT BLOCK > #BEGIN SECOND INPUT BLOCK > #BEGIN BLOCK 2 > #END FIRST INPUT BLOCK > #BEGIN SECOND INPUT BLOCK > x_start := c(0.1); > x_end := c(1.5) ; > array_y_init[0 + 1] := exact_soln_y(x_start); > glob_look_poles := true; > glob_type_given_pole := 1; > array_given_rad_poles[1,1] := c(1.570796327); > array_given_rad_poles[1,2] := c(0.0); > array_given_ord_poles[1,1] := c(0.0); > array_given_ord_poles[1,2] := c(0.0); > #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.000001); > glob_lower_ratio_limit:=c(0.999999); > glob_look_poles:=true; > glob_h:=c(0.001); > glob_display_interval:=c(0.01); > #END OVERRIDE BLOCK > #END BLOCK 2 > #END SECOND INPUT BLOCK > #BEGIN INITS AFTER SECOND INPUT BLOCK > glob_last_good_h := glob_h; > glob_max_sec := (60.0) * (glob_max_minutes) + (3600.0) * (glob_max_hours); > # after second input block > glob_check_sign := c(my_check_sign(x_start,x_end)); > glob__pi := arccos(glob__m1); > glob_prec = expt(10.0,c(-Digits)); > if (glob_optimize) then # if number 9 > #BEGIN OPTIMIZE CODE > omniout_str(ALWAYS,"START of Optimize"); > #Start Series -- INITIALIZE FOR OPTIMIZE > found_h := false; > glob_min_pole_est := glob_larger_float; > last_min_pole_est := glob_larger_float; > glob_least_given_sing := glob_larger_float; > glob_least_ratio_sing := glob_larger_float; > glob_least_3_sing := glob_larger_float; > glob_least_6_sing := glob_larger_float; > glob_min_h := float_abs(glob_min_h) * glob_check_sign; > glob_max_h := float_abs(glob_max_h) * glob_check_sign; > glob_h := float_abs(glob_min_h) * glob_check_sign; > glob_display_interval := c((float_abs(c(glob_display_interval))) * (glob_check_sign)); > display_max := c(x_end) - c(x_start)/glob__10; > if ((glob_display_interval) > (display_max)) then # if number 10 > glob_display_interval := c(display_max); > fi;# end if 10; > chk_data(); > min_value := glob_larger_float; > est_answer := est_size_answer(); > opt_iter := 1; > est_needed_step_err := estimated_needed_step_error(x_start,x_end,glob_h,est_answer); > omniout_float(ALWAYS,"est_needed_step_err",32,est_needed_step_err,16,""); > estimated_step_error := glob_small_float; > while ((opt_iter <= 100) and ( not found_h)) do # do number 1 > omniout_int(ALWAYS,"opt_iter",32,opt_iter,4,""); > array_x[1] := c(x_start); > array_x[2] := c(glob_h); > glob_next_display := c(x_start); > order_diff := 1; > #Start Series array_y > term_no := 1; > while (term_no <= order_diff) do # do number 2 > array_y[term_no] := array_y_init[term_no] * expt(glob_h , c(term_no - 1)) / c(factorial_1(term_no - 1)); > term_no := term_no + 1; > od;# end do number 2; > rows := order_diff; > r_order := 1; > while (r_order <= rows) do # do number 2 > term_no := 1; > while (term_no <= (rows - r_order + 1)) do # do number 3 > it := term_no + r_order - 1; > if (term_no < ATS_MAX_TERMS) then # if number 10 > array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1))); > fi;# end if 10; > term_no := term_no + 1; > od;# end do number 3; > r_order := r_order + 1; > od;# end do number 2 > ; > atomall(); > if (glob_check_sign * glob_min_h >= glob_check_sign * glob_h) then # if number 10 > omniout_str(ALWAYS,"SETTING H FOR MIN H"); > glob_h := glob_check_sign * float_abs(glob_min_h); > glob_h_reason := 1; > found_h := true; > fi;# end if 10; > if (glob_check_sign * glob_display_interval <= glob_check_sign * glob_h) then # if number 10 > omniout_str(ALWAYS,"SETTING H FOR DISPLAY INTERVAL"); > glob_h_reason := 2; > glob_h := glob_display_interval; > found_h := true; > fi;# end if 10; > if (glob_look_poles) then # if number 10 > check_for_pole(); > fi;# end if 10; > if ( not found_h) then # if number 10 > est_answer := est_size_answer(); > est_needed_step_err := estimated_needed_step_error(x_start,x_end,glob_h,est_answer); > omniout_float(ALWAYS,"est_needed_step_err",32,est_needed_step_err,16,""); > estimated_step_error := test_suggested_h(); > omniout_float(ALWAYS,"estimated_step_error",32,estimated_step_error,32,""); > if (estimated_step_error < est_needed_step_err) then # if number 11 > omniout_str(ALWAYS,"Double H and LOOP"); > glob_h := glob_h*glob__2; > else > omniout_str(ALWAYS,"Found H for OPTIMAL"); > found_h := true; > glob_h_reason := 3; > glob_h := glob_h/glob__2; > fi;# end if 11; > fi;# end if 10; > opt_iter := opt_iter + 1; > od;# end do number 1; > if (( not found_h) and (opt_iter = 1)) then # if number 10 > omniout_str(ALWAYS,"Beginning glob_h too large."); > found_h := false; > fi;# end if 10; > if (glob_check_sign * glob_max_h <= glob_check_sign * glob_h) then # if number 10 > omniout_str(ALWAYS,"SETTING H FOR MAX H"); > glob_h := glob_check_sign * float_abs(glob_max_h); > glob_h_reason := 1; > found_h := true; > fi;# end if 10; > else > found_h := true; > glob_h := glob_h * glob_check_sign; > fi;# end if 9; > #END OPTIMIZE CODE > if (glob_html_log) then # if number 9 > html_log_file := fopen("entry.html",WRITE,TEXT); > fi;# end if 9; > #BEGIN SOLUTION CODE > if (found_h) then # if number 9 > omniout_str(ALWAYS,"START of Soultion"); > #Start Series -- INITIALIZE FOR SOLUTION > array_x[1] := c(x_start); > array_x[2] := c(glob_h); > glob_next_display := c(x_start); > glob_min_pole_est := glob_larger_float; > glob_least_given_sing := glob_larger_float; > glob_least_ratio_sing := glob_larger_float; > glob_least_3_sing := glob_larger_float; > glob_least_6_sing := glob_larger_float; > order_diff := 1; > #Start Series array_y > term_no := 1; > while (term_no <= order_diff) do # do number 1 > array_y[term_no] := array_y_init[term_no] * expt(glob_h , c(term_no - 1)) / c(factorial_1(term_no - 1)); > term_no := term_no + 1; > od;# end do number 1; > rows := order_diff; > r_order := 1; > while (r_order <= rows) do # do number 1 > term_no := 1; > while (term_no <= (rows - r_order + 1)) do # do number 2 > it := term_no + r_order - 1; > if (term_no < ATS_MAX_TERMS) then # if number 10 > array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , c(term_no - 1)) / (c(factorial_1(term_no - 1))); > fi;# end if 10; > term_no := term_no + 1; > od;# end do number 2; > r_order := r_order + 1; > od;# end do number 1 > ; > current_iter := 1; > glob_clock_start_sec := elapsed_time_seconds(); > glob_clock_sec := elapsed_time_seconds(); > glob_iter := 0; > omniout_str(DEBUGL," "); > glob_reached_optimal_h := true; > glob_optimal_clock_start_sec := elapsed_time_seconds(); > while ((glob_iter < glob_max_iter) and (glob_check_sign * array_x[1] < glob_check_sign * x_end ) and (((glob_clock_sec) - (glob_orig_start_sec)) < (glob_max_sec))) do # do number 1 > #left paren 0001C > if (reached_interval()) then # if number 10 > omniout_str(INFO," "); > omniout_str(INFO,"TOP MAIN SOLVE Loop"); > fi;# end if 10; > glob_iter := glob_iter + 1; > glob_clock_sec := elapsed_time_seconds(); > track_estimated_error(); > atomall(); > track_estimated_error(); > display_alot(current_iter); > if (glob_look_poles) then # if number 10 > check_for_pole(); > fi;# end if 10; > if (reached_interval()) then # if number 10 > glob_next_display := glob_next_display + glob_display_interval; > fi;# end if 10; > array_x[1] := array_x[1] + glob_h; > array_x[2] := glob_h; > #Jump Series array_y; > order_diff := 2; > #START PART 1 SUM AND ADJUST > #START SUM AND ADJUST EQ =1 > #sum_and_adjust array_y > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 2; > calc_term := 1; > #adjust_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[2,iii] := array_y_higher[2,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1)); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := glob__0; > ord := 2; > calc_term := 1; > #sum_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > temp_sum := temp_sum + array_y_higher_work[ord,iii]; > iii := iii - 1; > od;# end do number 2; > array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 1; > calc_term := 2; > #adjust_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1)); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := glob__0; > ord := 1; > calc_term := 2; > #sum_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > temp_sum := temp_sum + array_y_higher_work[ord,iii]; > iii := iii - 1; > od;# end do number 2; > array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 1; > calc_term := 1; > #adjust_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , c(calc_term - 1)) / c(factorial_3(iii - calc_term , iii - 1)); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := glob__0; > ord := 1; > calc_term := 1; > #sum_subseriesarray_y > iii := ATS_MAX_TERMS; > while (iii >= calc_term) do # do number 2 > temp_sum := temp_sum + array_y_higher_work[ord,iii]; > iii := iii - 1; > od;# end do number 2; > array_y_higher_work2[ord,calc_term] := temp_sum * expt(glob_h , c(calc_term - 1)) / c(factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #END SUM AND ADJUST EQ =1 > #END PART 1 > #START PART 2 MOVE TERMS to REGULAR Array > term_no := ATS_MAX_TERMS; > while (term_no >= 1) do # do number 2 > array_y[term_no] := array_y_higher_work2[1,term_no]; > ord := 1; > while (ord <= order_diff) do # do number 3 > array_y_higher[ord,term_no] := array_y_higher_work2[ord,term_no]; > ord := ord + 1; > od;# end do number 3; > term_no := term_no - 1; > od;# end do number 2; > #END PART 2 HEVE MOVED TERMS to REGULAR Array > ; > od;# end do number 1;#right paren 0001C > omniout_str(ALWAYS,"Finished!"); > if (glob_iter >= glob_max_iter) then # if number 10 > omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!"); > fi;# end if 10; > if (elapsed_time_seconds() - (glob_orig_start_sec) >= (glob_max_sec )) then # if number 10 > omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!"); > fi;# end if 10; > glob_clock_sec := elapsed_time_seconds(); > omniout_str(INFO,"diff ( y , x , 1 ) = tan ( x ) ; "); > omniout_int(INFO,"Iterations ",32,glob_iter,4," ") > ; > prog_report(x_start,x_end); > if (glob_html_log) then # if number 10 > logstart(html_log_file); > logitem_str(html_log_file,"2015-05-01T22:58:32-05:00") > ; > logitem_str(html_log_file,"Maple") > ; > logitem_str(html_log_file,"tan") > ; > logitem_str(html_log_file,"diff ( y , x , 1 ) = tan ( x ) ; ") > ; > logitem_float(html_log_file,x_start) > ; > logitem_float(html_log_file,x_end) > ; > logitem_float(html_log_file,array_x[1]) > ; > logitem_float(html_log_file,glob_h) > ; > logitem_h_reason(html_log_file) > ; > logitem_integer(html_log_file,Digits) > ; > ; > logitem_float(html_log_file,glob_desired_digits_correct) > ; > if (array_est_digits[1] <> -16) then # if number 11 > logitem_integer(html_log_file,array_est_digits[1]) > ; > else > logitem_str(html_log_file,"Unknown") > ; > fi;# end if 11; > if (glob_min_good_digits <> -16) then # if number 11 > logitem_integer(html_log_file,glob_min_good_digits) > ; > else > logitem_str(html_log_file,"Unknown") > ; > fi;# end if 11; > if (glob_good_digits <> -16) then # if number 11 > logitem_integer(html_log_file,glob_good_digits) > ; > else > logitem_str(html_log_file,"Unknown") > ; > fi;# end if 11; > logitem_str(html_log_file,"NA") > ; > logitem_str(html_log_file,"NA") > ; > logitem_integer(html_log_file,ATS_MAX_TERMS) > ; > if (glob_type_given_pole = 0) then # if number 11 > logitem_str(html_log_file,"Not Given") > ; > logitem_str(html_log_file,"NA") > ; > elif > (glob_type_given_pole = 4) then # if number 12 > logitem_str(html_log_file,"No Solution") > ; > logitem_str(html_log_file,"NA") > ; > elif > (glob_type_given_pole = 5) then # if number 13 > logitem_str(html_log_file,"Some Pole") > ; > logitem_str(html_log_file,"????") > ; > elif > (glob_type_given_pole = 3) then # if number 14 > logitem_str(html_log_file,"No Pole") > ; > logitem_str(html_log_file,"NA") > ; > elif > (glob_type_given_pole = 1) then # if number 15 > logitem_str(html_log_file,"Real Sing") > ; > logitem_float(html_log_file,glob_least_given_sing) > ; > elif > (glob_type_given_pole = 2) then # if number 16 > logitem_str(html_log_file,"Complex Sing") > ; > logitem_float(html_log_file,glob_least_given_sing) > ; > fi;# end if 16; > if (glob_least_ratio_sing < glob_large_float) then # if number 16 > logitem_float(html_log_file,glob_least_ratio_sing) > ; > else > logitem_str(html_log_file,"NONE") > ; > fi;# end if 16; > if (glob_least_3_sing < glob_large_float) then # if number 16 > logitem_float(html_log_file,glob_least_3_sing) > ; > else > logitem_str(html_log_file,"NONE") > ; > fi;# end if 16; > if (glob_least_6_sing < glob_large_float) then # if number 16 > logitem_float(html_log_file,glob_least_6_sing) > ; > else > logitem_str(html_log_file,"NONE") > ; > fi;# end if 16; > logitem_integer(html_log_file,glob_iter) > ; > logitem_time(html_log_file,(glob_clock_sec)) > ; > if (c(glob_percent_done) < glob__100) then # if number 16 > logitem_time(html_log_file,(glob_total_exp_sec)) > ; > 0; > else > logitem_str(html_log_file,"Done") > ; > 0; > fi;# end if 16; > log_revs(html_log_file," 308.maple.seems.ok ") > ; > logitem_str(html_log_file,"tan diffeq.mxt") > ; > logitem_str(html_log_file,"tan maple results") > ; > logitem_str(html_log_file,"OK") > ; > logend(html_log_file) > ; > ; > fi;# end if 15; > if (glob_html_log) then # if number 15 > fclose(html_log_file); > fi;# end if 15 > ; > ;; > fi;# end if 14 > #END OUTFILEMAIN > end; main := proc() local d1, d2, d3, d4, est_err_2, niii, done_once, max_terms, display_max, term, ord, order_diff, term_no, html_log_file, iiif, jjjf, rows, r_order, sub_iter, calc_term, iii, temp_sum, current_iter, x_start, x_end, it, last_min_pole_est, opt_iter, tmp, subiter, est_needed_step_err, estimated_step_error, min_value, est_answer, found_h, repeat_it; global ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, glob_no_sing_tests, glob_ratio_test, glob_three_term_test, glob_six_term_test, glob_log_10, MAX_UNCHANGED, glob__small, glob_small_float, glob_smallish_float, glob_large_float, glob_larger_float, glob__m2, glob__m1, glob__0, glob__1, glob__2, glob__3, glob__4, glob__5, glob__8, glob__10, glob__100, glob__pi, glob__0_5, glob__0_8, glob__m0_8, glob__0_25, glob__0_125, glob_prec, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_total_exp_sec, glob_optimal_expect_sec, glob_estimated_size_answer, glob_almost_1, glob_clock_sec, glob_clock_start_sec, glob_disp_incr, glob_h, glob_diff_rc_fm, glob_diff_rc_fmm1, glob_diff_rc_fmm2, glob_diff_ord_fm, glob_diff_ord_fmm1, glob_diff_ord_fmm2, glob_six_term_ord_save, glob_guess_error_rc, glob_guess_error_ord, glob_least_given_sing, glob_least_ratio_sing, glob_least_3_sing, glob_least_6_sing, glob_last_good_h, glob_max_h, glob_min_h, glob_display_interval, glob_abserr, glob_relerr, glob_min_pole_est, glob_max_rel_trunc_err, glob_max_trunc_err, glob_max_hours, glob_optimal_clock_start_sec, glob_optimal_start, glob_upper_ratio_limit, glob_lower_ratio_limit, glob_max_sec, glob_orig_start_sec, glob_normmax, glob_max_minutes, glob_next_display, glob_est_digits, glob_subiter_method, glob_html_log, glob_min_good_digits, glob_good_digits, glob_min_apfp_est_good_digits, glob_apfp_est_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, glob_h_reason, glob_sec_in_minute, glob_min_in_hour, glob_hours_in_day, glob_days_in_year, glob_sec_in_hour, glob_sec_in_day, glob_sec_in_year, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_type_given_pole, glob_optimize, glob_look_poles, glob_dump_closed_form, glob_max_iter, glob_no_eqs, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_start, glob_iter, array_const_1, array_const_0D0, array_y_init, array_norms, array_fact_1, array_1st_rel_error, array_last_rel_error, array_est_rel_error, array_max_est_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_est_digits, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1_a1, array_tmp1_a2, array_tmp1, array_tmp2, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_given_rad_poles, array_given_ord_poles, array_rad_test_poles, array_ord_test_poles, array_fact_2, ATS_MAX_TERMS, glob_last; ATS_MAX_TERMS := 40; Digits := 32; max_terms := 40; glob_html_log := true; array_y_init := Array(0 .. 40, []); array_norms := Array(0 .. 40, []); array_fact_1 := Array(0 .. 40, []); array_1st_rel_error := Array(0 .. 2, []); array_last_rel_error := Array(0 .. 2, []); array_est_rel_error := Array(0 .. 2, []); array_max_est_error := Array(0 .. 2, []); array_type_pole := Array(0 .. 2, []); array_type_real_pole := Array(0 .. 2, []); array_type_complex_pole := Array(0 .. 2, []); array_est_digits := Array(0 .. 2, []); array_y := Array(0 .. 40, []); array_x := Array(0 .. 40, []); array_tmp0 := Array(0 .. 40, []); array_tmp1_g := Array(0 .. 40, []); array_tmp1_a1 := Array(0 .. 40, []); array_tmp1_a2 := Array(0 .. 40, []); array_tmp1 := Array(0 .. 40, []); array_tmp2 := Array(0 .. 40, []); array_m1 := Array(0 .. 40, []); array_y_higher := Array(0 .. 2, 0 .. 41, []); array_y_higher_work := Array(0 .. 2, 0 .. 41, []); array_y_higher_work2 := Array(0 .. 2, 0 .. 41, []); array_y_set_initial := Array(0 .. 2, 0 .. 41, []); array_given_rad_poles := Array(0 .. 2, 0 .. 4, []); array_given_ord_poles := Array(0 .. 2, 0 .. 4, []); array_rad_test_poles := Array(0 .. 2, 0 .. 5, []); array_ord_test_poles := Array(0 .. 2, 0 .. 5, []); array_fact_2 := Array(0 .. 40, 0 .. 41, []); term := 1; while term <= 40 do array_y_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 <= 2 do array_1st_rel_error[term] := c(0.); term := term + 1 end do; term := 1; while term <= 2 do array_last_rel_error[term] := c(0.); term := term + 1 end do; term := 1; while term <= 2 do array_est_rel_error[term] := c(0.); term := term + 1 end do; term := 1; while term <= 2 do array_max_est_error[term] := c(0.); term := term + 1 end do; term := 1; while term <= 2 do array_type_pole[term] := 0; term := term + 1 end do; term := 1; while term <= 2 do array_type_real_pole[term] := 0; term := term + 1 end do; term := 1; while term <= 2 do array_type_complex_pole[term] := 0; term := term + 1 end do; term := 1; while term <= 2 do array_est_digits[term] := 0; term := term + 1 end do ; term := 1; while term <= 40 do array_y[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_tmp0[term] := c(0.); term := term + 1 end do; term := 1; while term <= 40 do array_tmp1_g[term] := c(0.); term := term + 1 end do; term := 1; while term <= 40 do array_tmp1_a1[term] := c(0.); term := term + 1 end do; term := 1; while term <= 40 do array_tmp1_a2[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_m1[term] := c(0.); term := term + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 40 do array_y_higher[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 40 do array_y_higher_work[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 40 do array_y_higher_work2[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 40 do array_y_set_initial[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_given_rad_poles[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_given_ord_poles[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 4 do array_rad_test_poles[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 4 do array_ord_test_poles[ord, term] := c(0.); term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 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_y); zero_ats_ar(array_x); zero_ats_ar(array_tmp0); zero_ats_ar(array_tmp1_g); zero_ats_ar(array_tmp1_a1); zero_ats_ar(array_tmp1_a2); zero_ats_ar(array_tmp1); zero_ats_ar(array_tmp2); zero_ats_ar(array_m1); zero_ats_ar(array_const_1); array_const_1[1] := c(1); zero_ats_ar(array_const_0D0); array_const_0D0[1] := c(0.); zero_ats_ar(array_m1); array_m1[1] := glob__m1; iiif := 0; while iiif <= ATS_MAX_TERMS do jjjf := 0; while jjjf <= ATS_MAX_TERMS do array_fact_1[iiif] := 0; array_fact_2[iiif, jjjf] := 0; jjjf := jjjf + 1 end do; iiif := iiif + 1 end do; ALWAYS := 1; INFO := 2; DEBUGL := 3; DEBUGMASSIVE := 4; glob_iolevel := 5; glob_yes_pole := 4; glob_no_pole := 3; glob_not_given := 0; glob_no_sing_tests := 4; glob_ratio_test := 1; glob_three_term_test := 2; glob_six_term_test := 3; glob_log_10 := log(c(10.0)); MAX_UNCHANGED := 10; glob__small := c(0.1*10^(-50)); glob_small_float := c(0.1*10^(-50)); glob_smallish_float := c(0.1*10^(-60)); glob_large_float := c(0.10*10^101); glob_larger_float := c(0.11*10^101); glob__m2 := c(-2); glob__m1 := c(-1); glob__0 := c(0); glob__1 := c(1); glob__2 := c(2); glob__3 := c(3); glob__4 := c(4); glob__5 := c(5); glob__8 := c(8); glob__10 := c(10); glob__100 := c(100); glob__pi := c(0.); glob__0_5 := c(0.5); glob__0_8 := c(0.8); glob__m0_8 := c(-0.8); glob__0_25 := c(0.25); glob__0_125 := c(0.125); glob_prec := c(0.10*10^(-15)); glob_check_sign := c(1.0); glob_desired_digits_correct := c(8.0); glob_max_estimated_step_error := c(0.); glob_ratio_of_radius := c(0.1); glob_percent_done := c(0.); glob_total_exp_sec := c(0.1); glob_optimal_expect_sec := c(0.1); glob_estimated_size_answer := c(100.0); glob_almost_1 := c(0.9990); glob_clock_sec := c(0.); glob_clock_start_sec := c(0.); glob_disp_incr := c(0.1); glob_h := c(0.1); glob_diff_rc_fm := c(0.1); glob_diff_rc_fmm1 := c(0.1); glob_diff_rc_fmm2 := c(0.1); glob_diff_ord_fm := c(0.1); glob_diff_ord_fmm1 := c(0.1); glob_diff_ord_fmm2 := c(0.1); glob_six_term_ord_save := c(0.1); glob_guess_error_rc := c(0.1); glob_guess_error_ord := c(0.1); glob_least_given_sing := c(0.99*10^201); glob_least_ratio_sing := c(0.99*10^201); glob_least_3_sing := c(0.99*10^101); glob_least_6_sing := c(0.99*10^101); glob_last_good_h := c(0.1); glob_max_h := c(0.1); glob_min_h := c(0.1*10^(-5)); glob_display_interval := c(0.1); glob_abserr := c(0.1*10^(-10)); glob_relerr := c(0.1*10^(-10)); glob_min_pole_est := c(0.1*10^10); glob_max_rel_trunc_err := c(0.1*10^(-10)); glob_max_trunc_err := c(0.1*10^(-10)); glob_max_hours := c(0.); glob_optimal_clock_start_sec := c(0.); glob_optimal_start := c(0.); glob_upper_ratio_limit := c(1.0001); glob_lower_ratio_limit := c(0.9999); glob_max_sec := c(10000.0); glob_orig_start_sec := c(0.); glob_normmax := c(0.); glob_max_minutes := c(0.); glob_next_display := c(0.); glob_est_digits := 1; glob_subiter_method := 3; glob_html_log := true; glob_min_good_digits := 99999; glob_good_digits := 0; glob_min_apfp_est_good_digits := 99999; glob_apfp_est_good_digits := 0; glob_max_opt_iter := 10; glob_dump := false; glob_djd_debug := true; glob_display_flag := true; glob_djd_debug2 := true; glob_h_reason := 0; glob_sec_in_minute := 60; glob_min_in_hour := 60; glob_hours_in_day := 24; glob_days_in_year := 365; glob_sec_in_hour := 3600; glob_sec_in_day := 86400; glob_sec_in_year := 31536000; glob_not_yet_finished := true; glob_initial_pass := true; glob_not_yet_start_msg := true; glob_reached_optimal_h := false; glob_optimal_done := false; glob_type_given_pole := 0; glob_optimize := false; glob_look_poles := false; glob_dump_closed_form := false; glob_max_iter := 1000; glob_no_eqs := 0; glob_unchanged_h_cnt := 0; glob_warned := false; glob_warned2 := false; glob_start := 0; glob_iter := 0; array_y_set_initial[1, 1] := true; array_y_set_initial[1, 2] := false; array_y_set_initial[1, 3] := false; array_y_set_initial[1, 4] := false; array_y_set_initial[1, 5] := false; array_y_set_initial[1, 6] := false; array_y_set_initial[1, 7] := false; array_y_set_initial[1, 8] := false; array_y_set_initial[1, 9] := false; array_y_set_initial[1, 10] := false; array_y_set_initial[1, 11] := false; array_y_set_initial[1, 12] := false; array_y_set_initial[1, 13] := false; array_y_set_initial[1, 14] := false; array_y_set_initial[1, 15] := false; array_y_set_initial[1, 16] := false; array_y_set_initial[1, 17] := false; array_y_set_initial[1, 18] := false; array_y_set_initial[1, 19] := false; array_y_set_initial[1, 20] := false; array_y_set_initial[1, 21] := false; array_y_set_initial[1, 22] := false; array_y_set_initial[1, 23] := false; array_y_set_initial[1, 24] := false; array_y_set_initial[1, 25] := false; array_y_set_initial[1, 26] := false; array_y_set_initial[1, 27] := false; array_y_set_initial[1, 28] := false; array_y_set_initial[1, 29] := false; array_y_set_initial[1, 30] := false; array_y_set_initial[1, 31] := false; array_y_set_initial[1, 32] := false; array_y_set_initial[1, 33] := false; array_y_set_initial[1, 34] := false; array_y_set_initial[1, 35] := false; array_y_set_initial[1, 36] := false; array_y_set_initial[1, 37] := false; array_y_set_initial[1, 38] := false; array_y_set_initial[1, 39] := false; array_y_set_initial[1, 40] := false; 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 := 1; glob_iter := -1; opt_iter := -1; glob_max_iter := 50000; glob_max_hours := 0.; glob_max_minutes := 15.0; omniout_str(ALWAYS, "##############ECHO OF PROBLEM#################"); omniout_str(ALWAYS, "##############temp/tanpostode.ode#################"); omniout_str(ALWAYS, "diff ( y , x , 1 ) = tan ( x ) ; ") ; 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(1.5) ;"); omniout_str(ALWAYS, "array_y_init[0 + 1] := exact_soln_y(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 := 1;"); omniout_str(ALWAYS, ""); omniout_str(ALWAYS, "array_given_rad_poles[1,1] := c(1.570796327);"); omniout_str(ALWAYS, ""); omniout_str(ALWAYS, "array_given_rad_poles[1,2] := c(0.0);"); omniout_str(ALWAYS, ""); omniout_str(ALWAYS, "array_given_ord_poles[1,1] := c(0.0);"); omniout_str(ALWAYS, ""); omniout_str(ALWAYS, "array_given_ord_poles[1,2] := c(0.0);"); omniout_str(ALWAYS, ""); omniout_str(ALWAYS, "#END SECOND INPUT BLOCK"); omniout_str(ALWAYS, "#BEGIN OVERRIDE BLOCK"); omniout_str(ALWAYS, "glob_desired_digits_correct:=8;"); omniout_str(ALWAYS, "glob_max_minutes:=(3.0);"); omniout_str(ALWAYS, "glob_subiter_method:=3;"); omniout_str(ALWAYS, "glob_max_iter:=100000;"); omniout_str(ALWAYS, "glob_upper_ratio_limit:=c(1.000001);"); omniout_str(ALWAYS, "glob_lower_ratio_limit:=c(0.999999);"); omniout_str(ALWAYS, "glob_look_poles:=true;"); omniout_str(ALWAYS, "glob_h:=c(0.001);"); omniout_str(ALWAYS, "glob_display_interval:=c(0.01);"); omniout_str(ALWAYS, "#END OVERRIDE BLOCK"); omniout_str(ALWAYS, "!"); omniout_str(ALWAYS, "#BEGIN USER DEF BLOCK"); omniout_str(ALWAYS, "exact_soln_y := proc(x)"); omniout_str(ALWAYS, "return(neg(ln(cos(c(x)))));"); omniout_str(ALWAYS, "end;"); omniout_str(ALWAYS, "#END USER DEF BLOCK"); omniout_str(ALWAYS, "#######END OF ECHO OF PROBLEM#################"); glob_unchanged_h_cnt := 0; glob_warned := false; glob_warned2 := false; glob_small_float := glob__0; glob_smallish_float := glob__0; glob_large_float := c(0.10*10^101); glob_larger_float := c(0.11*10^101); glob_almost_1 := c(0.99); x_start := c(0.1); x_end := c(1.5); array_y_init[1] := exact_soln_y(x_start); glob_look_poles := true; glob_type_given_pole := 1; array_given_rad_poles[1, 1] := c(1.570796327); array_given_rad_poles[1, 2] := c(0.); array_given_ord_poles[1, 1] := c(0.); array_given_ord_poles[1, 2] := c(0.); glob_desired_digits_correct := 8; glob_max_minutes := 3.0; glob_subiter_method := 3; glob_max_iter := 100000; glob_upper_ratio_limit := c(1.000001); glob_lower_ratio_limit := c(0.999999); glob_look_poles := true; glob_h := c(0.001); glob_display_interval := c(0.01); glob_last_good_h := glob_h; glob_max_sec := 60.0*glob_max_minutes + 3600.0*glob_max_hours; glob_check_sign := c(my_check_sign(x_start, x_end)); glob__pi := arccos(glob__m1); glob_prec = expt(10.0, c(-Digits)); if glob_optimize then omniout_str(ALWAYS, "START of Optimize"); found_h := false; glob_min_pole_est := glob_larger_float; last_min_pole_est := glob_larger_float; glob_least_given_sing := glob_larger_float; glob_least_ratio_sing := glob_larger_float; glob_least_3_sing := glob_larger_float; glob_least_6_sing := glob_larger_float; glob_min_h := float_abs(glob_min_h)*glob_check_sign; glob_max_h := float_abs(glob_max_h)*glob_check_sign; glob_h := float_abs(glob_min_h)*glob_check_sign; glob_display_interval := c(float_abs(c(glob_display_interval))*glob_check_sign); display_max := c(x_end) - c(x_start)/glob__10; if display_max < glob_display_interval then glob_display_interval := c(display_max) end if; chk_data(); min_value := glob_larger_float; est_answer := est_size_answer(); opt_iter := 1; est_needed_step_err := estimated_needed_step_error(x_start, x_end, glob_h, est_answer) ; omniout_float(ALWAYS, "est_needed_step_err", 32, est_needed_step_err, 16, ""); estimated_step_error := glob_small_float; while opt_iter <= 100 and not found_h do omniout_int(ALWAYS, "opt_iter", 32, opt_iter, 4, ""); array_x[1] := c(x_start); array_x[2] := c(glob_h); glob_next_display := c(x_start); order_diff := 1; term_no := 1; while term_no <= order_diff do array_y[term_no] := array_y_init[term_no]* expt(glob_h, c(term_no - 1))/ c(factorial_1(term_no - 1)); term_no := term_no + 1 end do; rows := order_diff; r_order := 1; while r_order <= rows do term_no := 1; while term_no <= rows - r_order + 1 do it := term_no + r_order - 1; if term_no < ATS_MAX_TERMS then array_y_higher[r_order, term_no] := array_y_init[it]*expt(glob_h, c(term_no - 1))/ c(factorial_1(term_no - 1)) end if; term_no := term_no + 1 end do; r_order := r_order + 1 end do; atomall(); if glob_check_sign*glob_h <= glob_check_sign*glob_min_h then omniout_str(ALWAYS, "SETTING H FOR MIN H"); glob_h := float_abs(glob_min_h)*glob_check_sign; glob_h_reason := 1; found_h := true end if; if glob_check_sign*glob_display_interval <= glob_check_sign*glob_h then omniout_str(ALWAYS, "SETTING H FOR DISPLAY INTERVAL"); glob_h_reason := 2; glob_h := glob_display_interval; found_h := true end if; if glob_look_poles then check_for_pole() end if; if not found_h then est_answer := est_size_answer(); est_needed_step_err := estimated_needed_step_error(x_start, x_end, glob_h, est_answer); omniout_float(ALWAYS, "est_needed_step_err", 32, est_needed_step_err, 16, ""); estimated_step_error := test_suggested_h(); omniout_float(ALWAYS, "estimated_step_error", 32, estimated_step_error, 32, ""); if estimated_step_error < est_needed_step_err then omniout_str(ALWAYS, "Double H and LOOP"); glob_h := glob_h*glob__2 else omniout_str(ALWAYS, "Found H for OPTIMAL"); found_h := true; glob_h_reason := 3; glob_h := glob_h/glob__2 end if end if; opt_iter := opt_iter + 1 end do; if not found_h and opt_iter = 1 then omniout_str(ALWAYS, "Beginning glob_h too large."); found_h := false end if; if glob_check_sign*glob_max_h <= glob_check_sign*glob_h then omniout_str(ALWAYS, "SETTING H FOR MAX H"); glob_h := float_abs(glob_max_h)*glob_check_sign; glob_h_reason := 1; found_h := true end if else found_h := true; glob_h := glob_check_sign*glob_h end if; if glob_html_log then html_log_file := fopen("entry.html", WRITE, TEXT) end if; if found_h then omniout_str(ALWAYS, "START of Soultion"); array_x[1] := c(x_start); array_x[2] := c(glob_h); glob_next_display := c(x_start); glob_min_pole_est := glob_larger_float; glob_least_given_sing := glob_larger_float; glob_least_ratio_sing := glob_larger_float; glob_least_3_sing := glob_larger_float; glob_least_6_sing := glob_larger_float; order_diff := 1; term_no := 1; while term_no <= order_diff do array_y[term_no] := array_y_init[term_no]* expt(glob_h, c(term_no - 1))/c(factorial_1(term_no - 1)); term_no := term_no + 1 end do; rows := order_diff; r_order := 1; while r_order <= rows do term_no := 1; while term_no <= rows - r_order + 1 do it := term_no + r_order - 1; if term_no < ATS_MAX_TERMS then array_y_higher[r_order, term_no] := array_y_init[it]* expt(glob_h, c(term_no - 1))/ c(factorial_1(term_no - 1)) end if; term_no := term_no + 1 end do; r_order := r_order + 1 end do; current_iter := 1; glob_clock_start_sec := elapsed_time_seconds(); glob_clock_sec := elapsed_time_seconds(); glob_iter := 0; omniout_str(DEBUGL, " "); glob_reached_optimal_h := true; glob_optimal_clock_start_sec := elapsed_time_seconds(); while glob_iter < glob_max_iter and glob_check_sign*array_x[1] < glob_check_sign*x_end and glob_clock_sec - glob_orig_start_sec < glob_max_sec do if reached_interval() then omniout_str(INFO, " "); omniout_str(INFO, "TOP MAIN SOLVE Loop") end if; glob_iter := glob_iter + 1; glob_clock_sec := elapsed_time_seconds(); track_estimated_error(); atomall(); track_estimated_error(); display_alot(current_iter); if glob_look_poles then check_for_pole() end if; if reached_interval() then glob_next_display := glob_next_display + glob_display_interval end if; array_x[1] := array_x[1] + glob_h; array_x[2] := glob_h; order_diff := 2; ord := 2; calc_term := 1; iii := ATS_MAX_TERMS; while calc_term <= iii do array_y_higher_work[2, iii] := array_y_higher[2, iii]/( expt(glob_h, c(calc_term - 1))* c(factorial_3(iii - calc_term, iii - 1))); iii := iii - 1 end do; temp_sum := glob__0; ord := 2; calc_term := 1; iii := ATS_MAX_TERMS; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, c(calc_term - 1))/ c(factorial_1(calc_term - 1)); ord := 1; calc_term := 2; iii := ATS_MAX_TERMS; while calc_term <= iii do array_y_higher_work[1, iii] := array_y_higher[1, iii]/( expt(glob_h, c(calc_term - 1))* c(factorial_3(iii - calc_term, iii - 1))); iii := iii - 1 end do; temp_sum := glob__0; ord := 1; calc_term := 2; iii := ATS_MAX_TERMS; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, c(calc_term - 1))/ c(factorial_1(calc_term - 1)); ord := 1; calc_term := 1; iii := ATS_MAX_TERMS; while calc_term <= iii do array_y_higher_work[1, iii] := array_y_higher[1, iii]/( expt(glob_h, c(calc_term - 1))* c(factorial_3(iii - calc_term, iii - 1))); iii := iii - 1 end do; temp_sum := glob__0; ord := 1; calc_term := 1; iii := ATS_MAX_TERMS; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, c(calc_term - 1))/ c(factorial_1(calc_term - 1)); term_no := ATS_MAX_TERMS; while 1 <= term_no do array_y[term_no] := array_y_higher_work2[1, term_no]; ord := 1; while ord <= order_diff do array_y_higher[ord, term_no] := array_y_higher_work2[ord, term_no]; ord := ord + 1 end do; term_no := term_no - 1 end do end do; omniout_str(ALWAYS, "Finished!"); if glob_max_iter <= glob_iter then omniout_str(ALWAYS, "Maximum Iterations Reached before Solution Completed!") end if; if glob_max_sec <= elapsed_time_seconds() - glob_orig_start_sec then omniout_str(ALWAYS, "Maximum Time Reached before Solution Completed!") end if; glob_clock_sec := elapsed_time_seconds(); omniout_str(INFO, "diff ( y , x , 1 ) = tan ( x ) ; "); omniout_int(INFO, "Iterations ", 32, glob_iter, 4, " "); prog_report(x_start, x_end); if glob_html_log then logstart(html_log_file); logitem_str(html_log_file, "2015-05-01T22:58:32-05:00"); logitem_str(html_log_file, "Maple"); logitem_str(html_log_file, "tan"); logitem_str(html_log_file, "diff ( y , x , 1 ) = tan ( x ) ; "); logitem_float(html_log_file, x_start); logitem_float(html_log_file, x_end); logitem_float(html_log_file, array_x[1]); logitem_float(html_log_file, glob_h); logitem_h_reason(html_log_file); logitem_integer(html_log_file, Digits); logitem_float(html_log_file, glob_desired_digits_correct); if array_est_digits[1] <> -16 then logitem_integer(html_log_file, array_est_digits[1]) else logitem_str(html_log_file, "Unknown") end if; if glob_min_good_digits <> -16 then logitem_integer(html_log_file, glob_min_good_digits) else logitem_str(html_log_file, "Unknown") end if; if glob_good_digits <> -16 then logitem_integer(html_log_file, glob_good_digits) else logitem_str(html_log_file, "Unknown") end if; logitem_str(html_log_file, "NA"); logitem_str(html_log_file, "NA"); logitem_integer(html_log_file, ATS_MAX_TERMS); if glob_type_given_pole = 0 then logitem_str(html_log_file, "Not Given"); logitem_str(html_log_file, "NA") elif glob_type_given_pole = 4 then logitem_str(html_log_file, "No Solution"); logitem_str(html_log_file, "NA") elif glob_type_given_pole = 5 then logitem_str(html_log_file, "Some Pole"); logitem_str(html_log_file, "????") elif glob_type_given_pole = 3 then logitem_str(html_log_file, "No Pole"); logitem_str(html_log_file, "NA") elif glob_type_given_pole = 1 then logitem_str(html_log_file, "Real Sing"); logitem_float(html_log_file, glob_least_given_sing) elif glob_type_given_pole = 2 then logitem_str(html_log_file, "Complex Sing"); logitem_float(html_log_file, glob_least_given_sing) end if; if glob_least_ratio_sing < glob_large_float then logitem_float(html_log_file, glob_least_ratio_sing) else logitem_str(html_log_file, "NONE") end if; if glob_least_3_sing < glob_large_float then logitem_float(html_log_file, glob_least_3_sing) else logitem_str(html_log_file, "NONE") end if; if glob_least_6_sing < glob_large_float then logitem_float(html_log_file, glob_least_6_sing) else logitem_str(html_log_file, "NONE") end if; logitem_integer(html_log_file, glob_iter); logitem_time(html_log_file, glob_clock_sec); if c(glob_percent_done) < glob__100 then logitem_time(html_log_file, glob_total_exp_sec); 0 else logitem_str(html_log_file, "Done"); 0 end if; log_revs(html_log_file, " 308.maple.seems.ok "); logitem_str(html_log_file, "tan diffeq.mxt"); logitem_str(html_log_file, "tan maple results"); logitem_str(html_log_file, "OK"); logend(html_log_file) end if; if glob_html_log then fclose(html_log_file) end if end if end proc # End Function number 12 > main(); ##############ECHO OF PROBLEM################# ##############temp/tanpostode.ode################# diff ( y , x , 1 ) = tan ( x ) ; ! #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(1.5) ; array_y_init[0 + 1] := exact_soln_y(x_start); glob_look_poles := true; glob_type_given_pole := 1; array_given_rad_poles[1,1] := c(1.570796327); array_given_rad_poles[1,2] := c(0.0); array_given_ord_poles[1,1] := c(0.0); array_given_ord_poles[1,2] := c(0.0); #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.000001); glob_lower_ratio_limit:=c(0.999999); glob_look_poles:=true; glob_h:=c(0.001); glob_display_interval:=c(0.01); #END OVERRIDE BLOCK ! #BEGIN USER DEF BLOCK exact_soln_y := proc(x) return(neg(ln(cos(c(x))))); end; #END USER DEF BLOCK #######END OF ECHO OF PROBLEM################# START of Soultion TOP MAIN SOLVE Loop x[1] = 0.1 y[1] (closed_form) = 0.0050083556232353090791329977212671 y[1] (numeric) = 0.0050083556232353090791329977212671 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 14 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.471 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=4.2MB, alloc=40.3MB, time=0.14 TOP MAIN SOLVE Loop x[1] = 0.11 y[1] (closed_form) = 0.0060622403465323032306356113409113 y[1] (numeric) = 0.0060622403465323032306356113409134 absolute error = 2.1e-33 relative error = 3.4640658897683477849595778723851e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.461 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.12 y[1] (closed_form) = 0.0072173466466277368000894604662206 y[1] (numeric) = 0.0072173466466277368000894604662168 absolute error = 3.8e-33 relative error = 5.2650928188069335365755048237809e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.451 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.13 y[1] (closed_form) = 0.008473908649082293939847075567037 y[1] (numeric) = 0.0084739086490822939398470755670326 absolute error = 4.4e-33 relative error = 5.1924090549129421234068325682876e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.441 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.14 y[1] (closed_form) = 0.0098321816582955505386607580817523 y[1] (numeric) = 0.0098321816582955505386607580817521 absolute error = 2e-34 relative error = 2.0341365421300691197282114176828e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.431 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=40.5MB, alloc=44.3MB, time=0.58 TOP MAIN SOLVE Loop x[1] = 0.15 y[1] (closed_form) = 0.011292442366641786981368027419826 y[1] (numeric) = 0.011292442366641786981368027419827 absolute error = 1e-33 relative error = 8.8554802188234314590609468704173e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.421 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.16 y[1] (closed_form) = 0.012854989082009649242948557584918 y[1] (numeric) = 0.01285498908200964924294855758492 absolute error = 2e-33 relative error = 1.5558161794154830346126250679557e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.411 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.17 y[1] (closed_form) = 0.014520141974147117510638725229194 y[1] (numeric) = 0.01452014197414711751063872522919 absolute error = 4e-33 relative error = 2.7547940007211613759040100212574e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.401 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.18 y[1] (closed_form) = 0.016288243340248848521775773334465 y[1] (numeric) = 0.016288243340248848521775773334461 absolute error = 4e-33 relative error = 2.4557589891328875496598955846129e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.391 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.19 y[1] (closed_form) = 0.018159657890259910149161840872723 y[1] (numeric) = 0.018159657890259910149161840872717 absolute error = 6e-33 relative error = 3.3040270010913322249437818052116e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.381 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=84.7MB, alloc=52.3MB, time=1.05 TOP MAIN SOLVE Loop x[1] = 0.2 y[1] (closed_form) = 0.020134773052408348925755928105682 y[1] (numeric) = 0.020134773052408348925755928105681 absolute error = 1e-33 relative error = 4.9665322643425006151950931220052e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.371 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.21 y[1] (closed_form) = 0.022213999299519054687682950444782 y[1] (numeric) = 0.022213999299519054687682950444785 absolute error = 3e-33 relative error = 1.3504997274691332376701629135856e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.361 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.22 y[1] (closed_form) = 0.024397770496703150585626911321445 y[1] (numeric) = 0.024397770496703150585626911321446 absolute error = 1e-33 relative error = 4.0987351698186075094151270232649e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.351 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.23 y[1] (closed_form) = 0.026686544271060789125605597428335 y[1] (numeric) = 0.026686544271060789125605597428335 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.341 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.24 y[1] (closed_form) = 0.029080802404080932719476939417643 y[1] (numeric) = 0.029080802404080932719476939417643 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.331 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=128.9MB, alloc=52.3MB, time=1.52 TOP MAIN SOLVE Loop x[1] = 0.25 y[1] (closed_form) = 0.031581051247469607713948928307465 y[1] (numeric) = 0.031581051247469607713948928307466 absolute error = 1e-33 relative error = 3.1664557084056020807309863415846e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.321 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.26 y[1] (closed_form) = 0.034187822163188422429682548760632 y[1] (numeric) = 0.034187822163188422429682548760626 absolute error = 6e-33 relative error = 1.7550108840979265212372091952948e-29 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.311 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.27 y[1] (closed_form) = 0.036901671988538022962828423907479 y[1] (numeric) = 0.036901671988538022962828423907476 absolute error = 3e-33 relative error = 8.1297129326059421630631290100100e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.301 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.28 y[1] (closed_form) = 0.039723183527176829264819318516813 y[1] (numeric) = 0.039723183527176829264819318516815 absolute error = 2e-33 relative error = 5.0348431883151793787126812218300e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.291 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.29 y[1] (closed_form) = 0.04265296606702406673056111562254 y[1] (numeric) = 0.042652966067024066730561115622538 absolute error = 2e-33 relative error = 4.6890056763162442361124474062756e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.281 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=173.0MB, alloc=52.3MB, time=1.98 TOP MAIN SOLVE Loop x[1] = 0.3 y[1] (closed_form) = 0.045691655926058019453301984654094 y[1] (numeric) = 0.045691655926058019453301984654094 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.271 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.31 y[1] (closed_form) = 0.048839917027085832016946896893199 y[1] (numeric) = 0.048839917027085832016946896893201 absolute error = 2e-33 relative error = 4.0950110519041876860802642675505e-30 % Desired digits = 8 Estimated correct digits = 13 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.261 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.32 y[1] (closed_form) = 0.052098441502630347658225662533815 y[1] (numeric) = 0.052098441502630347658225662533814 absolute error = 1e-33 relative error = 1.9194432139577763959996581380792e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.251 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.33 y[1] (closed_form) = 0.055467950331152682936048083594259 y[1] (numeric) = 0.055467950331152682936048083594266 absolute error = 7e-33 relative error = 1.2619900245473037588847466038327e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.241 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.34 y[1] (closed_form) = 0.05894919400590681631636664753468 y[1] (numeric) = 0.058949194005906816316366647534685 absolute error = 5e-33 relative error = 8.4818801754931389186751276571028e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.231 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=217.1MB, alloc=52.3MB, time=2.45 TOP MAIN SOLVE Loop x[1] = 0.35 y[1] (closed_form) = 0.062542953237804748550628956240186 y[1] (numeric) = 0.062542953237804748550628956240192 absolute error = 6e-33 relative error = 9.5934069137835925515673590119066e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.221 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.36 y[1] (closed_form) = 0.066250039693758141520080425462836 y[1] (numeric) = 0.066250039693758141520080425462837 absolute error = 1e-33 relative error = 1.5094330578857248221729736638924e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.211 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.37 y[1] (closed_form) = 0.070071296772055153862035972018276 y[1] (numeric) = 0.07007129677205515386203597201828 absolute error = 4e-33 relative error = 5.7084714915611831164887372594294e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.201 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.38 y[1] (closed_form) = 0.074007600416429892867616152336733 y[1] (numeric) = 0.074007600416429892867616152336735 absolute error = 2e-33 relative error = 2.7024251411291460336078626552939e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.191 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.39 y[1] (closed_form) = 0.078059859970586954708407708121751 y[1] (numeric) = 0.078059859970586954708407708121749 absolute error = 2e-33 relative error = 2.5621362897058773963001112408045e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.181 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=261.3MB, alloc=52.3MB, time=2.95 TOP MAIN SOLVE Loop x[1] = 0.4 y[1] (closed_form) = 0.082229019075055429399409173994342 y[1] (numeric) = 0.082229019075055429399409173994339 absolute error = 3e-33 relative error = 3.6483470601317978122022328021689e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.171 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.41 y[1] (closed_form) = 0.086516056608366045624893433143116 y[1] (numeric) = 0.086516056608366045624893433143118 absolute error = 2e-33 relative error = 2.3117096160004607963261615715471e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.161 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.42 y[1] (closed_form) = 0.090921987674672412487058343650493 y[1] (numeric) = 0.090921987674672412487058343650495 absolute error = 2e-33 relative error = 2.1996879425427782290544313905053e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.151 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.43 y[1] (closed_form) = 0.095447864640073219965858582901525 y[1] (numeric) = 0.095447864640073219965858582901526 absolute error = 1e-33 relative error = 1.0476923750687618106997094118368e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.141 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.44 y[1] (closed_form) = 0.1000947782200374826708000675464 y[1] (numeric) = 0.1000947782200374826708000675464 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.131 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.45 y[1] (closed_form) = 0.1048638586204902087536765449528 y[1] (numeric) = 0.10486385862049020875367654495281 absolute error = 1e-32 relative error = 9.5361739798176929228709214477871e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.121 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=305.7MB, alloc=52.3MB, time=3.47 TOP MAIN SOLVE Loop x[1] = 0.46 y[1] (closed_form) = 0.10975627673528207129354998536697 y[1] (numeric) = 0.10975627673528207129354998536699 absolute error = 2e-32 relative error = 1.8222192474911854457753939988704e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.111 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.47 y[1] (closed_form) = 0.11477324540294465066547177211419 y[1] (numeric) = 0.11477324540294465066547177211421 absolute error = 2e-32 relative error = 1.7425663907807276373990099461198e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.101 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.48 y[1] (closed_form) = 0.11991602072582358236478155761168 y[1] (numeric) = 0.11991602072582358236478155761168 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.091 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.49 y[1] (closed_form) = 0.12518590345488655415521215776159 y[1] (numeric) = 0.1251859034548865541552121577616 absolute error = 1e-32 relative error = 7.9881198473785957229312899573591e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.081 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.5 y[1] (closed_form) = 0.13058424044372271678761259182601 y[1] (numeric) = 0.130584240443722716787612591826 absolute error = 1e-32 relative error = 7.6578919217358801615068075265730e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.071 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 memory used=349.9MB, alloc=52.3MB, time=3.97 TOP MAIN SOLVE Loop x[1] = 0.51 y[1] (closed_form) = 0.13611242617548598054384463663251 y[1] (numeric) = 0.1361124261754859805438446366325 absolute error = 1e-32 relative error = 7.3468677922964043087651262237556e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.061 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.52 y[1] (closed_form) = 0.14177190436678826263712043626926 y[1] (numeric) = 0.14177190436678826263712043626925 absolute error = 1e-32 relative error = 7.0535837440176318233430622044113e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.051 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.53 y[1] (closed_form) = 0.14756416965282155837629888639352 y[1] (numeric) = 0.14756416965282155837629888639349 absolute error = 3e-32 relative error = 2.0330138454735900908122135190440e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.041 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.54 y[1] (closed_form) = 0.15349076935828140966659957147956 y[1] (numeric) = 0.15349076935828140966659957147954 absolute error = 2e-32 relative error = 1.3030099519089369968591266716306e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.031 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 1.031 Order of pole (three term test) = 2.560e-07 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.55 y[1] (closed_form) = 0.15955330535898077874467619601204 y[1] (numeric) = 0.15955330535898077874467619601202 absolute error = 2e-32 relative error = 1.2534995721337000661899541168466e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.021 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 1.021 Order of pole (three term test) = 1.596e-07 NO COMPLEX POLE (six term test) for Equation 1 memory used=394.2MB, alloc=52.3MB, time=4.47 TOP MAIN SOLVE Loop x[1] = 0.56 y[1] (closed_form) = 0.16575343603938452477904084553625 y[1] (numeric) = 0.16575343603938452477904084553624 absolute error = 1e-32 relative error = 6.0330574369655353622983370220351e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.011 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 1.011 Order of pole (three term test) = 9.926e-08 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.57 y[1] (closed_form) = 0.17209287835166284853206403837245 y[1] (numeric) = 0.17209287835166284853206403837243 absolute error = 2e-32 relative error = 1.1621631407158546065857100512740e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 1.001 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 1.001 Order of pole (three term test) = 6.158e-08 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.58 y[1] (closed_form) = 0.17857340998225966096732308406808 y[1] (numeric) = 0.17857340998225966096732308406807 absolute error = 1e-32 relative error = 5.5999378636457958453221053068043e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9908 Order of pole (three term test) = 3.811e-08 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.59 y[1] (closed_form) = 0.18519687163240153853967239844412 y[1] (numeric) = 0.18519687163240153853967239844411 absolute error = 1e-32 relative error = 5.3996592447031526038026899738309e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9808 Order of pole (three term test) = 2.353e-08 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.6 y[1] (closed_form) = 0.19196516941943771967052566250649 y[1] (numeric) = 0.1919651694194377196705256625065 absolute error = 1e-32 relative error = 5.2092783447346751220031869080219e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9708 Order of pole (three term test) = 1.449e-08 NO COMPLEX POLE (six term test) for Equation 1 memory used=438.5MB, alloc=52.3MB, time=4.97 TOP MAIN SOLVE Loop x[1] = 0.61 y[1] (closed_form) = 0.19888027740640474945477660860593 y[1] (numeric) = 0.19888027740640474945477660860592 absolute error = 1e-32 relative error = 5.0281506695434444056176029093369e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9608 Order of pole (three term test) = 8.897e-09 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.62 y[1] (closed_form) = 0.2059442402677545113221722854327 y[1] (numeric) = 0.20594424026775451132217228543269 absolute error = 1e-32 relative error = 4.8556832601866840341514871911572e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9508 Order of pole (three term test) = 5.449e-09 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.63 y[1] (closed_form) = 0.21315917609977549587585267775296 y[1] (numeric) = 0.21315917609977549587585267775295 absolute error = 1e-32 relative error = 4.6913298235489531097560011142313e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9408 Order of pole (three term test) = 3.327e-09 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.64 y[1] (closed_form) = 0.22052727938487867644382399752528 y[1] (numeric) = 0.22052727938487867644382399752526 absolute error = 2e-32 relative error = 9.0691727825176167118275975948168e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9308 Order of pole (three term test) = 2.026e-09 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.65 y[1] (closed_form) = 0.22805082411961619408242495471385 y[1] (numeric) = 0.22805082411961619408242495471384 absolute error = 1e-32 relative error = 4.3849874424285548340639618231153e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9208 Order of pole (three term test) = 1.230e-09 NO COMPLEX POLE (six term test) for Equation 1 memory used=482.6MB, alloc=52.3MB, time=5.45 TOP MAIN SOLVE Loop x[1] = 0.66 y[1] (closed_form) = 0.23573216711705864347290962598666 y[1] (numeric) = 0.23573216711705864347290962598665 absolute error = 1e-32 relative error = 4.2421024344268860157420143879628e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9108 Order of pole (three term test) = 7.444e-10 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.67 y[1] (closed_form) = 0.24357375149498113754754544323105 y[1] (numeric) = 0.24357375149498113754754544323104 absolute error = 1e-32 relative error = 4.1055326933313054624520373142816e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.9008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.9008 Order of pole (three term test) = 4.491e-10 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.68 y[1] (closed_form) = 0.25157811036220622931999672046961 y[1] (numeric) = 0.25157811036220622931999672046959 absolute error = 2e-32 relative error = 7.9498172441176486786750190360357e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8908 Order of pole (three term test) = 2.700e-10 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.69 y[1] (closed_form) = 0.25974787071643065894544560756899 y[1] (numeric) = 0.25974787071643065894544560756896 absolute error = 3e-32 relative error = 1.1549661568833917104472994049817e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8808 Order of pole (three term test) = 1.618e-10 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.7 y[1] (closed_form) = 0.26808575756793110052941329261424 y[1] (numeric) = 0.26808575756793110052941329261419 absolute error = 5e-32 relative error = 1.8650748347692563037572436643028e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8708 Order of pole (three term test) = 9.666e-11 NO COMPLEX POLE (six term test) for Equation 1 memory used=526.7MB, alloc=52.3MB, time=5.94 TOP MAIN SOLVE Loop x[1] = 0.71 y[1] (closed_form) = 0.27659459830471089647622620475432 y[1] (numeric) = 0.27659459830471089647622620475427 absolute error = 5e-32 relative error = 1.8076997998680154028977902519084e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8608 Order of pole (three term test) = 5.752e-11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.72 y[1] (closed_form) = 0.28527732731592556251069378115938 y[1] (numeric) = 0.28527732731592556251069378115934 absolute error = 4e-32 relative error = 1.4021443756623068379972593372306e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8508 Order of pole (three term test) = 3.411e-11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.73 y[1] (closed_form) = 0.29413699089182122586533133649918 y[1] (numeric) = 0.29413699089182122586533133649913 absolute error = 5e-32 relative error = 1.6998881999982512285977634552204e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8408 Order of pole (three term test) = 2.015e-11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.74 y[1] (closed_form) = 0.30317675241995011257089763534277 y[1] (numeric) = 0.30317675241995011257089763534272 absolute error = 5e-32 relative error = 1.6492029682652482134406878673694e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8308 Order of pole (three term test) = 1.185e-11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.75 y[1] (closed_form) = 0.31239989789910529045450249364086 y[1] (numeric) = 0.3123998978991052904545024936408 absolute error = 6e-32 relative error = 1.9206152243807067927165326175636e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8208 Order of pole (three term test) = 6.948e-12 NO COMPLEX POLE (six term test) for Equation 1 memory used=570.9MB, alloc=52.3MB, time=6.42 TOP MAIN SOLVE Loop x[1] = 0.76 y[1] (closed_form) = 0.32180984179425945068151423381541 y[1] (numeric) = 0.32180984179425945068151423381537 absolute error = 4e-32 relative error = 1.2429700650849868786083279752077e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8108 Order of pole (three term test) = 4.055e-12 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.77 y[1] (closed_form) = 0.33141013325781794977317349320871 y[1] (numeric) = 0.33141013325781794977317349320868 absolute error = 3e-32 relative error = 9.0522277351917094352483658436037e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.8008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.8008 Order of pole (three term test) = 2.357e-12 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.78 y[1] (closed_form) = 0.34120446274472532274703956801391 y[1] (numeric) = 0.34120446274472532274703956801388 absolute error = 3e-32 relative error = 8.7923820687083817390578760451850e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7908 Order of pole (three term test) = 1.364e-12 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.79 y[1] (closed_form) = 0.35119666905142033592219992599373 y[1] (numeric) = 0.3511966690514203359221999259937 absolute error = 3e-32 relative error = 8.5422222485850401458553333666287e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7808 Order of pole (three term test) = 7.856e-13 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.8 y[1] (closed_form) = 0.36139074681134370073955187701716 y[1] (numeric) = 0.36139074681134370073955187701713 absolute error = 3e-32 relative error = 8.3012640098560291785317531038220e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7708 Order of pole (three term test) = 4.504e-13 NO COMPLEX POLE (six term test) for Equation 1 memory used=615.1MB, alloc=52.3MB, time=6.92 TOP MAIN SOLVE Loop x[1] = 0.81 y[1] (closed_form) = 0.37179085448269458146368508643973 y[1] (numeric) = 0.3717908544826945814636850864397 absolute error = 3e-32 relative error = 8.0690527048444069090164142013195e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7608 Order of pole (three term test) = 2.570e-13 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.82 y[1] (closed_form) = 0.38240132286744070218141983186178 y[1] (numeric) = 0.38240132286744070218141983186177 absolute error = 1e-32 relative error = 2.6150537150381398764755980197267e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7508 Order of pole (three term test) = 1.460e-13 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.83 y[1] (closed_form) = 0.39322666420425041395821766021091 y[1] (numeric) = 0.39322666420425041395821766021089 absolute error = 2e-32 relative error = 5.0861250827109650082452479904619e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7408 Order of pole (three term test) = 8.246e-14 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.84 y[1] (closed_form) = 0.40427158188207693854781095755977 y[1] (numeric) = 0.40427158188207693854781095755976 absolute error = 1e-32 relative error = 2.4735847010183680947066511350799e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7308 Order of pole (three term test) = 4.634e-14 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.85 y[1] (closed_form) = 0.41554098082563456072414008672357 y[1] (numeric) = 0.41554098082563456072414008672356 absolute error = 1e-32 relative error = 2.4065015152370993074744156440428e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7208 Order of pole (three term test) = 2.591e-14 NO COMPLEX POLE (six term test) for Equation 1 memory used=659.4MB, alloc=52.3MB, time=7.42 TOP MAIN SOLVE Loop x[1] = 0.86 y[1] (closed_form) = 0.42703997860902009961970846262481 y[1] (numeric) = 0.4270399786090200996197084626248 absolute error = 1e-32 relative error = 2.3417011289136422379392072638076e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7108 Order of pole (three term test) = 1.440e-14 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.87 y[1] (closed_form) = 0.43877391735931483133143230370915 y[1] (numeric) = 0.43877391735931483133143230370915 absolute error = 0 relative error = 0 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.7008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.7008 Order of pole (three term test) = 7.958e-15 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.88 y[1] (closed_form) = 0.45074837651822568140685167564968 y[1] (numeric) = 0.45074837651822568140685167564969 absolute error = 1e-32 relative error = 2.2185326716524862077584661218965e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6908 Order of pole (three term test) = 4.372e-15 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.89 y[1] (closed_form) = 0.46296918653677419992400132049904 y[1] (numeric) = 0.46296918653677419992400132049905 absolute error = 1e-32 relative error = 2.1599709636843591446046130781641e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6808 Order of pole (three term test) = 2.387e-15 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.9 y[1] (closed_form) = 0.47544244358581428500971793610522 y[1] (numeric) = 0.47544244358581428500971793610523 absolute error = 1e-32 relative error = 2.1033040139579092287837196962823e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6708 Order of pole (three term test) = 1.295e-15 NO COMPLEX POLE (six term test) for Equation 1 memory used=703.7MB, alloc=52.3MB, time=7.89 TOP MAIN SOLVE Loop x[1] = 0.91 y[1] (closed_form) = 0.48817452537386607244011633638259 y[1] (numeric) = 0.4881745253738660724401163363826 absolute error = 1e-32 relative error = 2.0484477333882895493558612541152e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6608 Order of pole (three term test) = 6.983e-16 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.92 y[1] (closed_form) = 0.50117210817352206486580922236454 y[1] (numeric) = 0.50117210817352206486580922236455 absolute error = 1e-32 relative error = 1.9953225323021518071425780477080e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6508 Order of pole (three term test) = 3.739e-16 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.93 y[1] (closed_form) = 0.51444218516866049589961060443574 y[1] (numeric) = 0.51444218516866049589961060443575 absolute error = 1e-32 relative error = 1.9438530292226108637170845310439e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6408 Order of pole (three term test) = 1.988e-16 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.94 y[1] (closed_form) = 0.52799208624706146590424159189259 y[1] (numeric) = 0.52799208624706146590424159189264 absolute error = 5e-32 relative error = 9.4698389052376207741018584733058e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6308 Order of pole (three term test) = 1.049e-16 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.95 y[1] (closed_form) = 0.54182949937696228955735782951295 y[1] (numeric) = 0.541829499376962289557357829513 absolute error = 5e-32 relative error = 9.2279951640680121311163537073748e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6208 Order of pole (three term test) = 5.496e-17 NO COMPLEX POLE (six term test) for Equation 1 memory used=747.9MB, alloc=52.3MB, time=8.36 TOP MAIN SOLVE Loop x[1] = 0.96 y[1] (closed_form) = 0.55596249372184078297003425326856 y[1] (numeric) = 0.5559624937218407829700342532686 absolute error = 4e-32 relative error = 7.1947299416231492178750215311288e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6108 Order of pole (three term test) = 2.857e-17 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.97 y[1] (closed_form) = 0.57039954466554805723971068073415 y[1] (numeric) = 0.57039954466554805723971068073416 absolute error = 1e-32 relative error = 1.7531570797209292852374561767918e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.6008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.6008 Order of pole (three term test) = 1.473e-17 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.98 y[1] (closed_form) = 0.58514956094014013115956949852153 y[1] (numeric) = 0.58514956094014013115956949852154 absolute error = 1e-32 relative error = 1.7089647959289820069389438382598e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5908 Order of pole (three term test) = 7.534e-18 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.99 y[1] (closed_form) = 0.60022191407174835977683955432996 y[1] (numeric) = 0.60022191407174835977683955432998 absolute error = 2e-32 relative error = 3.3321009331907318922592495494910e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5808 Order of pole (three term test) = 3.819e-18 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1 y[1] (closed_form) = 0.61562647038601426214703751640889 y[1] (numeric) = 0.61562647038601426214703751640891 absolute error = 2e-32 relative error = 3.2487232050726254656885231606205e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5708 Order of pole (three term test) = 1.919e-18 NO COMPLEX POLE (six term test) for Equation 1 memory used=792.2MB, alloc=52.3MB, time=8.83 TOP MAIN SOLVE Loop x[1] = 1.01 y[1] (closed_form) = 0.63137362584450315188279089363379 y[1] (numeric) = 0.6313736258445031518827908936338 absolute error = 1e-32 relative error = 1.5838482303761662159127203336818e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5608 Order of pole (three term test) = 9.552e-19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.02 y[1] (closed_form) = 0.64747434401770284367387505983639 y[1] (numeric) = 0.64747434401770284367387505983641 absolute error = 2e-32 relative error = 3.0889254817258322672268823959777e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5508 Order of pole (three term test) = 4.709e-19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.03 y[1] (closed_form) = 0.66394019753941837193284368197813 y[1] (numeric) = 0.66394019753941837193284368197815 absolute error = 2e-32 relative error = 3.0123194941533258645616326942854e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5408 Order of pole (three term test) = 2.298e-19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.04 y[1] (closed_form) = 0.68078341343243336216822163902211 y[1] (numeric) = 0.68078341343243336216822163902212 absolute error = 1e-32 relative error = 1.4688959517361219623537727973747e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5308 Order of pole (three term test) = 1.110e-19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.05 y[1] (closed_form) = 0.6980169227472259234768425271063 y[1] (numeric) = 0.69801692274722592347684252710631 absolute error = 1e-32 relative error = 1.4326300228714250399781130143757e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5208 Order of pole (three term test) = 5.304e-20 NO COMPLEX POLE (six term test) for Equation 1 memory used=836.4MB, alloc=52.3MB, time=9.30 TOP MAIN SOLVE Loop x[1] = 1.06 y[1] (closed_form) = 0.7156544150154985808589391935345 y[1] (numeric) = 0.71565441501549858085893919353452 absolute error = 2e-32 relative error = 2.7946449543760405211816886542539e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5108 Order of pole (three term test) = 2.506e-20 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.07 y[1] (closed_form) = 0.73371039808974145199588183609803 y[1] (numeric) = 0.73371039808974145199588183609807 absolute error = 4e-32 relative error = 5.4517422819878760007801684848994e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.5008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.5008 Order of pole (three term test) = 1.170e-20 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.08 y[1] (closed_form) = 0.75220026402071845962429762508506 y[1] (numeric) = 0.75220026402071845962429762508511 absolute error = 5e-32 relative error = 6.6471659731593512976606625454245e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4908 Order of pole (three term test) = 5.395e-21 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.09 y[1] (closed_form) = 0.77114036171872549545405346664079 y[1] (numeric) = 0.77114036171872549545405346664083 absolute error = 4e-32 relative error = 5.1871231212496247031462113180340e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4808 Order of pole (three term test) = 2.457e-21 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.1 y[1] (closed_form) = 0.79054807725423157832360761284218 y[1] (numeric) = 0.79054807725423157832360761284223 absolute error = 5e-32 relative error = 6.3247260272471131690939094290130e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4708 Order of pole (three term test) = 1.104e-21 NO COMPLEX POLE (six term test) for Equation 1 memory used=880.8MB, alloc=52.3MB, time=9.76 TOP MAIN SOLVE Loop x[1] = 1.11 y[1] (closed_form) = 0.8104419227821336686144201585331 y[1] (numeric) = 0.81044192278213366861442015853312 absolute error = 2e-32 relative error = 2.4677894168335714623164795292032e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4608 Order of pole (three term test) = 4.890e-22 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.12 y[1] (closed_form) = 0.8308416352250578146554749380697 y[1] (numeric) = 0.83084163522505781465547493806973 absolute error = 3e-32 relative error = 3.6107964175234935705964526984736e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4508 Order of pole (three term test) = 2.135e-22 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.13 y[1] (closed_form) = 0.85176828602948452590182842787181 y[1] (numeric) = 0.85176828602948452590182842787183 absolute error = 2e-32 relative error = 2.3480564289649646211425483134459e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4408 Order of pole (three term test) = 9.181e-23 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.14 y[1] (closed_form) = 0.87324440351957250437741676966729 y[1] (numeric) = 0.87324440351957250437741676966732 absolute error = 3e-32 relative error = 3.4354643303852096881547049181364e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4308 Order of pole (three term test) = 3.885e-23 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.15 y[1] (closed_form) = 0.89529410962432754843323878013503 y[1] (numeric) = 0.89529410962432754843323878013507 absolute error = 4e-32 relative error = 4.4678055590898855209791356180875e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4208 Order of pole (three term test) = 1.617e-23 NO COMPLEX POLE (six term test) for Equation 1 memory used=925.2MB, alloc=52.3MB, time=10.23 TOP MAIN SOLVE Loop x[1] = 1.16 y[1] (closed_form) = 0.9179432730528043730621826802488 y[1] (numeric) = 0.91794327305280437306218268024884 absolute error = 4e-32 relative error = 4.3575677467488792927370114281950e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4108 Order of pole (three term test) = 6.611e-24 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.17 y[1] (closed_form) = 0.94121968135004839415224478118841 y[1] (numeric) = 0.94121968135004839415224478118844 absolute error = 3e-32 relative error = 3.1873536640212604822423854789607e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.4008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4008 Order of pole (three term test) = 2.653e-24 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.18 y[1] (closed_form) = 0.9651532346968997068056452965941 y[1] (numeric) = 0.96515323469689970680564529659414 absolute error = 4e-32 relative error = 4.1444196177368403072870306854722e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3908 Order of pole (three term test) = 1.044e-24 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.19 y[1] (closed_form) = 0.98977616483648983560036133331333 y[1] (numeric) = 0.9897761648364898356003613333134 absolute error = 7e-32 relative error = 7.0723060917075063448710753500221e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3808 Order of pole (three term test) = 4.028e-25 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.2 y[1] (closed_form) = 1.0151232831406596166642531887589 y[1] (numeric) = 1.015123283140659616664253188759 absolute error = 1e-31 relative error = 9.8510202318099714696838520120862e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3708 Order of pole (three term test) = 1.520e-25 NO COMPLEX POLE (six term test) for Equation 1 memory used=969.6MB, alloc=52.3MB, time=10.72 TOP MAIN SOLVE Loop x[1] = 1.21 y[1] (closed_form) = 1.0412322625978628317573860361734 y[1] (numeric) = 1.0412322625978628317573860361736 absolute error = 2e-31 relative error = 1.9208010276304946632342586423945e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3608 Order of pole (three term test) = 5.616e-26 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.22 y[1] (closed_form) = 1.0681439594453074953144590293971 y[1] (numeric) = 1.0681439594453074953144590293972 absolute error = 1e-31 relative error = 9.3620339389393261696122831330832e-30 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3508 Order of pole (three term test) = 2.037e-26 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.23 y[1] (closed_form) = 1.0959027813271406152089727445301 y[1] (numeric) = 1.0959027813271406152089727445303 absolute error = 2e-31 relative error = 1.8249793997036814859923563484792e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3408 Order of pole (three term test) = 7.102e-27 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.24 y[1] (closed_form) = 1.1245571102958336035990707821674 y[1] (numeric) = 1.1245571102958336035990707821677 absolute error = 3e-31 relative error = 2.6677168927514936953581750871937e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3308 Order of pole (three term test) = 2.477e-27 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.25 y[1] (closed_form) = 1.1541597907619533834757535760123 y[1] (numeric) = 1.1541597907619533834757535760125 absolute error = 2e-31 relative error = 1.7328623090219073569901017154433e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3208 Order of pole (three term test) = 8.164e-28 NO COMPLEX POLE (six term test) for Equation 1 memory used=1014.0MB, alloc=52.3MB, time=11.19 TOP MAIN SOLVE Loop x[1] = 1.26 y[1] (closed_form) = 1.1847686947387932103640751409307 y[1] (numeric) = 1.1847686947387932103640751409309 absolute error = 2e-31 relative error = 1.6880932192768153875077449544539e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3108 Order of pole (three term test) = 3.029e-28 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.27 y[1] (closed_form) = 1.2164473795563924951328697040191 y[1] (numeric) = 1.2164473795563924951328697040195 absolute error = 4e-31 relative error = 3.2882638963460125520618266235853e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.3008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3008 Order of pole (three term test) = 3.887e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.28 y[1] (closed_form) = 1.2492658568129765948943342669988 y[1] (numeric) = 1.2492658568129765948943342669993 absolute error = 5e-31 relative error = 4.0023506387628211989853966864742e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2908 Order of pole (three term test) = 1.670e-28 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.29 y[1] (closed_form) = 1.2833014959320560732328761350587 y[1] (numeric) = 1.2833014959320560732328761350592 absolute error = 5e-31 relative error = 3.8962005544679293081279135251741e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2808 Order of pole (three term test) = 4.145e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.3 y[1] (closed_form) = 1.3186400916291685666027959482477 y[1] (numeric) = 1.3186400916291685666027959482483 absolute error = 6e-31 relative error = 4.5501422549552935741970886524303e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2708 Order of pole (three term test) = 3.785e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop memory used=1058.5MB, alloc=52.3MB, time=11.66 x[1] = 1.31 y[1] (closed_form) = 1.3553771323162041613521307414069 y[1] (numeric) = 1.3553771323162041613521307414074 absolute error = 5e-31 relative error = 3.6890101513336729654060881921967e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2608 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.32 y[1] (closed_form) = 1.3936193166132841894311591204205 y[1] (numeric) = 1.3936193166132841894311591204211 absolute error = 6e-31 relative error = 4.3053364204085165271785848502106e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2508 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.33 y[1] (closed_form) = 1.4334863785846989858939593092082 y[1] (numeric) = 1.4334863785846989858939593092089 absolute error = 7e-31 relative error = 4.8831995229080566756789880993088e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2408 Order of pole (three term test) = 3.263e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.34 y[1] (closed_form) = 1.4751133003293379102707928607389 y[1] (numeric) = 1.4751133003293379102707928607397 absolute error = 8e-31 relative error = 5.4233122284328245728256241380044e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2308 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.35 y[1] (closed_form) = 1.5186530149603870751898958988672 y[1] (numeric) = 1.518653014960387075189895898868 absolute error = 8e-31 relative error = 5.2678261072090085038270403325028e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2208 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.36 y[1] (closed_form) = 1.5642797364730061261017717087599 y[1] (numeric) = 1.5642797364730061261017717087608 absolute error = 9e-31 relative error = 5.7534466439438581918796116009730e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2108 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 memory used=1103.0MB, alloc=52.3MB, time=12.13 TOP MAIN SOLVE Loop x[1] = 1.37 y[1] (closed_form) = 1.6121930994906972389671884851212 y[1] (numeric) = 1.6121930994906972389671884851221 absolute error = 9e-31 relative error = 5.5824578351334968427682401344631e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.2008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2008 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.38 y[1] (closed_form) = 1.6626233574003796274966328950026 y[1] (numeric) = 1.6626233574003796274966328950035 absolute error = 9e-31 relative error = 5.4131321805030387011338955865748e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1908 Order of pole (three term test) = 1.391e-28 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.39 y[1] (closed_form) = 1.7158379811678190697045444588912 y[1] (numeric) = 1.7158379811678190697045444588921 absolute error = 9e-31 relative error = 5.2452504833087425073870157145904e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1808 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.4 y[1] (closed_form) = 1.7721501376696990272141106868693 y[1] (numeric) = 1.7721501376696990272141106868704 absolute error = 1.1e-30 relative error = 6.2071490254570221754740733219416e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1708 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1708 Order of pole (three term test) = 2.329e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.41 y[1] (closed_form) = 1.8319297289558808289320648371267 y[1] (numeric) = 1.8319297289558808289320648371278 absolute error = 1.1e-30 relative error = 6.0045971339029008400052528782541e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1608 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1608 Order of pole (three term test) = 2.172e-28 NO COMPLEX POLE (six term test) for Equation 1 memory used=1147.6MB, alloc=52.3MB, time=12.61 TOP MAIN SOLVE Loop x[1] = 1.42 y[1] (closed_form) = 1.8956179807145446725622651027797 y[1] (numeric) = 1.8956179807145446725622651027807 absolute error = 1.0e-30 relative error = 5.2753245125004274192185554763821e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1508 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1508 Order of pole (three term test) = 1.882e-28 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.43 y[1] (closed_form) = 1.9637470439243689010155627224162 y[1] (numeric) = 1.9637470439243689010155627224171 absolute error = 9e-31 relative error = 4.5830750084870009355542948859559e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1408 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1408 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.44 y[1] (closed_form) = 2.0369668305394392250598441967529 y[1] (numeric) = 2.0369668305394392250598441967538 absolute error = 9e-31 relative error = 4.4183340961013966433334485953978e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1308 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1308 Order of pole (three term test) = 5.236e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.45 y[1] (closed_form) = 2.1160825440137191518804053682086 y[1] (numeric) = 2.1160825440137191518804053682096 absolute error = 1.0e-30 relative error = 4.7257135730784456666013892843209e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1208 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1208 Order of pole (three term test) = 8.248e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.46 y[1] (closed_form) = 2.2021084657468975855988513433722 y[1] (numeric) = 2.2021084657468975855988513433732 absolute error = 1.0e-30 relative error = 4.5411023823516620443418311533001e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1108 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1108 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 memory used=1192.4MB, alloc=52.3MB, time=13.08 TOP MAIN SOLVE Loop x[1] = 1.47 y[1] (closed_form) = 2.2963472549526355919112295036683 y[1] (numeric) = 2.2963472549526355919112295036695 absolute error = 1.2e-30 relative error = 5.2256904847988732160056597219459e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.1008 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1008 Order of pole (three term test) = 7.130e-29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.48 y[1] (closed_form) = 2.4005108212575825445957134843943 y[1] (numeric) = 2.4005108212575825445957134843953 absolute error = 1.0e-30 relative error = 4.1657800129229110373776367044288e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.0908 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.0908 Order of pole (three term test) = 0 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 1.49 y[1] (closed_form) = 2.5169120195352477327155332172207 y[1] (numeric) = 2.5169120195352477327155332172217 absolute error = 1.0e-30 relative error = 3.9731225892617882334872187302527e-29 % Desired digits = 8 Estimated correct digits = 12 Correct digits = 32 h = 0.001 Radius of convergence (given) for eq 1 = 0.0808 Order of pole (given) = 0 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.0808 Order of pole (three term test) = 1.631e-28 NO COMPLEX POLE (six term test) for Equation 1 Finished! diff ( y , x , 1 ) = tan ( x ) ; Iterations = 1400 Total Elapsed Time = 13 Seconds Elapsed Time(since restart) = 13 Seconds Time to Timeout = 2 Minutes 46 Seconds Percent Done = 100.1 % > quit memory used=1221.2MB, alloc=52.3MB, time=13.37