On Sun, Mar 11, 2012 at 12:21 PM, Saptarshi Mandal
wrote:
> Chris,
> Its sad that you are leaving. I would like to take this opportunity to
> thank you for reviewing and correcting my (bad) pull requests during
> and after GSoC. I learned a lot of technical stuff from you and I am
> still in awe o
Thank you, Chris.
> It is pity. I remember how you help me about year ago, when I was
> started with the sympy.
>
>
It's been nice to see your competent work, Alexey. I'm glad I could be of
some help. The sympy group, like those who work with python, are a
really helpful bunch, I think.
> I hope
Am 11.03.2012 05:27, schrieb Bharath M R:
@Sergiu I was looking at top down operator precedence parsing for the task
That's the technique where the grammar requires the least contortions.
It also composes well: you can define sublanguages (such as arithmetic
and boolean logic), and as long as
Wow! Unexpectedly, there is a lot work that has been done in the logic
module. Great!
On Sun, Mar 11, 2012 at 8:58 AM, Aaron Meurer wrote:
> Unfortunately, documentation is one of the shortcomings in the
> assumptions code right now. I think you're best of just reading the
> code and figuring ou
Am 11.03.2012 05:21, schrieb Aaron Meurer:
* There is a categorical oversight in your analysis: in mathematical
terms, 'Monoid' and 'Ring' are categories, while specific algebraic
structures (e.g. the ring of integers (ZZ, +, *)) are members of these
categories.
I'm aware of that.
The problem i
On Sunday, March 11, 2012 7:00:15 PM UTC+5:30, Joachim Durchholz wrote:
>
> Am 11.03.2012 05:27, schrieb Bharath M R:
> > @Sergiu I was looking at top down operator precedence parsing for the
> task
>
> That's the technique where the grammar requires the least contortions.
> It also composes wel
Am 11.03.2012 17:58, schrieb Bharath M R:
Thanks for the reply. The parser is for building the web interface similar
to
Wolfram Alpha for SymPy. Basically I want to parse things like
integrate x**2 dx
roots x**2==1
Won't the operator precedence parsing be sufficient for this?
These two are ea
In [80]: Integer(1)
Out[80]: 1
In [81]: _.args
Out[81]: ()
Is this normal? I expected type(expr)(*expr.args) == expr to be always true.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To un
n [8]: i = ImmutableMatrix(eye(3))
In [9]: i**2
Out[9]:
2
⎡1 0 0⎤
⎢ ⎥
⎢0 1 0⎥
⎢ ⎥
⎣0 0 1⎦
In [10]: _.doit()
TypeError
Casting to Matrix does not work either. How to actually calculate the
product with Immutable matrices?
--
You received this message because you
Actually one can use as_explicit. I did not saw it in the
documentations, only when I checked the code I found about it.
On 11 March 2012 21:14, krastanov.ste...@gmail.com
wrote:
> n [8]: i = ImmutableMatrix(eye(3))
>
> In [9]: i**2
> Out[9]:
>
> 2
> ⎡1 0 0⎤
> ⎢ ⎥
> ⎢0 1 0⎥
>
On Sun, Mar 11, 2012 at 6:58 PM, Bharath M R wrote:
>
> On Sunday, March 11, 2012 7:00:15 PM UTC+5:30, Joachim Durchholz wrote:
>>
>> Am 11.03.2012 05:27, schrieb Bharath M R:
>> > @Sergiu I was looking at top down operator precedence parsing for the
>> > task
>>
>> That's the technique where the
On Sun, Mar 11, 2012 at 6:27 AM, Bharath M R wrote:
>
> @Sergiu I was looking at top down operator precedence parsing for the task
> (http://javascript.crockford.com/tdop/tdop.html) . One of the important task
> is to
> come up with the grammar. Is it possible to meet you on IRC sometime to
> disc
On Sun, Mar 11, 2012 at 5:26 AM, Aaron Meurer wrote:
> As far as I know, everything that has been implemented is already in
> the codebase, with the exception of
> https://github.com/sympy/sympy/pull/563. I've CC'd Jeremias (the
> student who worked on it last year) and Mateusz (his mentor), to s
On Sat, Mar 10, 2012 at 10:28 PM, Aaron Meurer wrote:
> Well, if you tell me specifically what you want to do, I can tell you
> where you can get the information. Do you just want to add more
> descriptive text for each item in the Features section? You'll
> probably have to use different kind o
On Sun, Mar 11, 2012 at 3:36 PM, Sergiu Ivanov
wrote:
> On Sat, Mar 10, 2012 at 10:28 PM, Aaron Meurer wrote:
>> Well, if you tell me specifically what you want to do, I can tell you
>> where you can get the information. Do you just want to add more
>> descriptive text for each item in the Featu
On Sun, Mar 11, 2012 at 10:39 AM, Joachim Durchholz wrote:
> Am 11.03.2012 05:21, schrieb Aaron Meurer:
* There is a categorical oversight in your analysis: in mathematical
terms, 'Monoid' and 'Ring' are categories, while specific algebraic
structures (e.g. the ring of integers
Right i**2 is a MatrixExpr. At some point someone suggested that we have
unevaluated dense matrix expressions. This choice was made to satisfy that
desire. We can change things around though.
In [1]: X = ImmutableMatrix(3,3, range(9))
In [4]: Y = ImmutableMatrix(ones(3, 3))
In [6]: X*Y
Out[6]:
⎡0
Le dimanche 11 mars 2012 à 17:39 +0100, Joachim Durchholz a écrit :
> Am 11.03.2012 05:21, schrieb Aaron Meurer:
> >>> * There is a categorical oversight in your analysis: in mathematical
> >>> terms, 'Monoid' and 'Ring' are categories, while specific algebraic
> >>> structures (e.g. the ring of in
On Sun, Mar 11, 2012 at 3:55 PM, Matthew Rocklin wrote:
> Right i**2 is a MatrixExpr. At some point someone suggested that we have
> unevaluated dense matrix expressions. This choice was made to satisfy that
> desire. We can change things around though.
>
> In [1]: X = ImmutableMatrix(3,3, range(9
See http://code.google.com/p/sympy/issues/detail?id=1206.
Aaron Meurer
On Sun, Mar 11, 2012 at 1:03 PM, krastanov.ste...@gmail.com
wrote:
> In [80]: Integer(1)
> Out[80]: 1
>
> In [81]: _.args
> Out[81]: ()
>
> Is this normal? I expected type(expr)(*expr.args) == expr to be always true.
>
> --
>
Polys are represented using a dense scheme, which is internally
represented by lists of lists. The way it works is that a
multivariate polynomial is recursively represented as a polynomial
with polynomial coefficients. A univariate polynomial is represented
just as you would expect it to be, e.g.
> If Mateusz is free, he'll likely be the one to mentor such a project.
> Otherwise, I don't know. Mario, would you be willing to help out with
> such a project, if not directly mentor it. I think your knowledge of
> Groebner bases is probably the strongest. We can help out where your
> knowledg
@Aaron - Will do. In general my point was that here is a case where we want
to write down X*Y in one way potentially but act on the syntax in two
different ways. We want to build two different mechanisms to consume the
expression X+Y
1. Return an unevaluated but simplified Matrix Expr
2. Ret
If you look at the source code for nstr, it only checks very for very
specific types. mpmath functions in general don't know about SymPy
functions, so if they work, it's just by the accident of duck typing.
That's why we have things like lambdify().
In this case, you can just use nstr(A.tolist())
For a mode selector, you'll have to ask on the IPython list. You can
get mathjax output by selecting the sympy profile, as in
ipython notebook --profile=sympy
Aaron Meurer
On Fri, Feb 3, 2012 at 4:04 PM, Paul Lutus wrote:
> The sympy sampler located at http://live.sympy.org allows one to choos
Hi,
I am a second year student of Netaji Subhas Institue of
Technology(under Delhi University),India.My major is Instrumentation
and Control engineering.I am good in "Data Structures and
Algorithms",as for the current project.Besides this I am good in
Linux,CSS etc..
I am programming for th
We will hopefully move our examples to IPython notebooks (see
http://code.google.com/p/sympy/issues/detail?id=2940). If they are
examples, I think for now you can just put the notebook in the
examples directory.
I'm not sure how to include html. I guess you should look at the
Sphinx documentatio
How about using MatrixExpr as an unevaluated proxy, and then
substitute ImmutibleMatrix when you want to evaluate it? It really
seems to me that sums, producs, and powers of ImmutibleMatrix should
evaluate by default.
Would you ever want X + X to not reduce to 2*X? That's kind of how
the core wo
I worked on the Risch algorithm for GSoC over the summer of 2010. The
work hasn't been merged yet, but you can find it at
https://github.com/asmeurer/sympy/tree/integration3, and details of
what was done are at
https://github.com/sympy/sympy/wiki/GSoC-2010-Risch-Integration-Report,
and in blog pos
I'm not sure about that. Doesn't that assume that a lambda expression
is going to return a floating point (or at least numeric) value?
Aaron Meurer
On Thu, Feb 9, 2012 at 1:58 PM, krastanov.ste...@gmail.com
wrote:
> On 9 February 2012 21:39, Aaron Meurer wrote:
>> I'm assuming you answered you
30 matches
Mail list logo
