Am 23.04.2014 01:24, schrieb Ondřej Čertík:
For the basic manipulation pretty much. One can get faster than the
current sympy,
see e.g. sympycore. But you don't get as fast as current CSymPy with
that approach.
The speedup is linear for O(n) problems. For O(n^3) problems (Gaussian
elimination [1]...)
the speedup is cubic. So it really matters for these kind of problems.
No, I think it is still linear even for O(n^3) problems. If it has n^3
operations
and each operations takes 100x less with CSymPy, the whole calculation still
takes 100x less with CSymPy.
That was my knee-jerk reaction, too.
But then it depends on what you mean by "speedup is cubic" - if it's
"reduce O(N³) to O(1)" then that's obviously absurd, if it's "we have
O(N³) so the payoff will be ~cubic with input size" then it's actually a
correct statement.
--
You received this message because you are subscribed to the Google Groups
"sympy" 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 http://groups.google.com/group/sympy.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sympy/535894DC.5030300%40durchholz.org.
For more options, visit https://groups.google.com/d/optout.
