Comment #7 on issue 1961 by smichr: integration works too hard
http://code.google.com/p/sympy/issues/detail?id=1961
Aaron, there are similar changes in risch that can be made...I've included
those in the 1793 branch at the smichr acct at github.
--
You received this message because you are
Hi,
I was wondering if there was a reason this patch was not applied?
http://groups.google.com/group/sympy-patches/browse_thread/thread/e75a05616e1b5732
Cheers,
Brian
--
You received this message because you are subscribed to the Google Groups
sympy-patches group.
To post to this group,
On Tue, Jun 22, 2010 at 10:43 AM, Brian Granger elliso...@gmail.com wrote:
Hi,
I was wondering if there was a reason this patch was not applied?
http://groups.google.com/group/sympy-patches/browse_thread/thread/e75a05616e1b5732
I think that we have forgot. Brian, do you have a push access to
On Mon, Jun 21, 2010 at 10:26 PM, william ratcliff
william.ratcl...@gmail.com wrote:
Has anyone had any thoughts or seen what other CAS do to take advantage of
multiple cores? For example, if one is collecting terms, one could imagine
farming out subexpressions to search to each core.
Very
Has anyone had any thoughts or seen what other CAS do to take advantage of
multiple cores? For example, if one is collecting terms, one could imagine
farming out subexpressions to search to each core.
William
On Tue, Jun 22, 2010 at 1:11 AM, Ondrej Certik ond...@certik.cz wrote:
On Mon, Jun
Aren't some results dependent on assumptions? I don't see how you can
cache independent of assumptions and not have problems.
For example:
1) check that there are no global or local assumptions set
2) store the expression
retrieve:
* check 1)
* use cache
How about:
0)
On Jun 22, 2010, at 12:03 AM, Øyvind Jensen wrote:
Aren't some results dependent on assumptions? I don't see how you can
cache independent of assumptions and not have problems.
For example:
1) check that there are no global or local assumptions set
2) store the expression
On Jun 21, 2010, at 11:52 PM, Ondrej Certik wrote:
On Mon, Jun 21, 2010 at 10:26 PM, william ratcliff
william.ratcl...@gmail.com wrote:
Has anyone had any thoughts or seen what other CAS do to take advantage of
multiple cores? For example, if one is collecting terms, one could imagine
It's not so much a printing issue as an ease of manipulation issue.
In base 16 I can go:
In [30]: hex = ee36
In [31]: int(hex, 16)
Out[31]: 60982
In [32]: int(hex[0], 16)
Out[32]: 14
In [34]: int(hex[2], 16)
Out[34]: 3
I would like to be able to do that with any base, so I could say:
base1000
Thank you, it worked well. I can't find how in sympy i can obtain the
entire expression parsing tree. I want to be able to navigate from my
app, selecting part of the expression (having the expression tree and
navigation functions, this would be very easy), and applying to this
expression some
You might look at the preorder_traversal() and postorder_traversal() functions
in sympy/utilities/iterables.py:
In [4]: a = (x + 2)*(x + 1)**2
In [5]: from sympy.utilities.iterables import preorder_traversal,
postorder_traversal
In [6]: preorder_traversal(a)
Out[6]: generator object
Man, I'm late to this convo as I'm getting these emails all out of
thread order and at random times ... corporate filters rock.
On Jun 22, 12:25 am, William Ratcliff wrote:
I would go with multiprocessing rather than multithreading--processes are
weightier but there are no side effects
To
On Jun 22, 2010, at 11:54 AM, Kevin Hunter wrote:
Man, I'm late to this convo as I'm getting these emails all out of
thread order and at random times ... corporate filters rock.
You could just use a private email address, such as one from gmail, to
subscribe to this list. (p.s., assumedly
If you haven't programmed a multi-execution style algorithm before,
it's a bit of a mental leap. However, the thought process involved
with multi-threading vs multi-processing vs multi-machine scales.
There is a growing movement to teach college students and younger
folks to think in parallel
On Tue, Jun 22, 2010 at 12:31 AM, Ondrej Certik ond...@certik.cz wrote:
I would be more than happy if we can remove all caching altogether,
but since it currently would slow sympy down, Well, maybe not anymore.
We should do some tests. But let's say we need to keep the cache (at
least
On Jun 22, 2010, at 12:39 PM, Christian Muise wrote:
On Tue, Jun 22, 2010 at 12:31 AM, Ondrej Certik ond...@certik.cz wrote:
I would be more than happy if we can remove all caching altogether,
but since it currently would slow sympy down, Well, maybe not anymore.
We should do some tests.
We'll start looking into it here at NIST later this summer. We have some
expressions on the order of 10,000 terms and things do tend to slow down ;
William
On Tue, Jun 22, 2010 at 2:50 PM, Kevin Hunter khun...@sandia.gov wrote:
If you haven't programmed a multi-execution style algorithm
17 matches
Mail list logo
