On Fri, Apr 29, 2016 at 11:07 AM, saad khalid <[email protected]> wrote: > Hey guys: > > I wasn't sure where to ask this, so I thought I'd put it here. I've got a > fairly long algorithm that I've written in Mathematica. I was wondering, do > you think there would be a speed increase if I were to program it into Sage? > What are some tips for a speed increase? I was thinking that I would use > lambda notation to define the function, like it says here > http://ask.sagemath.org/question/8027/how-to-sum/ > > However, what are other things? And do you think it would actually be > worthwhile? It's an algorhythm for calculating groebner bases. I don't know > if that matter. I just didn't know if the language would give any sizable > increase in speed. Thanks!
It is impossible to answer this question if you don't provide your code. With your complete code and exactly the inputs (or range of inputs) that you care about, it would then only be extremely challenging to answer your question... William -- William (http://wstein.org) -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
