Am 03.09.2014 um 02:07 schrieb Richard Fateman:
Sure. Unlikely to be easy to do by simply hacking on trees. Here's a
classic pattern:
a*x^2+b*x+c.a,b,c are pattern variables. x, in this context, is a
symbolic constant.
You might like to also impose a,b,c free of x, and a is non-zero,
I think such situations are OK, as long as you understand why the test
failed before and verified that the new test really tests the same
thing.
Aaron Meurer
On Tue, Sep 2, 2014 at 9:26 PM, Chris Smith wrote:
> At https://github.com/sympy/sympy/pull/7945 discussion involving a change
> that I ma
At https://github.com/sympy/sympy/pull/7945 discussion involving a change
that I made to a test that was added in response to issue 6533 has arisen.
In that issue a particular expression (which is slow to compute) raised an
assertion error, identifying that a change needed to be made in the code
There is a flag to the printer order='none', which you can use for
printers like pprint() or sstr(), which can speed up the printing of
very large expressions.
Aaron Meurer
On Tue, Sep 2, 2014 at 10:08 AM, Jason Moore wrote:
> This is typical behavior. Solving a 9 x 9 linear system will result i
I think it's a bug with the printer. S(0.06).round(1) == 0.1 gives
True. Can you open an issue for it?
Aaron Meurer
On Tue, Sep 2, 2014 at 7:28 AM, Duane Nykamp wrote:
> Is this the intended result of rounding to one decimal place? Sympy needs
> to go back to school on rounding. :)
>
> In [13]:
On Tuesday, September 2, 2014 12:23:31 PM UTC-7, Joachim Durchholz wrote:
>
> The makers of RUBI insist that no two rules of a rule set can ever apply
> to the same subexpression.
> That's draconic, and verifying that would be, erm, "interesting".
>
> I'm not sure whether that's worth it, but
On Monday, September 1, 2014 10:21:25 PM UTC-7, Joachim Durchholz wrote:
>
> Am 02.09.2014 um 05:58 schrieb Richard Fateman:
> > you could read
> > about inherited and synthesized attributes (usually in relation
> > to intermediate expression trees in the theory of compiling.)
>
> Heh. I don
I have not looked at your expression, however it may be that the methods
used for so-called Poisson Series in celestial mechanics and mathematically
analogous computations will solve your problems in a jiffy.
Maxima has Poisson series, which are special canonical forms
for sums of sines and cosine
On Tue, Sep 2, 2014 at 2:30 PM, Andrea Fresu wrote:
> Hello,
> I have this symmetric matrix:
>
> A=Matrix([[0, 0.623433638694170, 1, 5.42879559377412], [0.623433638694170,
> 0, 1, 6.81321272473753], [1, 1, 0, 0], [5.42879559377412, 6.81321272473753,
> 0, 0]])
>
> I did
>
> A.cholesky()
>
> getting
Hello,
I have this symmetric matrix:
A=Matrix([[0, 0.623433638694170, 1, 5.42879559377412], [0.623433638694170,
0, 1, 6.81321272473753], [1, 1, 0, 0], [5.42879559377412, 6.81321272473753,
0, 0]])
I did
A.cholesky()
getting:
⎡ 0 0 00 ⎤
⎢ ⎥
⎢zoo zoo
The makers of RUBI insist that no two rules of a rule set can ever apply
to the same subexpression.
That's draconic, and verifying that would be, erm, "interesting".
I'm not sure whether that's worth it, but they do have a point if they
say it's the only way to be sure that no rule is applied i
Am 02.09.2014 um 14:54 schrieb F. B.:
OK, by the way I see it an alternative structure for SymPy's pattern
matcher could be to define .match( ) in Basic only and cleverly use method
inheritance.
Actually that's normal use of inheritance :-)
> That is:
- express associativity through a st
This is typical behavior. Solving a 9 x 9 linear system will result in long
expressions. If you want to print them it will take time to parse the tree
because the expression is huge. Also, running the simplication routines on
very large expressions will also take a long time and may never even fini
Hi Aaron,
I use Sympy to compute the solution of an inverse problem (Ax = b)
symbolically, where A is a 9-by-9 symbolic matrix. The computation is quite
fast, however the out-printing of the solution ''x'' vector is very slow,
even the first entry x[0] takes longer than 2 minutes. And the
symp
OK, by the way I see it an alternative structure for SymPy's pattern
matcher could be to define .match( ) in Basic only and cleverly use method
inheritance. That is:
- express associativity through a static field (e.g. is_Associative)
- same if the type is an identity when given only one p
Using explicit multiplicatin (even with the parenthesis) lower the
precission of the result compared to pow.
That being said, we do that in Theano. Putting a limit on the exponent that
you do that would allow to don't loose too much precission for big exponent.
Fred
On Fri, Aug 29, 2014 at 4:48
Is this the intended result of rounding to one decimal place? Sympy needs
to go back to school on rounding. :)
In [13]: S(0.06).round(1)
Out[13]: 0.e-1
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving
17 matches
Mail list logo
