At 06:35 PM 8/14/2002 -0400, Nick Glover wrote: >I'm curious, where does the roundoff checking every iteration come >in? This explains how the program chooses the FFT size, but what are the >conditions for when roundoff checking for every iteration is used? Based >on my understanding, it seems to me that if the soft crossover calculation >determines that an exponent can't be run at the smaller FFT size, then >maybe it should just do the exponent at that FFT size with roundoff >checking every iteration instead of moving to a larger FFT size. Does the >program currently do this?
If prime95 decides to use the smaller FFT size (the thousand iterations average error was below the 0.241 to 0.243 threshold), then the LL test uses the smaller FFT size with error checking every iteration. This will protect you from roundoff errors up to 0.6. _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
