On 28/07/2011 22:34, VictorMiller wrote:
I want to do a lot of finite field computations, and want to use
Cython to speed things up. It's not clear to me what the details are
that I need to adhere to. I noticed from the comments in
element_givaro.pyx that the givaro library is fastest from fields of
size< 2^16. However, some of the fields that I want to calculate in
are bigger than that. So the particular question is -- what
declarations to I need to import, and most importantly can I do this
use formulae in my program (e.g like a*b + c^2) or will I need to
labaoriously write out all the individual function calls?
Victor
PS. If someone has a .pyx/.pxd program that does such a thing as an
example, that would probably be most of what I need.
Hi
I haven't seen any replies to this so just a couple of comments.
Have you got a working version of whatever computations you want to do
in ordinary sage, (without cython)? I always do the original
development without cython and then see how slow it really is and which
bits in particular need speeding up.
If so, what improvement do you get if you simply compile your existing
code using Cython without any type declarations, etc?
I suppose my point is that until you know exactly which parts of your
computation need optimizing you shouldn't try and optimize it.
Best wishes
Alastair
--
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
