|\^/| Maple 11 (IBM INTEL LINUX) ._|\| |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2007 \ MAPLE / All rights reserved. Maple is a trademark of <____ ____> Waterloo Maple Inc. | Type ? for help. > #BEGIN OUTFILE1 > # Begin Function number 3 > display_poles := proc() > global ALWAYS,glob_display_flag, glob_large_float, array_pole, glob_type_given_pole,array_given_rad_poles,array_given_ord_poles, array_complex_poles,array_poles,array_real_poles,array_x ; > local rad_given; > if (glob_type_given_pole = 4) then # if number 1 > rad_given := sqrt(expt(array_x[1] - array_given_rad_poles[1,1],2.0) + expt(array_given_rad_poles[1,2],2.0)) ; > 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," "); > elif > (glob_type_given_pole = 3) then # if number 2 > omniout_str(ALWAYS,"NO POLE (given) for Equation 1"); > else > omniout_str(ALWAYS,"NO INFO (given) for Equation 1"); > fi;# end if 2; > if (array_poles[1,1] <> glob_large_float) then # if number 2 > omniout_float(ALWAYS,"Radius of convergence (ratio test) for eq 1 ",4, array_poles[1,1],4," "); > omniout_str(ALWAYS,"Order of pole (ratio test) Not computed"); > else > omniout_str(ALWAYS,"NO POLE (ratio test) for Equation 1"); > fi;# end if 2; > if ((array_real_poles[1,1] > 0.0) and (array_real_poles[1,1] <> glob_large_float)) then # if number 2 > omniout_float(ALWAYS,"Radius of convergence (three term test) for eq 1 ",4, array_real_poles[1,1],4," "); > omniout_float(ALWAYS,"Order of pole (three term test) ",4, array_real_poles[1,2],4," "); > else > omniout_str(ALWAYS,"NO REAL POLE (three term test) for Equation 1"); > fi;# end if 2; > if ((array_complex_poles[1,1] > 0.0) and (array_complex_poles[1,1] <> glob_large_float)) then # if number 2 > omniout_float(ALWAYS,"Radius of convergence (six term test) for eq 1 ",4, array_complex_poles[1,1],4," "); > omniout_float(ALWAYS,"Order of pole (six term test) ",4, array_complex_poles[1,2],4," "); > else > omniout_str(ALWAYS,"NO COMPLEX POLE (six term test) for Equation 1"); > fi;# end if 2 > ; > end; display_poles := proc() local rad_given; global ALWAYS, glob_display_flag, glob_large_float, array_pole, glob_type_given_pole, array_given_rad_poles, array_given_ord_poles, array_complex_poles, array_poles, array_real_poles, array_x; if glob_type_given_pole = 4 then rad_given := sqrt( expt(array_x[1] - array_given_rad_poles[1, 1], 2.0) + expt(array_given_rad_poles[1, 2], 2.0)); 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, " ") elif glob_type_given_pole = 3 then omniout_str(ALWAYS, "NO POLE (given) for Equation 1") else omniout_str(ALWAYS, "NO INFO (given) for Equation 1") end if; if array_poles[1, 1] <> glob_large_float then omniout_float(ALWAYS, "Radius of convergence (ratio test) for eq 1 ", 4, array_poles[1, 1], 4, " "); omniout_str(ALWAYS, "Order of pole (ratio test) \ Not computed") else omniout_str(ALWAYS, "NO POLE (ratio test) for Equation 1") end if; if 0. < array_real_poles[1, 1] and array_real_poles[1, 1] <> glob_large_float then omniout_float(ALWAYS, "Radius of convergence (three term test) for eq 1 ", 4, array_real_poles[1, 1], 4, " "); omniout_float(ALWAYS, "Order of pole (three term test) ", 4, array_real_poles[1, 2], 4, " ") else omniout_str(ALWAYS, "NO REAL POLE (three term test) for Equation 1") end if; if 0. < array_complex_poles[1, 1] and array_complex_poles[1, 1] <> glob_large_float then omniout_float(ALWAYS, "Radius of convergence (six term test) for eq 1 ", 4, array_complex_poles[1, 1], 4, " "); omniout_float(ALWAYS, "Order of pole (six term test) ", 4, array_complex_poles[1, 2], 4, " ") else omniout_str(ALWAYS, "NO COMPLEX POLE (six term test) for Equation 1") end if end proc > # End Function number 3 > # Begin Function number 4 > check_sign := proc( x0 ,xf) > local ret; > if (xf > x0) then # if number 2 > ret := 1.0; > else > ret := -1.0; > fi;# end if 2; > ret;; > end; check_sign := proc(x0, xf) local ret; if x0 < xf then ret := 1.0 else ret := -1.0 end if; ret end proc > # End Function number 4 > # Begin Function number 5 > est_size_answer := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local min_size; > min_size := glob_large_float; > if (omniabs(array_y[1]) < min_size) then # if number 2 > min_size := omniabs(array_y[1]); > omniout_float(ALWAYS,"min_size",32,min_size,32,""); > fi;# end if 2; > if (min_size < 1.0) then # if number 2 > min_size := 1.0; > omniout_float(ALWAYS,"min_size",32,min_size,32,""); > fi;# end if 2; > min_size; > end; est_size_answer := proc() local min_size; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; min_size := glob_large_float; if omniabs(array_y[1]) < min_size then min_size := omniabs(array_y[1]); omniout_float(ALWAYS, "min_size", 32, min_size, 32, "") end if; if min_size < 1.0 then min_size := 1.0; omniout_float(ALWAYS, "min_size", 32, min_size, 32, "") end if; min_size end proc > # End Function number 5 > # Begin Function number 6 > test_suggested_h := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > 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 := 0.0; > no_terms := glob_max_terms; > hn_div_ho := 0.5; > hn_div_ho_2 := 0.25; > hn_div_ho_3 := 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 := omniabs(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 2 > max_estimated_step_error := est_tmp; > fi;# end if 2; > 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 glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; max_estimated_step_error := 0.; no_terms := glob_max_terms; hn_div_ho := 0.5; hn_div_ho_2 := 0.25; hn_div_ho_3 := 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 := omniabs(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 6 > # Begin Function number 7 > reached_interval := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local ret; > if (glob_check_sign * (array_x[1]) >= glob_check_sign * glob_next_display) then # if number 2 > ret := true; > else > ret := false; > fi;# end if 2; > return(ret); > end; reached_interval := proc() local ret; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; if glob_check_sign*glob_next_display <= 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 > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no; > #TOP DISPLAY ALOT > if (reached_interval()) then # if number 2 > if (iter >= 0) then # if number 3 > ind_var := array_x[1]; > omniout_float(ALWAYS,"x[1] ",33,ind_var,20," "); > analytic_val_y := exact_soln_y(ind_var); > omniout_float(ALWAYS,"y[1] (analytic) ",33,analytic_val_y,20," "); > term_no := 1; > numeric_val := array_y[term_no]; > abserr := omniabs(numeric_val - analytic_val_y); > omniout_float(ALWAYS,"y[1] (numeric) ",33,numeric_val,20," "); > if (omniabs(analytic_val_y) <> 0.0) then # if number 4 > relerr := abserr*100.0/omniabs(analytic_val_y); > if (relerr > 0.0000000000000000000000000000000001) then # if number 5 > glob_good_digits := -trunc(log10(relerr)) + 3; > else > glob_good_digits := Digits; > fi;# end if 5; > else > relerr := -1.0 ; > glob_good_digits := -1; > fi;# end if 4; > if (glob_iter = 1) then # if number 4 > array_1st_rel_error[1] := relerr; > else > array_last_rel_error[1] := relerr; > fi;# end if 4; > omniout_float(ALWAYS,"absolute error ",4,abserr,20," "); > omniout_float(ALWAYS,"relative error ",4,relerr,20,"%"); > omniout_int(INFO,"Correct digits ",32,glob_good_digits,4," ") > ; > omniout_float(ALWAYS,"h ",4,glob_h,20," "); > fi;# end if 3; > #BOTTOM DISPLAY ALOT > fi;# end if 2; > end; display_alot := proc(iter) local abserr, analytic_val_y, ind_var, numeric_val, relerr, term_no; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; if reached_interval() then if 0 <= iter then ind_var := array_x[1]; omniout_float(ALWAYS, "x[1] ", 33, ind_var, 20, " "); analytic_val_y := exact_soln_y(ind_var); omniout_float(ALWAYS, "y[1] (analytic) ", 33, analytic_val_y, 20, " "); term_no := 1; numeric_val := array_y[term_no]; abserr := omniabs(numeric_val - analytic_val_y); omniout_float(ALWAYS, "y[1] (numeric) ", 33, numeric_val, 20, " "); if omniabs(analytic_val_y) <> 0. then relerr := abserr*100.0/omniabs(analytic_val_y); if 0.1*10^(-33) < relerr then glob_good_digits := -trunc(log10(relerr)) + 3 else glob_good_digits := Digits end if else relerr := -1.0; glob_good_digits := -1 end if; if glob_iter = 1 then array_1st_rel_error[1] := relerr else array_last_rel_error[1] := relerr end if; omniout_float(ALWAYS, "absolute error ", 4, abserr, 20, " "); omniout_float(ALWAYS, "relative error ", 4, relerr, 20, "%"); omniout_int(INFO, "Correct digits ", 32, glob_good_digits, 4, " "); omniout_float(ALWAYS, "h ", 4, glob_h, 20, " ") end if end if end proc > # End Function number 8 > # Begin Function number 9 > adjust_for_pole := proc(h_param) > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local hnew, sz2, tmp; > #TOP ADJUST FOR POLE > hnew := h_param; > glob_normmax := glob_small_float; > if (omniabs(array_y_higher[1,1]) > glob_small_float) then # if number 2 > tmp := omniabs(array_y_higher[1,1]); > if (tmp < glob_normmax) then # if number 3 > glob_normmax := tmp; > fi;# end if 3 > fi;# end if 2; > if (glob_look_poles and (omniabs(array_pole[1]) > glob_small_float) and (array_pole[1] <> glob_large_float)) then # if number 2 > sz2 := array_pole[1]/10.0; > if (sz2 < hnew) then # if number 3 > omniout_float(INFO,"glob_h adjusted to ",20,h_param,12,"due to singularity."); > omniout_str(INFO,"Reached Optimal"); > return(hnew); > fi;# end if 3 > fi;# end if 2; > if ( not glob_reached_optimal_h) then # if number 2 > glob_reached_optimal_h := true; > glob_curr_iter_when_opt := glob_current_iter; > glob_optimal_clock_start_sec := elapsed_time_seconds(); > glob_optimal_start := array_x[1]; > fi;# end if 2; > hnew := sz2; > ;#END block > return(hnew); > #BOTTOM ADJUST FOR POLE > end; adjust_for_pole := proc(h_param) local hnew, sz2, tmp; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; hnew := h_param; glob_normmax := glob_small_float; if glob_small_float < omniabs(array_y_higher[1, 1]) then tmp := omniabs(array_y_higher[1, 1]); if tmp < glob_normmax then glob_normmax := tmp end if end if; if glob_look_poles and glob_small_float < omniabs(array_pole[1]) and array_pole[1] <> glob_large_float then sz2 := array_pole[1]/10.0; if sz2 < hnew then omniout_float(INFO, "glob_h adjusted to ", 20, h_param, 12, "due to singularity."); omniout_str(INFO, "Reached Optimal"); return hnew end if end if; if not glob_reached_optimal_h then glob_reached_optimal_h := true; glob_curr_iter_when_opt := glob_current_iter; glob_optimal_clock_start_sec := elapsed_time_seconds(); glob_optimal_start := array_x[1] end if; hnew := sz2; return hnew end proc > # End Function number 9 > # Begin Function number 10 > prog_report := proc(x_start,x_end) > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec; > #TOP PROGRESS REPORT > clock_sec1 := elapsed_time_seconds(); > total_clock_sec := convfloat(clock_sec1) - convfloat(glob_orig_start_sec); > glob_clock_sec := convfloat(clock_sec1) - convfloat(glob_clock_start_sec); > left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec) - convfloat(clock_sec1); > expect_sec := comp_expect_sec(convfloat(x_end),convfloat(x_start),convfloat(array_x[1]) + convfloat(glob_h) ,convfloat( clock_sec1) - convfloat(glob_orig_start_sec)); > opt_clock_sec := convfloat( clock_sec1) - convfloat(glob_optimal_clock_start_sec); > glob_optimal_expect_sec := comp_expect_sec(convfloat(x_end),convfloat(x_start),convfloat(array_x[1]) +convfloat( glob_h) ,convfloat( opt_clock_sec)); > glob_total_exp_sec := glob_optimal_expect_sec + total_clock_sec; > percent_done := comp_percent(convfloat(x_end),convfloat(x_start),convfloat(array_x[1]) + convfloat(glob_h)); > glob_percent_done := percent_done; > omniout_str_noeol(INFO,"Total Elapsed Time "); > omniout_timestr(convfloat(total_clock_sec)); > omniout_str_noeol(INFO,"Elapsed Time(since restart) "); > omniout_timestr(convfloat(glob_clock_sec)); > if (convfloat(percent_done) < convfloat(100.0)) then # if number 2 > omniout_str_noeol(INFO,"Expected Time Remaining "); > omniout_timestr(convfloat(expect_sec)); > omniout_str_noeol(INFO,"Optimized Time Remaining "); > omniout_timestr(convfloat(glob_optimal_expect_sec)); > omniout_str_noeol(INFO,"Expected Total Time "); > omniout_timestr(convfloat(glob_total_exp_sec)); > fi;# end if 2; > omniout_str_noeol(INFO,"Time to Timeout "); > omniout_timestr(convfloat(left_sec)); > omniout_float(INFO, "Percent Done ",33,percent_done,4,"%"); > #BOTTOM PROGRESS REPORT > end; prog_report := proc(x_start, x_end) local clock_sec, opt_clock_sec, clock_sec1, expect_sec, left_sec, percent_done, total_clock_sec; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; clock_sec1 := elapsed_time_seconds(); total_clock_sec := convfloat(clock_sec1) - convfloat(glob_orig_start_sec); glob_clock_sec := convfloat(clock_sec1) - convfloat(glob_clock_start_sec); left_sec := convfloat(glob_max_sec) + convfloat(glob_orig_start_sec) - convfloat(clock_sec1); expect_sec := comp_expect_sec(convfloat(x_end), convfloat(x_start), convfloat(array_x[1]) + convfloat(glob_h), convfloat(clock_sec1) - convfloat(glob_orig_start_sec)); opt_clock_sec := convfloat(clock_sec1) - convfloat(glob_optimal_clock_start_sec); glob_optimal_expect_sec := comp_expect_sec(convfloat(x_end), convfloat(x_start), convfloat(array_x[1]) + convfloat(glob_h), convfloat(opt_clock_sec)); glob_total_exp_sec := glob_optimal_expect_sec + total_clock_sec; percent_done := comp_percent(convfloat(x_end), convfloat(x_start), convfloat(array_x[1]) + convfloat(glob_h)); glob_percent_done := percent_done; omniout_str_noeol(INFO, "Total Elapsed Time "); omniout_timestr(convfloat(total_clock_sec)); omniout_str_noeol(INFO, "Elapsed Time(since restart) "); omniout_timestr(convfloat(glob_clock_sec)); if convfloat(percent_done) < convfloat(100.0) then omniout_str_noeol(INFO, "Expected Time Remaining "); omniout_timestr(convfloat(expect_sec)); omniout_str_noeol(INFO, "Optimized Time Remaining "); omniout_timestr(convfloat(glob_optimal_expect_sec)); omniout_str_noeol(INFO, "Expected Total Time "); omniout_timestr(convfloat(glob_total_exp_sec)) end if; omniout_str_noeol(INFO, "Time to Timeout "); omniout_timestr(convfloat(left_sec)); omniout_float(INFO, "Percent Done ", 33, percent_done, 4, "%") end proc > # End Function number 10 > # Begin Function number 11 > check_for_pole := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found_sing, h_new, ratio, term, local_test, tmp_rad, tmp_ratio, prev_tmp_rad; > #TOP CHECK FOR POLE > array_pole[1] := glob_large_float; > array_pole[2] := glob_large_float; > tmp_rad := glob_large_float; > prev_tmp_rad := glob_large_float; > tmp_ratio := glob_large_float; > rad_c := glob_large_float; > array_poles[1,1] := glob_large_float; > array_poles[1,2] := glob_large_float; > #TOP radius ratio test in Henrici1 > found_sing := 1; > n := glob_max_terms - 1 - 10; > cnt := 0; > while ((cnt < 5) and (found_sing = 1)) do # do number 1 > if ((omniabs(array_y_higher[1,n]) = 0.0) or (omniabs(array_y_higher[1,n+1]) = 0.0)) then # if number 2 > found_sing := 0; > else > tmp_rad := omniabs(array_y_higher[1,n] * glob_h / array_y_higher[1,n + 1]); > tmp_ratio := tmp_rad / prev_tmp_rad; > if ((cnt > 0 ) and (tmp_ratio < 2.0) and (tmp_ratio > 0.5)) then # if number 3 > if (tmp_rad < rad_c) then # if number 4 > rad_c := tmp_rad; > fi;# end if 4; > elif > (cnt = 0) then # if number 4 > if (tmp_rad < rad_c) then # if number 5 > rad_c := tmp_rad; > fi;# end if 5; > elif > (cnt > 0) then # if number 5 > found_sing := 0; > fi;# end if 5 > fi;# end if 4; > prev_tmp_rad := tmp_rad;; > cnt := cnt + 1; > n := n + 1; > od;# end do number 1; > if (found_sing = 1) then # if number 4 > if (rad_c < array_pole[1]) then # if number 5 > array_pole[1] := rad_c; > array_poles[1,1] := rad_c; > fi;# end if 5; > fi;# end if 4; > #BOTTOM radius ratio test in Henrici1 > #IN RADII REAL EQ = 1 > #Computes radius of convergence and r_order of pole from 3 adjacent Taylor series terms. EQUATUON NUMBER 1 > #Applies to pole of arbitrary r_order on the real axis, > #Due to Prof. George Corliss. > n := glob_max_terms; > m := n - 1 - 1; > while ((m >= 10) and ((omniabs(array_y_higher[1,m]) = 0.0) or (omniabs(array_y_higher[1,m-1]) = 0.0) or (omniabs(array_y_higher[1,m-2]) = 0.0))) do # do number 1 > m := m - 1; > od;# end do number 1; > if (m > 10) then # if number 4 > rm0 := array_y_higher[1,m]/array_y_higher[1,m-1]; > rm1 := array_y_higher[1,m-1]/array_y_higher[1,m-2]; > hdrc := convfloat(m)*rm0-convfloat(m-1)*rm1; > if (omniabs(hdrc) > 0.0) then # if number 5 > rcs := glob_h/hdrc; > ord_no := (rm1*convfloat((m-2)*(m-2))-rm0*convfloat(m-3))/hdrc; > array_real_poles[1,1] := rcs; > array_real_poles[1,2] := ord_no; > else > array_real_poles[1,1] := glob_large_float; > array_real_poles[1,2] := glob_large_float; > fi;# end if 5 > else > array_real_poles[1,1] := glob_large_float; > array_real_poles[1,2] := glob_large_float; > fi;# end if 4; > #BOTTOM RADII REAL EQ = 1 > #TOP RADII COMPLEX EQ = 1 > #Computes radius of convergence for complex conjugate pair of poles. > #from 6 adjacent Taylor series terms > #Also computes r_order of poles. > #Due to Manuel Prieto. > #With a correction by Dennis J. Darland > n := glob_max_terms - 1 - 1; > cnt := 0; > while ((cnt < 5) and (n >= 10)) do # do number 1 > if (omniabs(array_y_higher[1,n]) <> 0.0) then # if number 4 > cnt := cnt + 1; > else > cnt := 0; > fi;# end if 4; > n := n - 1; > od;# end do number 1; > m := n + cnt; > if (m <= 10) then # if number 4 > rad_c := glob_large_float; > ord_no := glob_large_float; > else > rm0 := (array_y_higher[1,m])/(array_y_higher[1,m-1]); > rm1 := (array_y_higher[1,m-1])/(array_y_higher[1,m-2]); > rm2 := (array_y_higher[1,m-2])/(array_y_higher[1,m-3]); > rm3 := (array_y_higher[1,m-3])/(array_y_higher[1,m-4]); > rm4 := (array_y_higher[1,m-4])/(array_y_higher[1,m-5]); > nr1 := convfloat(m-1)*rm0 - 2.0*convfloat(m-2)*rm1 + convfloat(m-3)*rm2; > nr2 := convfloat(m-2)*rm1 - 2.0*convfloat(m-3)*rm2 + convfloat(m-4)*rm3; > dr1 := (-1.0)/rm1 + 2.0/rm2 - 1.0/rm3; > dr2 := (-1.0)/rm2 + 2.0/rm3 - 1.0/rm4; > ds1 := 3.0/rm1 - 8.0/rm2 + 5.0/rm3; > ds2 := 3.0/rm2 - 8.0/rm3 + 5.0/rm4; > if ((omniabs(nr1 * dr2 - nr2 * dr1) = 0.0) or (omniabs(dr1) = 0.0)) then # if number 5 > rad_c := glob_large_float; > ord_no := glob_large_float; > else > if (omniabs(nr1*dr2 - nr2 * dr1) <> 0.0) then # if number 6 > rcs := ((ds1*dr2 - ds2*dr1 +dr1*dr2)/(nr1*dr2 - nr2 * dr1)); > #(Manuels) rcs := (ds1*dr2 - ds2*dr1)/(nr1*dr2 - nr2 * dr1) > ord_no := (rcs*nr1 - ds1)/(2.0*dr1) -convfloat(m)/2.0; > if (omniabs(rcs) <> 0.0) then # if number 7 > if (rcs > 0.0) then # if number 8 > rad_c := sqrt(rcs) * omniabs(glob_h); > else > rad_c := glob_large_float; > fi;# end if 8 > else > rad_c := glob_large_float; > ord_no := glob_large_float; > fi;# end if 7 > else > rad_c := glob_large_float; > ord_no := glob_large_float; > fi;# end if 6 > fi;# end if 5; > array_complex_poles[1,1] := rad_c; > array_complex_poles[1,2] := ord_no; > fi;# end if 4; > #BOTTOM RADII COMPLEX EQ = 1 > #START ADJUST ALL SERIES > if (array_pole[1] * glob_ratio_of_radius < omniabs(glob_h)) then # if number 4 > h_new := array_pole[1] * glob_ratio_of_radius; > term := 1; > ratio := 1.0; > while (term <= glob_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 / omniabs(glob_h); > term := term + 1; > od;# end do number 1; > glob_h := h_new; > fi;# end if 4; > #BOTTOM ADJUST ALL SERIES > ; > if (reached_interval()) then # if number 4 > display_poles(); > fi;# end if 4 > end; check_for_pole := proc() local cnt, dr1, dr2, ds1, ds2, hdrc, m, n, nr1, nr2, ord_no, rad_c, rcs, rm0, rm1, rm2, rm3, rm4, found_sing, h_new, ratio, term, local_test, tmp_rad, tmp_ratio, prev_tmp_rad; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; array_pole[1] := glob_large_float; array_pole[2] := glob_large_float; tmp_rad := glob_large_float; prev_tmp_rad := glob_large_float; tmp_ratio := glob_large_float; rad_c := glob_large_float; array_poles[1, 1] := glob_large_float; array_poles[1, 2] := glob_large_float; found_sing := 1; n := glob_max_terms - 11; cnt := 0; while cnt < 5 and found_sing = 1 do if omniabs(array_y_higher[1, n]) = 0. or omniabs(array_y_higher[1, n + 1]) = 0. then found_sing := 0 else tmp_rad := omniabs( array_y_higher[1, n]*glob_h/array_y_higher[1, n + 1]); tmp_ratio := tmp_rad/prev_tmp_rad; if 0 < cnt and tmp_ratio < 2.0 and 0.5 < tmp_ratio then if tmp_rad < rad_c then rad_c := tmp_rad end if elif cnt = 0 then if tmp_rad < rad_c then rad_c := tmp_rad end if elif 0 < cnt then found_sing := 0 end if end if; prev_tmp_rad := tmp_rad; cnt := cnt + 1; n := n + 1 end do; if found_sing = 1 then if rad_c < array_pole[1] then array_pole[1] := rad_c; array_poles[1, 1] := rad_c end if end if; n := glob_max_terms; m := n - 2; while 10 <= m and (omniabs(array_y_higher[1, m]) = 0. or omniabs(array_y_higher[1, m - 1]) = 0. or omniabs(array_y_higher[1, m - 2]) = 0.) do m := m - 1 end do; if 10 < m then rm0 := array_y_higher[1, m]/array_y_higher[1, m - 1]; rm1 := array_y_higher[1, m - 1]/array_y_higher[1, m - 2]; hdrc := convfloat(m)*rm0 - convfloat(m - 1)*rm1; if 0. < omniabs(hdrc) then rcs := glob_h/hdrc; ord_no := ( rm1*convfloat((m - 2)*(m - 2)) - rm0*convfloat(m - 3))/hdrc ; array_real_poles[1, 1] := rcs; array_real_poles[1, 2] := ord_no else array_real_poles[1, 1] := glob_large_float; array_real_poles[1, 2] := glob_large_float end if else array_real_poles[1, 1] := glob_large_float; array_real_poles[1, 2] := glob_large_float end if; n := glob_max_terms - 2; cnt := 0; while cnt < 5 and 10 <= n do if omniabs(array_y_higher[1, n]) <> 0. then cnt := cnt + 1 else cnt := 0 end if; n := n - 1 end do; m := n + cnt; if m <= 10 then rad_c := glob_large_float; ord_no := glob_large_float else rm0 := array_y_higher[1, m]/array_y_higher[1, m - 1]; rm1 := array_y_higher[1, m - 1]/array_y_higher[1, m - 2]; rm2 := array_y_higher[1, m - 2]/array_y_higher[1, m - 3]; rm3 := array_y_higher[1, m - 3]/array_y_higher[1, m - 4]; rm4 := array_y_higher[1, m - 4]/array_y_higher[1, m - 5]; nr1 := convfloat(m - 1)*rm0 - 2.0*convfloat(m - 2)*rm1 + convfloat(m - 3)*rm2; nr2 := convfloat(m - 2)*rm1 - 2.0*convfloat(m - 3)*rm2 + convfloat(m - 4)*rm3; dr1 := (-1)*(1.0)/rm1 + 2.0/rm2 - 1.0/rm3; dr2 := (-1)*(1.0)/rm2 + 2.0/rm3 - 1.0/rm4; ds1 := 3.0/rm1 - 8.0/rm2 + 5.0/rm3; ds2 := 3.0/rm2 - 8.0/rm3 + 5.0/rm4; if omniabs(nr1*dr2 - nr2*dr1) = 0. or omniabs(dr1) = 0. then rad_c := glob_large_float; ord_no := glob_large_float else if omniabs(nr1*dr2 - nr2*dr1) <> 0. then rcs := (ds1*dr2 - ds2*dr1 + dr1*dr2)/(nr1*dr2 - nr2*dr1); ord_no := (rcs*nr1 - ds1)/(2.0*dr1) - convfloat(m)/2.0; if omniabs(rcs) <> 0. then if 0. < rcs then rad_c := sqrt(rcs)*omniabs(glob_h) else rad_c := glob_large_float end if else rad_c := glob_large_float; ord_no := glob_large_float end if else rad_c := glob_large_float; ord_no := glob_large_float end if end if; array_complex_poles[1, 1] := rad_c; array_complex_poles[1, 2] := ord_no end if; if array_pole[1]*glob_ratio_of_radius < omniabs(glob_h) then h_new := array_pole[1]*glob_ratio_of_radius; term := 1; ratio := 1.0; while term <= glob_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/omniabs(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 11 > # Begin Function number 12 > get_norms := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local iii; > if ( not glob_initial_pass) then # if number 4 > iii := 1; > while (iii <= glob_max_terms) do # do number 1 > array_norms[iii] := 0.0; > iii := iii + 1; > od;# end do number 1; > #TOP GET NORMS > iii := 1; > while (iii <= glob_max_terms) do # do number 1 > if (omniabs(array_y[iii]) > array_norms[iii]) then # if number 5 > array_norms[iii] := omniabs(array_y[iii]); > fi;# end if 5; > iii := iii + 1; > od;# end do number 1 > #BOTTOM GET NORMS > ; > fi;# end if 4; > end; get_norms := proc() local iii; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; if not glob_initial_pass then iii := 1; while iii <= glob_max_terms do array_norms[iii] := 0.; iii := iii + 1 end do; iii := 1; while iii <= glob_max_terms do if array_norms[iii] < omniabs(array_y[iii]) then array_norms[iii] := omniabs(array_y[iii]) end if; iii := iii + 1 end do end if end proc > # End Function number 12 > # Begin Function number 13 > atomall := proc() > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > local kkk, order_d, adj2, adj3 , temporary, term; > #TOP ATOMALL > #END OUTFILE1 > #BEGIN ATOMHDR1 > #emit pre cos 1 $eq_no = 1 > array_tmp1[1] := cos(array_x[1]); > array_tmp1_g[1] := sin(array_x[1]); > #emit pre mult CONST - LINEAR $eq_no = 1 i = 1 > array_tmp2[1] := array_const_2D0[1] * array_x[1]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 1 > array_tmp3[1] := array_tmp2[1] + array_const_1D0[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 1 > array_tmp4[1] := array_tmp1[1] / array_tmp3[1]; > #emit pre add CONST FULL $eq_no = 1 i = 1 > array_tmp5[1] := array_const_0D0[1] + array_tmp4[1]; > #emit pre sin 1 $eq_no = 1 > array_tmp6[1] := sin(array_x[1]); > array_tmp6_g[1] := cos(array_x[1]); > #emit pre mult CONST FULL $eq_no = 1 i = 1 > array_tmp7[1] := array_const_2D0[1] * array_tmp6[1]; > #emit pre mult CONST - LINEAR $eq_no = 1 i = 1 > array_tmp8[1] := array_const_2D0[1] * array_x[1]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 1 > array_tmp9[1] := array_tmp8[1] + array_const_1D0[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 1 > array_tmp10[1] := array_tmp7[1] / array_tmp9[1]; > #emit pre mult CONST - LINEAR $eq_no = 1 i = 1 > array_tmp11[1] := array_const_2D0[1] * array_x[1]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 1 > array_tmp12[1] := array_tmp11[1] + array_const_1D0[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 1 > array_tmp13[1] := array_tmp10[1] / array_tmp12[1]; > #emit pre sub FULL FULL $eq_no = 1 i = 1 > array_tmp14[1] := array_tmp5[1] - array_tmp13[1]; > #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5 > if ( not array_y_set_initial[1,2]) then # if number 1 > if (1 <= glob_max_terms) then # if number 2 > temporary := array_tmp14[1] * expt(glob_h , (1)) * factorial_3(0,1); > array_y[2] := temporary; > array_y_higher[1,2] := temporary; > temporary := temporary / glob_h * (1.0); > array_y_higher[2,1] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 2; > #END ATOMHDR1 > #BEGIN ATOMHDR2 > #emit pre cos ID_LINEAR iii = 2 $eq_no = 1 > array_tmp1[2] := -array_tmp1_g[1] * array_x[2] / 1; > array_tmp1_g[2] := array_tmp1[1] * array_x[2] / 1; > #emit pre mult CONST - LINEAR $eq_no = 1 i = 2 > array_tmp2[2] := array_const_2D0[1] * array_x[2]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 2 > array_tmp3[2] := array_tmp2[2]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 2 > array_tmp4[2] := (array_tmp1[2] - array_tmp4[1] * array_tmp3[2]) / array_tmp3[1]; > #emit pre add CONST FULL $eq_no = 1 i = 2 > array_tmp5[2] := array_tmp4[2]; > #emit pre sin ID_LINEAR iii = 2 $eq_no = 1 > array_tmp6[2] := array_tmp6_g[1] * array_x[2] / 1; > array_tmp6_g[2] := -array_tmp6[1] * array_x[2] / 1; > #emit pre mult CONST FULL $eq_no = 1 i = 2 > array_tmp7[2] := array_const_2D0[1] * array_tmp6[2]; > #emit pre mult CONST - LINEAR $eq_no = 1 i = 2 > array_tmp8[2] := array_const_2D0[1] * array_x[2]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 2 > array_tmp9[2] := array_tmp8[2]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 2 > array_tmp10[2] := (array_tmp7[2] - array_tmp10[1] * array_tmp9[2]) / array_tmp9[1]; > #emit pre mult CONST - LINEAR $eq_no = 1 i = 2 > array_tmp11[2] := array_const_2D0[1] * array_x[2]; > #emit pre add LINEAR - CONST $eq_no = 1 i = 2 > array_tmp12[2] := array_tmp11[2]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 2 > array_tmp13[2] := (array_tmp10[2] - array_tmp13[1] * array_tmp12[2]) / array_tmp12[1]; > #emit pre sub FULL FULL $eq_no = 1 i = 2 > array_tmp14[2] := array_tmp5[2] - array_tmp13[2]; > #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5 > if ( not array_y_set_initial[1,3]) then # if number 1 > if (2 <= glob_max_terms) then # if number 2 > temporary := array_tmp14[2] * expt(glob_h , (1)) * factorial_3(1,2); > array_y[3] := temporary; > array_y_higher[1,3] := temporary; > temporary := temporary / glob_h * (2.0); > array_y_higher[2,2] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 3; > #END ATOMHDR2 > #BEGIN ATOMHDR3 > #emit pre cos ID_LINEAR iii = 3 $eq_no = 1 > array_tmp1[3] := -array_tmp1_g[2] * array_x[2] / 2; > array_tmp1_g[3] := array_tmp1[2] * array_x[2] / 2; > #emit pre div FULL - LINEAR $eq_no = 1 i = 3 > array_tmp4[3] := (array_tmp1[3] - array_tmp4[2] * array_tmp3[2]) / array_tmp3[1]; > #emit pre add CONST FULL $eq_no = 1 i = 3 > array_tmp5[3] := array_tmp4[3]; > #emit pre sin ID_LINEAR iii = 3 $eq_no = 1 > array_tmp6[3] := array_tmp6_g[2] * array_x[2] / 2; > array_tmp6_g[3] := -array_tmp6[2] * array_x[2] / 2; > #emit pre mult CONST FULL $eq_no = 1 i = 3 > array_tmp7[3] := array_const_2D0[1] * array_tmp6[3]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 3 > array_tmp10[3] := (array_tmp7[3] - array_tmp10[2] * array_tmp9[2]) / array_tmp9[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 3 > array_tmp13[3] := (array_tmp10[3] - array_tmp13[2] * array_tmp12[2]) / array_tmp12[1]; > #emit pre sub FULL FULL $eq_no = 1 i = 3 > array_tmp14[3] := array_tmp5[3] - array_tmp13[3]; > #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5 > if ( not array_y_set_initial[1,4]) then # if number 1 > if (3 <= glob_max_terms) then # if number 2 > temporary := array_tmp14[3] * expt(glob_h , (1)) * factorial_3(2,3); > array_y[4] := temporary; > array_y_higher[1,4] := temporary; > temporary := temporary / glob_h * (3.0); > array_y_higher[2,3] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 4; > #END ATOMHDR3 > #BEGIN ATOMHDR4 > #emit pre cos ID_LINEAR iii = 4 $eq_no = 1 > array_tmp1[4] := -array_tmp1_g[3] * array_x[2] / 3; > array_tmp1_g[4] := array_tmp1[3] * array_x[2] / 3; > #emit pre div FULL - LINEAR $eq_no = 1 i = 4 > array_tmp4[4] := (array_tmp1[4] - array_tmp4[3] * array_tmp3[2]) / array_tmp3[1]; > #emit pre add CONST FULL $eq_no = 1 i = 4 > array_tmp5[4] := array_tmp4[4]; > #emit pre sin ID_LINEAR iii = 4 $eq_no = 1 > array_tmp6[4] := array_tmp6_g[3] * array_x[2] / 3; > array_tmp6_g[4] := -array_tmp6[3] * array_x[2] / 3; > #emit pre mult CONST FULL $eq_no = 1 i = 4 > array_tmp7[4] := array_const_2D0[1] * array_tmp6[4]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 4 > array_tmp10[4] := (array_tmp7[4] - array_tmp10[3] * array_tmp9[2]) / array_tmp9[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 4 > array_tmp13[4] := (array_tmp10[4] - array_tmp13[3] * array_tmp12[2]) / array_tmp12[1]; > #emit pre sub FULL FULL $eq_no = 1 i = 4 > array_tmp14[4] := array_tmp5[4] - array_tmp13[4]; > #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5 > if ( not array_y_set_initial[1,5]) then # if number 1 > if (4 <= glob_max_terms) then # if number 2 > temporary := array_tmp14[4] * expt(glob_h , (1)) * factorial_3(3,4); > array_y[5] := temporary; > array_y_higher[1,5] := temporary; > temporary := temporary / glob_h * (4.0); > array_y_higher[2,4] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 5; > #END ATOMHDR4 > #BEGIN ATOMHDR5 > #emit pre cos ID_LINEAR iii = 5 $eq_no = 1 > array_tmp1[5] := -array_tmp1_g[4] * array_x[2] / 4; > array_tmp1_g[5] := array_tmp1[4] * array_x[2] / 4; > #emit pre div FULL - LINEAR $eq_no = 1 i = 5 > array_tmp4[5] := (array_tmp1[5] - array_tmp4[4] * array_tmp3[2]) / array_tmp3[1]; > #emit pre add CONST FULL $eq_no = 1 i = 5 > array_tmp5[5] := array_tmp4[5]; > #emit pre sin ID_LINEAR iii = 5 $eq_no = 1 > array_tmp6[5] := array_tmp6_g[4] * array_x[2] / 4; > array_tmp6_g[5] := -array_tmp6[4] * array_x[2] / 4; > #emit pre mult CONST FULL $eq_no = 1 i = 5 > array_tmp7[5] := array_const_2D0[1] * array_tmp6[5]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 5 > array_tmp10[5] := (array_tmp7[5] - array_tmp10[4] * array_tmp9[2]) / array_tmp9[1]; > #emit pre div FULL - LINEAR $eq_no = 1 i = 5 > array_tmp13[5] := (array_tmp10[5] - array_tmp13[4] * array_tmp12[2]) / array_tmp12[1]; > #emit pre sub FULL FULL $eq_no = 1 i = 5 > array_tmp14[5] := array_tmp5[5] - array_tmp13[5]; > #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5 > if ( not array_y_set_initial[1,6]) then # if number 1 > if (5 <= glob_max_terms) then # if number 2 > temporary := array_tmp14[5] * expt(glob_h , (1)) * factorial_3(4,5); > array_y[6] := temporary; > array_y_higher[1,6] := temporary; > temporary := temporary / glob_h * (5.0); > array_y_higher[2,5] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 6; > #END ATOMHDR5 > #BEGIN OUTFILE3 > #Top Atomall While Loop-- outfile3 > while (kkk <= glob_max_terms) do # do number 1 > #END OUTFILE3 > #BEGIN OUTFILE4 > #emit cos LINEAR $eq_no = 1 > array_tmp1[kkk] := -array_tmp1_g[kkk - 1] * array_x[2] / (kkk - 1); > array_tmp1_g[kkk] := array_tmp1[kkk - 1] * array_x[2] / (kkk - 1); > #emit div FULL LINEAR $eq_no = 1 i = 1 > array_tmp4[kkk] := -ats(kkk,array_tmp3,array_tmp4,2) / array_tmp3[1]; > #emit NOT FULL - FULL add $eq_no = 1 > array_tmp5[kkk] := array_tmp4[kkk]; > #emit sin LINEAR $eq_no = 1 > array_tmp6[kkk] := array_tmp6_g[kkk - 1] * array_x[2] / (kkk - 1); > array_tmp6_g[kkk] := -array_tmp6[kkk - 1] * array_x[2] / (kkk - 1); > #emit mult CONST FULL $eq_no = 1 i = 1 > array_tmp7[kkk] := array_const_2D0[1] * array_tmp6[kkk]; > #emit div FULL LINEAR $eq_no = 1 i = 1 > array_tmp10[kkk] := -ats(kkk,array_tmp9,array_tmp10,2) / array_tmp9[1]; > #emit div FULL LINEAR $eq_no = 1 i = 1 > array_tmp13[kkk] := -ats(kkk,array_tmp12,array_tmp13,2) / array_tmp12[1]; > #emit FULL - FULL sub $eq_no = 1 > array_tmp14[kkk] := array_tmp5[kkk] - array_tmp13[kkk]; > #emit assign $eq_no = 1 > order_d := 1; > if (kkk + order_d < glob_max_terms) then # if number 1 > if ( not array_y_set_initial[1,kkk + order_d]) then # if number 2 > temporary := array_tmp14[kkk] * expt(glob_h , (order_d)) * factorial_3((kkk - 1),(kkk + order_d - 1)); > array_y[kkk + order_d] := temporary; > array_y_higher[1,kkk + order_d] := temporary; > term := kkk + order_d - 1; > adj2 := kkk + order_d - 1; > adj3 := 2; > while (term >= 1) do # do number 1 > if (adj3 <= order_d + 1) then # if number 3 > if (adj2 > 0) then # if number 4 > temporary := temporary / glob_h * convfp(adj2); > else > temporary := temporary; > fi;# end if 4; > array_y_higher[adj3,term] := 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 glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; array_tmp1[1] := cos(array_x[1]); array_tmp1_g[1] := sin(array_x[1]); array_tmp2[1] := array_const_2D0[1]*array_x[1]; array_tmp3[1] := array_tmp2[1] + array_const_1D0[1]; array_tmp4[1] := array_tmp1[1]/array_tmp3[1]; array_tmp5[1] := array_const_0D0[1] + array_tmp4[1]; array_tmp6[1] := sin(array_x[1]); array_tmp6_g[1] := cos(array_x[1]); array_tmp7[1] := array_const_2D0[1]*array_tmp6[1]; array_tmp8[1] := array_const_2D0[1]*array_x[1]; array_tmp9[1] := array_tmp8[1] + array_const_1D0[1]; array_tmp10[1] := array_tmp7[1]/array_tmp9[1]; array_tmp11[1] := array_const_2D0[1]*array_x[1]; array_tmp12[1] := array_tmp11[1] + array_const_1D0[1]; array_tmp13[1] := array_tmp10[1]/array_tmp12[1]; array_tmp14[1] := array_tmp5[1] - array_tmp13[1]; if not array_y_set_initial[1, 2] then if 1 <= glob_max_terms then temporary := array_tmp14[1]*expt(glob_h, 1)*factorial_3(0, 1); array_y[2] := temporary; array_y_higher[1, 2] := temporary; temporary := temporary*1.0/glob_h; array_y_higher[2, 1] := temporary end if end if; kkk := 2; array_tmp1[2] := -array_tmp1_g[1]*array_x[2]; array_tmp1_g[2] := array_tmp1[1]*array_x[2]; array_tmp2[2] := array_const_2D0[1]*array_x[2]; array_tmp3[2] := array_tmp2[2]; array_tmp4[2] := (array_tmp1[2] - array_tmp4[1]*array_tmp3[2])/array_tmp3[1]; array_tmp5[2] := array_tmp4[2]; array_tmp6[2] := array_tmp6_g[1]*array_x[2]; array_tmp6_g[2] := -array_tmp6[1]*array_x[2]; array_tmp7[2] := array_const_2D0[1]*array_tmp6[2]; array_tmp8[2] := array_const_2D0[1]*array_x[2]; array_tmp9[2] := array_tmp8[2]; array_tmp10[2] := (array_tmp7[2] - array_tmp10[1]*array_tmp9[2])/array_tmp9[1]; array_tmp11[2] := array_const_2D0[1]*array_x[2]; array_tmp12[2] := array_tmp11[2]; array_tmp13[2] := (array_tmp10[2] - array_tmp13[1]*array_tmp12[2])/array_tmp12[1]; array_tmp14[2] := array_tmp5[2] - array_tmp13[2]; if not array_y_set_initial[1, 3] then if 2 <= glob_max_terms then temporary := array_tmp14[2]*expt(glob_h, 1)*factorial_3(1, 2); array_y[3] := temporary; array_y_higher[1, 3] := temporary; temporary := temporary*2.0/glob_h; array_y_higher[2, 2] := temporary end if end if; kkk := 3; array_tmp1[3] := -1/2*array_tmp1_g[2]*array_x[2]; array_tmp1_g[3] := 1/2*array_tmp1[2]*array_x[2]; array_tmp4[3] := (array_tmp1[3] - array_tmp4[2]*array_tmp3[2])/array_tmp3[1]; array_tmp5[3] := array_tmp4[3]; array_tmp6[3] := 1/2*array_tmp6_g[2]*array_x[2]; array_tmp6_g[3] := -1/2*array_tmp6[2]*array_x[2]; array_tmp7[3] := array_const_2D0[1]*array_tmp6[3]; array_tmp10[3] := (array_tmp7[3] - array_tmp10[2]*array_tmp9[2])/array_tmp9[1]; array_tmp13[3] := (array_tmp10[3] - array_tmp13[2]*array_tmp12[2])/array_tmp12[1]; array_tmp14[3] := array_tmp5[3] - array_tmp13[3]; if not array_y_set_initial[1, 4] then if 3 <= glob_max_terms then temporary := array_tmp14[3]*expt(glob_h, 1)*factorial_3(2, 3); array_y[4] := temporary; array_y_higher[1, 4] := temporary; temporary := temporary*3.0/glob_h; array_y_higher[2, 3] := temporary end if end if; kkk := 4; array_tmp1[4] := -1/3*array_tmp1_g[3]*array_x[2]; array_tmp1_g[4] := 1/3*array_tmp1[3]*array_x[2]; array_tmp4[4] := (array_tmp1[4] - array_tmp4[3]*array_tmp3[2])/array_tmp3[1]; array_tmp5[4] := array_tmp4[4]; array_tmp6[4] := 1/3*array_tmp6_g[3]*array_x[2]; array_tmp6_g[4] := -1/3*array_tmp6[3]*array_x[2]; array_tmp7[4] := array_const_2D0[1]*array_tmp6[4]; array_tmp10[4] := (array_tmp7[4] - array_tmp10[3]*array_tmp9[2])/array_tmp9[1]; array_tmp13[4] := (array_tmp10[4] - array_tmp13[3]*array_tmp12[2])/array_tmp12[1]; array_tmp14[4] := array_tmp5[4] - array_tmp13[4]; if not array_y_set_initial[1, 5] then if 4 <= glob_max_terms then temporary := array_tmp14[4]*expt(glob_h, 1)*factorial_3(3, 4); array_y[5] := temporary; array_y_higher[1, 5] := temporary; temporary := temporary*4.0/glob_h; array_y_higher[2, 4] := temporary end if end if; kkk := 5; array_tmp1[5] := -1/4*array_tmp1_g[4]*array_x[2]; array_tmp1_g[5] := 1/4*array_tmp1[4]*array_x[2]; array_tmp4[5] := (array_tmp1[5] - array_tmp4[4]*array_tmp3[2])/array_tmp3[1]; array_tmp5[5] := array_tmp4[5]; array_tmp6[5] := 1/4*array_tmp6_g[4]*array_x[2]; array_tmp6_g[5] := -1/4*array_tmp6[4]*array_x[2]; array_tmp7[5] := array_const_2D0[1]*array_tmp6[5]; array_tmp10[5] := (array_tmp7[5] - array_tmp10[4]*array_tmp9[2])/array_tmp9[1]; array_tmp13[5] := (array_tmp10[5] - array_tmp13[4]*array_tmp12[2])/array_tmp12[1]; array_tmp14[5] := array_tmp5[5] - array_tmp13[5]; if not array_y_set_initial[1, 6] then if 5 <= glob_max_terms then temporary := array_tmp14[5]*expt(glob_h, 1)*factorial_3(4, 5); array_y[6] := temporary; array_y_higher[1, 6] := temporary; temporary := temporary*5.0/glob_h; array_y_higher[2, 5] := temporary end if end if; kkk := 6; while kkk <= glob_max_terms do array_tmp1[kkk] := -array_tmp1_g[kkk - 1]*array_x[2]/(kkk - 1); array_tmp1_g[kkk] := array_tmp1[kkk - 1]*array_x[2]/(kkk - 1); array_tmp4[kkk] := -ats(kkk, array_tmp3, array_tmp4, 2)/array_tmp3[1]; array_tmp5[kkk] := array_tmp4[kkk]; array_tmp6[kkk] := array_tmp6_g[kkk - 1]*array_x[2]/(kkk - 1); array_tmp6_g[kkk] := -array_tmp6[kkk - 1]*array_x[2]/(kkk - 1); array_tmp7[kkk] := array_const_2D0[1]*array_tmp6[kkk]; array_tmp10[kkk] := -ats(kkk, array_tmp9, array_tmp10, 2)/array_tmp9[1]; array_tmp13[kkk] := -ats(kkk, array_tmp12, array_tmp13, 2)/array_tmp12[1]; array_tmp14[kkk] := array_tmp5[kkk] - array_tmp13[kkk]; order_d := 1; if kkk + order_d < glob_max_terms then if not array_y_set_initial[1, kkk + order_d] then temporary := array_tmp14[kkk]*expt(glob_h, order_d)* factorial_3(kkk - 1, kkk + order_d - 1); array_y[kkk + order_d] := temporary; array_y_higher[1, kkk + order_d] := temporary; term := kkk + order_d - 1; adj2 := kkk + order_d - 1; adj3 := 2; while 1 <= term do if adj3 <= order_d + 1 then if 0 < adj2 then temporary := temporary*convfp(adj2)/glob_h else temporary := temporary end if; array_y_higher[adj3, term] := 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 13 > #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 ", 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 ", prelabel, value, postlabel) else printf("%-30s = %-42.32g %s ", 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 ", prelabel, value, postlabel) else printf("%-30s = %-32d %s ", 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 > dump_series := proc(iolevel,dump_label,series_name,arr_series,numb) > global glob_iolevel; > local i; > if (glob_iolevel >= iolevel) then # if number 0 > i := 1; > while (i <= numb) do # do number 1 > print(dump_label,series_name > ,i,arr_series[i]); > i := i + 1; > od;# end do number 1 > fi;# end if 0 > end; dump_series := proc(iolevel, dump_label, series_name, arr_series, numb) local i; global glob_iolevel; if iolevel <= glob_iolevel then i := 1; while i <= numb do print(dump_label, series_name, i, arr_series[i]); i := i + 1 end do end if end proc > # End Function number 8 > # Begin Function number 9 > dump_series_2 := proc(iolevel,dump_label,series_name2,arr_series2,numb,subnum,arr_x) > global glob_iolevel; > local i,sub,ts_term; > if (glob_iolevel >= iolevel) then # if number 0 > sub := 1; > while (sub <= subnum) do # do number 1 > i := 1; > while (i <= numb) do # do number 2 > print(dump_label,series_name2,sub,i,arr_series2[sub,i]); > od;# end do number 2; > sub := sub + 1; > od;# end do number 1; > fi;# end if 0; > end; dump_series_2 := proc( iolevel, dump_label, series_name2, arr_series2, numb, subnum, arr_x) local i, sub, ts_term; global glob_iolevel; if iolevel <= glob_iolevel then sub := 1; while sub <= subnum do i := 1; while i <= numb do print(dump_label, series_name2, sub, i, arr_series2[sub, i]) end do; sub := sub + 1 end do end if end proc > # End Function number 9 > # Begin Function number 10 > cs_info := proc(iolevel,str) > global glob_iolevel,glob_correct_start_flag,glob_h,glob_reached_optimal_h; > if (glob_iolevel >= iolevel) then # if number 0 > print("cs_info " , str , " glob_correct_start_flag = " , glob_correct_start_flag , "glob_h := " , glob_h , "glob_reached_optimal_h := " , glob_reached_optimal_h) > fi;# end if 0; > end; cs_info := proc(iolevel, str) global glob_iolevel, glob_correct_start_flag, glob_h, glob_reached_optimal_h; if iolevel <= glob_iolevel then print("cs_info ", str, " glob_correct_start_flag = ", glob_correct_start_flag, "glob_h := ", glob_h, "glob_reached_optimal_h := ", glob_reached_optimal_h) end if end proc > # End Function number 10 > # Begin Function number 11 > 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 := trunc(secs_in / glob_sec_in_year); > sec_temp := (trunc(secs_in) mod trunc(glob_sec_in_year)); > days_int := trunc(sec_temp / glob_sec_in_day) ; > sec_temp := (sec_temp mod trunc(glob_sec_in_day)) ; > hours_int := trunc(sec_temp / glob_sec_in_hour); > sec_temp := (sec_temp mod trunc(glob_sec_in_hour)); > minutes_int := trunc(sec_temp / glob_sec_in_minute); > sec_int := (sec_temp mod 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," Unknown"); > 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 := trunc(secs_in/glob_sec_in_year); sec_temp := trunc(secs_in) mod trunc(glob_sec_in_year); days_int := trunc(sec_temp/glob_sec_in_day); sec_temp := sec_temp mod trunc(glob_sec_in_day); hours_int := trunc(sec_temp/glob_sec_in_hour); sec_temp := sec_temp mod trunc(glob_sec_in_hour); minutes_int := trunc(sec_temp/glob_sec_in_minute); sec_int := sec_temp mod 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, " Unknown") end if; fprintf(fd, " ") end proc > # End Function number 11 > # Begin Function number 12 > 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 := trunc(secs_in / glob_sec_in_year); > sec_temp := (trunc(secs_in) mod trunc(glob_sec_in_year)); > days_int := trunc(sec_temp / glob_sec_in_day) ; > sec_temp := (sec_temp mod trunc(glob_sec_in_day)) ; > hours_int := trunc(sec_temp / glob_sec_in_hour); > sec_temp := (sec_temp mod trunc(glob_sec_in_hour)); > minutes_int := trunc(sec_temp / glob_sec_in_minute); > sec_int := (sec_temp mod 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(" Unknown\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 := trunc(secs_in/glob_sec_in_year); sec_temp := trunc(secs_in) mod trunc(glob_sec_in_year); days_int := trunc(sec_temp/glob_sec_in_day); sec_temp := sec_temp mod trunc(glob_sec_in_day); hours_int := trunc(sec_temp/glob_sec_in_hour); sec_temp := sec_temp mod trunc(glob_sec_in_hour); minutes_int := trunc(sec_temp/glob_sec_in_minute); sec_int := sec_temp mod trunc(glob_sec_in_minute); if 0 < years_int then printf(" = %d Years %d Days %d Hours %d Mi\ nutes %d Seconds ", years_int, days_int, hours_int, minutes_int, sec_int) elif 0 < days_int then printf(" = %d Days %d Hours %d Minutes %d\ Seconds ", days_int, hours_int, minutes_int, sec_int) elif 0 < hours_int then printf(" = %d Hours %d Minutes %d Second\ s ", hours_int, minutes_int, sec_int) elif 0 < minutes_int then printf(" = %d Minutes %d Seconds ", minutes_int, sec_int) else printf(" = %d Seconds ", sec_int) end if else printf(" Unknown ") end if end proc > # End Function number 12 > # Begin Function number 13 > ats := proc(mmm_ats,arr_a,arr_b,jjj_ats) > local iii_ats, lll_ats,ma_ats, ret_ats; > ret_ats := 0.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; > ret_ats := ret_ats + arr_a[iii_ats]*arr_b[lll_ats]; > 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; ret_ats := 0.; if jjj_ats <= mmm_ats then ma_ats := mmm_ats + 1; iii_ats := jjj_ats; while iii_ats <= mmm_ats do lll_ats := ma_ats - iii_ats; ret_ats := ret_ats + arr_a[iii_ats]*arr_b[lll_ats]; iii_ats := iii_ats + 1 end do end if; ret_ats end proc > # End Function number 13 > # Begin Function number 14 > att := proc(mmm_att,arr_aa,arr_bb,jjj_att) > global glob_max_terms; > local al_att, iii_att,lll_att, ma_att, ret_att; > ret_att := 0.0; > if (jjj_att <= mmm_att) then # if number 6 > ma_att := mmm_att + 2; > iii_att := jjj_att; > while (iii_att <= mmm_att) do # do number 1 > lll_att := ma_att - iii_att; > al_att := (lll_att - 1); > if (lll_att <= glob_max_terms) then # if number 7 > ret_att := ret_att + arr_aa[iii_att]*arr_bb[lll_att]* convfp(al_att); > fi;# end if 7; > iii_att := iii_att + 1; > od;# end do number 1; > ret_att := ret_att / convfp(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 glob_max_terms; ret_att := 0.; if jjj_att <= mmm_att then ma_att := mmm_att + 2; iii_att := jjj_att; while iii_att <= mmm_att do lll_att := ma_att - iii_att; al_att := lll_att - 1; if lll_att <= glob_max_terms then ret_att := ret_att + arr_aa[iii_att]*arr_bb[lll_att]*convfp(al_att) end if; iii_att := iii_att + 1 end do; ret_att := ret_att/convfp(mmm_att) end if; ret_att end proc > # End Function number 14 > # Begin Function number 15 > display_pole_debug := proc(typ,m,radius,order2) > global ALWAYS,glob_display_flag, glob_large_float, array_pole; > if (typ = 1) then # if number 6 > omniout_str(ALWAYS,"Real"); > else > omniout_str(ALWAYS,"Complex"); > fi;# end if 6; > omniout_int(ALWAYS,"m",4, m ,4," "); > omniout_float(ALWAYS,"DBG Radius of convergence ",4, radius,4," "); > omniout_float(ALWAYS,"DBG Order of pole ",4, order2,4," "); > end; display_pole_debug := proc(typ, m, radius, order2) global ALWAYS, glob_display_flag, glob_large_float, array_pole; if typ = 1 then omniout_str(ALWAYS, "Real") else omniout_str(ALWAYS, "Complex") end if; omniout_int(ALWAYS, "m", 4, m, 4, " "); omniout_float(ALWAYS, "DBG Radius of convergence ", 4, radius, 4, " "); omniout_float(ALWAYS, "DBG Order of pole ", 4, order2, 4, " ") end proc > # End Function number 15 > # Begin Function number 16 > 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 16 > # Begin Function number 17 > 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 17 > # Begin Function number 18 > 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 18 > # Begin Function number 19 > logitem_good_digits := proc(file,rel_error) > global glob_small_float; > local good_digits; > fprintf(file,""); > if (rel_error <> -1.0) then # if number 6 > if (rel_error > + 0.0000000000000000000000000000000001) then # if number 7 > good_digits := 1-trunc(log10(rel_error)); > fprintf(file,"%d",good_digits); > else > good_digits := Digits; > fprintf(file,"%d",good_digits); > fi;# end if 7; > else > fprintf(file,"Unknown"); > fi;# end if 6; > fprintf(file,""); > end; logitem_good_digits := proc(file, rel_error) local good_digits; global glob_small_float; fprintf(file, ""); if rel_error <> -1.0 then if 0.1*10^(-33) < rel_error then good_digits := 1 - trunc(log10(rel_error)); fprintf(file, "%d", good_digits) else good_digits := Digits; fprintf(file, "%d", good_digits) end if else fprintf(file, "Unknown") end if; fprintf(file, "") end proc > # End Function number 19 > # Begin Function number 20 > log_revs := proc(file,revs) > fprintf(file,revs); > end; log_revs := proc(file, revs) fprintf(file, revs) end proc > # End Function number 20 > # Begin Function number 21 > 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 21 > # Begin Function number 22 > logitem_pole := proc(file,pole) > fprintf(file,""); > if (pole = 0) then # if number 6 > fprintf(file,"NA"); > elif > (pole = 1) then # if number 7 > fprintf(file,"Real"); > elif > (pole = 2) then # if number 8 > fprintf(file,"Complex"); > elif > (pole = 4) then # if number 9 > fprintf(file,"Yes"); > else > fprintf(file,"No"); > fi;# end if 9 > fprintf(file,""); > end; logitem_pole := proc(file, pole) fprintf(file, ""); if pole = 0 then fprintf(file, "NA") elif pole = 1 then fprintf(file, "Real") elif pole = 2 then fprintf(file, "Complex") elif pole = 4 then fprintf(file, "Yes") else fprintf(file, "No") end if; fprintf(file, "") end proc > # End Function number 22 > # Begin Function number 23 > logstart := proc(file) > fprintf(file,""); > end; logstart := proc(file) fprintf(file, "") end proc > # End Function number 23 > # Begin Function number 24 > logend := proc(file) > fprintf(file,"\n"); > end; logend := proc(file) fprintf(file, " ") end proc > # End Function number 24 > # Begin Function number 25 > chk_data := proc() > global glob_max_iter,ALWAYS, glob_max_terms; > local errflag; > errflag := false; > if ((glob_max_terms < 15) or (glob_max_terms > 512)) then # if number 9 > omniout_str(ALWAYS,"Illegal max_terms = -- Using 30"); > glob_max_terms := 30; > fi;# end if 9; > if (glob_max_iter < 2) then # if number 9 > omniout_str(ALWAYS,"Illegal max_iter"); > errflag := true; > fi;# end if 9; > if (errflag) then # if number 9 > quit; > fi;# end if 9 > end; chk_data := proc() local errflag; global glob_max_iter, ALWAYS, glob_max_terms; errflag := false; if glob_max_terms < 15 or 512 < glob_max_terms then omniout_str(ALWAYS, "Illegal max_terms = -- Using 30"); glob_max_terms := 30 end if; if glob_max_iter < 2 then omniout_str(ALWAYS, "Illegal max_iter"); errflag := true end if; if errflag then quit end if end proc > # End Function number 25 > # Begin Function number 26 > comp_expect_sec := proc(t_end2,t_start2,t2,clock_sec2) > global glob_small_float; > local ms2, rrr, sec_left, sub1, sub2; > ; > ms2 := clock_sec2; > sub1 := (t_end2-t_start2); > sub2 := (t2-t_start2); > if (sub1 = 0.0) then # if number 9 > sec_left := 0.0; > else > if (sub2 > 0.0) then # if number 10 > rrr := (sub1/sub2); > sec_left := rrr * ms2 - ms2; > else > sec_left := 0.0; > fi;# end if 10 > fi;# end if 9; > 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 := clock_sec2; sub1 := t_end2 - t_start2; sub2 := t2 - t_start2; if sub1 = 0. then sec_left := 0. else if 0. < sub2 then rrr := sub1/sub2; sec_left := rrr*ms2 - ms2 else sec_left := 0. end if end if; sec_left end proc > # End Function number 26 > # Begin Function number 27 > 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 9 > rrr := (100.0*sub2)/sub1; > else > rrr := 0.0; > fi;# end if 9; > 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 := 100.0*sub2/sub1 else rrr := 0. end if; rrr end proc > # End Function number 27 > # Begin Function number 28 > factorial_2 := proc(nnn) > nnn!; > end; factorial_2 := proc(nnn) nnn! end proc > # End Function number 28 > # Begin Function number 29 > factorial_1 := proc(nnn) > global glob_max_terms,array_fact_1; > local ret; > if (nnn <= glob_max_terms) then # if number 9 > if (array_fact_1[nnn] = 0) then # if number 10 > ret := factorial_2(nnn); > array_fact_1[nnn] := ret; > else > ret := array_fact_1[nnn]; > fi;# end if 10; > else > ret := factorial_2(nnn); > fi;# end if 9; > ret; > end; factorial_1 := proc(nnn) local ret; global glob_max_terms, array_fact_1; if nnn <= glob_max_terms then if array_fact_1[nnn] = 0 then ret := factorial_2(nnn); array_fact_1[nnn] := ret else ret := array_fact_1[nnn] end if else ret := factorial_2(nnn) end if; ret end proc > # End Function number 29 > # Begin Function number 30 > factorial_3 := proc(mmm,nnn) > global glob_max_terms,array_fact_2; > local ret; > if ((nnn <= glob_max_terms) and (mmm <= glob_max_terms)) then # if number 9 > if (array_fact_2[mmm,nnn] = 0) then # if number 10 > ret := factorial_1(mmm)/factorial_1(nnn); > array_fact_2[mmm,nnn] := ret; > else > ret := array_fact_2[mmm,nnn]; > fi;# end if 10; > else > ret := factorial_2(mmm)/factorial_2(nnn); > fi;# end if 9; > ret; > end; factorial_3 := proc(mmm, nnn) local ret; global glob_max_terms, array_fact_2; if nnn <= glob_max_terms and mmm <= glob_max_terms then if array_fact_2[mmm, nnn] = 0 then ret := factorial_1(mmm)/factorial_1(nnn); array_fact_2[mmm, nnn] := ret else ret := array_fact_2[mmm, nnn] end if else ret := factorial_2(mmm)/factorial_2(nnn) end if; ret end proc > # End Function number 30 > # Begin Function number 31 > convfp := proc(mmm) > (mmm); > end; convfp := proc(mmm) mmm end proc > # End Function number 31 > # Begin Function number 32 > convfloat := proc(mmm) > (mmm); > end; convfloat := proc(mmm) mmm end proc > # End Function number 32 > # Begin Function number 33 > elapsed_time_seconds := proc() > time(); > end; elapsed_time_seconds := proc() time() end proc > # End Function number 33 > # Begin Function number 34 > omniabs := proc(x) > abs(x); > end; omniabs := proc(x) abs(x) end proc > # End Function number 34 > # Begin Function number 35 > expt := proc(x,y) > (x^y); > end; expt := proc(x, y) x^y end proc > # End Function number 35 > # Begin Function number 36 > 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; > omniout_float(ALWAYS,"glob_desired_digits_correct",32,glob_desired_digits_correct,32,""); > desired_abs_gbl_error := expt(10.0, -glob_desired_digits_correct) * omniabs(estimated_answer); > 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 := omniabs(desired_abs_gbl_error / estimated_steps); > 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; omniout_float(ALWAYS, "glob_desired_digits_correct", 32, glob_desired_digits_correct, 32, ""); desired_abs_gbl_error := expt(10.0, -glob_desired_digits_correct)*omniabs(estimated_answer); 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 := omniabs(desired_abs_gbl_error/estimated_steps); omniout_float(ALWAYS, "step_error", 32, step_error, 32, ""); step_error end proc > # End Function number 36 > #END ATS LIBRARY BLOCK > #BEGIN USER DEF BLOCK > #BEGIN USER DEF BLOCK > exact_soln_y := proc(x) > return(sin(x)/(2*x+1)); > end; exact_soln_y := proc(x) return sin(x)/(2*x + 1) end proc > #END USER DEF BLOCK > #END USER DEF BLOCK > #END OUTFILE5 > # Begin Function number 2 > main := proc() > #BEGIN OUTFIEMAIN > local d1,d2,d3,d4,est_err_2,niii,done_once, > term,ord,order_diff,term_no,html_log_file,iiif,jjjf, > rows,r_order,sub_iter,calc_term,iii,temp_sum,current_iter, > x_start,x_end > ,it, max_terms, opt_iter, tmp,subiter, est_needed_step_err,estimated_step_error,min_value,est_answer,best_h,found_h,repeat_it; > global > glob_max_terms, > glob_iolevel, > glob_yes_pole, > glob_no_pole, > glob_not_given, > ALWAYS, > INFO, > DEBUGL, > DEBUGMASSIVE, > #Top Generate Globals Decl > MAX_UNCHANGED, > glob_check_sign, > glob_desired_digits_correct, > glob_max_estimated_step_error, > glob_ratio_of_radius, > glob_percent_done, > glob_subiter_method, > glob_total_exp_sec, > glob_optimal_expect_sec, > glob_html_log, > glob_good_digits, > glob_max_opt_iter, > glob_dump, > glob_djd_debug, > glob_display_flag, > glob_djd_debug2, > 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_almost_1, > glob_clock_sec, > glob_clock_start_sec, > glob_not_yet_finished, > glob_initial_pass, > glob_not_yet_start_msg, > glob_reached_optimal_h, > glob_optimal_done, > glob_disp_incr, > glob_h, > glob_max_h, > glob_min_h, > glob_type_given_pole, > glob_large_float, > glob_last_good_h, > glob_look_poles, > glob_neg_h, > glob_display_interval, > glob_next_display, > glob_dump_analytic, > glob_abserr, > glob_relerr, > glob_max_hours, > glob_max_iter, > glob_max_rel_trunc_err, > glob_max_trunc_err, > glob_no_eqs, > glob_optimal_clock_start_sec, > glob_optimal_start, > glob_small_float, > glob_smallish_float, > glob_unchanged_h_cnt, > glob_warned, > glob_warned2, > glob_max_sec, > glob_orig_start_sec, > glob_start, > glob_curr_iter_when_opt, > glob_current_iter, > glob_iter, > glob_normmax, > glob_max_minutes, > #Bottom Generate Globals Decl > #BEGIN CONST > array_const_1, > array_const_0D0, > array_const_2D0, > array_const_1D0, > #END CONST > array_y_init, > array_norms, > array_fact_1, > array_pole, > array_real_pole, > array_complex_pole, > array_1st_rel_error, > array_last_rel_error, > array_type_pole, > array_type_real_pole, > array_type_complex_pole, > array_y, > array_x, > array_tmp0, > array_tmp1_g, > array_tmp1, > array_tmp2, > array_tmp3, > array_tmp4, > array_tmp5, > array_tmp6_g, > array_tmp6, > array_tmp7, > array_tmp8, > array_tmp9, > array_tmp10, > array_tmp11, > array_tmp12, > array_tmp13, > array_tmp14, > array_m1, > array_y_higher, > array_y_higher_work, > array_y_higher_work2, > array_y_set_initial, > array_poles, > array_given_rad_poles, > array_given_ord_poles, > array_real_poles, > array_complex_poles, > array_fact_2, > glob_last; > glob_last; > ALWAYS := 1; > INFO := 2; > DEBUGL := 3; > DEBUGMASSIVE := 4; > glob_iolevel := INFO; > glob_max_terms := 30; > glob_iolevel := 5; > glob_yes_pole := 4; > glob_no_pole := 3; > glob_not_given := 0; > ALWAYS := 1; > INFO := 2; > DEBUGL := 3; > DEBUGMASSIVE := 4; > MAX_UNCHANGED := 10; > glob_check_sign := 1.0; > glob_desired_digits_correct := 8.0; > glob_max_estimated_step_error := 0.0; > glob_ratio_of_radius := 0.1; > glob_percent_done := 0.0; > glob_subiter_method := 3; > glob_total_exp_sec := 0.1; > glob_optimal_expect_sec := 0.1; > glob_html_log := true; > glob_good_digits := 0; > glob_max_opt_iter := 10; > glob_dump := false; > glob_djd_debug := true; > glob_display_flag := true; > glob_djd_debug2 := true; > 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_almost_1 := 0.9990; > glob_clock_sec := 0.0; > glob_clock_start_sec := 0.0; > 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_disp_incr := 0.1; > glob_h := 0.1; > glob_max_h := 0.1; > glob_min_h := 0.000001; > glob_type_given_pole := 0; > glob_large_float := 9.0e100; > glob_last_good_h := 0.1; > glob_look_poles := false; > glob_neg_h := false; > glob_display_interval := 0.0; > glob_next_display := 0.0; > glob_dump_analytic := false; > glob_abserr := 0.1e-10; > glob_relerr := 0.1e-10; > glob_max_hours := 0.0; > glob_max_iter := 1000; > glob_max_rel_trunc_err := 0.1e-10; > glob_max_trunc_err := 0.1e-10; > glob_no_eqs := 0; > glob_optimal_clock_start_sec := 0.0; > glob_optimal_start := 0.0; > glob_small_float := 0.0; > glob_smallish_float := 0.0; > glob_unchanged_h_cnt := 0; > glob_warned := false; > glob_warned2 := false; > glob_max_sec := 10000.0; > glob_orig_start_sec := 0.0; > glob_start := 0; > glob_curr_iter_when_opt := 0; > glob_current_iter := 0; > glob_iter := 0; > glob_normmax := 0.0; > glob_max_minutes := 0.0; > #Write Set Defaults > glob_orig_start_sec := elapsed_time_seconds(); > MAX_UNCHANGED := 10; > glob_curr_iter_when_opt := 0; > glob_display_flag := true; > glob_no_eqs := 1; > glob_iter := -1; > opt_iter := -1; > glob_max_iter := 50000; > glob_max_hours := 0.0; > glob_max_minutes := 15.0; > omniout_str(ALWAYS,"##############ECHO OF PROBLEM#################"); > omniout_str(ALWAYS,"##############temp/div_sin_lin_newpostode.ode#################"); > omniout_str(ALWAYS,"diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ;"); > omniout_str(ALWAYS,"!"); > omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK"); > omniout_str(ALWAYS,"Digits:=32;"); > omniout_str(ALWAYS,"max_terms:=30;"); > omniout_str(ALWAYS,"!"); > omniout_str(ALWAYS,"#END FIRST INPUT BLOCK"); > omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK"); > omniout_str(ALWAYS,"x_start := 0.1;"); > omniout_str(ALWAYS,"x_end := 1.0 ;"); > omniout_str(ALWAYS,"array_y_init[0 + 1] := exact_soln_y(x_start);"); > omniout_str(ALWAYS,"glob_look_poles := true;"); > omniout_str(ALWAYS,"glob_max_iter := 1000000;"); > omniout_str(ALWAYS,"glob_max_h := 0.001;"); > omniout_str(ALWAYS,"#END SECOND INPUT BLOCK"); > omniout_str(ALWAYS,"#BEGIN OVERRIDE BLOCK"); > omniout_str(ALWAYS,"glob_desired_digits_correct:=10;"); > omniout_str(ALWAYS,"glob_display_interval:=0.01;"); > omniout_str(ALWAYS,"glob_look_poles:=true;"); > omniout_str(ALWAYS,"glob_max_iter:=10000000;"); > omniout_str(ALWAYS,"glob_max_minutes:=3;"); > omniout_str(ALWAYS,"glob_subiter_method:=3;"); > 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(sin(x)/(2*x+1));"); > 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 := 0.0; > glob_smallish_float := 0.0; > glob_large_float := 1.0e100; > glob_almost_1 := 0.99; > #BEGIN FIRST INPUT BLOCK > #BEGIN FIRST INPUT BLOCK > Digits:=32; > max_terms:=30; > #END FIRST INPUT BLOCK > #START OF INITS AFTER INPUT BLOCK > glob_max_terms := max_terms; > glob_html_log := true; > #END OF INITS AFTER INPUT BLOCK > array_y_init:= Array(0..(max_terms + 1),[]); > array_norms:= Array(0..(max_terms + 1),[]); > array_fact_1:= Array(0..(max_terms + 1),[]); > array_pole:= Array(0..(4 + 1),[]); > array_real_pole:= Array(0..(4 + 1),[]); > array_complex_pole:= Array(0..(4 + 1),[]); > array_1st_rel_error:= Array(0..(2 + 1),[]); > array_last_rel_error:= Array(0..(2 + 1),[]); > array_type_pole:= Array(0..(2 + 1),[]); > array_type_real_pole:= Array(0..(2 + 1),[]); > array_type_complex_pole:= Array(0..(2 + 1),[]); > array_y:= Array(0..(max_terms + 1),[]); > array_x:= Array(0..(max_terms + 1),[]); > array_tmp0:= Array(0..(max_terms + 1),[]); > array_tmp1_g:= Array(0..(max_terms + 1),[]); > array_tmp1:= Array(0..(max_terms + 1),[]); > array_tmp2:= Array(0..(max_terms + 1),[]); > array_tmp3:= Array(0..(max_terms + 1),[]); > array_tmp4:= Array(0..(max_terms + 1),[]); > array_tmp5:= Array(0..(max_terms + 1),[]); > array_tmp6_g:= Array(0..(max_terms + 1),[]); > array_tmp6:= Array(0..(max_terms + 1),[]); > array_tmp7:= Array(0..(max_terms + 1),[]); > array_tmp8:= Array(0..(max_terms + 1),[]); > array_tmp9:= Array(0..(max_terms + 1),[]); > array_tmp10:= Array(0..(max_terms + 1),[]); > array_tmp11:= Array(0..(max_terms + 1),[]); > array_tmp12:= Array(0..(max_terms + 1),[]); > array_tmp13:= Array(0..(max_terms + 1),[]); > array_tmp14:= Array(0..(max_terms + 1),[]); > array_m1:= Array(0..(max_terms + 1),[]); > array_y_higher := Array(0..(2+ 1) ,(0..max_terms+ 1),[]); > array_y_higher_work := Array(0..(2+ 1) ,(0..max_terms+ 1),[]); > array_y_higher_work2 := Array(0..(2+ 1) ,(0..max_terms+ 1),[]); > array_y_set_initial := Array(0..(2+ 1) ,(0..max_terms+ 1),[]); > array_poles := Array(0..(2+ 1) ,(0..3+ 1),[]); > array_given_rad_poles := Array(0..(2+ 1) ,(0..3+ 1),[]); > array_given_ord_poles := Array(0..(2+ 1) ,(0..3+ 1),[]); > array_real_poles := Array(0..(2+ 1) ,(0..3+ 1),[]); > array_complex_poles := Array(0..(2+ 1) ,(0..3+ 1),[]); > array_fact_2 := Array(0..(max_terms+ 1) ,(0..max_terms+ 1),[]); > term := 1; > while (term <= max_terms) do # do number 1 > array_y_init[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_norms[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_fact_1[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 4) do # do number 1 > array_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 4) do # do number 1 > array_real_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 4) do # do number 1 > array_complex_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_1st_rel_error[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_last_rel_error[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_real_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= 2) do # do number 1 > array_type_complex_pole[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_y[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_x[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp0[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp1_g[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp1[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp2[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp3[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp4[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp5[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp6_g[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp6[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp7[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp8[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp9[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp10[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp11[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp12[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp13[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_tmp14[term] := 0.0; > term := term + 1; > od;# end do number 1; > term := 1; > while (term <= max_terms) do # do number 1 > array_m1[term] := 0.0; > term := term + 1; > od;# end do number 1; > ord := 1; > while (ord <=2) do # do number 1 > term := 1; > while (term <= max_terms) do # do number 2 > array_y_higher[ord,term] := 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 <= max_terms) do # do number 2 > array_y_higher_work[ord,term] := 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 <= max_terms) do # do number 2 > array_y_higher_work2[ord,term] := 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 <= max_terms) do # do number 2 > array_y_set_initial[ord,term] := 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_poles[ord,term] := 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] := 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] := 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_real_poles[ord,term] := 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_complex_poles[ord,term] := 0.0; > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > ord := 1; > while (ord <=max_terms) do # do number 1 > term := 1; > while (term <= max_terms) do # do number 2 > array_fact_2[ord,term] := 0.0; > term := term + 1; > od;# end do number 2; > ord := ord + 1; > od;# end do number 1; > #BEGIN ARRAYS DEFINED AND INITIALIZATED > array_y := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_y[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_x := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_x[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp0 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp0[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp1_g := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp1_g[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp1 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp1[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp2 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp2[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp3 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp3[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp4 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp4[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp5 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp5[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp6_g := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp6_g[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp6 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp6[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp7 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp7[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp8 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp8[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp9 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp9[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp10 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp10[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp11 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp11[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp12 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp12[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp13 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp13[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_tmp14 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_tmp14[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_m1 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_m1[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_1 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_const_1[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_1[1] := 1; > array_const_0D0 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_const_0D0[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_0D0[1] := 0.0; > array_const_2D0 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_const_2D0[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_2D0[1] := 2.0; > array_const_1D0 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_const_1D0[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_1D0[1] := 1.0; > array_m1 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms) do # do number 1 > array_m1[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_m1[1] := -1.0; > #END ARRAYS DEFINED AND INITIALIZATED > #Initing Factorial Tables > iiif := 0; > while (iiif <= glob_max_terms) do # do number 1 > jjjf := 0; > while (jjjf <= glob_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 Tables > #TOP SECOND INPUT BLOCK > #BEGIN SECOND INPUT BLOCK > #END FIRST INPUT BLOCK > #BEGIN SECOND INPUT BLOCK > x_start := 0.1; > x_end := 1.0 ; > array_y_init[0 + 1] := exact_soln_y(x_start); > glob_look_poles := true; > glob_max_iter := 1000000; > glob_max_h := 0.001; > #END SECOND INPUT BLOCK > #BEGIN OVERRIDE BLOCK > glob_desired_digits_correct:=10; > glob_display_interval:=0.01; > glob_look_poles:=true; > glob_max_iter:=10000000; > glob_max_minutes:=3; > glob_subiter_method:=3; > #END OVERRIDE BLOCK > #END SECOND INPUT BLOCK > #BEGIN INITS AFTER SECOND INPUT BLOCK > glob_last_good_h := glob_h; > glob_max_terms := max_terms; > glob_max_sec := convfloat(60.0) * convfloat(glob_max_minutes) + convfloat(3600.0) * convfloat(glob_max_hours); > if (glob_h > 0.0) then # if number 1 > glob_neg_h := false; > glob_display_interval := omniabs(glob_display_interval); > else > glob_neg_h := true; > glob_display_interval := -omniabs(glob_display_interval); > fi;# end if 1; > chk_data(); > #AFTER INITS AFTER SECOND INPUT BLOCK > array_y_set_initial[1,1] := true; > array_y_set_initial[1,2] := false; > array_y_set_initial[1,3] := false; > array_y_set_initial[1,4] := false; > array_y_set_initial[1,5] := false; > array_y_set_initial[1,6] := false; > array_y_set_initial[1,7] := false; > array_y_set_initial[1,8] := false; > array_y_set_initial[1,9] := false; > array_y_set_initial[1,10] := false; > array_y_set_initial[1,11] := false; > array_y_set_initial[1,12] := false; > array_y_set_initial[1,13] := false; > array_y_set_initial[1,14] := false; > array_y_set_initial[1,15] := false; > array_y_set_initial[1,16] := false; > array_y_set_initial[1,17] := false; > array_y_set_initial[1,18] := false; > array_y_set_initial[1,19] := false; > array_y_set_initial[1,20] := false; > array_y_set_initial[1,21] := false; > array_y_set_initial[1,22] := false; > array_y_set_initial[1,23] := false; > array_y_set_initial[1,24] := false; > array_y_set_initial[1,25] := false; > array_y_set_initial[1,26] := false; > array_y_set_initial[1,27] := false; > array_y_set_initial[1,28] := false; > array_y_set_initial[1,29] := false; > array_y_set_initial[1,30] := false; > #BEGIN OPTIMIZE CODE > omniout_str(ALWAYS,"START of Optimize"); > #Start Series -- INITIALIZE FOR OPTIMIZE > glob_check_sign := check_sign(x_start,x_end); > glob_h := check_sign(x_start,x_end); > found_h := false; > glob_h := glob_min_h; > if (glob_max_h < glob_h) then # if number 4 > glob_h := glob_max_h; > fi;# end if 4; > if (glob_display_interval < glob_h) then # if number 4 > glob_h := glob_display_interval; > fi;# end if 4; > best_h := glob_h; > min_value := glob_large_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 := 0.0; > while ((opt_iter <= 100) and ( not found_h)) do # do number 1 > omniout_int(ALWAYS,"opt_iter",32,opt_iter,4,""); > array_x[1] := x_start; > array_x[2] := glob_h; > glob_next_display := x_start; > order_diff := 1; > #Start Series array_y > term_no := 1; > while (term_no <= order_diff) do # do number 2 > array_y[term_no] := array_y_init[term_no] * expt(glob_h , (term_no - 1)) / factorial_1(term_no - 1); > term_no := term_no + 1; > od;# end do number 2; > rows := order_diff; > r_order := 1; > while (r_order <= rows) do # do number 2 > term_no := 1; > while (term_no <= (rows - r_order + 1)) do # do number 3 > it := term_no + r_order - 1; > array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , (term_no - 1)) / ((factorial_1(term_no - 1))); > term_no := term_no + 1; > od;# end do number 3; > r_order := r_order + 1; > od;# end do number 2 > ; > atomall(); > 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) and (opt_iter = 1)) or (glob_h >= glob_max_h )) then # if number 4 > found_h := true; > glob_h := glob_max_h; > best_h := glob_h; > elif > ((estimated_step_error > est_needed_step_err) and ( not found_h)) then # if number 5 > glob_h := glob_h/2.0; > best_h := glob_h; > found_h := true; > else > glob_h := glob_h*2.0; > best_h := glob_h; > fi;# end if 5; > omniout_float(ALWAYS,"best_h",32,best_h,32,""); > opt_iter := opt_iter + 1; > od;# end do number 1; > if (( not found_h) and (opt_iter = 1)) then # if number 5 > omniout_str(ALWAYS,"Beginning glob_h too large."); > found_h := false; > fi;# end if 5; > if (opt_iter > 100) then # if number 5 > glob_h := glob_max_h; > found_h := false; > fi;# end if 5; > if (glob_display_interval < glob_h) then # if number 5 > glob_h := glob_display_interval; > fi;# end if 5; > #END OPTIMIZE CODE > if (glob_html_log) then # if number 5 > html_log_file := fopen("entry.html",WRITE,TEXT); > fi;# end if 5; > #BEGIN SOLUTION CODE > if (found_h) then # if number 5 > omniout_str(ALWAYS,"START of Soultion"); > #Start Series -- INITIALIZE FOR SOLUTION > array_x[1] := x_start; > array_x[2] := glob_h; > glob_next_display := x_start; > order_diff := 1; > #Start Series array_y > term_no := 1; > while (term_no <= order_diff) do # do number 1 > array_y[term_no] := array_y_init[term_no] * expt(glob_h , (term_no - 1)) / factorial_1(term_no - 1); > term_no := term_no + 1; > od;# end do number 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; > array_y_higher[r_order,term_no] := array_y_init[it]* expt(glob_h , (term_no - 1)) / ((factorial_1(term_no - 1))); > term_no := term_no + 1; > od;# end do number 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_current_iter := 0; > glob_iter := 0; > omniout_str(DEBUGL," "); > glob_reached_optimal_h := true; > glob_optimal_clock_start_sec := elapsed_time_seconds(); > while ((glob_current_iter < glob_max_iter) and ((glob_check_sign * array_x[1]) < (glob_check_sign * x_end )) and ((convfloat(glob_clock_sec) - convfloat(glob_orig_start_sec)) < convfloat(glob_max_sec))) do # do number 1 > #left paren 0001C > if (reached_interval()) then # if number 6 > omniout_str(INFO," "); > omniout_str(INFO,"TOP MAIN SOLVE Loop"); > fi;# end if 6; > glob_iter := glob_iter + 1; > glob_clock_sec := elapsed_time_seconds(); > glob_current_iter := glob_current_iter + 1; > atomall(); > display_alot(current_iter); > if (glob_look_poles) then # if number 6 > #left paren 0004C > check_for_pole(); > fi;# end if 6;#was right paren 0004C > if (reached_interval()) then # if number 6 > glob_next_display := glob_next_display + glob_display_interval; > fi;# end if 6; > 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 := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[2,iii] := array_y_higher[2,iii] / expt(glob_h , (calc_term - 1)) / factorial_3(iii - calc_term , iii - 1); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := 0.0; > ord := 2; > calc_term := 1; > #sum_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 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 , (calc_term - 1)) / (factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 1; > calc_term := 2; > #adjust_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , (calc_term - 1)) / factorial_3(iii - calc_term , iii - 1); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := 0.0; > ord := 1; > calc_term := 2; > #sum_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 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 , (calc_term - 1)) / (factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 1; > calc_term := 1; > #adjust_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[1,iii] := array_y_higher[1,iii] / expt(glob_h , (calc_term - 1)) / factorial_3(iii - calc_term , iii - 1); > iii := iii - 1; > od;# end do number 2; > #AFTER ADJUST SUBSERIES EQ =1 > #BEFORE SUM SUBSERIES EQ =1 > temp_sum := 0.0; > ord := 1; > calc_term := 1; > #sum_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 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 , (calc_term - 1)) / (factorial_1(calc_term - 1)); > #AFTER SUM SUBSERIES EQ =1 > #END SUM AND ADJUST EQ =1 > #END PART 1 > #START PART 2 MOVE TERMS to REGULAR Array > term_no := glob_max_terms; > while (term_no >= 1) do # do number 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 6 > omniout_str(ALWAYS,"Maximum Iterations Reached before Solution Completed!"); > fi;# end if 6; > if (elapsed_time_seconds() - convfloat(glob_orig_start_sec) >= convfloat(glob_max_sec )) then # if number 6 > omniout_str(ALWAYS,"Maximum Time Reached before Solution Completed!"); > fi;# end if 6; > glob_clock_sec := elapsed_time_seconds(); > omniout_str(INFO,"diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ;"); > omniout_int(INFO,"Iterations ",32,glob_iter,4," ") > ; > prog_report(x_start,x_end); > if (glob_html_log) then # if number 6 > logstart(html_log_file); > logitem_str(html_log_file,"2013-05-26T00:51:26-05:00") > ; > logitem_str(html_log_file,"Maple") > ; > logitem_str(html_log_file,"div_sin_lin_new") > ; > logitem_str(html_log_file,"diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ;") > ; > logitem_float(html_log_file,x_start) > ; > logitem_float(html_log_file,x_end) > ; > logitem_float(html_log_file,array_x[1]) > ; > logitem_float(html_log_file,glob_h) > ; > logitem_integer(html_log_file,Digits) > ; > ; > logitem_good_digits(html_log_file,array_last_rel_error[1]) > ; > logitem_integer(html_log_file,glob_max_terms) > ; > logitem_float(html_log_file,array_1st_rel_error[1]) > ; > logitem_float(html_log_file,array_last_rel_error[1]) > ; > logitem_integer(html_log_file,glob_iter) > ; > logitem_time(html_log_file,convfloat(glob_clock_sec)) > ; > if (glob_percent_done < 100.0) then # if number 7 > logitem_time(html_log_file,convfloat(glob_total_exp_sec)) > ; > 0; > else > logitem_str(html_log_file,"Done") > ; > 0; > fi;# end if 7; > log_revs(html_log_file," 189 ") > ; > logitem_str(html_log_file,"div_sin_lin_new diffeq.mxt") > ; > logitem_str(html_log_file,"div_sin_lin_new maple results") > ; > logitem_str(html_log_file,"All Tests - All Languages") > ; > logend(html_log_file) > ; > ; > fi;# end if 6; > if (glob_html_log) then # if number 6 > fclose(html_log_file); > fi;# end if 6 > ; > ;; > fi;# end if 5 > #END OUTFILEMAIN > end; main := proc() local d1, d2, d3, d4, est_err_2, niii, done_once, term, ord, order_diff, term_no, html_log_file, iiif, jjjf, rows, r_order, sub_iter, calc_term, iii, temp_sum, current_iter, x_start, x_end, it, max_terms, opt_iter, tmp, subiter, est_needed_step_err, estimated_step_error, min_value, est_answer, best_h, found_h, repeat_it; global glob_max_terms, glob_iolevel, glob_yes_pole, glob_no_pole, glob_not_given, ALWAYS, INFO, DEBUGL, DEBUGMASSIVE, MAX_UNCHANGED, glob_check_sign, glob_desired_digits_correct, glob_max_estimated_step_error, glob_ratio_of_radius, glob_percent_done, glob_subiter_method, glob_total_exp_sec, glob_optimal_expect_sec, glob_html_log, glob_good_digits, glob_max_opt_iter, glob_dump, glob_djd_debug, glob_display_flag, glob_djd_debug2, 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_almost_1, glob_clock_sec, glob_clock_start_sec, glob_not_yet_finished, glob_initial_pass, glob_not_yet_start_msg, glob_reached_optimal_h, glob_optimal_done, glob_disp_incr, glob_h, glob_max_h, glob_min_h, glob_type_given_pole, glob_large_float, glob_last_good_h, glob_look_poles, glob_neg_h, glob_display_interval, glob_next_display, glob_dump_analytic, glob_abserr, glob_relerr, glob_max_hours, glob_max_iter, glob_max_rel_trunc_err, glob_max_trunc_err, glob_no_eqs, glob_optimal_clock_start_sec, glob_optimal_start, glob_small_float, glob_smallish_float, glob_unchanged_h_cnt, glob_warned, glob_warned2, glob_max_sec, glob_orig_start_sec, glob_start, glob_curr_iter_when_opt, glob_current_iter, glob_iter, glob_normmax, glob_max_minutes, array_const_1, array_const_0D0, array_const_2D0, array_const_1D0, array_y_init, array_norms, array_fact_1, array_pole, array_real_pole, array_complex_pole, array_1st_rel_error, array_last_rel_error, array_type_pole, array_type_real_pole, array_type_complex_pole, array_y, array_x, array_tmp0, array_tmp1_g, array_tmp1, array_tmp2, array_tmp3, array_tmp4, array_tmp5, array_tmp6_g, array_tmp6, array_tmp7, array_tmp8, array_tmp9, array_tmp10, array_tmp11, array_tmp12, array_tmp13, array_tmp14, array_m1, array_y_higher, array_y_higher_work, array_y_higher_work2, array_y_set_initial, array_poles, array_given_rad_poles, array_given_ord_poles, array_real_poles, array_complex_poles, array_fact_2, glob_last; glob_last; ALWAYS := 1; INFO := 2; DEBUGL := 3; DEBUGMASSIVE := 4; glob_iolevel := INFO; glob_max_terms := 30; glob_iolevel := 5; glob_yes_pole := 4; glob_no_pole := 3; glob_not_given := 0; ALWAYS := 1; INFO := 2; DEBUGL := 3; DEBUGMASSIVE := 4; MAX_UNCHANGED := 10; glob_check_sign := 1.0; glob_desired_digits_correct := 8.0; glob_max_estimated_step_error := 0.; glob_ratio_of_radius := 0.1; glob_percent_done := 0.; glob_subiter_method := 3; glob_total_exp_sec := 0.1; glob_optimal_expect_sec := 0.1; glob_html_log := true; glob_good_digits := 0; glob_max_opt_iter := 10; glob_dump := false; glob_djd_debug := true; glob_display_flag := true; glob_djd_debug2 := true; 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_almost_1 := 0.9990; glob_clock_sec := 0.; glob_clock_start_sec := 0.; 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_disp_incr := 0.1; glob_h := 0.1; glob_max_h := 0.1; glob_min_h := 0.1*10^(-5); glob_type_given_pole := 0; glob_large_float := 0.90*10^101; glob_last_good_h := 0.1; glob_look_poles := false; glob_neg_h := false; glob_display_interval := 0.; glob_next_display := 0.; glob_dump_analytic := false; glob_abserr := 0.1*10^(-10); glob_relerr := 0.1*10^(-10); glob_max_hours := 0.; glob_max_iter := 1000; glob_max_rel_trunc_err := 0.1*10^(-10); glob_max_trunc_err := 0.1*10^(-10); glob_no_eqs := 0; glob_optimal_clock_start_sec := 0.; glob_optimal_start := 0.; glob_small_float := 0.; glob_smallish_float := 0.; glob_unchanged_h_cnt := 0; glob_warned := false; glob_warned2 := false; glob_max_sec := 10000.0; glob_orig_start_sec := 0.; glob_start := 0; glob_curr_iter_when_opt := 0; glob_current_iter := 0; glob_iter := 0; glob_normmax := 0.; glob_max_minutes := 0.; glob_orig_start_sec := elapsed_time_seconds(); MAX_UNCHANGED := 10; glob_curr_iter_when_opt := 0; glob_display_flag := true; glob_no_eqs := 1; glob_iter := -1; opt_iter := -1; glob_max_iter := 50000; glob_max_hours := 0.; glob_max_minutes := 15.0; omniout_str(ALWAYS, "##############ECHO OF PROBLEM#################"); omniout_str(ALWAYS, "##############temp/div_sin_lin_newpostode.ode#################"); omniout_str(ALWAYS, "diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 \ ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ;"); omniout_str(ALWAYS, "!"); omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK"); omniout_str(ALWAYS, "Digits:=32;"); omniout_str(ALWAYS, "max_terms:=30;"); omniout_str(ALWAYS, "!"); omniout_str(ALWAYS, "#END FIRST INPUT BLOCK"); omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK"); omniout_str(ALWAYS, "x_start := 0.1;"); omniout_str(ALWAYS, "x_end := 1.0 ;"); omniout_str(ALWAYS, "array_y_init[0 + 1] := exact_soln_y(x_start);"); omniout_str(ALWAYS, "glob_look_poles := true;"); omniout_str(ALWAYS, "glob_max_iter := 1000000;"); omniout_str(ALWAYS, "glob_max_h := 0.001;"); omniout_str(ALWAYS, "#END SECOND INPUT BLOCK"); omniout_str(ALWAYS, "#BEGIN OVERRIDE BLOCK"); omniout_str(ALWAYS, "glob_desired_digits_correct:=10;"); omniout_str(ALWAYS, "glob_display_interval:=0.01;"); omniout_str(ALWAYS, "glob_look_poles:=true;"); omniout_str(ALWAYS, "glob_max_iter:=10000000;"); omniout_str(ALWAYS, "glob_max_minutes:=3;"); omniout_str(ALWAYS, "glob_subiter_method:=3;"); 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(sin(x)/(2*x+1));"); 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 := 0.; glob_smallish_float := 0.; glob_large_float := 0.10*10^101; glob_almost_1 := 0.99; Digits := 32; max_terms := 30; glob_max_terms := max_terms; glob_html_log := true; array_y_init := Array(0 .. max_terms + 1, []); array_norms := Array(0 .. max_terms + 1, []); array_fact_1 := Array(0 .. max_terms + 1, []); array_pole := Array(0 .. 5, []); array_real_pole := Array(0 .. 5, []); array_complex_pole := Array(0 .. 5, []); array_1st_rel_error := Array(0 .. 3, []); array_last_rel_error := Array(0 .. 3, []); array_type_pole := Array(0 .. 3, []); array_type_real_pole := Array(0 .. 3, []); array_type_complex_pole := Array(0 .. 3, []); array_y := Array(0 .. max_terms + 1, []); array_x := Array(0 .. max_terms + 1, []); array_tmp0 := Array(0 .. max_terms + 1, []); array_tmp1_g := Array(0 .. max_terms + 1, []); array_tmp1 := Array(0 .. max_terms + 1, []); array_tmp2 := Array(0 .. max_terms + 1, []); array_tmp3 := Array(0 .. max_terms + 1, []); array_tmp4 := Array(0 .. max_terms + 1, []); array_tmp5 := Array(0 .. max_terms + 1, []); array_tmp6_g := Array(0 .. max_terms + 1, []); array_tmp6 := Array(0 .. max_terms + 1, []); array_tmp7 := Array(0 .. max_terms + 1, []); array_tmp8 := Array(0 .. max_terms + 1, []); array_tmp9 := Array(0 .. max_terms + 1, []); array_tmp10 := Array(0 .. max_terms + 1, []); array_tmp11 := Array(0 .. max_terms + 1, []); array_tmp12 := Array(0 .. max_terms + 1, []); array_tmp13 := Array(0 .. max_terms + 1, []); array_tmp14 := Array(0 .. max_terms + 1, []); array_m1 := Array(0 .. max_terms + 1, []); array_y_higher := Array(0 .. 3, 0 .. max_terms + 1, []); array_y_higher_work := Array(0 .. 3, 0 .. max_terms + 1, []); array_y_higher_work2 := Array(0 .. 3, 0 .. max_terms + 1, []); array_y_set_initial := Array(0 .. 3, 0 .. max_terms + 1, []); array_poles := Array(0 .. 3, 0 .. 4, []); array_given_rad_poles := Array(0 .. 3, 0 .. 4, []); array_given_ord_poles := Array(0 .. 3, 0 .. 4, []); array_real_poles := Array(0 .. 3, 0 .. 4, []); array_complex_poles := Array(0 .. 3, 0 .. 4, []); array_fact_2 := Array(0 .. max_terms + 1, 0 .. max_terms + 1, []); term := 1; while term <= max_terms do array_y_init[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_norms[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_fact_1[term] := 0.; term := term + 1 end do; term := 1; while term <= 4 do array_pole[term] := 0.; term := term + 1 end do; term := 1; while term <= 4 do array_real_pole[term] := 0.; term := term + 1 end do ; term := 1; while term <= 4 do array_complex_pole[term] := 0.; term := term + 1 end do; term := 1; while term <= 2 do array_1st_rel_error[term] := 0.; term := term + 1 end do; term := 1; while term <= 2 do array_last_rel_error[term] := 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 <= max_terms do array_y[term] := 0.; term := term + 1 end do ; term := 1; while term <= max_terms do array_x[term] := 0.; term := term + 1 end do ; term := 1; while term <= max_terms do array_tmp0[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp1_g[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp1[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp2[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp3[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp4[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp5[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp6_g[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp6[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp7[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp8[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp9[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp10[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp11[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp12[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp13[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_tmp14[term] := 0.; term := term + 1 end do; term := 1; while term <= max_terms do array_m1[term] := 0.; term := term + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= max_terms do array_y_higher[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= max_terms do array_y_higher_work[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= max_terms do array_y_higher_work2[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= max_terms do array_y_set_initial[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_poles[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_given_rad_poles[ord, term] := 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] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_real_poles[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= 2 do term := 1; while term <= 3 do array_complex_poles[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; ord := 1; while ord <= max_terms do term := 1; while term <= max_terms do array_fact_2[ord, term] := 0.; term := term + 1 end do; ord := ord + 1 end do; array_y := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_y[term] := 0.; term := term + 1 end do; array_x := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_x[term] := 0.; term := term + 1 end do; array_tmp0 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp0[term] := 0.; term := term + 1 end do; array_tmp1_g := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp1_g[term] := 0.; term := term + 1 end do; array_tmp1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp1[term] := 0.; term := term + 1 end do; array_tmp2 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp2[term] := 0.; term := term + 1 end do; array_tmp3 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp3[term] := 0.; term := term + 1 end do; array_tmp4 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp4[term] := 0.; term := term + 1 end do; array_tmp5 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp5[term] := 0.; term := term + 1 end do; array_tmp6_g := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp6_g[term] := 0.; term := term + 1 end do; array_tmp6 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp6[term] := 0.; term := term + 1 end do; array_tmp7 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp7[term] := 0.; term := term + 1 end do; array_tmp8 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp8[term] := 0.; term := term + 1 end do; array_tmp9 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp9[term] := 0.; term := term + 1 end do; array_tmp10 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp10[term] := 0.; term := term + 1 end do; array_tmp11 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp11[term] := 0.; term := term + 1 end do; array_tmp12 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp12[term] := 0.; term := term + 1 end do; array_tmp13 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp13[term] := 0.; term := term + 1 end do; array_tmp14 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_tmp14[term] := 0.; term := term + 1 end do; array_m1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_m1[term] := 0.; term := term + 1 end do; array_const_1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_1[term] := 0.; term := term + 1 end do; array_const_1[1] := 1; array_const_0D0 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_0D0[term] := 0.; term := term + 1 end do; array_const_0D0[1] := 0.; array_const_2D0 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_2D0[term] := 0.; term := term + 1 end do; array_const_2D0[1] := 2.0; array_const_1D0 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_1D0[term] := 0.; term := term + 1 end do; array_const_1D0[1] := 1.0; array_m1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms do array_m1[term] := 0.; term := term + 1 end do; array_m1[1] := -1.0; iiif := 0; while iiif <= glob_max_terms do jjjf := 0; while jjjf <= glob_max_terms do array_fact_1[iiif] := 0; array_fact_2[iiif, jjjf] := 0; jjjf := jjjf + 1 end do; iiif := iiif + 1 end do; x_start := 0.1; x_end := 1.0; array_y_init[1] := exact_soln_y(x_start); glob_look_poles := true; glob_max_iter := 1000000; glob_max_h := 0.001; glob_desired_digits_correct := 10; glob_display_interval := 0.01; glob_look_poles := true; glob_max_iter := 10000000; glob_max_minutes := 3; glob_subiter_method := 3; glob_last_good_h := glob_h; glob_max_terms := max_terms; glob_max_sec := convfloat(60.0)*convfloat(glob_max_minutes) + convfloat(3600.0)*convfloat(glob_max_hours); if 0. < glob_h then glob_neg_h := false; glob_display_interval := omniabs(glob_display_interval) else glob_neg_h := true; glob_display_interval := -omniabs(glob_display_interval) end if; chk_data(); array_y_set_initial[1, 1] := true; array_y_set_initial[1, 2] := false; array_y_set_initial[1, 3] := false; array_y_set_initial[1, 4] := false; array_y_set_initial[1, 5] := false; array_y_set_initial[1, 6] := false; array_y_set_initial[1, 7] := false; array_y_set_initial[1, 8] := false; array_y_set_initial[1, 9] := false; array_y_set_initial[1, 10] := false; array_y_set_initial[1, 11] := false; array_y_set_initial[1, 12] := false; array_y_set_initial[1, 13] := false; array_y_set_initial[1, 14] := false; array_y_set_initial[1, 15] := false; array_y_set_initial[1, 16] := false; array_y_set_initial[1, 17] := false; array_y_set_initial[1, 18] := false; array_y_set_initial[1, 19] := false; array_y_set_initial[1, 20] := false; array_y_set_initial[1, 21] := false; array_y_set_initial[1, 22] := false; array_y_set_initial[1, 23] := false; array_y_set_initial[1, 24] := false; array_y_set_initial[1, 25] := false; array_y_set_initial[1, 26] := false; array_y_set_initial[1, 27] := false; array_y_set_initial[1, 28] := false; array_y_set_initial[1, 29] := false; array_y_set_initial[1, 30] := false; omniout_str(ALWAYS, "START of Optimize"); glob_check_sign := check_sign(x_start, x_end); glob_h := check_sign(x_start, x_end); found_h := false; glob_h := glob_min_h; if glob_max_h < glob_h then glob_h := glob_max_h end if; if glob_display_interval < glob_h then glob_h := glob_display_interval end if; best_h := glob_h; min_value := glob_large_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 := 0.; while opt_iter <= 100 and not found_h do omniout_int(ALWAYS, "opt_iter", 32, opt_iter, 4, ""); array_x[1] := x_start; array_x[2] := glob_h; glob_next_display := x_start; order_diff := 1; term_no := 1; while term_no <= order_diff do array_y[term_no] := array_y_init[term_no]* expt(glob_h, term_no - 1)/factorial_1(term_no - 1); term_no := term_no + 1 end do; rows := order_diff; r_order := 1; while r_order <= rows do term_no := 1; while term_no <= rows - r_order + 1 do it := term_no + r_order - 1; array_y_higher[r_order, term_no] := array_y_init[it]* expt(glob_h, term_no - 1)/factorial_1(term_no - 1); term_no := term_no + 1 end do; r_order := r_order + 1 end do; atomall(); estimated_step_error := test_suggested_h(); omniout_float(ALWAYS, "estimated_step_error", 32, estimated_step_error, 32, ""); if est_needed_step_err < estimated_step_error and opt_iter = 1 or glob_max_h <= glob_h then found_h := true; glob_h := glob_max_h; best_h := glob_h elif est_needed_step_err < estimated_step_error and not found_h then glob_h := glob_h/2.0; best_h := glob_h; found_h := true else glob_h := glob_h*2.0; best_h := glob_h end if; omniout_float(ALWAYS, "best_h", 32, best_h, 32, ""); 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 100 < opt_iter then glob_h := glob_max_h; found_h := false end if; if glob_display_interval < glob_h then glob_h := glob_display_interval 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] := x_start; array_x[2] := glob_h; glob_next_display := x_start; order_diff := 1; term_no := 1; while term_no <= order_diff do array_y[term_no] := array_y_init[term_no]* expt(glob_h, term_no - 1)/factorial_1(term_no - 1); term_no := term_no + 1 end do; rows := order_diff; r_order := 1; while r_order <= rows do term_no := 1; while term_no <= rows - r_order + 1 do it := term_no + r_order - 1; array_y_higher[r_order, term_no] := array_y_init[it]* expt(glob_h, term_no - 1)/factorial_1(term_no - 1); term_no := term_no + 1 end do; r_order := r_order + 1 end do; current_iter := 1; glob_clock_start_sec := elapsed_time_seconds(); glob_clock_sec := elapsed_time_seconds(); glob_current_iter := 0; glob_iter := 0; omniout_str(DEBUGL, " "); glob_reached_optimal_h := true; glob_optimal_clock_start_sec := elapsed_time_seconds(); while glob_current_iter < glob_max_iter and glob_check_sign*array_x[1] < glob_check_sign*x_end and convfloat(glob_clock_sec) - convfloat(glob_orig_start_sec) < convfloat(glob_max_sec) do if reached_interval() then omniout_str(INFO, " "); omniout_str(INFO, "TOP MAIN SOLVE Loop") end if; glob_iter := glob_iter + 1; glob_clock_sec := elapsed_time_seconds(); glob_current_iter := glob_current_iter + 1; atomall(); 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 := glob_max_terms; while calc_term <= iii do array_y_higher_work[2, iii] := array_y_higher[2, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 2; calc_term := 1; iii := glob_max_terms; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1); ord := 1; calc_term := 2; iii := glob_max_terms; while calc_term <= iii do array_y_higher_work[1, iii] := array_y_higher[1, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 1; calc_term := 2; iii := glob_max_terms; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1); ord := 1; calc_term := 1; iii := glob_max_terms; while calc_term <= iii do array_y_higher_work[1, iii] := array_y_higher[1, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 1; calc_term := 1; iii := glob_max_terms; while calc_term <= iii do temp_sum := temp_sum + array_y_higher_work[ord, iii]; iii := iii - 1 end do; array_y_higher_work2[ord, calc_term] := temp_sum* expt(glob_h, calc_term - 1)/factorial_1(calc_term - 1); term_no := glob_max_terms; while 1 <= term_no do array_y[term_no] := array_y_higher_work2[1, term_no]; ord := 1; while ord <= order_diff do array_y_higher[ord, term_no] := array_y_higher_work2[ord, term_no]; ord := ord + 1 end do; term_no := term_no - 1 end do end do; omniout_str(ALWAYS, "Finished!"); if glob_max_iter <= glob_iter then omniout_str(ALWAYS, "Maximum Iterations Reached before Solution Completed!") end if; if convfloat(glob_max_sec) <= elapsed_time_seconds() - convfloat(glob_orig_start_sec) then omniout_str(ALWAYS, "Maximum Time Reached before Solution Completed!") end if; glob_clock_sec := elapsed_time_seconds(); omniout_str(INFO, "diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.\ 0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 \ ) ;"); omniout_int(INFO, "Iterations ", 32, glob_iter, 4, " "); prog_report(x_start, x_end); if glob_html_log then logstart(html_log_file); logitem_str(html_log_file, "2013-05-26T00:51:26-05:00"); logitem_str(html_log_file, "Maple"); logitem_str(html_log_file, "div_sin_lin_new"); logitem_str(html_log_file, "diff( y , x , 1 ) = cos ( x ) / (\ 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) /\ ( 2.0 * x + 1.0 ) ;"); logitem_float(html_log_file, x_start); logitem_float(html_log_file, x_end); logitem_float(html_log_file, array_x[1]); logitem_float(html_log_file, glob_h); logitem_integer(html_log_file, Digits); logitem_good_digits(html_log_file, array_last_rel_error[1]); logitem_integer(html_log_file, glob_max_terms); logitem_float(html_log_file, array_1st_rel_error[1]); logitem_float(html_log_file, array_last_rel_error[1]); logitem_integer(html_log_file, glob_iter); logitem_time(html_log_file, convfloat(glob_clock_sec)); if glob_percent_done < 100.0 then logitem_time(html_log_file, convfloat(glob_total_exp_sec)); 0 else logitem_str(html_log_file, "Done"); 0 end if; log_revs(html_log_file, " 189 "); logitem_str(html_log_file, "div_sin_lin_new diffeq.mxt"); logitem_str(html_log_file, "div_sin_lin_new maple results"); logitem_str(html_log_file, "All Tests - All Languages"); logend(html_log_file) end if; if glob_html_log then fclose(html_log_file) end if end if end proc > # End Function number 13 > main(); ##############ECHO OF PROBLEM################# ##############temp/div_sin_lin_newpostode.ode################# diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ; ! #BEGIN FIRST INPUT BLOCK Digits:=32; max_terms:=30; ! #END FIRST INPUT BLOCK #BEGIN SECOND INPUT BLOCK x_start := 0.1; x_end := 1.0 ; array_y_init[0 + 1] := exact_soln_y(x_start); glob_look_poles := true; glob_max_iter := 1000000; glob_max_h := 0.001; #END SECOND INPUT BLOCK #BEGIN OVERRIDE BLOCK glob_desired_digits_correct:=10; glob_display_interval:=0.01; glob_look_poles:=true; glob_max_iter:=10000000; glob_max_minutes:=3; glob_subiter_method:=3; #END OVERRIDE BLOCK ! #BEGIN USER DEF BLOCK exact_soln_y := proc(x) return(sin(x)/(2*x+1)); end; #END USER DEF BLOCK #######END OF ECHO OF PROBLEM################# START of Optimize min_size = 0 min_size = 1 glob_desired_digits_correct = 10 desired_abs_gbl_error = 1.0000000000000000000000000000000e-10 range = 0.9 estimated_steps = 900000 step_error = 1.1111111111111111111111111111111e-16 est_needed_step_err = 1.1111111111111111111111111111111e-16 opt_iter = 1 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 4.5040466011927044178749834756551e-152 estimated_step_error = 4.5040466011927044178749834756551e-152 best_h = 2.0e-06 opt_iter = 2 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 3.0226120825400831054172882224633e-144 estimated_step_error = 3.0226120825400831054172882224633e-144 best_h = 4.00e-06 opt_iter = 3 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 2.0284373762078619718929927544959e-136 estimated_step_error = 2.0284373762078619718929927544959e-136 best_h = 8.000e-06 opt_iter = 4 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.3612569106719591161103301279375e-128 estimated_step_error = 1.3612569106719591161103301279375e-128 best_h = 1.60000e-05 opt_iter = 5 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 9.1351818435006868284057161762980e-121 estimated_step_error = 9.1351818435006868284057161762980e-121 best_h = 3.200000e-05 opt_iter = 6 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 6.1304380487252632303140392781550e-113 estimated_step_error = 6.1304380487252632303140392781550e-113 best_h = 6.4000000e-05 opt_iter = 7 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 4.1139616929745795013478285822867e-105 estimated_step_error = 4.1139616929745795013478285822867e-105 best_h = 0.000128 opt_iter = 8 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 2.7606911812185421228813815952496e-97 estimated_step_error = 2.7606911812185421228813815952496e-97 best_h = 0.000256 opt_iter = 9 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.8524782306558729427237916886489e-89 estimated_step_error = 1.8524782306558729427237916886489e-89 best_h = 0.000512 opt_iter = 10 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.2429218131389774180070255741378e-81 estimated_step_error = 1.2429218131389774180070255741378e-81 best_h = 0.001024 opt_iter = 11 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 8.3376828534415982287253683810871e-74 estimated_step_error = 8.3376828534415982287253683810871e-74 best_h = 0.001 START of Soultion TOP MAIN SOLVE Loop x[1] = 0.1 y[1] (analytic) = 0.083194513872356793589011832008852 y[1] (numeric) = 0.083194513872356793589011832008852 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6273 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.5624 Order of pole (six term test) = -1.434e-26 bytes used=4000528, alloc=3210676, time=0.38 TOP MAIN SOLVE Loop x[1] = 0.11 y[1] (analytic) = 0.089982213800962957922089745970041 y[1] (numeric) = 0.089982213800962971438046473074783 absolute error = 1.3515956727104742e-17 relative error = 1.5020698153750134781830934310451e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6377 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=8001908, alloc=4586680, time=0.81 TOP MAIN SOLVE Loop x[1] = 0.12 y[1] (analytic) = 0.096542102652354322554315011508847 y[1] (numeric) = 0.096542102652354348120248492551061 absolute error = 2.5565933481042214e-17 relative error = 2.6481641458654050500303737569269e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6482 Order of pole (ratio test) Not computed 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] (analytic) = 0.10288424017436099963587762754628 y[1] (numeric) = 0.10288424017436103596476846656433 absolute error = 3.632889083901805e-17 relative error = 3.5310452579958205363262955730490e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6586 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=12002712, alloc=4717728, time=1.26 TOP MAIN SOLVE Loop x[1] = 0.14 y[1] (analytic) = 0.10901805831580975134217839976982 y[1] (numeric) = 0.10901805831580979730176254430627 absolute error = 4.595958414453645e-17 relative error = 4.2157771707324025162598987742089e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6691 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.2645 Order of pole (six term test) = -2.372e-27 TOP MAIN SOLVE Loop x[1] = 0.15 y[1] (analytic) = 0.11495240959507632422901956822126 y[1] (numeric) = 0.1149524095950763788211664971897 absolute error = 5.459214692896844e-17 relative error = 4.7491085329373336652299281042846e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.6795 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=16004684, alloc=4717728, time=1.71 TOP MAIN SOLVE Loop x[1] = 0.16 y[1] (analytic) = 0.12069561107139845705413875733787 y[1] (numeric) = 0.12069561107139851939723810382864 absolute error = 6.234309934649077e-17 relative error = 5.1653161861545412294387174782984e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.69 Order of pole (ratio test) Not computed 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] (analytic) = 0.12625548437835523146091371393347 y[1] (numeric) = 0.12625548437835530077479452892902 absolute error = 6.931388081499555e-17 relative error = 5.4899698936863342123092186987825e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7005 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=20005592, alloc=4783252, time=2.16 TOP MAIN SOLVE Loop x[1] = 0.18 y[1] (analytic) = 0.13163939222487071936897260272001 y[1] (numeric) = 0.1316393922248707949619603845452 absolute error = 7.559298778182519e-17 relative error = 5.7424291091146010102209466533264e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7109 Order of pole (ratio test) Not computed 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] (analytic) = 0.13685427172210186811076170505892 y[1] (numeric) = 0.13685427172210194936854453899084 absolute error = 8.125778283393192e-17 relative error = 5.9375408462905031506811698718641e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7214 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=24007248, alloc=4783252, time=2.61 TOP MAIN SOLVE Loop x[1] = 0.2 y[1] (analytic) = 0.14190666485361515389958044794171 y[1] (numeric) = 0.14190666485361524027560995647608 absolute error = 8.637602950853437e-17 relative error = 6.0868197838090400989543045384295e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7318 Order of pole (ratio test) Not computed 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] (analytic) = 0.14680274637049265535824818748425 y[1] (numeric) = 0.14680274637049274636544574190799 absolute error = 9.100719755442374e-17 relative error = 6.1992844006299995307282971463397e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7423 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=28010236, alloc=4783252, time=3.08 TOP MAIN SOLVE Loop x[1] = 0.22 y[1] (analytic) = 0.15154834936171480552207708712292 y[1] (numeric) = 0.15154834936171490072565267878212 absolute error = 9.520357559165920e-17 relative error = 6.2820595534450728351221368200962e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7527 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.476 Order of pole (six term test) = 3.065e-27 TOP MAIN SOLVE Loop x[1] = 0.23 y[1] (analytic) = 0.15614898872273177767439535093155 y[1] (numeric) = 0.15614898872273187668561711145153 absolute error = 9.901122176051998e-17 relative error = 6.3408173546567564136904010353931e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7632 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=32011264, alloc=4848776, time=3.54 TOP MAIN SOLVE Loop x[1] = 0.24 y[1] (analytic) = 0.16060988272103688402756221924988 y[1] (numeric) = 0.16060988272103698649833997532596 absolute error = 1.0247077775607608e-16 relative error = 6.3801041392986665143601669666016e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7736 Order of pole (ratio test) Not computed 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.25 y[1] (analytic) = 0.16493597283634861973123246989959 y[1] (numeric) = 0.16493597283634872534939985772749 absolute error = 1.0561816738782790e-16 relative error = 6.4035859231644674324352216034627e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7841 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=36012648, alloc=4848776, time=3.99 TOP MAIN SOLVE Loop x[1] = 0.26 y[1] (analytic) = 0.1691319420343125640482818844508 y[1] (numeric) = 0.16913194203431267253347918999839 absolute error = 1.0848519730554759e-16 relative error = 6.4142347093453645835561590166479e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.7945 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 4.572 Order of pole (six term test) = 9.488e-26 TOP MAIN SOLVE Loop x[1] = 0.27 y[1] (analytic) = 0.17320223161612410956641981884451 y[1] (numeric) = 0.17320223161612422066649446856616 absolute error = 1.1110007464972165e-16 relative error = 6.4144713155866108465130446229907e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.805 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=40014328, alloc=4848776, time=4.44 TOP MAIN SOLVE Loop x[1] = 0.28 y[1] (analytic) = 0.17715105677186777776901894772939 y[1] (numeric) = 0.17715105677186789125687295096215 absolute error = 1.1348785400323276e-16 relative error = 6.4062758682484494012825808380754e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8155 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=44017260, alloc=4848776, time=4.90 TOP MAIN SOLVE Loop x[1] = 0.29 y[1] (analytic) = 0.18098242095242755233160772500277 y[1] (numeric) = 0.18098242095242766800243177300421 absolute error = 1.1567082404800144e-16 relative error = 6.3912739944177393208470471558136e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8259 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.5852 Order of pole (six term test) = 7.21e-28 TOP MAIN SOLVE Loop x[1] = 0.3 y[1] (analytic) = 0.18470012916333723444082546605314 y[1] (numeric) = 0.18470012916333735210966815800815 absolute error = 1.1766884269195501e-16 relative error = 6.3708045698168434977278440495689e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8364 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=48018340, alloc=4848776, time=5.36 TOP MAIN SOLVE Loop x[1] = 0.31 y[1] (analytic) = 0.18830780027373055652200205182652 y[1] (numeric) = 0.18830780027373067602163011967256 absolute error = 1.1949962806784604e-16 relative error = 6.3459733422692718270132347973667e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8468 Order of pole (ratio test) Not computed 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] (analytic) = 0.19180887842446205284253508744948 y[1] (numeric) = 0.19180887842446217402154675486292 absolute error = 1.2117901166741344e-16 relative error = 6.3176956490643375514860117513016e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8573 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=52020988, alloc=4848776, time=5.82 TOP MAIN SOLVE Loop x[1] = 0.33 y[1] (analytic) = 0.19520664361136647391578053986158 y[1] (numeric) = 0.19520664361136659663693946243574 absolute error = 1.2272115892257416e-16 relative error = 6.2867306487220583514287863704298e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8677 Order of pole (ratio test) Not computed 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] (analytic) = 0.19850422151238952189391159942309 y[1] (numeric) = 0.19850422151238964603267334690679 absolute error = 1.2413876174748370e-16 relative error = 6.2537089036031233049653767680767e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8782 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=56021968, alloc=4848776, time=6.28 TOP MAIN SOLVE Loop x[1] = 0.35 y[1] (analytic) = 0.20170459262085373481743229818684 y[1] (numeric) = 0.20170459262085386026063918322069 absolute error = 1.2544320688503385e-16 relative error = 6.2191547180500137839756955533866e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8886 Order of pole (ratio test) Not computed 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] (analytic) = 0.20481060074133138188948455576787 y[1] (numeric) = 0.20481060074133150853420789282301 absolute error = 1.2664472333705514e-16 relative error = 6.1835043146522963240145922275987e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.8991 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.004 Order of pole (six term test) = -6.531e-27 bytes used=60025176, alloc=4848776, time=6.73 TOP MAIN SOLVE Loop x[1] = 0.37 y[1] (analytic) = 0.20782496089940343565361636156733 y[1] (numeric) = 0.20782496089940356340612804297975 absolute error = 1.2775251168141242e-16 relative error = 6.1471206888979203124965617594326e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9095 Order of pole (ratio test) Not computed 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] (analytic) = 0.2107502667119219726394803786075 y[1] (numeric) = 0.21075026671192210141433805531697 absolute error = 1.2877485767670947e-16 relative error = 6.1103057986984165531737340185746e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.92 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=64026624, alloc=4914300, time=7.19 TOP MAIN SOLVE Loop x[1] = 0.39 y[1] (analytic) = 0.21358899726020304956807983025121 y[1] (numeric) = 0.21358899726020317928731204464556 absolute error = 1.2971923221439435e-16 relative error = 6.0733106048700137846457648147751e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9305 Order of pole (ratio test) Not computed 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.4 y[1] (analytic) = 0.21634352350480582870350653155317 y[1] (numeric) = 0.21634352350480595929588592025861 absolute error = 1.3059237938870544e-16 relative error = 6.0363433706303889784119334224512e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9409 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=68028044, alloc=4914300, time=7.64 TOP MAIN SOLVE Loop x[1] = 0.41 y[1] (analytic) = 0.21901611427715543604054815387425 y[1] (numeric) = 0.2190161142771555674409423627245 absolute error = 1.3140039420885025e-16 relative error = 5.9995765445171182552609481857219e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9514 Order of pole (ratio test) Not computed 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] (analytic) = 0.22160894188020118802868867287301 y[1] (numeric) = 0.22160894188020132017747994106756 absolute error = 1.3214879126819455e-16 relative error = 5.9631524859512396544934106024218e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9618 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.7682 Order of pole (six term test) = -9.338e-27 bytes used=72029840, alloc=4914300, time=8.10 TOP MAIN SOLVE Loop x[1] = 0.43 y[1] (analytic) = 0.22412408732753267000909606055084 y[1] (numeric) = 0.22412408732753280285166156689062 absolute error = 1.3284256550633978e-16 relative error = 5.9271882415835563876167343188181e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9723 Order of pole (ratio test) Not computed 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] (analytic) = 0.22656354524787212913283018658506 y[1] (numeric) = 0.22656354524787226261907623359418 absolute error = 1.3348624604700912e-16 relative error = 5.8917795403037291853977089055499e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9827 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=76030548, alloc=4914300, time=8.55 TOP MAIN SOLVE Loop x[1] = 0.45 y[1] (analytic) = 0.22892922847959484758991802433258 y[1] (numeric) = 0.22892922847959498167386198799074 absolute error = 1.3408394396365816e-16 relative error = 5.8570041429030311094697892692344e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 0.9932 Order of pole (ratio test) Not computed 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.46 y[1] (analytic) = 0.23122297237787487772995502287964 y[1] (numeric) = 0.23122297237787501236934973521343 absolute error = 1.3463939471233379e-16 relative error = 5.8229246569973201330808833482062e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.004 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=80031392, alloc=4914300, time=9.01 TOP MAIN SOLVE Loop x[1] = 0.47 y[1] (analytic) = 0.2334465388551898405686983507198 y[1] (numeric) = 0.23344653885518997572469422543997 absolute error = 1.3515599587472017e-16 relative error = 5.7895909075164883140952330629981e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.014 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=84032160, alloc=4914300, time=9.47 x[1] = 0.48 y[1] (analytic) = 0.23560162017422596384522599111665 y[1] (numeric) = 0.2356016201742260994820667622907 absolute error = 1.3563684077117405e-16 relative error = 5.7570419367605125960955324317087e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.025 Order of pole (ratio test) Not computed 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] (analytic) = 0.23768984251068587685927188746867 y[1] (numeric) = 0.23768984251068601294402031934721 absolute error = 1.3608474843187854e-16 relative error = 5.7253076948696512640887509575390e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.035 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=88033748, alloc=4914300, time=9.92 TOP MAIN SOLVE Loop x[1] = 0.5 y[1] (analytic) = 0.23971276930210150013664396760778 y[1] (numeric) = 0.23971276930210163663893431996424 absolute error = 1.3650229035235646e-16 relative error = 5.6944104709051800838599962063932e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.045 Order of pole (ratio test) Not computed 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.51 y[1] (analytic) = 0.241671904397478957673331800829 y[1] (numeric) = 0.24167190439747909456514620689375 absolute error = 1.3689181440606475e-16 relative error = 5.6643661060790134887817349596798e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.056 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=92034984, alloc=4914300, time=10.38 TOP MAIN SOLVE Loop x[1] = 0.52 y[1] (analytic) = 0.24356869502143956585022497183713 y[1] (numeric) = 0.24356869502143970310569121227646 absolute error = 1.3725546624043933e-16 relative error = 5.6351850236073128347145328097737e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.066 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.2001 Order of pole (six term test) = 1.488e-27 TOP MAIN SOLVE Loop x[1] = 0.53 y[1] (analytic) = 0.24540453456545969020080632158548 y[1] (numeric) = 0.24540453456545982779601476414115 absolute error = 1.3759520844255567e-16 relative error = 5.6068731038811857147028561637934e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.077 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.658 Order of pole (six term test) = -6.190e-27 bytes used=96035940, alloc=4914300, time=10.84 TOP MAIN SOLVE Loop x[1] = 0.54 y[1] (analytic) = 0.24718076521784283878715417449915 y[1] (numeric) = 0.24718076521784297669999190015039 absolute error = 1.3791283772565124e-16 relative error = 5.5794324288990407520889670332701e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.087 Order of pole (ratio test) Not computed 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.55 y[1] (analytic) = 0.248898680443171032280180051313 y[1] (numeric) = 0.24889868044317117049018040869341 absolute error = 1.3821000035738041e-16 relative error = 5.5528619159930319943041464491426e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.098 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=100036680, alloc=4914300, time=11.30 TOP MAIN SOLVE Loop x[1] = 0.56 y[1] (analytic) = 0.25055952732117141691125917033586 y[1] (numeric) = 0.25055952732117155539946519455346 absolute error = 1.3848820602421760e-16 relative error = 5.5271578576495751421437119655890e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.108 Order of pole (ratio test) Not computed 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.57 y[1] (analytic) = 0.25216450875419123410956237994338 y[1] (numeric) = 0.25216450875419137285840268329172 absolute error = 1.3874884030334834e-16 relative error = 5.5023143815452653873224015008450e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.119 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=104038072, alloc=4914300, time=11.76 TOP MAIN SOLVE Loop x[1] = 0.58 y[1] (analytic) = 0.25371478555179331304754447202614 y[1] (numeric) = 0.25371478555179345204072036526341 absolute error = 1.3899317589323727e-16 relative error = 5.4783238426939535151353064825386e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.129 Order of pole (ratio test) Not computed 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.59 y[1] (analytic) = 0.25521147840035953014795567838338 y[1] (numeric) = 0.25521147840035966937033841482124 absolute error = 1.3922238273643786e-16 relative error = 5.4551771577465902072426180159884e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.14 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=108040244, alloc=4914300, time=12.21 TOP MAIN SOLVE Loop x[1] = 0.6 y[1] (analytic) = 0.25665566972501607145497520257212 y[1] (numeric) = 0.25665566972501621089251235535178 absolute error = 1.3943753715277966e-16 relative error = 5.4328640899371009832048321837795e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.15 Order of pole (ratio test) Not computed 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.61 y[1] (analytic) = 0.25804840545066723477070992439762 y[1] (numeric) = 0.25804840545066737441034001193847 absolute error = 1.3963963008754085e-16 relative error = 5.4113734918713400770945374716616e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.16 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.518 Order of pole (six term test) = -4.650e-27 bytes used=112043804, alloc=4914300, time=12.67 TOP MAIN SOLVE Loop x[1] = 0.62 y[1] (analytic) = 0.25939069666843976600132286945634 y[1] (numeric) = 0.25939069666843990583089743679592 absolute error = 1.3982957456733958e-16 relative error = 5.3906935122686200359102868911588e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.171 Order of pole (ratio test) Not computed 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.63 y[1] (analytic) = 0.26068352121339358987527083663479 y[1] (numeric) = 0.2606835212133937298834832826782 absolute error = 1.4000821244604341e-16 relative error = 5.3708117718508846420728513961080e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.181 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=116046132, alloc=4914300, time=13.13 TOP MAIN SOLVE Loop x[1] = 0.64 y[1] (analytic) = 0.26192782515894388240506414000348 y[1] (numeric) = 0.26192782515894402258138465381721 absolute error = 1.4017632051381373e-16 relative error = 5.3517155128040133149943935005678e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.192 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 4.446 Order of pole (six term test) = -5.770e-26 TOP MAIN SOLVE Loop x[1] = 0.65 y[1] (analytic) = 0.26312452423306067842283551243737 y[1] (numeric) = 0.26312452423306081875745154675224 absolute error = 1.4033461603431487e-16 relative error = 5.3333917255852016520526818430989e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.202 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=120049472, alloc=4914300, time=13.59 TOP MAIN SOLVE Loop x[1] = 0.66 y[1] (analytic) = 0.26427450516096283992032132732599 y[1] (numeric) = 0.26427450516096298040408309531112 absolute error = 1.4048376176798513e-16 relative error = 5.3158272563000379030133688717708e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.213 Order of pole (ratio test) Not computed 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.67 y[1] (analytic) = 0.26537862693870071810147175817376 y[1] (numeric) = 0.26537862693870085872584229114321 absolute error = 1.4062437053296945e-16 relative error = 5.2990088974064966436989296692530e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.223 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=124050164, alloc=4914300, time=14.05 TOP MAIN SOLVE Loop x[1] = 0.68 y[1] (analytic) = 0.26643772204172394648482126585604 y[1] (numeric) = 0.26643772204172408724183061560445 absolute error = 1.4075700934974841e-16 relative error = 5.2829234641071570342437712344676e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.234 Order of pole (ratio test) Not computed 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.69 y[1] (analytic) = 0.26745259757225543707455008697845 y[1] (numeric) = 0.26745259757225557795675329755146 absolute error = 1.4088220321057301e-16 relative error = 5.2675578584542272191688427003214e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.244 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=128053756, alloc=4914300, time=14.51 TOP MAIN SOLVE Loop x[1] = 0.7 y[1] (analytic) = 0.26842403634903793903025597974947 y[1] (numeric) = 0.26842403634903808003069449020314 absolute error = 1.4100043851045367e-16 relative error = 5.2528991229052066567068806263137e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.255 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=132056308, alloc=4914300, time=14.98 x[1] = 0.71 y[1] (analytic) = 0.26935279794278375256616858382349 y[1] (numeric) = 0.26935279794278389367833475640711 absolute error = 1.4111216617258362e-16 relative error = 5.2389344848223495037657922051147e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.265 Order of pole (ratio test) Not computed 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.72 y[1] (analytic) = 0.27023961966043981705655894780663 y[1] (numeric) = 0.27023961966043995827436344545146 absolute error = 1.4121780449764483e-16 relative error = 5.2256513932001215923619227229561e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.275 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=136059132, alloc=4914300, time=15.44 TOP MAIN SOLVE Loop x[1] = 0.73 y[1] (analytic) = 0.27108521748117799745227403689493 y[1] (numeric) = 0.27108521748117813877001580028924 absolute error = 1.4131774176339431e-16 relative error = 5.2130375487260307951816386341975e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.286 Order of pole (ratio test) Not computed 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.74 y[1] (analytic) = 0.27189028694683268850156498290652 y[1] (numeric) = 0.27189028694683282991390358112302 absolute error = 1.4141233859821650e-16 relative error = 5.2010809281270591686649728081364e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.296 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.9187 Order of pole (six term test) = 6.366e-27 bytes used=140059860, alloc=4914300, time=15.90 TOP MAIN SOLVE Loop x[1] = 0.75 y[1] (analytic) = 0.27265550400933366669329678111196 y[1] (numeric) = 0.27265550400933380819522693102496 absolute error = 1.4150193014991300e-16 relative error = 5.1897698036225610851341945593117e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.307 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.163 Order of pole (six term test) = -9.73e-28 TOP MAIN SOLVE Loop x[1] = 0.76 y[1] (analytic) = 0.27338152583752037267768080903561 y[1] (numeric) = 0.27338152583752051426450887788438 absolute error = 1.4158682806884877e-16 relative error = 5.1790927581916590853278906287366e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.317 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.2905 Order of pole (six term test) = 5.579e-27 bytes used=144062792, alloc=4914300, time=16.36 TOP MAIN SOLVE Loop x[1] = 0.77 y[1] (analytic) = 0.27406899158557352244877312380008 y[1] (numeric) = 0.27406899158557366411609544645566 absolute error = 1.4166732232265558e-16 relative error = 5.1690386972662062391721294647812e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.328 Order of pole (ratio test) Not computed 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.78 y[1] (analytic) = 0.27471852312516022826870989262419 y[1] (numeric) = 0.27471852312516037001239275060394 absolute error = 1.4174368285797975e-16 relative error = 5.1595968573768911081259348116324e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.338 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=148063752, alloc=4914300, time=16.82 TOP MAIN SOLVE Loop x[1] = 0.79 y[1] (analytic) = 0.27533072574325884101318948642217 y[1] (numeric) = 0.27533072574325898282935060965284 absolute error = 1.4181616112323067e-16 relative error = 5.1507568122081586114930454733630e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.349 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.6939 Order of pole (six term test) = -7.340e-27 TOP MAIN SOLVE Loop x[1] = 0.8 y[1] (analytic) = 0.275906188807508754471990234839 y[1] (numeric) = 0.27590618880750889635698169975656 absolute error = 1.4188499146491756e-16 relative error = 5.1425084764556095614487580947630e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.359 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.8625 Order of pole (six term test) = -3.036e-27 bytes used=152065672, alloc=4914300, time=17.28 TOP MAIN SOLVE Loop x[1] = 0.81 y[1] (analytic) = 0.27644548640081775226266292080708 y[1] (numeric) = 0.27644548640081789421305532974302 absolute error = 1.4195039240893594e-16 relative error = 5.1348421078260020064769935968194e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.37 Order of pole (ratio test) Not computed 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.82 y[1] (analytic) = 0.27694917792685449976564900177565 y[1] (numeric) = 0.27694917792685464177821683884347 absolute error = 1.4201256783706782e-16 relative error = 5.1277483074737629841458314956852e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.38 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=156067236, alloc=4914300, time=17.74 TOP MAIN SOLVE Loop x[1] = 0.83 y[1] (analytic) = 0.27741780868795590929645873163086 y[1] (numeric) = 0.27741780868795605136816679960545 absolute error = 1.4207170806797459e-16 relative error = 5.1212180191279346455849457769785e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.39 Order of pole (ratio test) Not computed 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.84 y[1] (analytic) = 0.27785191043688780643901965322002 y[1] (numeric) = 0.27785191043688794856701050429838 absolute error = 1.4212799085107836e-16 relative error = 5.1152425271289173895513613785387e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.401 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.776 Order of pole (six term test) = -1.030e-27 bytes used=160068728, alloc=4914300, time=18.19 TOP MAIN SOLVE Loop x[1] = 0.85 y[1] (analytic) = 0.27825200190381211211558204601314 y[1] (numeric) = 0.2782520019038122542971643269465 absolute error = 1.4218158228093336e-16 relative error = 5.1098134535644266939784518851949e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.411 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.274 Order of pole (six term test) = -2.871e-27 TOP MAIN SOLVE Loop x[1] = 0.86 y[1] (analytic) = 0.27861858929973418099065762115024 y[1] (numeric) = 0.27861858929973432322329526012619 absolute error = 1.4223263763897595e-16 relative error = 5.1049227546681734832450939467161e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.422 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=164070344, alloc=4914300, time=18.66 TOP MAIN SOLVE Loop x[1] = 0.87 y[1] (analytic) = 0.27895216679762959056379665099374 y[1] (numeric) = 0.27895216679762973284509881989371 absolute error = 1.4228130216889997e-16 relative error = 5.1005627166223184970557774214551e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.432 Order of pole (ratio test) Not computed 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.88 y[1] (analytic) = 0.27925321699238017797450910534637 y[1] (numeric) = 0.27925321699238032030222089667211 absolute error = 1.4232771179132574e-16 relative error = 5.0967259508852624772392382029113e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.443 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=168072100, alloc=4914300, time=19.11 TOP MAIN SOLVE Loop x[1] = 0.89 y[1] (analytic) = 0.27952221134058412427709845790402 y[1] (numeric) = 0.27952221134058426664909222081502 absolute error = 1.4237199376291100e-16 relative error = 5.0934053891494761607630235076893e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.453 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 2.229 Order of pole (six term test) = 1.456e-26 TOP MAIN SOLVE Loop x[1] = 0.9 y[1] (analytic) = 0.27975961058124406730763654132627 y[1] (numeric) = 0.27975961058124420972190382590811 absolute error = 1.4241426728458184e-16 relative error = 5.0905942780194062925345755401097e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.464 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.7951 Order of pole (six term test) = -2.385e-27 bytes used=172073456, alloc=4914300, time=19.57 TOP MAIN SOLVE Loop x[1] = 0.91 y[1] (analytic) = 0.27996586513828028790033954534452 y[1] (numeric) = 0.27996586513828043035498360848288 absolute error = 1.4245464406313836e-16 relative error = 5.0882861734868067684284557666637e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.474 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.5731 Order of pole (six term test) = -3.075e-27 TOP MAIN SOLVE Loop x[1] = 0.92 y[1] (analytic) = 0.28014141550576268671418172622592 y[1] (numeric) = 0.28014141550576282920741055633258 absolute error = 1.4249322883010666e-16 relative error = 5.0864749352698078248573079068673e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.485 bytes used=176074788, alloc=4914300, time=20.03 Order of pole (ratio test) Not computed 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.93 y[1] (analytic) = 0.2802866926167052979315801454233 y[1] (numeric) = 0.28028669261670544046169996678678 absolute error = 1.4253011982136348e-16 relative error = 5.0851547210724972369105710463866e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.495 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=180075660, alloc=4914300, time=20.49 x[1] = 0.94 y[1] (analytic) = 0.28040211819622023849660409674797 y[1] (numeric) = 0.28040211819622038106201331749393 absolute error = 1.4256540922074596e-16 relative error = 5.0843199808134584802663067322106e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.505 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 0.8314 Order of pole (six term test) = -3.812e-27 TOP MAIN SOLVE Loop x[1] = 0.95 y[1] (analytic) = 0.28048810509978405196049038003537 y[1] (numeric) = 0.28048810509978419455967395061244 absolute error = 1.4259918357057707e-16 relative error = 5.0839654508645634982830822498052e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.516 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=184078332, alloc=4914300, time=20.96 TOP MAIN SOLVE Loop x[1] = 0.96 y[1] (analytic) = 0.28054505763732817521685689946248 y[1] (numeric) = 0.2805450576373283178483810512422 absolute error = 1.4263152415177972e-16 relative error = 5.0840861483350457051051406458952e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.526 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.288 Order of pole (six term test) = 7.09e-28 TOP MAIN SOLVE Loop x[1] = 0.97 y[1] (analytic) = 0.28057337188382655016211565913481 y[1] (numeric) = 0.28057337188382669282462299515533 absolute error = 1.4266250733602052e-16 relative error = 5.0846773654304932075117424490788e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.537 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 2.405 Order of pole (six term test) = 3.718e-27 bytes used=188079220, alloc=4914300, time=21.42 TOP MAIN SOLVE Loop x[1] = 0.98 y[1] (analytic) = 0.28057343597701705002855854314836 y[1] (numeric) = 0.28057343597701719272076345526205 absolute error = 1.4269220491211369e-16 relative error = 5.0857346639117399743741569013098e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.547 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.622 Order of pole (six term test) = -6.833e-27 TOP MAIN SOLVE Loop x[1] = 0.99 y[1] (analytic) = 0.28054563040285923382189913139165 y[1] (numeric) = 0.28054563040285937654258352011518 absolute error = 1.4272068438872353e-16 relative error = 5.0872538696745627575999460451713e-14 % Correct digits = 16 h = 0.001 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 1.558 Order of pole (ratio test) Not computed NO REAL POLE (three term test) for Equation 1 Radius of convergence (six term test) for eq 1 = 1.045 Order of pole (six term test) = 3.260e-27 bytes used=192081544, alloc=4914300, time=21.88 Finished! diff( y , x , 1 ) = cos ( x ) / ( 2.0 * x + 1.0 ) - 2.0 * sin ( x ) / ( 2.0 * x + 1.0 ) / ( 2.0 * x + 1.0 ) ; Iterations = 900 Total Elapsed Time = 21 Seconds Elapsed Time(since restart) = 21 Seconds Time to Timeout = 2 Minutes 38 Seconds Percent Done = 100.1 % > quit bytes used=192652052, alloc=4914300, time=21.94