Hi! I did a search in the documentation and source, but I did not find a good answer to the question how to do fast Fourier transform in Sage in a general context: You have a commutative unitary ring R with a primitive n-th root of unity w, and then apply discrete Fourier transform to n-tuples of R.
Is there anything in Sage, besides the stuff for complex vectors? Cheers, Simon -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
