Re: [sympy] Do I have something more to do after my Pull requests?

Hi, On 6 December 2015 at 16:46, Thomas Baruchel wrote: > I did three Pull requests 10/14 days ago: > https://github.com/sympy/sympy/pulls/baruchel > Since that, I have no news; maybe it is normal, but I am asking in case I > would have forgotten something? > Do I need to do something more? Regar

Re: [sympy] Why does factor() sometimes just return the input?

Hi, On 30 November 2015 at 07:01, Adam Leeper wrote: > Hi all- > > I'm trying to understand why factor() and Poly.all_roots() behave > differently when trying to find simple complex roots. I suspect there is > something to do with exact values vs. numerical approximations, but I want > something

Re: [sympy] collecting common factors in a matrix

Hi, On 27 November 2015 at 19:34, Riccardo Rossi wrote: > Dear list, > > i am a newby to sympy, and i should say that i liked what i found, so ... > first of all kudos to the developers. > > as of now i can succesfully generate my finite element matrices using sympy, > which saves me quite a lot

Re: [sympy] don't understand piece of code

Hi, On 9 November 2015 at 09:49, Paul Royik wrote: > In Mul class I see this piece of code: > > def _eval_is_real(self): > real = True > zero = one_neither = False > > for t in self.args: > if not t.is_complex: > return t.is_complex > > > Do

Re: [sympy] What to read to be good at rewriting expressions?

Hi, On 3 November 2015 at 21:47, Hugh <7141...@gmail.com> wrote: > import sympy > sympy.init_session() > > > x11, x12, x13, x21, x22, x23, x31, x32, x33 = symbols('x_1:4(1:4)') > > A = Matrix(3,3,symbols('x_1:4(1:4)')) > expr1 = A.det() > > expr2 = x11*(x22*x33 - x23*x32) - x12*(x21*x33 -x23*x31)

Re: [sympy] Poly(..., domain='EX') -> where is it documented?

Hi, On 21 January 2015 at 22:06, Bastian Weber wrote: > On 01/21/2015 08:26 PM, Aaron Meurer wrote: >> The domain argument is likely undocumented. > Thats a pity. Yeah, documentation of polys module is below standards. > >> The polys are unfortunately >> not so well documented, beyond the docst

Re: [sympy] formula guesser

Hi, On 1 January 2015 at 22:01, Ralf Stephan wrote: > Hello, > I'm thinking about implementing a formula guesser for C-finite integer > sequences. The algorithm, which is not as complicated as the one for D-finite > sequences, needs SymPy's rsolve on one hand, and on the other an > implementat

Re: [sympy] Factor options

