Reading the bug report it seemed to me that the code was determining in some way that terms could be dropped off the sum because they were too small to contribute, and then stopped adding them in. Is that the "simple implementation bug"? Or is that an additional bad idea?
As for me looking it up in the literature, I came across this paper. Though it is really about compiling the evaluation of polynomials: http://www.eecs.berkeley.edu/~fateman/papers/polyval.pdf If you are going to evaluate the same polynomial at many points, you might want to use that, or look at the references in that paper for yet more ideas. Or use Google. Try searching for polynomial evaluation FFT for some odd papers. RJF On Oct 2, 10:42 am, Fredrik Johansson <fredrik.johans...@gmail.com> wrote: > On Fri, Oct 2, 2009 at 7:14 PM, rjf <fate...@gmail.com> wrote: > > > I think that this is one of those times that you might like to look up > > in the literature how to do something, instead of pulling an > > "algorithm" out of your posterior. Stable evaluation of polynomials is > > the subject. > > FYI, this is a simple implementation bug and has nothing to do with > stable polynomial evaluation. > > Fredrik --~--~---------~--~----~------------~-------~--~----~ To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
