END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

 

Are you still running with this Quazor? 'Cos this would be the paradigm to follow. If it's still good then I will need to implement it.
Since no replies from the established publishers then I can only assume they're relying on the glitch fix stage.

regards skychurch. 

ok, so it turns out, rather unsurprisingly, that my memory of my screwing around with this stuff a year ago was no good, and my program was no good back then either, so my previous post last night about what i thought i was remembering was also no good.

my previous check was just what i gleaned from the discussion on the forums here, checking for when the last term in the series grows larger by a few orders of magnitude than any of the other terms.  maybe that is an incomplete or otherwise flawed solution, and maybe you guys did it better or more complete than how i did it, i dont know.  i reimplemented the acceleration check, and it looks very promising indeed.  similar to the other method, i check for when the accelerated sum differs from the unaccelerated sum by a few orders of magnitude as the bail condition.  in my bit of testing this morning, when testing the other method with a setting that causes it to go far enough that it starts producing some questionable results, the method of checking the accelerated sum is able to go substantially farther than that, but with what appears to be correct results.  this indicates to me that the other method or at least my implementation of it is flawed / incomplete / unreliable, sometimes stopping in time and sometimes going too far, whereas the method of checking the accelerated sum looks to be more consistent.  more testing is necessary, but it looks promising and i am kind of hopeful about this again.  im glad you guys resurrected this post  

...i also wonder again if there could be any benefit in actually utilizing the accelerated sum to initialize points.  should test that also.  in my mind im not sure if the result should actually be a better value, or the opposite, a magnification of the error.

another thing, if one was to decide to call this good and roll with it, i guess you would need to strip the acceleration routine out of libgsl and modify it (or write your own routine) so that it can use more than just doubles, like our extended-exponent types. (groan)   well, looking at the gsl code, its only a few pages long, so it shouldnt be too big a deal.

thanks 


i said that wrong.  what im currently doing is checking if the larger sum divided by the smaller sum is greater than bailCondition, setting bailCondition to something like 1.001.  so its when the accelerated sum starts to diverge from the unaccelerated sum past a certain number of mantissa digits?  or however you would best say it