Hi, On 8 December 2014 at 01:05, Paul Royik wrote: > How should I use factor to factor expression over irrational numbers? > > For example, > x^2-4 produces (x-2)(x+2) > x^2-2 produces (x-sqrt(2))(x+sqrt(2)) > x^4+1 produces (x^2-sqrt(2) x+1) (x^2+sqrt(2) x+1) > x^2+1 produces x^2+1 (only complex

Re: [sympy] error in using solve_poly_system and solve_triangulated

Hi, On 23 November 2014 at 22:13, Junwei Huang wrote: > Hi > I am quite new to sympy. I found sympy as I was searching a way to solve a > system of 3 6-order polynomials for 3 unknowns. I tried to solve this system > using either solve_poly_system or solve_triangulated but got the same error. > H

Re: [sympy] Arbitrary constraints?

Hi, On 11 November 2014 01:13, Aaron Meurer wrote: > Q is just a namespace for the assumptions, like Q.positive or Q.real. > > refine() simplifies things based on assumptions. I think we shouldn't use "refine()" and "simplifies" together as this only can increase confusion. Simplification implie

Re: [sympy] Problems with simplifying

Hi, On 9 November 2014 17:24, Darek Cidlinský wrote: > I would like to have sympy simplify a monstrous polynom ratio: > > In [2]: E=1/(2*x1**2 - 4*x1*x2 + 2*x2**2 + 2*y1**2 - 4*y1*y2 + 2*y2**2) * > (-y1*r1**2 + y2*r1**2 + y1*r2**2 - y2*r2**2 + y1*x1**2 + y2*x1**2 - > 2*x1*x2*y1 - 2*x1*x2*y2 + y1*

Re: [sympy] Targeting specific subexpression for transformations

Hi, On 24 October 2014 15:16, Francesco Bonazzi wrote: > Consider this use case > > In [97]: expr = 1/(1-x) + 1/(1+x) > > In [98]: e2 = Integral(expr, x) > > In [99]: e2 > Out[99]: > ⌠ > ⎮ ⎛ 1 1 ⎞ > ⎮ ⎜─ + ──⎟ dx > ⎮ ⎝x + 1 -x + 1⎠ > ⌡ > > > Suppose now I want to act on the exp

Re: [sympy] Problems with numerical evaluation in sympy after init_session()

Hi, On 20 October 2014 19:18, Marek Kaluba wrote: > Hi all, > > recently I started using sympy (and immediately fall for it), so this mail > may be simply my lack of understanding how sympy internally works. > However I found a _strange_ (to me) issue with numerical evaluation: > > (ipython conso

Re: [sympy] Re: Sorting both numerical and symbol items reasonably

Hi, On 19 October 2014 05:40, Duane Nykamp wrote: > Here's my solution for a customized sort key. Does this seem reasonable? I > just copied the format for the sort key for numbers and applied it to > anything that was real. It seems to work how I'd want it to work. > > > def customized_sort_k

Re: [sympy] TEX commands as input in SymPy

Hi, On 8 October 2014 12:05, wrote: > Is there any function in SymPy can take this TEX command as an input > > (-6x^2-x-7)(2x^3+3x^2-2x-5) > > to find the derivative? I wanted to suggest a mathematica parser for this: In [1]: import sympy.parsing.mathematica as m In [2]: m.parse("(-6x^2-x-7)(

Re: [sympy] isympy -i in IPython

Hi, On 2 October 2014 22:53, Christophe Bal wrote: > Sorry, indeed I was looking for a solution for IPython notebook. In that > case, the solution dose not work. I have the following error message. init_ipython_session() works only with terminal, but auto_int_to_Integer is generic. Terminal-only

Re: [sympy] isympy -i in IPython

Hi, On 2 October 2014 14:56, Christophe Bal wrote: > Hello, > is there a way to have the features given by isympy -i in IPython ? In [1]: from sympy.interactive.session import init_ipython_session In [2]: init_ipython_session(auto_int_to_Integer=True) Out[2]: In [3]: from sympy import * In

Re: [sympy] Why 1/3 == S(1)/3 is True ?

Hi, On 2 October 2014 15:02, Christophe Bal wrote: > Hello. > > For me the fact that 1/3 == S(1)/3 has value True sounds like a bug > because 1/3 is a float, and S(1)/3 a rational.> Because 1/3 == S(1)/3 is equivalent to Float(1/3) == S(1)/3 and apparently __eq__ prefers Float comparison

Re: [sympy] More sugar for Buchberger's algorithm?

Hi, On 10 September 2014 06:36, Aaron Meurer wrote: > Yes, we would love to have improvements to the Groebner algorithms. According to `git log`, sympy implements sugar cube strategy since ad2332f74cc474253d803388d2cf8a3c61d4c42d. Mateusz > We have some benchmarks in > sympy/polys/benchmarks/b

Re: [sympy] Apart function

Hi, On 21 August 2014 16:26, clemens novak wrote: > Am Mittwoch, 20. August 2014 23:45:55 UTC+2 schrieb Mateusz Paprocki: >> >> Hi, >> >> On 20 August 2014 21:28, Ondřej Čertík wrote: >> > Hi Clemens, >> > >> > On Wed, Aug 20, 2014 at 5:15

Re: [sympy] Apart function

Hi, On 20 August 2014 21:28, Ondřej Čertík wrote: > Hi Clemens, > > On Wed, Aug 20, 2014 at 5:15 AM, clemens novak wrote: >> I have a question regarding the apart function. I want to obtain the partial >> fractions for eq = z / (z**2-z-1) . >> >> The denominator has real roots solve(denom(eq)) y

Re: [sympy] integration fails with PolynomialDivisionFailed

Hi, On 15 July 2014 16:09, Adam Spontarelli wrote: > from sympy import * > x, ep, D = symbols('x, \epsilon, D') > integrate(1+5.55*ep**2*exp(-.13*(x/D)), x) > > fails and gives the PolynomialDivisionFailed error message. Changing the > -0.13 constant to -0.12 succeeds. Is there something about th

Re: [sympy] Questions about the goals of CSymPy

Hi, On 23 April 2014 17:35, Ondřej Čertík wrote: > On Wed, Apr 23, 2014 at 9:21 AM, Mateusz Paprocki wrote: >> Hi, >> >> On 23 April 2014 07:36, Ondřej Čertík wrote: >>> On Tue, Apr 22, 2014 at 9:52 PM, Aaron Meurer wrote: >>>> On Tue, Apr 22, 20

Re: [sympy] Questions about the goals of CSymPy

Hi, On 23 April 2014 17:37, Mateusz Paprocki wrote: > Hi, > > On 23 April 2014 17:33, Aaron Meurer wrote: >> Does it make a difference if you start out with c = 1 (rather than c = >> Integer(1) or c = ZZ(1))? > OK, so one could use EX domain to make ring() work wit

Re: [sympy] Questions about the goals of CSymPy

Meurer > > On Wed, Apr 23, 2014 at 10:21 AM, Mateusz Paprocki wrote: >> Hi, >> >> On 23 April 2014 07:36, Ondřej Čertík wrote: >>> On Tue, Apr 22, 2014 at 9:52 PM, Aaron Meurer wrote: >>>> On Tue, Apr 22, 2014 at 10:21 PM, Ondřej Čertík >>>

Re: [sympy] Questions about the goals of CSymPy

Hi, On 23 April 2014 07:36, Ondřej Čertík wrote: > On Tue, Apr 22, 2014 at 9:52 PM, Aaron Meurer wrote: >> On Tue, Apr 22, 2014 at 10:21 PM, Ondřej Čertík >> wrote: >>> On Tue, Apr 22, 2014 at 6:06 PM, Aaron Meurer wrote: On Tue, Apr 22, 2014 at 12:05 PM, Ondřej Čertík wrote:

Re: [sympy] Not Implemented Error when solving a equation system

Hi, On 3 April 2014 11:58, rgbarriada wrote: > > Hi all, > > I am trying to solve a very simple equation system. Here is the code: > > import sympy as sp > a, b, c, d = sp.S('a b c d'.split()) > equations = [ > sp.Eq(a, b+c/d), > sp.Eq(c, 60.), > sp.Eq(d, 5.)] > > print sp.solve(eq

Re: [sympy] [GSoC] D3.js and Three.js backend for our plotting module

Hi, On 18 March 2014 17:12, David Li wrote: > Just some thoughts: > > I agree with Jason that ultimately, integrating a library specifically > focused on Python and web plotting is the best course for SymPy and > Gamma/Live in general. > > Gamma/Live's problem is that it runs on App Engine - anyt

Re: [sympy] Equivalent of FullForm form Mathematica

Hi, On 3 March 2014 16:30, Christophe Bal wrote: > Hello. > > Is there an equivalent of FullForm that produces simple treeview of a > formula ? Here is basic example seen in a video. > > FullForm[x**2+x**3] = Plus[Power[x, 2], Power[y, 3]] > In [1]: srepr(x**2 + x**3) Out[1]: "Add(Pow(Symbol('x'

Re: [sympy] How to get symboly constant part of a Poly

Hi, On 29 January 2014 10:08, Roderick de Nijs wrote: > I am having the following little anoying issue: > Imagine i have: > > from sympy import var > var('x y z t') > p=Poly(x*y + x*z + z*t,gens=[x,y]) > > now i can use p.coef_monomial to extract coefficients for x, y or x*y but > how do I get th

Re: [sympy] checking in a set

Hi, On 29 October 2013 17:26, Taylan Şengül wrote: > I want to check if the result of an expression is in a set: > from sympy import * var('a') > a print(a-a in {0}) > False print(a - a == 0) > True > > How can I make the first statement True? In [1]: var('a') Out[1]: a In [

Re: [sympy] Random test failure in heurisch

Hi, On 17 October 2013 21:32, Joachim Durchholz wrote: > Am 17.10.2013 21:16, schrieb Mateusz Paprocki: > >> Hi, >> >> On 17 October 2013 21:09, Joachim Durchholz wrote: >>> >>> Just a heads-up for whoever is working on heurisch: >>> >&g

Re: [sympy] Random test failure in heurisch

Hi, On 17 October 2013 21:09, Joachim Durchholz wrote: > Just a heads-up for whoever is working on heurisch: > > I'm getting a test failure that depends on the random seed (and possibly on > the timeout). > This happens on latest master. Can you try https://github.com/mattpap/sympy/tree/improve-

Re: [sympy] symbolic eigenvalues

Hi, On 8 October 2013 20:30, Aaron Meurer wrote: > Working on a solution to this, This should help: https://github.com/sympy/sympy/pull/2520 > but there's one thing I'm unsure about. > Is it OK to also assume sqrt(x*y) == sqrt(x)*sqrt(y) in this context? > > Aaron Meurer > > On Tue, Oct 8, 2013

Re: [sympy] OverflowError when calling sympy.intervals()

Hi, On 23 September 2013 20:12, Heiner Kirchhoffer wrote: > Hi Aaron and all, > > Maybe, P can be negative? This would require a float or maybe better, a > Rational. > > After studying the related code from a pure syntactical point of view > (without knowing the mathematical concept behind), I wo

Re: [sympy] Two integration test suites

Hi, On 13 September 2013 02:09, Aaron Meurer wrote: > Yes, the fallback algorithm in SymPy, heurisch, is very slow. What's > the longest time an integral took that still gave an answer from your > tests? Example 181 can be computed, in improve-heurisch branch, as follows: In [1]: from sympy.int

Re: [sympy] KeyError with Matrix class

Hi, On 3 September 2013 13:38, Wojciech Czaja wrote: > > When I create Matrix calling g (gclass object) > I get KeyError but calling g directly I do not > > Any idea? > For some, yet unknown to me, reason Matrix constructor converts first component to a SymPy object, so (1, 1) get converted to (

Re: [sympy] gcd

interesting point. This could even work with polynomials. > > Christophe BAL > > > 2013/7/11 Mateusz Paprocki > >> Hi, >> >> On 11 July 2013 11:14, Thilina Rathnayake wrote: >> >>> Hi, >>> >>> I implemented the extended_eucl

Re: [sympy] gcd

ef gcdex" or follow implementation tree to igcdex() (gcdex() -> PythonIntegerRing.gcdex() -> igcdex()). > I also feel that when we are dealing with integers, i.e when using igcd()we > should > allow inputting more than two numbers at a time. It doesn't break the AP

Re: [sympy] gcd

ded Euclidean algorithm over integers (strange no one pointed this out earlier, because this function is there since 2008). Also extended_euclid() is recursive (at least in that PR) and igcdex() is iterative. > Regards, > Thilina > > > On Thu, Jul 11, 2013 at 2:12 PM, Mateusz Paprock

Re: [sympy] gcd

Hi, On 11 July 2013 10:17, Stephen Loo wrote: > Hi all, > > I found that there are many different kind of gcd in sympy different > module, such as > > sympy.core.numbers.igcd > sympy.polys.polytools.gcd > sympy.polys.polytools.gcdex > sympy.polys.polytools.gcd_list > sympy.polys.polytools.half_g

Re: [sympy] Complex numbers and Symbols

Hi, On 10 July 2013 16:31, Amit Saha wrote: > On Thu, Jul 11, 2013 at 12:28 AM, Aaron Meurer wrote: > > On Jul 10, 2013, at 9:21 AM, Amit Saha wrote: > > > >> On Sun, Jul 7, 2013 at 12:03 PM, Aaron Meurer > wrote: > >>> > >>> > >>> > >>> On Sat, Jul 6, 2013 at 5:45 PM, Amit Saha > wrote: > >

Re: [sympy] sy.Poly Evaluation

Hi, On 9 July 2013 15:05, Freddie Witherden wrote: > Hi all, > > Consider the following snippet: > > import sympy as sy > from sympy.abc import x > from sympy.mpmath import mp > > N = 4 > mp.dps = 30 > > # Way 1 > Pn1 = sy.legendre_poly(N, x) > dPn1 = Pn1.diff() > > print dPn1.evalf(mp.dps, subs

Re: [sympy] Possible bug in method 'refine_root()' of class sympy.polys.polytools.Poly

Hi, On 18 June 2013 12:26, Chris Smith wrote: > There is still a potential problem here: > > Consider an unfactorable polynomial > > >>> eq = x**5-x**3+1 > >>> factor(_) > x**5 - x**3 + 1 > > find where it has zeros > > >>> df = eq.diff(x) > >>> solve(df) > [0, -sqrt(15)/5, sqrt(15)/5] > > shift

Re: [sympy] Possible bug in method 'refine_root()' of class sympy.polys.polytools.Poly

Hi, On 18 June 2013 09:35, Heiner Kirchhoffer wrote: > Hi smichr and all, > > Thank you for your quick response. > Does that mean that the method 'refine_root()' of class 'Poly' is not > capable of finding isolation intervals for all real roots of an arbitrary > polynomial? > If so, this would, u

Re: [sympy] Tutorial simplification example suggestions

Hi, On 4 June 2013 01:55, Aaron Meurer wrote: > At http://docs.sympy.org/tutorial/tutorial/simplification.html at the > bottom, I added a little example to show how to use some of the > polynomial simplification functions like cancel() and apart(). But I > can't think of any good examples to sh

Re: [sympy] Is anyone dying to use these 2.6+ only features?

Hi, On 21 January 2013 09:15, Aaron Meurer wrote: > I was looking at what benefits we would get from dropping Python 2.5 > support (other than the obvious no longer having to test on it). If > we dropped support, we would be able to use any feature that was > introduced in Python 2.6. Here's a

Re: [sympy] Delaying evaluation of functions

Hi, On 26 March 2013 21:00, Duane Nykamp wrote: > I'd like to delay evaluation of functions like gcd so that I can have users > enter an expression like gcd(a,b), where a and b will be replaced by > numbers. If I just enter gcd(a,b), it finds the gcd of the polynomials a > and b, which is one.

Re: [sympy] Re: solve is terribly slow compared to sage

Hi, On 12 March 2013 07:37, ThanhVu Nguyen wrote: > That sounds very interesting. Can you share some details on what you did > that makes it much faster, even when using pure Python coefficients ? why > is that the current solve in sympy is so slow comparing to the one in Sage ? > Speed impro

Re: [sympy] Re: solve is terribly slow compared to sage

Hi, On 9 March 2013 21:41, ThanhVu Nguyen wrote: > They are linear equations, the coeficients are floating points ... the > simpliest kind of linear equations for solving. For example > > solve([2x + 2y + 3= 0 , 4.2x + 5y + 1 = 0 ... ] , solution_dict=True) > > Here's a real big one 165 unkno

Re: [sympy] Help, becoming involved in SymPy

Hi, On 4 March 2013 12:10, Ben Fishbein wrote: > Hello, > My name's Ben and I would like to become involved developing SymPy. However, > I'm finding the situation confusing. I've spent a while becoming familiar > with the code, but can't find an area where I can help. I've checked the > issues pa

Re: [sympy] Multivariate Polynomials

Hi, On 13 February 2013 02:18, Aaron Meurer wrote: > It's not exactly the best name, but the method you are looking for is > nth(). The arguments are powers of the generators. > > In [21]: Poly(3*x**3+2*x+12, gens=[x]).nth(3) > Out[21]: 3 > > In [22]: Poly(2*3*4*x*y*exp(8) + 23*x, gens=[x,y]).nt

Re: [sympy] sympy ground types

Hi, On 8 October 2012 16:30, Julien Rioux wrote: > Hi, > > What is the status of the different ground types supported by sympy? > "./bin/test -h" mentions three possible ground types: gmpy, python, and > sympy. These seems to have been added in March 2010 ( > http://code.google.com/p/sympy/issue

Re: [sympy] solvers - solve(), solve_poly_system

Hi, On 10 September 2012 21:04, billpap wrote: > I have posted my problem already in StackOverflow, > > > http://stackoverflow.com/questions/12353608/sympy-solve-and-solve-poly-system#comment16590856_12353608 > > A second problem that I have, is, that although when I use > solve_poly_system in g

Re: [sympy] @classmethod vs. @staticmethod

Hi, On 28 August 2012 15:27, Sergiu Ivanov wrote: > Hello, > > While writing one of my classes, I needed to factor out some bits of > functionality into private, instance-independent functions. To avoid > supplying any extra arguments to these functions, I have made them > into static methods u

Re: [sympy] reduce the google code page

Hi, On 24 August 2012 17:47, Ondřej Čertík wrote: > On Thu, Aug 23, 2012 at 1:55 PM, Aaron Meurer wrote: > > On Thu, Aug 23, 2012 at 2:15 PM, Ondřej Čertík > wrote: > >> On Thu, Aug 23, 2012 at 11:49 AM, Joachim Durchholz > wrote: > >>> Am 23.08.2012 20:09, schrieb Aaron Meurer: > >>> >

Re: [sympy] commit message reminder (72-80)

Hi, On 29 June 2012 19:29, smichr wrote: > Just a reminder that commit messages will look best when viewed in a > command window (e.g. git bash) when the title is not longer than 72 > characters, is followed by a blank line, and successive lines are not > longer than 80 characters. (If the title

Re: [sympy] mixing refine() and simplify()

Hi, On 23 June 2012 08:55, Aaron Meurer wrote: > On Jun 22, 2012, at 10:13 PM, Mateusz Paprocki wrote: > > Hi, > > On 23 June 2012 01:25, krastanov.ste...@gmail.com < > krastanov.ste...@gmail.com> wrote: > >> > simplify() is kind of a "catch all&quo

Re: [sympy] mixing refine() and simplify()

Hi, On 23 June 2012 01:25, krastanov.ste...@gmail.com < krastanov.ste...@gmail.com> wrote: > > simplify() is kind of a "catch all" simplification function, so > > perhaps it should include refine() as well. refine() is still > > relatively new, so I don't think it's been fleshed out beyond > > "a

Re: [sympy] summation in sympy

Hi, On 25 April 2012 01:36, Tom Bachmann wrote: > On 25.04.2012 00:20, Aaron Meurer wrote: > >> On Tue, Apr 24, 2012 at 5:16 PM, Tom Bachmann wrote: >> >>> I agree. Can you open an issue for this in our issue tracker (http://code.google.com/p/**sympy/issues/list

Re: [sympy] sympy git problems

Hi, On 25 April 2012 20:33, Sergiu Ivanov wrote: > Hello, > > On Wed, Apr 25, 2012 at 9:30 PM, Kjetil brinchmann Halvorsen > wrote: > > see below. > > > > On Wed, Apr 25, 2012 at 13:26, Joachim Durchholz > wrote: > >> > >> It's seeing all these .c and .so files it knows nothing about, and > d

Re: [sympy] sympy/polys/domains: Ring vs. RingDomain

Hi, On 4 April 2012 14:03, Sergiu Ivanov wrote: > On Tue, Apr 3, 2012 at 10:01 PM, Joachim Durchholz > wrote: > > Am 03.04.2012 20:30, schrieb Sergiu Ivanov: > > > > This discussion has gotten somewhat circular, and no single posting has > > addressed all points and put them into perspective. >

Re: [sympy] Unexpected weakness in sympy substitution

Hi, On 25 February 2012 23:22, Coleman Broaddus wrote: > Sympy's subs function does not seem to be able to recognize negative > multi-term expressions... > > x,y = symbols('x,y') > e1_, e2_ = symbols('e1, e2') > e1 = x > e2 = 1+x > [(e1).subs(e1,e1_), (-e1).subs(e1,e1_), (e2).subs(e2,e2_), > (-e2

Re: [sympy] Twitter page

Hi, On 25 February 2012 01:57, Ondřej Čertík wrote: > On Fri, Feb 24, 2012 at 4:42 PM, Aaron Meurer wrote: > > Great. I guess @sympy was already taken by someone. @SymPyTips is > > not, though. But @SymbolicPython is fine too. > > I think that Mateusz reserved @sympy for us to use. > Nope.

Re: [sympy] groebner walk in GSoC

Hi, On 17 February 2012 09:58, mario wrote: > In the GSoC idea page the Groebner part is outdated. > > Maybe an idea could be the implementation of the generic Groebner walk > converting between Groebner basis of finite-dimensional ideals; > there are efficient algorithms for it, by Tran (2000)

Re: [sympy] regarding function expand()

Hi, On 19 February 2012 13:36, prateek papriwal wrote: > how does the function expand() works and where is its source code > written in the git repositories of sympy . > i have cloned the sympy . > Use `git grep` to find appropriate source files: $ git grep -n "def expand" sympy/core/expr.py:23

Re: [sympy] ipython .12 notebooks with unicode or latex print

Hi, On 28 December 2011 16:25, Matthew Rocklin wrote: > I just took a look at the ipython 0.12 notebook interface and it's very > neat. > Has anyone played around with making this work well with sympy printing > (either latex or unicode)? There is an extension for sympy which can be loaded wit

Re: [sympy] mixed representation of numbers?

Hi, On 6 December 2011 08:28, smichr wrote: > Is there any place in sympy for mixed representation? in pprint, a > Rational method? > > >> Rational(7, 3).mixed > '2 1/3' > or > (2, 1/3) > > I was working with a younger math class and wishing for this today. > You can implement a printer for thi

Re: [sympy] Re: Releasing SymPy 0.7.2

t of GCI and the current fast > > pace of development, it might be a good idea to postpone the release > > to January (GCI ends on January 16th). This is also the time Aaron > > said is good (better) for him. > > > > On Wed, Nov 16, 2011 at 12:58 PM, Saptarshi Mandal

Re: [sympy] should some symbols default to literal 0?

Hi, On 27 November 2011 05:59, Aaron Meurer wrote: > This is an interesting question. Definitely is_zero should work. > > Actually, it's not so bad. It's just not implemented enough to know > that zero + zero == zero: > > In [4]: a.is_zero > Out[4]: True > > In [3]: var('a b',positive=False,ne

Re: [sympy] Removing auto-distribution of constants

Hi, On 28 November 2011 02:01, Kate MacInnis wrote: > So last spring, I started working on removing the auto-distribution of > constants. Life got busy, and I had to set that project aside for > awhile. When I decided to come back to it over the long weekend, I > decided to start fresh. I've

Re: [sympy] testing instances for sympy-live

Hi, 2011/11/27 Ondřej Čertík > Hi, > > On Fri, Nov 25, 2011 at 4:25 PM, Mateusz Paprocki > wrote: > > Hi, > > > > On 25 November 2011 15:08, krastanov.ste...@gmail.com > > wrote: > >> > >> Hi, > >> > >> You can test the

Re: [sympy] testing instances for sympy-live

Hi, On 25 November 2011 15:08, krastanov.ste...@gmail.com < krastanov.ste...@gmail.com> wrote: > Hi, > > You can test the new stuff done for sympy-live (the new design and the new > mobile interface) on sympy-live-testing-2.appspot.com. > > Aaron mentioned quite correctly a number of deficiencies

Re: [sympy] Parsing issue with mathematica.py

Hi, On 24 November 2011 18:18, Aaron Meurer wrote: > I think the problem is that you can't parse this with regular > expressions. You need a more advanced parser. This is because > regular expressions cannot solve the matching parentheses problem > (given a string of left and right parentheses

Re: [sympy] Re: NotImplementedError: only univariate inequalities are supported

Hi, On 22 November 2011 13:36, Joon Lee wrote: > Thank you for your responses. I was looking for a clean and easy to > follow method, but.. > > On Nov 17, 4:42 pm, Aaron Meurer wrote: > > In this case, it cannot > > solve systems of inequalities. Unfortunately, our inequalities solver > > is

[sympy] Re: Releasing SymPy 0.7.2

Hi, On 14 November 2011 23:02, Mateusz Paprocki wrote: > Hi, > > Is there a chance we could release SymPy 0.7.2 in two weeks? Early > December I will give a tutorial about SymPy and I would like to take > advantage of Python 3 support and new features. > I started https:

Re: [sympy] Releasing SymPy 0.7.2

Hi, On 15 November 2011 01:17, Vladimir Perić wrote: > On Tue, Nov 15, 2011 at 8:08 AM, Aaron Meurer wrote: > > Hi. > > > > On Tue, Nov 15, 2011 at 12:02 AM, Mateusz Paprocki > wrote: > >> Hi, > >> Is there a chance we could release SymPy 0.7.2 in tw

Re: [sympy] Releasing SymPy 0.7.2

Hi, On 14 November 2011 23:08, Aaron Meurer wrote: > Hi. > > On Tue, Nov 15, 2011 at 12:02 AM, Mateusz Paprocki > wrote: > > Hi, > > Is there a chance we could release SymPy 0.7.2 in two weeks? Early > December > > I will give a tutorial about SymPy and

Re: [sympy] Algorithm used to calculate approximation of exp, log, ...

Hi, On 15 November 2011 10:28, Christophe BAL wrote: > Hello, > what are the algorithms used to calculate approximation of exp ? > I suggest asking this question on mpmath's mailing list. > > Best regards. > Christophe. > > -- > You received this message because you are subscribed to the Goog

[sympy] Releasing SymPy 0.7.2

Hi, Is there a chance we could release SymPy 0.7.2 in two weeks? Early December I will give a tutorial about SymPy and I would like to take advantage of Python 3 support and new features. Mateusz -- You received this message because you are subscribed to the Google Groups "sympy" group. To pos

Re: [sympy] Re: abstract syntax tree

bdarepr(sin(x)) >>> Out[47]: sin(x) >>> >> >> Because sin is a Function and Function has a custom printer, which is not >> true for Integral, which is just an ordinary type (default printer). >> >> >>> >>> Is this difference betwee

Re: [sympy] Re: abstract syntax tree

gt; In [46]: lambdarepr(sin(x).func) > Out[46]: sin > > In [47]: lambdarepr(sin(x)) > Out[47]: sin(x) > Because sin is a Function and Function has a custom printer, which is not true for Integral, which is just an ordinary type (default printer). > > Is this difference bet

Re: [sympy] Re: abstract syntax tree

Hi, On 12 November 2011 17:00, krastanov.ste...@gmail.com < krastanov.ste...@gmail.com> wrote: > Ok, but why are those printed differently (ipython --profile=sympy): > > In [34]: sin(x).func > Out[34]: sympy.functions.elementary.trigonometric.sin > > In [35]: str(sin(x).func) > Out[35]: sin > > I

Re: [sympy] Re: convert sympy.Matrix to list of lists of python standard types or numpy array

so far. I don't know if this is in > > the scope of sympy, but it would be nice to have a nice interface to > > numpy at this point. > > This is within the scope to some degree. This is why we have > functions like lambdify() for example. > > Aaron Meurer > >

Re: [sympy] Re: convert sympy.Matrix to list of lists of python standard types or numpy array

all last) /home/mateusz/repo/git/sympy/ in () > 1 long(Integer(10)) TypeError: long() argument must be a string or a number, not 'Integer' > I've got the pypy version of sympy which is 0.7.1. Has the behavior > anything changed here? > > Thanks for your help anyw

Re: [sympy] convert sympy.Matrix to list of lists of python standard types or numpy array

Hi, On 1 November 2011 09:36, a.lwtzky wrote: > Dear everyone, > > I was wondering if there is a function in sympy that converts a > sympy.Matrix to a list of lists of python standard types. For example > if you have > >>> m = matrices.Matrix([[2,0],[0,2]]) > > it would be nice to have a functio

Re: [sympy] papers on sympy?

Hi, On 1 November 2011 09:22, Aaron Meurer wrote: > On Mon, Oct 31, 2011 at 6:37 PM, David Joyner wrote: > > On Mon, Oct 31, 2011 at 7:31 PM, Aaron Meurer > wrote: > >> Comments: > >> > >> - "as its beautiful logo" should this be "as is its beautiful logo"? > > > > fixed > > > >> > >> - "Howe

Re: [sympy] papers on sympy?

Hi, On 30 October 2011 09:14, David Joyner wrote: > On Thu, Oct 13, 2011 at 5:33 AM, David Joyner wrote: > > On Wed, Oct 12, 2011 at 1:21 PM, Aaron Meurer > wrote: > > > > ... > > > > > Thanks very much for these. I'll post a draft for criticism once it > reaches > > a more readable state. > >

Re: [sympy] Add.flatten doesn't join Polys

Hi, On 26 October 2011 01:24, smichr wrote: > I would expect Add to behave the same as the + operator in this > situation: > > >>> Add(Poly(0,x),Poly(x,x)) > Poly(0, x, domain='ZZ') + Poly(x, x, domain='ZZ') > >>> _.args[0]+_.args[1] > Poly(x, x, domain='ZZ') > > Is this an issue that should be

Re: [sympy] just an FYI

Hi, On 23 October 2011 17:45, smichr wrote: > I found that cancel (even when there is nothing to cancel) does do > something: > >>>> cancel(3.0*x+y**2-2) >3.0*x + 1.0*y**2 - 2.0 > > I'm not sure if this is a bug or a feature, but it's something to be > aware of. > This is a future, beca

Re: [sympy] Latest and greatest Sphinx docs

Hi, On 16 October 2011 16:11, Jason Moore wrote: > Hi, > > Are the lastest (head on master) docs accessible online anywhere? (like > readthedocs or github pages) > They are here: http://docs.sympy.org/dev/ (last updated 11 October). > > We just added the physics.mechanics package to sympy, bu

Re: [sympy] Test failure in solvers/test_solvers.py

Hi, On 13 October 2011 19:29, Chris Smith wrote: > 2011/10/14 Aaron Meurer : > > I didn't look into it, but my guess is that the log is only expanded > > if the expansion hints are hit on the expression in a particular > > order. Unfortunately, we still have in Expr.expand: > > > > for hint, us

Re: [sympy] Test failure in solvers/test_solvers.py

Hi, On 13 October 2011 15:00, Vladimir Perić wrote: > On Thu, Oct 13, 2011 at 8:31 PM, Tom Bachmann wrote: > > Hi all, > > > > when rebasing my branch onto master, I suddenly get a test failure at > line > > 727 of sympy/solvers/tests/test_solvers.py. It took me quite a while to > > notice the

Re: [sympy] how to remove gcd Integer and terms, not Rational and terms

Hi, On 13 October 2011 11:15, smichr wrote: > Does anyone have a suggestion of how to best retrieve the Integer gcd > and factors from an Add instead of getting the Rational? > >>>> terms_gcd(3*x+9*x**2/2) # I want 3*x*(3*x/2 + 1) >3*x*(3*x + 2)/2 >>>> primitive(3*(3*x/2 + 1)) >(

Re: [sympy] PyPy benchmarks

Hi, On 8 October 2011 04:40, Maciej Fijalkowski wrote: > Hi > > I did some benchmarking of sympy under PyPy. I would like some > comments on the validity of benchmarks. I've use PyPy nightly from 7th > of Oct, CPython 2.7 release and sympy git trunk. > > Benchmarks (also http://paste.pocoo.org/s

Re: [sympy] Getting transcendental rather log form of integral

Hi, On 6 October 2011 12:04, Mateusz Paprocki wrote: > Hi, > > On 6 October 2011 11:57, Scott wrote: > >> How do I coerce integrate(a/(a**2+b*a+b*c*x**2),x) to yield. >> This may be a double post. >> >>

Re: [sympy] Getting transcendental rather log form of integral

Hi, On 6 October 2011 11:57, Scott wrote: > How do I coerce integrate(a/(a**2+b*a+b*c*x**2),x) to yield. > This may be a double post. > >Sqrt[b] Sqrt[c] x > Sqrt[a] ArcTan[---] > Sqrt[a] Sqrt[a + b] > --- >Sqrt[b]

Re: [sympy] papers on sympy?

Hi, On 6 October 2011 10:10, David Joyner wrote: > On Thu, Oct 6, 2011 at 1:03 PM, william ratcliff > wrote: > > Has the core team thought about making a small publication somewhere for > > sympy? For the academics it might be useful... > > > I'm not in the core team, but I've been asked to wr

Re: [sympy] Gröbner Bases / Modulus / Algebraic Relations

Hi, On 29 September 2011 05:07, Vinzenz wrote: > Hi, > > I'm trying to port a Mathematica project to sympy. Therefore, I would > like to use an algorithm to decompose an expression using Gröbner > Bases as described in > > 8.3 Algebraic Relations, Gröbner Bases: A Short Introduction for > System

Re: [sympy] Simple way to construct an arbitrary rank numpy array of sympy zeros

Hi, On 29 September 2011 04:52, Torquil wrote: > Hi everybody! > > What is the simplest way of constructing e.g. a (2,3,4)-shaped numpy > array containing sympy zeros? > The simplest, but maybe not the most efficient is: In [1]: import numpy as np In [2]: a = S.Zero*np.zeros((2, 3, 4)) In [3

  1   2   3   4   >