Comment #6 on issue 3742 by asmeu...@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
Mateusz's branch works fast and correctly. His benchmark *is* your system.
It runs in 2.37 seconds. It will eventually be part of the default rref,
but more work needs to be
Comment #7 on issue 3742 by natalie@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
I get it now THANK YOU SO MUCH! :D
--
You received this message because this project is configured to send all
issue notifications to this address.
You may
Comment #8 on issue 3742 by asmeu...@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
By the way, I was wondering if we could get away with not using cancel. It
will lead to larger expressions, but a rational function does not have to
be canceled to determine
Updates:
Status: Fixed
Comment #2 on issue 3474 by asmeu...@gmail.com: Wrong result from re(x**2),
im(x**2) and (x**2).as_real_imag()
http://code.google.com/p/sympy/issues/detail?id=3474
(No comment was entered for this change.)
--
You received this message because this project is
Comment #9 on issue 3742 by matt...@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
By the way, I was wondering if we could get away with not using cancel.
Unfortunately not, because intermediate expressions grow too fast without
cancelation and arithmetics
Updates:
Labels: NeedsReview smichr
Comment #4 on issue 3552 by smi...@gmail.com: Expression with square root
doesn't simplify well
http://code.google.com/p/sympy/issues/detail?id=3552
In PR 2023:
radsimp(eq)
1 + sqrt(2 + sqrt(5))/2 + sqrt(5)*sqrt(2 + sqrt(5))/2
All long time ago
Updates:
Status: Fixed
Comment #15 on issue 2895 by smi...@gmail.com: minpoly hangs on this
expresion
http://code.google.com/p/sympy/issues/detail?id=2895
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
issue
Updates:
Labels: EasyToFix
Comment #3 on issue 2887 by smi...@gmail.com: Bug with minpoly()
http://code.google.com/p/sympy/issues/detail?id=2887
(No comment was entered for this change.)
--
You received this message because this project is configured to send all
issue notifications
Updates:
Labels: EasyToFix
Comment #2 on issue 2835 by smi...@gmail.com: PolynomialError with
minpoly()
http://code.google.com/p/sympy/issues/detail?id=2835
If the expression is expanded first (issue 2887) minpoly hangs but if the
expression were checked as being equal to zero
Comment #2 on issue 2751 by smi...@gmail.com: minpoly() should use PurePoly
http://code.google.com/p/sympy/issues/detail?id=2751
Although death of dummy_eq has been called for, it can be used for this:
minpoly(sqrt(2)).dummy_eq(minpoly(sqrt(2)))
True
--
You received this message because
Comment #5 on issue 3667 by smi...@gmail.com: getting consistent output
from solve until a Solution class is available
http://code.google.com/p/sympy/issues/detail?id=3667
Another inconsistent output is that it can return a generator:
radsimp(1/(root(2,3)+root(2,5)))
1/(2**(1/5) +
Status: Valid
Owner:
CC: mario.pe...@gmail.com
Labels: Type-Defect Priority-Medium
New issue 3769 by smi...@gmail.com: minpoly hangs on this expresion; should
subtract constant?
http://code.google.com/p/sympy/issues/detail?id=3769
eq=((1/sqrt(sqrt(7)/7 + 2*sqrt(2)+sqrt(3)))+3);
Comment #1 on issue 3769 by smi...@gmail.com: minpoly hangs on this
expresion; should subtract constant?
http://code.google.com/p/sympy/issues/detail?id=3769
A simpler expression is
a=3; eq = 1/sqrt(sqrt(7) + sqrt(2) + sqrt(3)) + a
minpoly(eq-a, x).subs(x, x - a).subs(x, eq).equals(0)
Comment #3 on issue 3768 by smi...@gmail.com: Printing oddness
http://code.google.com/p/sympy/issues/detail?id=3768
This is how a number that is computed without precision is printed: we
don't know any of the digits but we know that it is on the order of 10**151.
--
You received this
Comment #4 on issue 2734 by skirpic...@gmail.com:
ask(~Q.negative(log(p)**2), Q.positive(p)) is None
http://code.google.com/p/sympy/issues/detail?id=2734
https://github.com/sympy/sympy/pull/2027
--
You received this message because this project is configured to send all
issue
Comment #3 on issue 2703 by skirpic...@gmail.com: summation(z**n, (n, 1,
oo)) gives a strange result
http://code.google.com/p/sympy/issues/detail?id=2703
I think, this is fixed in PR 1910, e.g.:
In [3]: summation(z**n, (n, 1, oo))
Out[3]:
⎧ z
⎪ ── for │z│ 1
⎪ -z + 1
⎪
⎪ ∞
⎪ ___
⎨
Status: Valid
Owner:
Labels: Type-Defect Priority-Medium
New issue 3770 by smi...@gmail.com: nsolve could employ scaling while
searching for solution
http://code.google.com/p/sympy/issues/detail?id=3770
mp is a polynomial with large coefficients
print filldedent(mp)
(x - 15)**16 -
Comment #2 on issue 3769 by mario.pe...@gmail.com: minpoly hangs on this
expresion; should subtract constant?
http://code.google.com/p/sympy/issues/detail?id=3769
It does not stall on my computer, it takes 6s; but computing the following
one obtains the same in 0.07s
```
Comment #4 on issue 3768 by asmeu...@gmail.com: Printing oddness
http://code.google.com/p/sympy/issues/detail?id=3768
Is this standard? It seems like 1e151 would be better.
--
You received this message because this project is configured to send all
issue notifications to this address.
You
Comment #7 on issue 2745 by mario.pe...@gmail.com: should cancel expand exp?
http://code.google.com/p/sympy/issues/detail?id=2745
In PR 2006
```
solve(minpoly((2 + 3**(S(1)/3)), x), x)[2]
3**(1/3) + 2
```
--
You received this message because this project is configured to send all
issue
Comment #10 on issue 3742 by natalie@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
I am still having problems with rref. I am now using Mateusz's branch. I
have looked at his solve_lin_sys, and saw how he calls rref. When his
solver calls rref, it uses
Comment #11 on issue 3742 by matt...@gmail.com: rref very slow
http://code.google.com/p/sympy/issues/detail?id=3742
In [1]: from sympy.polys.solvers import RawMatrix
In [2]: from sympy.polys.fields import vfield
In [3]: vfield(a_(1:5)(1:5), ZZ)
Out[3]:
Rational function field in a_11, a_12,
Maybe some of the GSoC applicants could help out. Reviewing others' code is
a great way to become more familiar with the code base, and to improve your
own coding practices.
Aaron Meurer
On Apr 18, 2013, at 11:24 PM, smichr smi...@gmail.com wrote:
These branches (with indicated PR number) and
On 19.04.2013 00:36, Aaron Meurer wrote:
On Tue, Apr 16, 2013 at 2:09 PM, Tom Bachmanne_mc...@web.de wrote:
Hi guys,
I did some investigations on issues with disabling caching. Basically, I ran
the tests in all our 323 test files, both with and without the cache, and
timed each file
well. i know if i create another set of loops it is two times slower but
everything looks unpresentable for my need that way.
for i in range(4):
for k in range(4):
for l in range(4):
for m in range(4):
if(g[i][m]!=0):
you might use cartes to handle the loops:
for i, k, l, m in cartes(*[range(4) for i in range(4)]):
... print i, k, l, m
... break
...
0 0 0 0
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and stop receiving emails
26 matches
Mail list logo
