So you are saying ii)Linear system of three or more ODEs equations like x'(t)
= cy – bz, y'(t) = az – cx, z'(t) = bx – ay is already implemented in
sympy.
If yes do inform me so that I can update my proposal
On Saturday, March 15, 2014 5:13:49 AM UTC+5:30, Aaron Meurer wrote:
I think at
I agree, although it is usually a good idea to have a lot of
motivating examples to write a good framework. But in this case, the
existing solvers should be enough (with perhaps the exception of the
solvers that cannot exist currently because the current framework
doesn't allow them, like
- Your example
In[]: soln = solve(sin(x)*sin(y), (x, y), input_set = Interval(0,
4)*Interval(0, 4))
is a bit confusing to me. The input_set argument gives a 2-dimensional
set, but how are you to know which axis is x and which is y?
The axis is determined by the order of variables in which
Hello,
In order to save time, can you tell me what kinds of Diophantine equation
you have problems with? If possible, please give me an example.
Thank you
On Saturday, March 15, 2014 4:06:48 PM UTC+2, Nguyen Tung wrote:
Thanks, problem solved
On Saturday, March 15, 2014 3:20:44 PM UTC+2,
Uploaded mine.
On Wednesday, March 12, 2014 10:10:27 PM UTC+5:30, Aaron Meurer wrote:
I see quite a few GSoC proposals on the wiki. I just want to remind
everyone that proposals do not count unless they are submitted in
Melange. The deadline is not for another week, but it's better to keep
Mine too, also re-Uploaded the enrollment form!
On Sun, Mar 16, 2014 at 2:37 PM, Sachin Joglekar srjoglekar...@gmail.comwrote:
Uploaded mine.
On Wednesday, March 12, 2014 10:10:27 PM UTC+5:30, Aaron Meurer wrote:
I see quite a few GSoC proposals on the wiki. I just want to remind
everyone
Hi,
You mean the areas we need to improve? I noted some of the areas we need
to improve in my first reply to you. Please have a look at that. Let me
know if
you have any problems with that.
Regards,
Thilina
On Sun, Mar 16, 2014 at 2:37 PM, Nguyen Tung iwonan...@gmail.com wrote:
Hello,
In
I searched for it Aaron but cant find whether ii) is implemented. Please
inform me if it is.
On Sunday, March 16, 2014 11:38:32 AM UTC+5:30, Kundan Kumar wrote:
So you are saying ii)Linear system of three or more ODEs equations like
x'(t)
= cy – bz, y'(t) = az – cx, z'(t) = bx – ay is
Hi all,
Sorry for my long absence from the discussion here. I was busy improving my
knowledge base on Diophantine equations and Group Theory, and getting
familiar to the sympy module. I tried implementing the issues listed in
First,
Yes, you said I can work on Diophantine equations. But I don't know what
kind of equation you have problems with? (Is that binary quadratic or
homogeneous ternary quadratic or general pythagorean)
Second,
I need some test cases that made you think your Diophantine solver needs to
be
Hi,
I am sorry If I was not clear to you early. I was just letting you know of
the areas
you can work on. The PR refers to a Pull Request. Are you familiar with
github?
If not have a look at the following link.
https://help.github.com/articles/using-pull-requests
The link of the Pull request I
Hi,
Nice to hear that you are working in fixing the issues. Did you find good
references for
the algorithms involved? I am eager to know how much of work you have done
on this.
Regards,
Thilina
On Sun, Mar 16, 2014 at 4:23 PM, Kumar Krishna Agarwal
kumar.1994...@gmail.com wrote:
Hi all,
Below is an example of implementation of place command in Matlab (
http://www.mathworks.com/help/control/ref/place.html;jsessionid=aa5f7955d910961c374bbda6868a
).
http://pastie.org/private/woqxo2cqgt8c7qdicyxr9q
W dniu wtorek, 11 marca 2014 21:54:41 UTC+1 użytkownik Jason Moore napisał:
I'm little surpised. Can you provide an example of this
from the Mathematica?
I don't have the software. But I have seen examples in
the references.
Wolfram gives both the truncated series with the order
term and using generating functions as shown below:
In[1] := FormalSeries(exp(x), x)
input_set = imageset((x, y), x**2 + y**2 1, S.Reals*S.Reals))
Note that sets doesn't work this way, we don't take booleans. I'm actually
pretty sure you know this already, I just want to show off how sets works
to others.
Instead you could do the following
In [4]: unit_disk =
Cool. That looks useful. If you start using Symbols the results get more
complicated but with this change:
from sympy import symbols
from sympy.matrices import Matrix
from sympy.core.symbol import Symbol
from sympy.polys.polytools import Poly
from sympy.solvers.solvers import solve
def place(A,
Please give a few minutes of your time to see what I have.
On Saturday, March 15, 2014 9:04:27 PM UTC+5:30, SAHIL SHEKHAWAT wrote:
Hi everyone!
I have my proposal at
https://github.com/sympy/sympy/wiki/GSoC-2014-Application-Sahil-Shekhawat%3A-Improving-SymPyGamma.
I think the idea is
On 16.03.2014 17:52, Avichal Dayal wrote:
I'm little surpised. Can you provide an example of this
from the Mathematica?
I don't have the software. But I have seen examples in
the references.
Wolfram gives both the truncated series with the order
term and using generating functions as
On Sun, Mar 16, 2014 at 06:52:14AM -0700, Avichal Dayal wrote:
But is it encouraged to use fn library?
No.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
On Saturday, March 15, 2014 5:28:33 AM UTC+5:30, Aaron Meurer wrote:
On Mon, Mar 3, 2014 at 2:03 PM, RAJAT AGGARWAL
rajatagg...@gmail.com javascript: wrote:
Hi
I was working on the other parts of the sympy code, to understand the
much
part of it so that i can have ideas for this
Hi Aaron
Step-by-step implementation includes all the modules. It is just an example
to proceed with different modules. What I meant was, for Integration parts
we can just use this already implemented feature to show the steps.
Yeah, I agree that this is different from what we learn in
On Sun, Mar 16, 2014 at 3:06 AM, Harsh Gupta gupta.hars...@gmail.com wrote:
- Your example
In[]: soln = solve(sin(x)*sin(y), (x, y), input_set = Interval(0,
4)*Interval(0, 4))
is a bit confusing to me. The input_set argument gives a 2-dimensional
set, but how are you to know which axis is x
Sorry for not responding sooner. This thread must have fallen through
the cracks.
I've answered your questions inline. Let me just comment on the
proposal itself here.
It feels a bit like a laundry list. I realize that you don't really
know what is priority. I would rather focus the proposal.
Did you figure this out?
Aaron Meurer
On Thu, Mar 13, 2014 at 4:26 PM, Kundan Kumar
kundankumar18...@gmail.com wrote:
Hi,
I am implementing nth order euler non homogeneous equation (homogeneous has
already been implemented). But I am unable to understand what is key of
match used in each
S.Integers._contains(self, other) just calls ask(Q.integer(other))
S.Reals is actually just Interval(-oo, oo). Interval._contains depends on
the and operators. It returns true because the following return true
In [9]: x oo
Out[9]: True
In [10]: x -oo
Out[10]: True
On Sun, Mar 16, 2014
On Sun, Mar 16, 2014 at 2:27 PM, Matthew Rocklin mrock...@gmail.com wrote:
S.Integers._contains(self, other) just calls ask(Q.integer(other))
It should raise an exception when ask() returns None.
S.Reals is actually just Interval(-oo, oo). Interval._contains depends on
the and operators.
Hi,
I've worked on the first issue you gave me:
diophantine(x**3-4*x*y**2+y**3-1)
I've found a bug in your classify_diop() that yields an error. In line 322,
you put a '==' which should be '='. But even I fix that, the code gave me
set([]) (which I assume no solution). Then, I tried to solve
Here's what I think we should we with the parameters. The list is generated
from the docstring.
'dict'=True (default is False)
return list (perhaps empty) of solution mappings
'set'=True (default is False)
return list of symbols and set of tuple(s) of solution(s)
Not needed, sets as
Going from functions to summations would be useful, though I'm not
sure if such a thing would be required or even useful for the series
module. The last time we discussed it, the conclusion was that we need
stronger summation algorithms, so that we have some hope of
simplifying the product or
On Sun, Mar 16, 2014 at 3:20 PM, Harsh Gupta gupta.hars...@gmail.com wrote:
Here's what I think we should we with the parameters. The list is generated
from the docstring.
'dict'=True (default is False)
return list (perhaps empty) of solution mappings
'set'=True (default is False)
I'm not sure if the input_set API is as friendly as it could be. Most
users are going to want to just toss in relations with the rest of the
equations, especially if they can be expressed using the assumptions
or using inequalities, like
solve([sin(x) - 1, x 0])
or
solve([x**2 + y**2
Sorry I accidently pushed Send, ( I was unconsciously entering some vim
commands). Ignore the For after the example.
--
Harsh
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and stop receiving emails from it, send an
Recall that sets mostly lives in the core. In particular I think that
Interval and maybe Union have been used in the core for some time and
FiniteSet has made itself useful in the last couple years.
On Sun, Mar 16, 2014 at 3:31 PM, Matthew Rocklin mrock...@gmail.com wrote:
By the way, I
Hi,
There is a good library called Arb from Fredrik, which among others
can do Bernoulli numbers:
http://fredrikj.net/arb/
http://fredrikj.net/arb/bernoulli.html
I think it is very fast, judging from Fredrik's blogposts:
Hi,
But what if one of the packages we use is discontinued for some
reason? we will have to switch to another. So as Tim has pointed out,
we should take careful decisions when we choose these additional
libraries
Right. This is the case. But there are some big old players around
that
Looking through my notes
(https://github.com/sympy/sympy/wiki/assumptions_handlers, pardon the
formatting; it looks better in emacs), I see that most of the wrong
results I saw were not in the core facts, like positive or real
(other than the ones you probably already knew about with infinities
Yeah, I got it. Thanks
On Monday, March 17, 2014 12:45:38 AM UTC+5:30, Aaron Meurer wrote:
Did you figure this out?
Aaron Meurer
On Thu, Mar 13, 2014 at 4:26 PM, Kundan Kumar
kundanku...@gmail.com javascript: wrote:
Hi,
I am implementing nth order euler non homogeneous equation
In the mechanics package we generate very long mathematical expressions
which we then want to evaluate numerically as fast as possible. To do this,
we generate code in a low level language and typically use common
subexpression elimination as a pre-compile optimization step*. I'm
wondering if
Someone contributed recently modificatin that allow Theano elemwise to
run in parallel on the CPU. We found that it is useless or harmful to
run in parallel for the addition of 2 vectors if their is less then
200k elements in the vectors. This is just to show how big is the cost
to start/stop
Hi,
On Sun, Mar 16, 2014 at 5:49 PM, someone someb...@bluewin.ch wrote:
Hi,
But what if one of the packages we use is discontinued for some
reason? we will have to switch to another. So as Tim has pointed out,
we should take careful decisions when we choose these additional
libraries
my porposal is
at
https://github.com/sympy/sympy/wiki/GSoC-2014-Application-Sahil-Shekhawat:-3D-plotting-in-SymPyGamma
On Monday, March 17, 2014 7:38:36 AM UTC+5:30, SAHIL SHEKHAWAT wrote:
I think my proposal i near to completion can you please have a look.
On Wednesday, March 5, 2014
I think my proposal i near to completion can you please have a look.
On Wednesday, March 5, 2014 10:07:18 AM UTC+5:30, SAHIL SHEKHAWAT wrote:
Thanks David and Ondřej , i am starting writing my proposal...
*thanks a lot*
On Wednesday, March 5, 2014 9:54:16 AM UTC+5:30, Ondřej Čertík wrote:
Thanks Fred. That gives me a sense of scale. The longer expressions I've
encountered so far in our work far have 1000 to 5000 common subexpressions
(although it wouldn't be hard to create problems that have hundreds of
thousands of cses). So this isn't at the scale your are talking about for
I'm not sure that Fred's experience applies in this case. Fred, am I
correct in assuming that the element-wise computations that you benchmarked
had FLOPs / element ratios less than ten? I.e. you did only a few
computations per element but on many elements? In this case you're memory
bound and
I updated the wiki page.
On Fri, Mar 14, 2014 at 3:43 PM, Aaron Meurer asmeu...@gmail.com wrote:
Historically, the purpose of the 0 has not been features but API
stability. That's my main motivation for waiting for the assumptions.
Aaron Meurer
On Fri, Mar 14, 2014 at 5:31 PM, Joachim
Response from Max follows (for some reason he was getting bounced by the
mailing list).
On Sun, Mar 16, 2014 at 8:55 PM, Max Hutchinson maxhu...@gmail.com wrote:
tl;dr it depends on the DAG, but improved ILP is is likely possible (if
difficult) and there could be room for multi-core
46 matches
Mail list logo
