This is a known issue, though one it doesn't sound like upstream is working
on.
See https://groups.google.com/forum/#!topic/linbox-use/SgsXVYM7u7s/discussion
and http://trac.sagemath.org/sage_trac/ticket/12883#comment:85
On Tuesday, May 28, 2013 9:37:41 AM UTC-4, Theo Belaire wrote:
>
> What i
On Tue, May 28, 2013 at 10:46 AM, Thierry Dumont
wrote:
> Hi,
> I am experimenting with fast Fourier Transform in Sage.
> It seems there are different possibilities.
>
> 1) There is: FastFourierTransform
> FastFourierTransform(size, base_ring=None)
>
> 2) One can simply do:
> v = vector(CDF,[1..10
Hi,
I am experimenting with fast Fourier Transform in Sage.
It seems there are different possibilities.
1) There is: FastFourierTransform
FastFourierTransform(size, base_ring=None)
2) One can simply do:
v = vector(CDF,[1..10]);
v.fft()
3) One can directly use scipy/numpy which seems to use the
Hi,
Although it seems that this thread has not been active for a while, I
venture to post a related question:
Is it possible to find all solutions to a linear Diophantine equation
modulo some integer m i.e. find all solutions (x,y) to the equation: a x +
b y = c (mod m) for fixed integers a,b,
What is the problem with:
> you are running out of primes. 1000 coprime primes found
Should I be concerned?
It was printed during one of my rather long running computations.
'Sage Version 5.9, Release Date: 2013-04-30'
OSX, 64 bit.
--
You received this message because you are subscribed to
