On Apr 27, 8:43 am, Bill Hart <goodwillh...@googlemail.com> wrote: > That's called Kronecker Substitution (or Segmentation), not Fateman > mulitplication.
.. so you can imagine MY confusion.. Since it is an algorithm for multiplying polynomials over ZZ, it doesn't seem relevant. It's probably not fair to blame Kronecker for this, but who cares And besides, the notion of accurate results has not been defined for the purposes here. I gave an example of 10^200*x +Interval[-1,1]... which is either accurate or not. As for the stability of the FFT, you should be able to find literature on this. It is probably better than the n^2 algorithm, but it "depends". . -- 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
