|\^/| 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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 - 3 - 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 - 3 - 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 - 3 - 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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 - 13; 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 - 4; 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 - 4; 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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 diff $eq_no = 1 i = 1 order_d = 1 > array_tmp1[1] := array_y_higher[2,1]; > # emit pre mult FULL FULL $eq_no = 1 i = 1 > array_tmp2[1] := (array_m1[1] * (array_tmp1[1])); > #emit pre add CONST FULL $eq_no = 1 i = 1 > array_tmp3[1] := array_const_0D0[1] + array_tmp2[1]; > #emit pre assign xxx $eq_no = 1 i = 1 $min_hdrs = 5 > if ( not array_y_set_initial[1,4]) then # if number 1 > if (1 <= glob_max_terms) then # if number 2 > temporary := array_tmp3[1] * expt(glob_h , (3)) * factorial_3(0,3); > array_y[4] := temporary; > array_y_higher[1,4] := temporary; > temporary := temporary / glob_h * (3.0); > array_y_higher[2,3] := temporary; > temporary := temporary / glob_h * (2.0); > array_y_higher[3,2] := temporary; > temporary := temporary / glob_h * (1.0); > array_y_higher[4,1] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 2; > #END ATOMHDR1 > #BEGIN ATOMHDR2 > #emit pre diff $eq_no = 1 i = 2 order_d = 1 > array_tmp1[2] := array_y_higher[2,2]; > # emit pre mult FULL FULL $eq_no = 1 i = 2 > array_tmp2[2] := ats(2,array_m1,array_tmp1,1); > #emit pre add CONST FULL $eq_no = 1 i = 2 > array_tmp3[2] := array_tmp2[2]; > #emit pre assign xxx $eq_no = 1 i = 2 $min_hdrs = 5 > if ( not array_y_set_initial[1,5]) then # if number 1 > if (2 <= glob_max_terms) then # if number 2 > temporary := array_tmp3[2] * expt(glob_h , (3)) * factorial_3(1,4); > array_y[5] := temporary; > array_y_higher[1,5] := temporary; > temporary := temporary / glob_h * (4.0); > array_y_higher[2,4] := temporary; > temporary := temporary / glob_h * (3.0); > array_y_higher[3,3] := temporary; > temporary := temporary / glob_h * (2.0); > array_y_higher[4,2] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 3; > #END ATOMHDR2 > #BEGIN ATOMHDR3 > #emit pre diff $eq_no = 1 i = 3 order_d = 1 > array_tmp1[3] := array_y_higher[2,3]; > # emit pre mult FULL FULL $eq_no = 1 i = 3 > array_tmp2[3] := ats(3,array_m1,array_tmp1,1); > #emit pre add CONST FULL $eq_no = 1 i = 3 > array_tmp3[3] := array_tmp2[3]; > #emit pre assign xxx $eq_no = 1 i = 3 $min_hdrs = 5 > if ( not array_y_set_initial[1,6]) then # if number 1 > if (3 <= glob_max_terms) then # if number 2 > temporary := array_tmp3[3] * expt(glob_h , (3)) * factorial_3(2,5); > array_y[6] := temporary; > array_y_higher[1,6] := temporary; > temporary := temporary / glob_h * (5.0); > array_y_higher[2,5] := temporary; > temporary := temporary / glob_h * (4.0); > array_y_higher[3,4] := temporary; > temporary := temporary / glob_h * (3.0); > array_y_higher[4,3] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 4; > #END ATOMHDR3 > #BEGIN ATOMHDR4 > #emit pre diff $eq_no = 1 i = 4 order_d = 1 > array_tmp1[4] := array_y_higher[2,4]; > # emit pre mult FULL FULL $eq_no = 1 i = 4 > array_tmp2[4] := ats(4,array_m1,array_tmp1,1); > #emit pre add CONST FULL $eq_no = 1 i = 4 > array_tmp3[4] := array_tmp2[4]; > #emit pre assign xxx $eq_no = 1 i = 4 $min_hdrs = 5 > if ( not array_y_set_initial[1,7]) then # if number 1 > if (4 <= glob_max_terms) then # if number 2 > temporary := array_tmp3[4] * expt(glob_h , (3)) * factorial_3(3,6); > array_y[7] := temporary; > array_y_higher[1,7] := temporary; > temporary := temporary / glob_h * (6.0); > array_y_higher[2,6] := temporary; > temporary := temporary / glob_h * (5.0); > array_y_higher[3,5] := temporary; > temporary := temporary / glob_h * (4.0); > array_y_higher[4,4] := temporary; > fi;# end if 2; > fi;# end if 1; > kkk := 5; > #END ATOMHDR4 > #BEGIN ATOMHDR5 > #emit pre diff $eq_no = 1 i = 5 order_d = 1 > array_tmp1[5] := array_y_higher[2,5]; > # emit pre mult FULL FULL $eq_no = 1 i = 5 > array_tmp2[5] := ats(5,array_m1,array_tmp1,1); > #emit pre add CONST FULL $eq_no = 1 i = 5 > array_tmp3[5] := array_tmp2[5]; > #emit pre assign xxx $eq_no = 1 i = 5 $min_hdrs = 5 > if ( not array_y_set_initial[1,8]) then # if number 1 > if (5 <= glob_max_terms) then # if number 2 > temporary := array_tmp3[5] * expt(glob_h , (3)) * factorial_3(4,7); > array_y[8] := temporary; > array_y_higher[1,8] := temporary; > temporary := temporary / glob_h * (7.0); > array_y_higher[2,7] := temporary; > temporary := temporary / glob_h * (6.0); > array_y_higher[3,6] := temporary; > temporary := temporary / glob_h * (5.0); > array_y_higher[4,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 diff $eq_no = 1 > array_tmp1[kkk] := array_y_higher[2,kkk]; > #emit mult FULL FULL $eq_no = 1 > array_tmp2[kkk] := ats(kkk,array_m1,array_tmp1,1); > #emit NOT FULL - FULL add $eq_no = 1 > array_tmp3[kkk] := array_tmp2[kkk]; > #emit assign $eq_no = 1 > order_d := 3; > 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_tmp3[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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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] := array_y_higher[2, 1]; array_tmp2[1] := array_m1[1]*array_tmp1[1]; array_tmp3[1] := array_const_0D0[1] + array_tmp2[1]; if not array_y_set_initial[1, 4] then if 1 <= glob_max_terms then temporary := array_tmp3[1]*expt(glob_h, 3)*factorial_3(0, 3); array_y[4] := temporary; array_y_higher[1, 4] := temporary; temporary := temporary*3.0/glob_h; array_y_higher[2, 3] := temporary; temporary := temporary*2.0/glob_h; array_y_higher[3, 2] := temporary; temporary := temporary*1.0/glob_h; array_y_higher[4, 1] := temporary end if end if; kkk := 2; array_tmp1[2] := array_y_higher[2, 2]; array_tmp2[2] := ats(2, array_m1, array_tmp1, 1); array_tmp3[2] := array_tmp2[2]; if not array_y_set_initial[1, 5] then if 2 <= glob_max_terms then temporary := array_tmp3[2]*expt(glob_h, 3)*factorial_3(1, 4); array_y[5] := temporary; array_y_higher[1, 5] := temporary; temporary := temporary*4.0/glob_h; array_y_higher[2, 4] := temporary; temporary := temporary*3.0/glob_h; array_y_higher[3, 3] := temporary; temporary := temporary*2.0/glob_h; array_y_higher[4, 2] := temporary end if end if; kkk := 3; array_tmp1[3] := array_y_higher[2, 3]; array_tmp2[3] := ats(3, array_m1, array_tmp1, 1); array_tmp3[3] := array_tmp2[3]; if not array_y_set_initial[1, 6] then if 3 <= glob_max_terms then temporary := array_tmp3[3]*expt(glob_h, 3)*factorial_3(2, 5); array_y[6] := temporary; array_y_higher[1, 6] := temporary; temporary := temporary*5.0/glob_h; array_y_higher[2, 5] := temporary; temporary := temporary*4.0/glob_h; array_y_higher[3, 4] := temporary; temporary := temporary*3.0/glob_h; array_y_higher[4, 3] := temporary end if end if; kkk := 4; array_tmp1[4] := array_y_higher[2, 4]; array_tmp2[4] := ats(4, array_m1, array_tmp1, 1); array_tmp3[4] := array_tmp2[4]; if not array_y_set_initial[1, 7] then if 4 <= glob_max_terms then temporary := array_tmp3[4]*expt(glob_h, 3)*factorial_3(3, 6); array_y[7] := temporary; array_y_higher[1, 7] := temporary; temporary := temporary*6.0/glob_h; array_y_higher[2, 6] := temporary; temporary := temporary*5.0/glob_h; array_y_higher[3, 5] := temporary; temporary := temporary*4.0/glob_h; array_y_higher[4, 4] := temporary end if end if; kkk := 5; array_tmp1[5] := array_y_higher[2, 5]; array_tmp2[5] := ats(5, array_m1, array_tmp1, 1); array_tmp3[5] := array_tmp2[5]; if not array_y_set_initial[1, 8] then if 5 <= glob_max_terms then temporary := array_tmp3[5]*expt(glob_h, 3)*factorial_3(4, 7); array_y[8] := temporary; array_y_higher[1, 8] := temporary; temporary := temporary*7.0/glob_h; array_y_higher[2, 7] := temporary; temporary := temporary*6.0/glob_h; array_y_higher[3, 6] := temporary; temporary := temporary*5.0/glob_h; array_y_higher[4, 5] := temporary end if end if; kkk := 6; while kkk <= glob_max_terms do array_tmp1[kkk] := array_y_higher[2, kkk]; array_tmp2[kkk] := ats(kkk, array_m1, array_tmp1, 1); array_tmp3[kkk] := array_tmp2[kkk]; order_d := 3; if kkk + order_d < glob_max_terms then if not array_y_set_initial[1, kkk + order_d] then temporary := array_tmp3[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( - cos(x)); > end; exact_soln_y := proc(x) return -cos(x) end proc > exact_soln_yp := proc(x) > return( sin(x)); > end; exact_soln_yp := proc(x) return sin(x) end proc > exact_soln_ypp := proc(x) > return( cos(x)); > end; exact_soln_ypp := proc(x) return cos(x) 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_3, > array_const_0D0, > array_const_1, > #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, > array_tmp2, > array_tmp3, > 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/diff2postode.ode#################"); > omniout_str(ALWAYS,"diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ;"); > omniout_str(ALWAYS,"!"); > omniout_str(ALWAYS,"#BEGIN FIRST INPUT BLOCK"); > omniout_str(ALWAYS,"Digits:=32;"); > omniout_str(ALWAYS,"max_terms:=30;"); > omniout_str(ALWAYS,"!"); > omniout_str(ALWAYS,"#END FIRST INPUT BLOCK"); > omniout_str(ALWAYS,"#BEGIN SECOND INPUT BLOCK"); > omniout_str(ALWAYS,"x_start := -1.0;"); > omniout_str(ALWAYS,"x_end := 1.0 ;"); > omniout_str(ALWAYS,"array_y_init[0 + 1] := exact_soln_y(x_start);"); > omniout_str(ALWAYS,"array_y_init[1 + 1] := exact_soln_yp(x_start);"); > omniout_str(ALWAYS,"array_y_init[2 + 1] := exact_soln_ypp(x_start);"); > omniout_str(ALWAYS,"glob_look_poles := true;"); > omniout_str(ALWAYS,"glob_max_iter := 1000000000;"); > omniout_str(ALWAYS,"glob_display_interval := 0.1;"); > omniout_str(ALWAYS,"glob_max_minutes := 10;"); > 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( - cos(x));"); > omniout_str(ALWAYS,"end;"); > omniout_str(ALWAYS,"exact_soln_yp := proc(x)"); > omniout_str(ALWAYS,"return( sin(x));"); > omniout_str(ALWAYS,"end;"); > omniout_str(ALWAYS,"exact_soln_ypp := proc(x)"); > omniout_str(ALWAYS,"return( cos(x));"); > omniout_str(ALWAYS,"end;"); > omniout_str(ALWAYS,"#END USER DEF BLOCK"); > omniout_str(ALWAYS,"#######END OF ECHO OF PROBLEM#################"); > glob_unchanged_h_cnt := 0; > glob_warned := false; > glob_warned2 := false; > glob_small_float := 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:= Array(0..(max_terms + 1),[]); > array_tmp2:= Array(0..(max_terms + 1),[]); > array_tmp3:= Array(0..(max_terms + 1),[]); > array_m1:= Array(0..(max_terms + 1),[]); > array_y_higher := Array(0..(4+ 1) ,(0..max_terms+ 1),[]); > array_y_higher_work := Array(0..(4+ 1) ,(0..max_terms+ 1),[]); > array_y_higher_work2 := Array(0..(4+ 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[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_m1[term] := 0.0; > term := term + 1; > od;# end do number 1; > ord := 1; > while (ord <=4) 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 <=4) 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 <=4) 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_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_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 := 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_const_3 := Array(1..(max_terms+1 + 1),[]); > term := 1; > while (term <= max_terms + 1) do # do number 1 > array_const_3[term] := 0.0; > term := term + 1; > od;# end do number 1; > array_const_3[1] := 3; > 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_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_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 := -1.0; > x_end := 1.0 ; > array_y_init[0 + 1] := exact_soln_y(x_start); > array_y_init[1 + 1] := exact_soln_yp(x_start); > array_y_init[2 + 1] := exact_soln_ypp(x_start); > glob_look_poles := true; > glob_max_iter := 1000000000; > glob_display_interval := 0.1; > glob_max_minutes := 10; > #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] := true; > array_y_set_initial[1,3] := true; > 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 := 3; > #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 := 3; > #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 := 4; > #START PART 1 SUM AND ADJUST > #START SUM AND ADJUST EQ =1 > #sum_and_adjust array_y > #BEFORE ADJUST SUBSERIES EQ =1 > ord := 4; > calc_term := 1; > #adjust_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[4,iii] := array_y_higher[4,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 := 4; > 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 := 3; > calc_term := 2; > #adjust_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[3,iii] := array_y_higher[3,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 := 3; > 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 := 3; > calc_term := 1; > #adjust_subseriesarray_y > iii := glob_max_terms; > while (iii >= calc_term) do # do number 2 > array_y_higher_work[3,iii] := array_y_higher[3,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 := 3; > 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 := 2; > calc_term := 3; > #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 := 3; > #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 := 2; > calc_term := 2; > #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 := 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 := 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 := 4; > #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 := 4; > #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 := 3; > #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 := 3; > #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 , 3 ) = m1 * diff ( y , x , 1 ) ;"); > 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:19:21-05:00") > ; > logitem_str(html_log_file,"Maple") > ; > logitem_str(html_log_file,"diff2") > ; > logitem_str(html_log_file,"diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ;") > ; > 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,"diff2 diffeq.mxt") > ; > logitem_str(html_log_file,"diff2 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_3, array_const_0D0, array_const_1, 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, array_tmp2, array_tmp3, 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/diff2postode.ode#################"); omniout_str(ALWAYS, "diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ;"); omniout_str(ALWAYS, "!"); omniout_str(ALWAYS, "#BEGIN FIRST INPUT BLOCK"); omniout_str(ALWAYS, "Digits:=32;"); omniout_str(ALWAYS, "max_terms:=30;"); omniout_str(ALWAYS, "!"); omniout_str(ALWAYS, "#END FIRST INPUT BLOCK"); omniout_str(ALWAYS, "#BEGIN SECOND INPUT BLOCK"); omniout_str(ALWAYS, "x_start := -1.0;"); omniout_str(ALWAYS, "x_end := 1.0 ;"); omniout_str(ALWAYS, "array_y_init[0 + 1] := exact_soln_y(x_start);"); omniout_str(ALWAYS, "array_y_init[1 + 1] := exact_soln_yp(x_start);"); omniout_str(ALWAYS, "array_y_init[2 + 1] := exact_soln_ypp(x_start);"); omniout_str(ALWAYS, "glob_look_poles := true;"); omniout_str(ALWAYS, "glob_max_iter := 1000000000;"); omniout_str(ALWAYS, "glob_display_interval := 0.1;"); omniout_str(ALWAYS, "glob_max_minutes := 10;"); 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( - cos(x));"); omniout_str(ALWAYS, "end;"); omniout_str(ALWAYS, "exact_soln_yp := proc(x)"); omniout_str(ALWAYS, "return( sin(x));"); omniout_str(ALWAYS, "end;"); omniout_str(ALWAYS, "exact_soln_ypp := proc(x)"); omniout_str(ALWAYS, "return( cos(x));"); omniout_str(ALWAYS, "end;"); omniout_str(ALWAYS, "#END USER DEF BLOCK"); omniout_str(ALWAYS, "#######END OF ECHO OF PROBLEM#################"); glob_unchanged_h_cnt := 0; glob_warned := false; glob_warned2 := false; glob_small_float := 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 := Array(0 .. max_terms + 1, []); array_tmp2 := Array(0 .. max_terms + 1, []); array_tmp3 := Array(0 .. max_terms + 1, []); array_m1 := Array(0 .. max_terms + 1, []); array_y_higher := Array(0 .. 5, 0 .. max_terms + 1, []); array_y_higher_work := Array(0 .. 5, 0 .. max_terms + 1, []); array_y_higher_work2 := Array(0 .. 5, 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[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_m1[term] := 0.; term := term + 1 end do; ord := 1; while ord <= 4 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 <= 4 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 <= 4 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_m1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_m1[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 := 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_const_3 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_3[term] := 0.; term := term + 1 end do; array_const_3[1] := 3; array_const_0D0 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_0D0[term] := 0.; term := term + 1 end do; array_const_0D0[1] := 0.; array_const_1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms + 1 do array_const_1[term] := 0.; term := term + 1 end do; array_const_1[1] := 1; array_m1 := Array(1 .. max_terms + 2, []); term := 1; while term <= max_terms do array_m1[term] := 0.; term := term + 1 end do; array_m1[1] := -1.0; iiif := 0; while iiif <= glob_max_terms do jjjf := 0; while jjjf <= glob_max_terms do array_fact_1[iiif] := 0; array_fact_2[iiif, jjjf] := 0; jjjf := jjjf + 1 end do; iiif := iiif + 1 end do; x_start := -1.0; x_end := 1.0; array_y_init[1] := exact_soln_y(x_start); array_y_init[2] := exact_soln_yp(x_start); array_y_init[3] := exact_soln_ypp(x_start); glob_look_poles := true; glob_max_iter := 1000000000; glob_display_interval := 0.1; glob_max_minutes := 10; 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] := true; array_y_set_initial[1, 3] := true; 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 := 3; 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 := 3; 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 := 4; ord := 4; calc_term := 1; iii := glob_max_terms; while calc_term <= iii do array_y_higher_work[4, iii] := array_y_higher[4, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 4; 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 := 3; calc_term := 2; iii := glob_max_terms; while calc_term <= iii do array_y_higher_work[3, iii] := array_y_higher[3, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 3; 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 := 3; calc_term := 1; iii := glob_max_terms; while calc_term <= iii do array_y_higher_work[3, iii] := array_y_higher[3, iii]/( expt(glob_h, calc_term - 1)* factorial_3(iii - calc_term, iii - 1)); iii := iii - 1 end do; temp_sum := 0.; ord := 3; 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 := 2; calc_term := 3; 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 := 3; 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 := 2; calc_term := 2; 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 := 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 := 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 := 4; 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 := 4; 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 := 3; 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 := 3; 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 , 3 ) = m1 * diff ( y , x , 1 ) ;") ; 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:19:21-05:00"); logitem_str(html_log_file, "Maple"); logitem_str(html_log_file, "diff2") ; logitem_str(html_log_file, "diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ;"); 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, "diff2 diffeq.mxt"); logitem_str(html_log_file, "diff2 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/diff2postode.ode################# diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ; ! #BEGIN FIRST INPUT BLOCK Digits:=32; max_terms:=30; ! #END FIRST INPUT BLOCK #BEGIN SECOND INPUT BLOCK x_start := -1.0; x_end := 1.0 ; array_y_init[0 + 1] := exact_soln_y(x_start); array_y_init[1 + 1] := exact_soln_yp(x_start); array_y_init[2 + 1] := exact_soln_ypp(x_start); glob_look_poles := true; glob_max_iter := 1000000000; glob_display_interval := 0.1; glob_max_minutes := 10; #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( - cos(x)); end; exact_soln_yp := proc(x) return( sin(x)); end; exact_soln_ypp := proc(x) return( cos(x)); 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 = 2 estimated_steps = 2000000 step_error = 5.0000000000000000000000000000000e-17 est_needed_step_err = 5.0000000000000000000000000000000e-17 opt_iter = 1 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.3397316172814231263197778706802e-183 estimated_step_error = 1.3397316172814231263197778706802e-183 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 = 8.9907869493661251410917409382049e-176 estimated_step_error = 8.9907869493661251410917409382049e-176 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 = 6.0336153344093950755591305624719e-168 estimated_step_error = 6.0336153344093950755591305624719e-168 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 = 4.0490911761692463631124940029652e-160 estimated_step_error = 4.0490911761692463631124940029652e-160 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 = 2.7172997176055611365908212378212e-152 estimated_step_error = 2.7172997176055611365908212378212e-152 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 = 1.8235498134436724182692961423013e-144 estimated_step_error = 1.8235498134436724182692961423013e-144 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 = 1.2237646936954100969178329101706e-136 estimated_step_error = 1.2237646936954100969178329101706e-136 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 = 8.2125609985124731086453418318560e-129 estimated_step_error = 8.2125609985124731086453418318560e-129 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 = 5.5113767371499060878978713699027e-121 estimated_step_error = 5.5113767371499060878978713699027e-121 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 = 3.6986496265328216768356578036918e-113 estimated_step_error = 3.6986496265328216768356578036918e-113 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 = 2.4821583988511603573313554542731e-105 estimated_step_error = 2.4821583988511603573313554542731e-105 best_h = 0.002048 opt_iter = 12 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.6657974956169852647113792850330e-97 estimated_step_error = 1.6657974956169852647113792850330e-97 best_h = 0.004096 opt_iter = 13 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.1179637971932414217221329296398e-89 estimated_step_error = 1.1179637971932414217221329296398e-89 best_h = 0.008192 opt_iter = 14 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 7.5034141033298235005559105438972e-82 estimated_step_error = 7.5034141033298235005559105438972e-82 best_h = 0.016384 opt_iter = 15 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 5.0366450493936106961019402223875e-74 estimated_step_error = 5.0366450493936106961019402223875e-74 best_h = 0.032768 opt_iter = 16 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 3.3816307872806817665744962933748e-66 estimated_step_error = 3.3816307872806817665744962933748e-66 best_h = 0.065536 opt_iter = 17 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 2.2715142569750776437942565645012e-58 estimated_step_error = 2.2715142569750776437942565645012e-58 best_h = 0.131072 opt_iter = 18 hn_div_ho = 0.5 hn_div_ho_2 = 0.25 hn_div_ho_3 = 0.125 max_estimated_step_error = 1.5272567681677524975950004554179e-50 estimated_step_error = 1.5272567681677524975950004554179e-50 best_h = 0.1 START of Soultion TOP MAIN SOLVE Loop x[1] = -1 y[1] (analytic) = -0.54030230586813971740093660744298 y[1] (numeric) = -0.54030230586813971740093660744298 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.437 Order of pole (three term test) = -7.36 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.99 y[1] (analytic) = -0.54868986058158757534312640865361 y[1] (numeric) = -0.54868986058158757534312640865362 absolute error = 1e-32 relative error = 1.8225231990619311821271370478539e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4409 Order of pole (three term test) = -7.562 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.98 y[1] (analytic) = -0.55702254676621730087665826735994 y[1] (numeric) = -0.55702254676621730087665826735995 absolute error = 1e-32 relative error = 1.7952594662558616386636592855259e-30 % Correct digits = 32 h = 0.01 bytes used=4000084, alloc=3079628, time=0.38 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4446 Order of pole (three term test) = -7.766 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.97 y[1] (analytic) = -0.56529953116035431303652775484986 y[1] (numeric) = -0.56529953116035431303652775484987 absolute error = 1e-32 relative error = 1.7689736942596852047933142508645e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4481 Order of pole (three term test) = -7.972 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.96 y[1] (analytic) = -0.57351998607245666212505080035186 y[1] (numeric) = -0.57351998607245666212505080035187 absolute error = 1e-32 relative error = 1.7436183991566481011479254485116e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4515 Order of pole (three term test) = -8.18 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.95 y[1] (analytic) = -0.58168308946388349416618097376046 y[1] (numeric) = -0.58168308946388349416618097376047 absolute error = 1e-32 relative error = 1.7191491692180088054618740078576e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4547 Order of pole (three term test) = -8.389 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.94 y[1] (analytic) = -0.58978802503109822996098981522402 y[1] (numeric) = -0.58978802503109822996098981522403 absolute error = 1e-32 relative error = 1.6955244215873528317788450478026e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.42 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4577 Order of pole (three term test) = -8.599 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.93 y[1] (analytic) = -0.59783398228729823849490708443298 y[1] (numeric) = -0.597833982287298238494907084433 absolute error = 2e-32 relative error = 3.3454103635060167849777977091353e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.68 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4605 Order of pole (three term test) = -8.811 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.92 y[1] (analytic) = -0.60582015664346284179740470667438 y[1] (numeric) = -0.60582015664346284179740470667439 absolute error = 1e-32 relative error = 1.6506548833576031067674696397598e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.94 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4632 Order of pole (three term test) = -9.024 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.91 y[1] (analytic) = -0.61374574948881154652117822617468 y[1] (numeric) = -0.61374574948881154652117822617469 absolute error = 1e-32 relative error = 1.6293391861905347267678537725338e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.22 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4656 Order of pole (three term test) = -9.239 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.9 y[1] (analytic) = -0.62160996827066445648471615140713 y[1] (numeric) = -0.62160996827066445648471615140714 absolute error = 1e-32 relative error = 1.6087258104660495130240128623064e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.49 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4679 Order of pole (three term test) = -9.454 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.89 y[1] (analytic) = -0.62941202657369688020355305738025 y[1] (numeric) = -0.62941202657369688020355305738026 absolute error = 1e-32 relative error = 1.5887843857125782890595346514415e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.77 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.47 Order of pole (three term test) = -9.67 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.88 y[1] (analytic) = -0.63715114419858020801549860572209 y[1] (numeric) = -0.6371511441985802080154986057221 absolute error = 1e-32 relative error = 1.5694863127928890315672260421183e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.05 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4719 Order of pole (three term test) = -9.887 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.87 y[1] (analytic) = -0.64482654724000119477766380548283 y[1] (numeric) = -0.64482654724000119477766380548284 absolute error = 1e-32 relative error = 1.5508046377436210517474071140389e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.34 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4736 Order of pole (three term test) = -10.11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.86 y[1] (analytic) = -0.65243746816405184627203066422386 y[1] (numeric) = -0.65243746816405184627203066422387 absolute error = 1e-32 relative error = 1.5327139362703728856785609726008e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.64 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4751 Order of pole (three term test) = -10.32 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.85 y[1] (analytic) = -0.65998314588498217039541602946147 y[1] (numeric) = -0.65998314588498217039541602946148 absolute error = 1e-32 relative error = 1.5151902078636927633703548871492e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.93 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4764 Order of pole (three term test) = -10.54 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.84 y[1] (analytic) = -0.66746282584130811792267103687086 y[1] (numeric) = -0.66746282584130811792267103687087 absolute error = 1e-32 relative error = 1.4982107786145889242480292904049e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.24 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4776 Order of pole (three term test) = -10.76 NO COMPLEX POLE (six term test) for Equation 1 bytes used=8002808, alloc=4324584, time=0.76 TOP MAIN SOLVE Loop x[1] = -0.83 y[1] (analytic) = -0.67487576007126710211246291786445 y[1] (numeric) = -0.67487576007126710211246291786447 absolute error = 2e-32 relative error = 2.9635084238153691318662949969539e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.55 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4785 Order of pole (three term test) = -10.98 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.82 y[1] (analytic) = -0.68222120728761355166655797843693 y[1] (numeric) = -0.68222120728761355166655797843695 absolute error = 2e-32 relative error = 2.9316004525154433989688989109211e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.86 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4793 Order of pole (three term test) = -11.21 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.81 y[1] (analytic) = -0.6894984329517470175496392406801 y[1] (numeric) = -0.68949843295174701754963924068012 absolute error = 2e-32 relative error = 2.9006592392646749631796699844823e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.18 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4798 Order of pole (three term test) = -11.43 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.8 y[1] (analytic) = -0.69670670934716542092074998164232 y[1] (numeric) = -0.69670670934716542092074998164234 absolute error = 2e-32 relative error = 2.8706483993444796009939048163257e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.51 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4802 Order of pole (three term test) = -11.65 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.79 y[1] (analytic) = -0.70384531565223609691278086108495 y[1] (numeric) = -0.70384531565223609691278086108497 absolute error = 2e-32 relative error = 2.8415334385605014942610583502002e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.84 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4804 Order of pole (three term test) = -11.87 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.78 y[1] (analytic) = -0.71091353801227735721626502376456 y[1] (numeric) = -0.71091353801227735721626502376458 absolute error = 2e-32 relative error = 2.8132816342083224421967142135470e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.18 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4804 Order of pole (three term test) = -12.09 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.77 y[1] (analytic) = -0.71791066961094336337129056532434 y[1] (numeric) = -0.71791066961094336337129056532436 absolute error = 2e-32 relative error = 2.7858619249716097277693846674882e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.45 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4801 Order of pole (three term test) = -12.31 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.76 y[1] (analytic) = -0.72483601074090517233968836666701 y[1] (numeric) = -0.72483601074090517233968836666702 absolute error = 1e-32 relative error = 1.3796224044909559951870120177153e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.11 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4797 Order of pole (three term test) = -12.53 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.75 y[1] (analytic) = -0.73168886887382088631183875300008 y[1] (numeric) = -0.7316888688738208863118387530001 absolute error = 2e-32 relative error = 2.7334022493444522704301373203136e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.77 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4792 Order of pole (three term test) = -12.75 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.74 y[1] (analytic) = -0.73846855872958790979142456069883 y[1] (numeric) = -0.73846855872958790979142456069885 absolute error = 2e-32 relative error = 2.7083075865012678425941625899104e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.44 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4784 Order of pole (three term test) = -12.98 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.73 y[1] (analytic) = -0.74517440234487038879013215855033 y[1] (numeric) = -0.74517440234487038879013215855035 absolute error = 2e-32 relative error = 2.6839354568628756191548285450706e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.11 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4774 Order of pole (three term test) = -13.2 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.72 y[1] (analytic) = -0.75180572914089497944548696225195 y[1] (numeric) = -0.75180572914089497944548696225196 absolute error = 1e-32 relative error = 1.3301308585965713491100945769746e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.79 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4762 Order of pole (three term test) = -13.42 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.71 y[1] (analytic) = -0.75836187599050816654145794413955 y[1] (numeric) = -0.75836187599050816654145794413957 absolute error = 2e-32 relative error = 2.6372633742799492530594693858876e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.47 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4749 Order of pole (three term test) = -13.64 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.7 y[1] (analytic) = -0.76484218728448842625585999019186 y[1] (numeric) = -0.76484218728448842625585999019188 absolute error = 2e-32 relative error = 2.6149185194671877397493456706106e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.16 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4733 Order of pole (three term test) = -13.85 NO COMPLEX POLE (six term test) for Equation 1 bytes used=12007288, alloc=4390108, time=1.13 TOP MAIN SOLVE Loop x[1] = -0.69 y[1] (analytic) = -0.77124601499710660197353931549777 y[1] (numeric) = -0.77124601499710660197353931549778 absolute error = 1e-32 relative error = 1.2966031338311052264542717392827e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.86 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4716 Order of pole (three term test) = -14.07 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.68 y[1] (analytic) = -0.77757271875092793718239408404432 y[1] (numeric) = -0.77757271875092793718239408404433 absolute error = 1e-32 relative error = 1.2860533502337547426689159643017e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.56 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4697 Order of pole (three term test) = -14.29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.67 y[1] (analytic) = -0.78382166588084928530294214483812 y[1] (numeric) = -0.78382166588084928530294214483813 absolute error = 1e-32 relative error = 1.2758004065583108419105880067084e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.26 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4676 Order of pole (three term test) = -14.5 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.66 y[1] (analytic) = -0.78999223149736509278381709123024 y[1] (numeric) = -0.78999223149736509278381709123026 absolute error = 2e-32 relative error = 2.5316704649223765395685680354113e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.97 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4653 Order of pole (three term test) = -14.72 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.65 y[1] (analytic) = -0.79608379854905582891760457067991 y[1] (numeric) = -0.79608379854905582891760457067992 absolute error = 1e-32 relative error = 1.2561491664854909886649278077748e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.68 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4628 Order of pole (three term test) = -14.93 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.64 y[1] (analytic) = -0.80209575788429261358611077926032 y[1] (numeric) = -0.80209575788429261358611077926034 absolute error = 2e-32 relative error = 2.4934678688183670087530666488528e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.4 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4601 Order of pole (three term test) = -15.15 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.63 y[1] (analytic) = -0.80802750831215187252370896577706 y[1] (numeric) = -0.80802750831215187252370896577707 absolute error = 1e-32 relative error = 1.2375816289829659822819115182141e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.12 Order of pole (ratio test) Not computed Radius of convergence (three term test) for eq 1 = 0.4573 Order of pole (three term test) = -15.36 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.62 y[1] (analytic) = -0.8138784566625339286839996543607 y[1] (numeric) = -0.81387845666253392868399965436071 absolute error = 1e-32 relative error = 1.2286846909558135601849115214852e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4542 Order of pole (three term test) = -15.57 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.61 y[1] (analytic) = -0.81964801784547951790074657865482 y[1] (numeric) = -0.81964801784547951790074657865484 absolute error = 2e-32 relative error = 2.4400717825892931863375557676783e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.451 Order of pole (three term test) = -15.78 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.6 y[1] (analytic) = -0.82533561490967829724095249895538 y[1] (numeric) = -0.82533561490967829724095249895539 absolute error = 1e-32 relative error = 1.2116283145123167046145551213724e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4476 Order of pole (three term test) = -15.98 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.59 y[1] (analytic) = -0.83094067910016349524799652249068 y[1] (numeric) = -0.83094067910016349524799652249069 absolute error = 1e-32 relative error = 1.2034553430251038491614501709658e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.444 Order of pole (three term test) = -16.19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.58 y[1] (analytic) = -0.83646264991518693465788732805002 y[1] (numeric) = -0.83646264991518693465788732805003 absolute error = 1e-32 relative error = 1.1955106424672935751964175215789e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4403 Order of pole (three term test) = -16.39 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.57 y[1] (analytic) = -0.84190097516226874013375636391601 y[1] (numeric) = -0.84190097516226874013375636391602 absolute error = 1e-32 relative error = 1.1877881478962049113853027126885e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4363 Order of pole (three term test) = -16.6 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.56 y[1] (analytic) = -0.84725511101341612609452550386632 y[1] (numeric) = -0.84725511101341612609452550386633 absolute error = 1e-32 relative error = 1.1802820508263244778218975785322e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4322 Order of pole (three term test) = -16.8 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.55 y[1] (analytic) = -0.85252452205950574280498179761777 y[1] (numeric) = -0.85252452205950574280498179761778 absolute error = 1e-32 relative error = 1.1729867870360221144899718332545e-30 % Correct digits = 32 h = 0.01 bytes used=16008008, alloc=4390108, time=1.52 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.428 Order of pole (three term test) = -16.99 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.54 y[1] (analytic) = -0.8577086813638241425379687789178 y[1] (numeric) = -0.8577086813638241425379687789178 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4235 Order of pole (three term test) = -17.19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.53 y[1] (analytic) = -0.8628070705147610118066950185642 y[1] (numeric) = -0.86280707051476101180669501856421 absolute error = 1e-32 relative error = 1.1590076555624283961082735251395e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4189 Order of pole (three term test) = -17.38 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.52 y[1] (analytic) = -0.86781917967764990038784757198851 y[1] (numeric) = -0.86781917967764990038784757198852 absolute error = 1e-32 relative error = 1.1523137808171610842144187861275e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4141 Order of pole (three term test) = -17.58 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.51 y[1] (analytic) = -0.87274450764575126310580847357551 y[1] (numeric) = -0.87274450764575126310580847357552 absolute error = 1e-32 relative error = 1.1458107054692597333792993299734e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4092 Order of pole (three term test) = -17.77 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.5 y[1] (analytic) = -0.87758256189037271611628158260383 y[1] (numeric) = -0.87758256189037271611628158260384 absolute error = 1e-32 relative error = 1.1394939273245491223133277682049e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.4041 Order of pole (three term test) = -17.95 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.49 y[1] (analytic) = -0.88233285861012149570546815913666 y[1] (numeric) = -0.88233285861012149570546815913667 absolute error = 1e-32 relative error = 1.1333591288612230659188985538320e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3988 Order of pole (three term test) = -18.14 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.48 y[1] (analytic) = -0.88699492277928419439995483115874 y[1] (numeric) = -0.88699492277928419439995483115875 absolute error = 1e-32 relative error = 1.1274021691878787428048684309357e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3933 Order of pole (three term test) = -18.32 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.47 y[1] (analytic) = -0.89156828819532893645401927653339 y[1] (numeric) = -0.8915682881953289364540192765334 absolute error = 1e-32 relative error = 1.1216190764525210868536294551902e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3878 Order of pole (three term test) = -18.5 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.46 y[1] (analytic) = -0.89605249752552524253638990350041 y[1] (numeric) = -0.89605249752552524253638990350041 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.382 Order of pole (three term test) = -18.68 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.45 y[1] (analytic) = -0.90044710235267692166884061148645 y[1] (numeric) = -0.90044710235267692166884061148645 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3761 Order of pole (three term test) = -18.85 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.44 y[1] (analytic) = -0.90475166321996341716553738899837 y[1] (numeric) = -0.90475166321996341716553738899837 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3701 Order of pole (three term test) = -19.03 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.43 y[1] (analytic) = -0.90896574967488512247591047766345 y[1] (numeric) = -0.90896574967488512247591047766345 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3639 Order of pole (three term test) = -19.19 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.42 y[1] (analytic) = -0.91308894031230827243608878966567 y[1] (numeric) = -0.91308894031230827243608878966567 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3575 Order of pole (three term test) = -19.36 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.41 y[1] (analytic) = -0.91712082281660510547564205827702 y[1] (numeric) = -0.91712082281660510547564205827702 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.351 Order of pole (three term test) = -19.52 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=20010364, alloc=4455632, time=1.91 x[1] = -0.4 y[1] (analytic) = -0.9210609940028850827985267320518 y[1] (numeric) = -0.9210609940028850827985267320518 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3444 Order of pole (three term test) = -19.68 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.39 y[1] (analytic) = -0.9249090598573130414506767528811 y[1] (numeric) = -0.9249090598573130414506767528811 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3377 Order of pole (three term test) = -19.84 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.38 y[1] (analytic) = -0.92866463557651024949253080772456 y[1] (numeric) = -0.92866463557651024949253080772456 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3308 Order of pole (three term test) = -20 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.37 y[1] (analytic) = -0.93232734560603442320381290449088 y[1] (numeric) = -0.93232734560603442320381290449088 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3237 Order of pole (three term test) = -20.15 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.36 y[1] (analytic) = -0.93589682367793485835091236812474 y[1] (numeric) = -0.93589682367793485835091236812474 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3166 Order of pole (three term test) = -20.29 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.35 y[1] (analytic) = -0.93937271284737892003503235730367 y[1] (numeric) = -0.93937271284737892003503235730367 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3093 Order of pole (three term test) = -20.44 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.34 y[1] (analytic) = -0.94275466552834622850264406002658 y[1] (numeric) = -0.94275466552834622850264406002658 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.3019 Order of pole (three term test) = -20.58 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.33 y[1] (analytic) = -0.94604234352838697152941057836621 y[1] (numeric) = -0.94604234352838697152941057836621 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2943 Order of pole (three term test) = -20.72 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.32 y[1] (analytic) = -0.94923541808244086757530727376609 y[1] (numeric) = -0.9492354180824408675753072737661 absolute error = 1e-32 relative error = 1.0534794435084492819719159833912e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2867 Order of pole (three term test) = -20.85 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.31 y[1] (analytic) = -0.95233356988571339784280543620221 y[1] (numeric) = -0.95233356988571339784280543620222 absolute error = 1e-32 relative error = 1.0500522418001151663727238237418e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2789 Order of pole (three term test) = -20.98 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.3 y[1] (analytic) = -0.95533648912560601964231022756805 y[1] (numeric) = -0.95533648912560601964231022756806 absolute error = 1e-32 relative error = 1.0467516015380856009327908455870e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2711 Order of pole (three term test) = -21.11 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.29 y[1] (analytic) = -0.95824387551269716807012477793186 y[1] (numeric) = -0.95824387551269716807012477793187 absolute error = 1e-32 relative error = 1.0435756758319605291858372486606e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2631 Order of pole (three term test) = -21.23 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.28 y[1] (analytic) = -0.96105543831077094792459005359648 y[1] (numeric) = -0.96105543831077094792459005359648 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.255 Order of pole (three term test) = -21.35 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.27 y[1] (analytic) = -0.9637708963658905130162327094922 y[1] (numeric) = -0.96377089636589051301623270949221 absolute error = 1e-32 relative error = 1.0375909915631601514930305045560e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2468 Order of pole (three term test) = -21.47 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.26 y[1] (analytic) = -0.96638997813451322555821764645006 y[1] (numeric) = -0.96638997813451322555821764645007 absolute error = 1e-32 relative error = 1.0347789428967034948403011117944e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2385 Order of pole (three term test) = -21.58 NO COMPLEX POLE (six term test) for Equation 1 bytes used=24012760, alloc=4455632, time=2.29 TOP MAIN SOLVE Loop x[1] = -0.25 y[1] (analytic) = -0.96891242171064478414459544949419 y[1] (numeric) = -0.96891242171064478414459544949419 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2301 Order of pole (three term test) = -21.69 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.24 y[1] (analytic) = -0.97133797485202960492617524696338 y[1] (numeric) = -0.97133797485202960492617524696338 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2217 Order of pole (three term test) = -21.79 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.23 y[1] (analytic) = -0.9736663950053748369677306480716 y[1] (numeric) = -0.9736663950053748369677306480716 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2131 Order of pole (three term test) = -21.89 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.22 y[1] (analytic) = -0.9758974493306054894060229810447 y[1] (numeric) = -0.9758974493306054894060229810447 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.2045 Order of pole (three term test) = -21.99 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.21 y[1] (analytic) = -0.97803091472414824491613856809935 y[1] (numeric) = -0.97803091472414824491613856809935 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1957 Order of pole (three term test) = -22.08 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.2 y[1] (analytic) = -0.98006657784124163112419651674817 y[1] (numeric) = -0.98006657784124163112419651674817 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1869 Order of pole (three term test) = -22.17 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.19 y[1] (analytic) = -0.98200423511727031896787750418991 y[1] (numeric) = -0.98200423511727031896787750418992 absolute error = 1e-32 relative error = 1.0183255471200494754242006144117e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1781 Order of pole (three term test) = -22.25 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.18 y[1] (analytic) = -0.98384369278812141459271602461153 y[1] (numeric) = -0.98384369278812141459271602461154 absolute error = 1e-32 relative error = 1.0164216199486862747130581631310e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1691 Order of pole (three term test) = -22.33 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.17 y[1] (analytic) = -0.9855847669095607091719299902125 y[1] (numeric) = -0.98558476690956070917192999021251 absolute error = 1e-32 relative error = 1.0146260713176810517259565757587e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1601 Order of pole (three term test) = -22.41 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.16 y[1] (analytic) = -0.98722728337562694904095252401834 y[1] (numeric) = -0.98722728337562694904095252401834 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.151 Order of pole (three term test) = -22.48 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.15 y[1] (analytic) = -0.98877107793604228673498099865434 y[1] (numeric) = -0.98877107793604228673498099865434 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1419 Order of pole (three term test) = -22.55 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.14 y[1] (analytic) = -0.9902159962126371718989482270114 y[1] (numeric) = -0.9902159962126371718989482270114 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1327 Order of pole (three term test) = -22.61 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.13 y[1] (analytic) = -0.99156189371478803959451217115181 y[1] (numeric) = -0.99156189371478803959451217115181 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1234 Order of pole (three term test) = -22.67 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.12 y[1] (analytic) = -0.99280863585386625224809816785763 y[1] (numeric) = -0.99280863585386625224809816785763 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1141 Order of pole (three term test) = -22.72 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.11 y[1] (analytic) = -0.99395609795669685035783961141985 y[1] (numeric) = -0.99395609795669685035783961141984 absolute error = 1e-32 relative error = 1.0060806529138739295356804682092e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.1048 Order of pole (three term test) = -22.77 NO COMPLEX POLE (six term test) for Equation 1 bytes used=28014268, alloc=4455632, time=2.67 TOP MAIN SOLVE Loop x[1] = -0.1 y[1] (analytic) = -0.99500416527802576609556198780387 y[1] (numeric) = -0.99500416527802576609556198780386 absolute error = 1e-32 relative error = 1.0050209184004554284651141013116e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.09536 Order of pole (three term test) = -22.82 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.09 y[1] (analytic) = -0.99595273301199425309283937182514 y[1] (numeric) = -0.99595273301199425309283937182513 absolute error = 1e-32 relative error = 1.0040637139232158778501676963764e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.08594 Order of pole (three term test) = -22.86 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.08 y[1] (analytic) = -0.99680170630261938497770677463351 y[1] (numeric) = -0.9968017063026193849777067746335 absolute error = 1e-32 relative error = 1.0032085556005355029958108787911e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.07647 Order of pole (three term test) = -22.9 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.07 y[1] (analytic) = -0.99755100025327957462090838993974 y[1] (numeric) = -0.99755100025327957462090838993973 absolute error = 1e-32 relative error = 1.0024550120706596664893782215052e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.06698 Order of pole (three term test) = -22.93 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.06 y[1] (analytic) = -0.99820053993520416554766168718284 y[1] (numeric) = -0.99820053993520416554766168718283 absolute error = 1e-32 relative error = 1.0018027039585779448282054668829e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.05746 Order of pole (three term test) = -22.96 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.05 y[1] (analytic) = -0.99875026039496624656287081115652 y[1] (numeric) = -0.99875026039496624656287081115651 absolute error = 1e-32 relative error = 1.0012513034084612211531018109808e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.04792 Order of pole (three term test) = -22.98 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.04 y[1] (analytic) = -0.99920010666097794031457075812913 y[1] (numeric) = -0.99920010666097794031457075812912 absolute error = 1e-32 relative error = 1.0008005336805808190957963024622e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.03836 Order of pole (three term test) = -23 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.03 y[1] (analytic) = -0.99955003374898751627215870646661 y[1] (numeric) = -0.9995500337489875162721587064666 absolute error = 1e-32 relative error = 1.0004501688117850453891178286820e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.02878 Order of pole (three term test) = -23.02 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.02 y[1] (analytic) = -0.99980000666657777841269559083748 y[1] (numeric) = -0.99980000666657777841269559083746 absolute error = 2e-32 relative error = 2.0004000666775128701264434089590e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.01919 Order of pole (three term test) = -23.03 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = -0.01 y[1] (analytic) = -0.99995000041666527778025793375221 y[1] (numeric) = -0.99995000041666527778025793375219 absolute error = 2e-32 relative error = 2.0001000041668361179814292496011e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 0.009599 Order of pole (three term test) = -23.04 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0 y[1] (analytic) = -1 y[1] (numeric) = -0.99999999999999999999999999999998 absolute error = 2e-32 relative error = 2.0000000000000000000000000000000e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 Radius of convergence (three term test) for eq 1 = 2.477e-32 Order of pole (three term test) = -23.04 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.01 y[1] (analytic) = -0.99995000041666527778025793375221 y[1] (numeric) = -0.99995000041666527778025793375219 absolute error = 2e-32 relative error = 2.0001000041668361179814292496011e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.02 y[1] (analytic) = -0.99980000666657777841269559083748 y[1] (numeric) = -0.99980000666657777841269559083746 absolute error = 2e-32 relative error = 2.0004000666775128701264434089590e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.03 y[1] (analytic) = -0.99955003374898751627215870646661 y[1] (numeric) = -0.9995500337489875162721587064666 absolute error = 1e-32 relative error = 1.0004501688117850453891178286820e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.04 y[1] (analytic) = -0.99920010666097794031457075812913 y[1] (numeric) = -0.99920010666097794031457075812912 absolute error = 1e-32 relative error = 1.0008005336805808190957963024622e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 bytes used=32015748, alloc=4455632, time=3.06 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.05 y[1] (analytic) = -0.99875026039496624656287081115652 y[1] (numeric) = -0.99875026039496624656287081115651 absolute error = 1e-32 relative error = 1.0012513034084612211531018109808e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.06 y[1] (analytic) = -0.99820053993520416554766168718284 y[1] (numeric) = -0.99820053993520416554766168718283 absolute error = 1e-32 relative error = 1.0018027039585779448282054668829e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.07 y[1] (analytic) = -0.99755100025327957462090838993974 y[1] (numeric) = -0.99755100025327957462090838993973 absolute error = 1e-32 relative error = 1.0024550120706596664893782215052e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.08 y[1] (analytic) = -0.99680170630261938497770677463351 y[1] (numeric) = -0.9968017063026193849777067746335 absolute error = 1e-32 relative error = 1.0032085556005355029958108787911e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.09 y[1] (analytic) = -0.99595273301199425309283937182514 y[1] (numeric) = -0.99595273301199425309283937182513 absolute error = 1e-32 relative error = 1.0040637139232158778501676963764e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.1 y[1] (analytic) = -0.99500416527802576609556198780387 y[1] (numeric) = -0.99500416527802576609556198780386 absolute error = 1e-32 relative error = 1.0050209184004554284651141013116e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.11 y[1] (analytic) = -0.99395609795669685035783961141985 y[1] (numeric) = -0.99395609795669685035783961141984 absolute error = 1e-32 relative error = 1.0060806529138739295356804682092e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.12 y[1] (analytic) = -0.99280863585386625224809816785763 y[1] (numeric) = -0.99280863585386625224809816785763 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.13 y[1] (analytic) = -0.99156189371478803959451217115181 y[1] (numeric) = -0.99156189371478803959451217115181 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.14 y[1] (analytic) = -0.9902159962126371718989482270114 y[1] (numeric) = -0.9902159962126371718989482270114 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.15 y[1] (analytic) = -0.98877107793604228673498099865434 y[1] (numeric) = -0.98877107793604228673498099865434 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.16 y[1] (analytic) = -0.98722728337562694904095252401834 y[1] (numeric) = -0.98722728337562694904095252401834 absolute error = 0 relative error = 0 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.17 y[1] (analytic) = -0.9855847669095607091719299902125 y[1] (numeric) = -0.98558476690956070917192999021251 absolute error = 1e-32 relative error = 1.0146260713176810517259565757587e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.18 y[1] (analytic) = -0.98384369278812141459271602461153 y[1] (numeric) = -0.98384369278812141459271602461154 absolute error = 1e-32 relative error = 1.0164216199486862747130581631310e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=36016872, alloc=4521156, time=3.44 x[1] = 0.19 y[1] (analytic) = -0.98200423511727031896787750418991 y[1] (numeric) = -0.98200423511727031896787750418992 absolute error = 1e-32 relative error = 1.0183255471200494754242006144117e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.2 y[1] (analytic) = -0.98006657784124163112419651674817 y[1] (numeric) = -0.98006657784124163112419651674818 absolute error = 1e-32 relative error = 1.0203388449411926897924327768492e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.21 y[1] (analytic) = -0.97803091472414824491613856809935 y[1] (numeric) = -0.97803091472414824491613856809936 absolute error = 1e-32 relative error = 1.0224625673331073524464086165795e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.22 y[1] (analytic) = -0.9758974493306054894060229810447 y[1] (numeric) = -0.97589744933060548940602298104471 absolute error = 1e-32 relative error = 1.0246978314021899569039539168330e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.23 y[1] (analytic) = -0.9736663950053748369677306480716 y[1] (numeric) = -0.97366639500537483696773064807161 absolute error = 1e-32 relative error = 1.0270458189064641551739991395066e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.24 y[1] (analytic) = -0.97133797485202960492617524696338 y[1] (numeric) = -0.97133797485202960492617524696339 absolute error = 1e-32 relative error = 1.0295077778178462266084903163054e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.25 y[1] (analytic) = -0.96891242171064478414459544949419 y[1] (numeric) = -0.9689124217106447841445954494942 absolute error = 1e-32 relative error = 1.0320850239843856443984493479876e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.26 y[1] (analytic) = -0.96638997813451322555821764645006 y[1] (numeric) = -0.96638997813451322555821764645008 absolute error = 2e-32 relative error = 2.0695578857934069896806022235888e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.27 y[1] (analytic) = -0.9637708963658905130162327094922 y[1] (numeric) = -0.96377089636589051301623270949222 absolute error = 2e-32 relative error = 2.0751819831263203029860610091120e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.28 y[1] (analytic) = -0.96105543831077094792459005359648 y[1] (numeric) = -0.96105543831077094792459005359649 absolute error = 1e-32 relative error = 1.0405227004986113756623811239264e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.29 y[1] (analytic) = -0.95824387551269716807012477793186 y[1] (numeric) = -0.95824387551269716807012477793188 absolute error = 2e-32 relative error = 2.0871513516639210583716744973211e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.3 y[1] (analytic) = -0.95533648912560601964231022756805 y[1] (numeric) = -0.95533648912560601964231022756807 absolute error = 2e-32 relative error = 2.0935032030761712018655816911741e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.31 y[1] (analytic) = -0.95233356988571339784280543620221 y[1] (numeric) = -0.95233356988571339784280543620223 absolute error = 2e-32 relative error = 2.1001044836002303327454476474836e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.32 y[1] (analytic) = -0.94923541808244086757530727376609 y[1] (numeric) = -0.94923541808244086757530727376611 absolute error = 2e-32 relative error = 2.1069588870168985639438319667824e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.33 y[1] (analytic) = -0.94604234352838697152941057836621 y[1] (numeric) = -0.94604234352838697152941057836622 absolute error = 1e-32 relative error = 1.0570351389033719013512246936692e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=40017820, alloc=4521156, time=3.83 TOP MAIN SOLVE Loop x[1] = 0.34 y[1] (analytic) = -0.94275466552834622850264406002658 y[1] (numeric) = -0.94275466552834622850264406002659 absolute error = 1e-32 relative error = 1.0607213483685831202937827622284e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.35 y[1] (analytic) = -0.93937271284737892003503235730367 y[1] (numeric) = -0.93937271284737892003503235730368 absolute error = 1e-32 relative error = 1.0645401833834950584242632965675e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.36 y[1] (analytic) = -0.93589682367793485835091236812474 y[1] (numeric) = -0.93589682367793485835091236812476 absolute error = 2e-32 relative error = 2.1369876992853746943292352547215e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.37 y[1] (analytic) = -0.93232734560603442320381290449088 y[1] (numeric) = -0.9323273456060344232038129044909 absolute error = 2e-32 relative error = 2.1451693007030203111482463335611e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.38 y[1] (analytic) = -0.92866463557651024949253080772456 y[1] (numeric) = -0.92866463557651024949253080772458 absolute error = 2e-32 relative error = 2.1536299794149157443180906061186e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.39 y[1] (analytic) = -0.9249090598573130414506767528811 y[1] (numeric) = -0.92490905985731304145067675288112 absolute error = 2e-32 relative error = 2.1623747531552374206082103360578e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.4 y[1] (analytic) = -0.9210609940028850827985267320518 y[1] (numeric) = -0.92106099400288508279852673205182 absolute error = 2e-32 relative error = 2.1714088567664774062278599103175e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.41 y[1] (analytic) = -0.91712082281660510547564205827702 y[1] (numeric) = -0.91712082281660510547564205827704 absolute error = 2e-32 relative error = 2.1807377504064545372568400892330e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.42 y[1] (analytic) = -0.91308894031230827243608878966567 y[1] (numeric) = -0.91308894031230827243608878966569 absolute error = 2e-32 relative error = 2.1903671282185613004854314981091e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.43 y[1] (analytic) = -0.90896574967488512247591047766345 y[1] (numeric) = -0.90896574967488512247591047766347 absolute error = 2e-32 relative error = 2.2003029274924288586094653589129e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.44 y[1] (analytic) = -0.90475166321996341716553738899837 y[1] (numeric) = -0.90475166321996341716553738899839 absolute error = 2e-32 relative error = 2.2105513383441656893621706403621e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.45 y[1] (analytic) = -0.90044710235267692166884061148645 y[1] (numeric) = -0.90044710235267692166884061148647 absolute error = 2e-32 relative error = 2.2211188139474545768889213420232e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.46 y[1] (analytic) = -0.89605249752552524253638990350041 y[1] (numeric) = -0.89605249752552524253638990350043 absolute error = 2e-32 relative error = 2.2320120813490923284652883710187e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.47 y[1] (analytic) = -0.89156828819532893645401927653339 y[1] (numeric) = -0.89156828819532893645401927653342 absolute error = 3e-32 relative error = 3.3648572293575632605608883655706e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.48 y[1] (analytic) = -0.88699492277928419439995483115874 y[1] (numeric) = -0.88699492277928419439995483115877 absolute error = 3e-32 relative error = 3.3822065075636362284146052928070e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 bytes used=44019128, alloc=4521156, time=4.22 TOP MAIN SOLVE Loop x[1] = 0.49 y[1] (analytic) = -0.88233285861012149570546815913666 y[1] (numeric) = -0.88233285861012149570546815913669 absolute error = 3e-32 relative error = 3.4000773865836691977566956614959e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.5 y[1] (analytic) = -0.87758256189037271611628158260383 y[1] (numeric) = -0.87758256189037271611628158260386 absolute error = 3e-32 relative error = 3.4184817819736473669399833046148e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.51 y[1] (analytic) = -0.87274450764575126310580847357551 y[1] (numeric) = -0.87274450764575126310580847357554 absolute error = 3e-32 relative error = 3.4374321164077792001378979899203e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.52 y[1] (analytic) = -0.86781917967764990038784757198851 y[1] (numeric) = -0.86781917967764990038784757198855 absolute error = 4e-32 relative error = 4.6092551232686443368576751445101e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.53 y[1] (analytic) = -0.8628070705147610118066950185642 y[1] (numeric) = -0.86280707051476101180669501856424 absolute error = 4e-32 relative error = 4.6360306222497135844330941005581e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.54 y[1] (analytic) = -0.8577086813638241425379687789178 y[1] (numeric) = -0.85770868136382414253796877891783 absolute error = 3e-32 relative error = 3.4976910752841681261612782120289e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.55 y[1] (analytic) = -0.85252452205950574280498179761777 y[1] (numeric) = -0.85252452205950574280498179761781 absolute error = 4e-32 relative error = 4.6919471481440884579598873330178e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.56 y[1] (analytic) = -0.84725511101341612609452550386632 y[1] (numeric) = -0.84725511101341612609452550386636 absolute error = 4e-32 relative error = 4.7211282033052979112875903141288e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.57 y[1] (analytic) = -0.84190097516226874013375636391601 y[1] (numeric) = -0.84190097516226874013375636391605 absolute error = 4e-32 relative error = 4.7511525915848196455412108507539e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.58 y[1] (analytic) = -0.83646264991518693465788732805002 y[1] (numeric) = -0.83646264991518693465788732805006 absolute error = 4e-32 relative error = 4.7820425698691743007856700863157e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.59 y[1] (analytic) = -0.83094067910016349524799652249068 y[1] (numeric) = -0.83094067910016349524799652249072 absolute error = 4e-32 relative error = 4.8138213721004153966458006838632e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.6 y[1] (analytic) = -0.82533561490967829724095249895538 y[1] (numeric) = -0.82533561490967829724095249895542 absolute error = 4e-32 relative error = 4.8465132580492668184582204854896e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.61 y[1] (analytic) = -0.81964801784547951790074657865482 y[1] (numeric) = -0.81964801784547951790074657865487 absolute error = 5e-32 relative error = 6.1001794564732329658438894191958e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.62 y[1] (analytic) = -0.8138784566625339286839996543607 y[1] (numeric) = -0.81387845666253392868399965436074 absolute error = 4e-32 relative error = 4.9147387638232542407396460859407e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop bytes used=48021516, alloc=4521156, time=4.60 x[1] = 0.63 y[1] (analytic) = -0.80802750831215187252370896577706 y[1] (numeric) = -0.8080275083121518725237089657771 absolute error = 4e-32 relative error = 4.9503265159318639291276460728563e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.12 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.64 y[1] (analytic) = -0.80209575788429261358611077926032 y[1] (numeric) = -0.80209575788429261358611077926037 absolute error = 5e-32 relative error = 6.2336696720459175218826666221320e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.4 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.65 y[1] (analytic) = -0.79608379854905582891760457067991 y[1] (numeric) = -0.79608379854905582891760457067995 absolute error = 4e-32 relative error = 5.0245966659419639546597112310993e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.68 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.66 y[1] (analytic) = -0.78999223149736509278381709123024 y[1] (numeric) = -0.78999223149736509278381709123029 absolute error = 5e-32 relative error = 6.3291761623059413489214200885283e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.97 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.78382166588084928530294214483812 y[1] (numeric) = -0.78382166588084928530294214483816 absolute error = 4e-32 relative error = 5.1032016262332433676423520268335e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.26 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.68 y[1] (analytic) = -0.77757271875092793718239408404432 y[1] (numeric) = -0.77757271875092793718239408404436 absolute error = 4e-32 relative error = 5.1442134009350189706756638572067e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.56 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.77124601499710660197353931549777 y[1] (numeric) = -0.77124601499710660197353931549781 absolute error = 4e-32 relative error = 5.1864125353244209058170869571309e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.86 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.7 y[1] (analytic) = -0.76484218728448842625585999019186 y[1] (numeric) = -0.76484218728448842625585999019191 absolute error = 5e-32 relative error = 6.5372962986679693493733641765266e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.16 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.71 y[1] (analytic) = -0.75836187599050816654145794413955 y[1] (numeric) = -0.7583618759905081665414579441396 absolute error = 5e-32 relative error = 6.5931584356998731326486734647191e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.47 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.75180572914089497944548696225195 y[1] (numeric) = -0.75180572914089497944548696225199 absolute error = 4e-32 relative error = 5.3205234343862853964403783078986e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.79 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.73 y[1] (analytic) = -0.74517440234487038879013215855033 y[1] (numeric) = -0.74517440234487038879013215855038 absolute error = 5e-32 relative error = 6.7098386421571890478870713626765e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.11 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.73846855872958790979142456069883 y[1] (numeric) = -0.73846855872958790979142456069888 absolute error = 5e-32 relative error = 6.7707689662531696064854064747761e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.44 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.75 y[1] (analytic) = -0.73168886887382088631183875300008 y[1] (numeric) = -0.73168886887382088631183875300013 absolute error = 5e-32 relative error = 6.8335056233611306760753433007841e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.77 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.76 y[1] (analytic) = -0.72483601074090517233968836666701 y[1] (numeric) = -0.72483601074090517233968836666705 absolute error = 4e-32 relative error = 5.5184896179638239807480480708611e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.11 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.77 y[1] (analytic) = -0.71791066961094336337129056532434 y[1] (numeric) = -0.71791066961094336337129056532439 absolute error = 5e-32 relative error = 6.9646548124290243194234616687205e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.45 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=52024916, alloc=4521156, time=4.99 TOP MAIN SOLVE Loop x[1] = 0.78 y[1] (analytic) = -0.71091353801227735721626502376456 y[1] (numeric) = -0.71091353801227735721626502376461 absolute error = 5e-32 relative error = 7.0332040855208061054917855338675e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 17.18 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.79 y[1] (analytic) = -0.70384531565223609691278086108495 y[1] (numeric) = -0.703845315652236096912780861085 absolute error = 5e-32 relative error = 7.1038335964012537356526458755006e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.84 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.8 y[1] (analytic) = -0.69670670934716542092074998164232 y[1] (numeric) = -0.69670670934716542092074998164237 absolute error = 5e-32 relative error = 7.1766209983611990024847620408143e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.51 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.81 y[1] (analytic) = -0.6894984329517470175496392406801 y[1] (numeric) = -0.68949843295174701754963924068015 absolute error = 5e-32 relative error = 7.2516480981616874079491749612058e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 16.18 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.68222120728761355166655797843693 y[1] (numeric) = -0.68222120728761355166655797843698 absolute error = 5e-32 relative error = 7.3290011312886084974222472773027e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.86 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.83 y[1] (analytic) = -0.67487576007126710211246291786445 y[1] (numeric) = -0.6748757600712671021124629178645 absolute error = 5e-32 relative error = 7.4087710595384228296657374923848e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.55 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.66746282584130811792267103687086 y[1] (numeric) = -0.6674628258413081179226710368709 absolute error = 4e-32 relative error = 5.9928431144583556969921171616197e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 15.24 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.85 y[1] (analytic) = -0.65998314588498217039541602946147 y[1] (numeric) = -0.65998314588498217039541602946151 absolute error = 4e-32 relative error = 6.0607608314547710534814195485968e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.93 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.86 y[1] (analytic) = -0.65243746816405184627203066422386 y[1] (numeric) = -0.6524374681640518462720306642239 absolute error = 4e-32 relative error = 6.1308557450814915427142438904032e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.64 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.87 y[1] (analytic) = -0.64482654724000119477766380548283 y[1] (numeric) = -0.64482654724000119477766380548287 absolute error = 4e-32 relative error = 6.2032185509744842069896284561557e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.34 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.63715114419858020801549860572209 y[1] (numeric) = -0.63715114419858020801549860572213 absolute error = 4e-32 relative error = 6.2779452511715561262689041684732e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 14.05 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.89 y[1] (analytic) = -0.62941202657369688020355305738025 y[1] (numeric) = -0.62941202657369688020355305738029 absolute error = 4e-32 relative error = 6.3551375428503131562381386057661e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.77 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.9 y[1] (analytic) = -0.62160996827066445648471615140713 y[1] (numeric) = -0.62160996827066445648471615140717 absolute error = 4e-32 relative error = 6.4349032418641980520960514492256e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.49 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.91 y[1] (analytic) = -0.61374574948881154652117822617468 y[1] (numeric) = -0.61374574948881154652117822617472 absolute error = 4e-32 relative error = 6.5173567447621389070714150901352e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 13.22 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=56025696, alloc=4521156, time=5.38 x[1] = 0.92 y[1] (analytic) = -0.60582015664346284179740470667438 y[1] (numeric) = -0.60582015664346284179740470667442 absolute error = 4e-32 relative error = 6.6026195334304124270698785590394e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.94 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.59783398228729823849490708443298 y[1] (numeric) = -0.59783398228729823849490708443303 absolute error = 5e-32 relative error = 8.3635259087650419624444942728382e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.68 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.94 y[1] (analytic) = -0.58978802503109822996098981522402 y[1] (numeric) = -0.58978802503109822996098981522406 absolute error = 4e-32 relative error = 6.7820976863494113271153801912102e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 Radius of convergence (ratio test) for eq 1 = 12.42 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.95 y[1] (analytic) = -0.58168308946388349416618097376046 y[1] (numeric) = -0.5816830894638834941661809737605 absolute error = 4e-32 relative error = 6.8765966768720352218474960314306e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.96 y[1] (analytic) = -0.57351998607245666212505080035186 y[1] (numeric) = -0.5735199860724566621250508003519 absolute error = 4e-32 relative error = 6.9744735966265924045917017940464e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.97 y[1] (analytic) = -0.56529953116035431303652775484986 y[1] (numeric) = -0.56529953116035431303652775484991 absolute error = 5e-32 relative error = 8.8448684712984260239665712543226e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.98 y[1] (analytic) = -0.55702254676621730087665826735994 y[1] (numeric) = -0.55702254676621730087665826735999 absolute error = 5e-32 relative error = 8.9762973312793081933182964276293e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 TOP MAIN SOLVE Loop x[1] = 0.99 y[1] (analytic) = -0.54868986058158757534312640865361 y[1] (numeric) = -0.54868986058158757534312640865366 absolute error = 5e-32 relative error = 9.1126159953096559106356852392696e-30 % Correct digits = 32 h = 0.01 NO INFO (given) for Equation 1 NO POLE (ratio test) for Equation 1 NO REAL POLE (three term test) for Equation 1 NO COMPLEX POLE (six term test) for Equation 1 Finished! diff ( y , x , 3 ) = m1 * diff ( y , x , 1 ) ; Iterations = 200 Total Elapsed Time = 5 Seconds Elapsed Time(since restart) = 5 Seconds Time to Timeout = 2 Minutes 54 Seconds Percent Done = 100.5 % > quit bytes used=58189088, alloc=4521156, time=5.58