> On Sunday, June 29, 2014 3:08:00 PM UTC-5, an...@britishideas.com wrote:
>>
>> Hi,
>>
>> I have the following expression in sympy:
>>
>> -0.497/rb == 2.5
>>
>> How can I evaluate it to give me the value of rb?
>>
>> Thanks, A
Hi,
I have the following expression in sympy:
-0.497/rb == 2.5
How can I evaluate it to give me the value of rb?
Thanks, Andy
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving e
Hello,
I would like to bring to your attention the following conference
announcement. Very sorry if you are recieving this multiple times.
-- Andy
--
Andy R. Terrel, Ph.D.
Texas Advanced Computing Center
University of Texas at Austin
ater...@tacc.utexas.edu
SciPy 2012, the eleventh annual
On Wed, Mar 21, 2012 at 4:32 PM, Aaron Meurer wrote:
> On Wed, Mar 21, 2012 at 3:10 PM, Andy Ray Terrel
> wrote:
>> I would like to play more with the LLVM implementation. Check out
>> https://github.com/ContinuumIO/numba
>
> Cool. Is that related to the unladen swall
are very ambitious vectorize (or generate
CUDA/OPENCL/ISPC code).
It looks like there is enough interest for me to go find a
bibliography for this project.
-- Andy
On Wed, Mar 21, 2012 at 2:47 PM, Aaron Meurer wrote:
> I wonder if we can take advantage of the low-level interpretation from
Yeah the idea for a first pass is to only support Static Single
Assignment codes and then iterate upon that.
-- Andy
On Tue, Mar 20, 2012 at 2:47 PM, Nikhilesh Sigatapu
wrote:
> The idea is interesting. You would have to consider side-effects and other
> similar complications tha
simple things in the other directions. I realize
this isn't super well formed but after seeing a number of these
symbolic executor papers, I think it is probably a good way to go.
-- Andy
On Tue, Mar 20, 2012 at 11:28 AM, Aaron Meurer wrote:
> Isn't this just a matter of turning some v
mizes codes for IBM and has won him 5
Gordon Bell prizes.
-- Andy
--
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 unsubscribe from this group, send email to
sympy+unsubscr...@g
This seems doable and our cse algorithms are somewhat bad.
Hosengadi et al 2006:
http://cseweb.ucsd.edu/~kastner/papers/tcad06-poly_factorization_cse.pdf
-- Andy
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To view this discussion
these projects, I don't know that it is feasible to switch
SymPy. It would be much more work.
-- Andy
On Fri, Feb 3, 2012 at 5:18 PM, Aaron Meurer wrote:
> On Thu, Feb 2, 2012 at 3:21 PM, Nathan Rice
> wrote:
>>>> Also, note that @chainable does some magic :) Every operat
t of 3: 137 ns per loop
In [24]: %timeit numpy.random.random()
100 loops, best of 3: 216 ns per loop
>
> Aaron Meurer
>
> On Sun, Feb 5, 2012 at 6:28 PM, Andy Ray Terrel wrote:
>> On Fri, Feb 3, 2012 at 11:19 PM, scripts wrote:
>>> Is easier to explain my questio
On Fri, Feb 3, 2012 at 11:19 PM, scripts wrote:
> Is easier to explain my question with an example, what i'm seeking is
> something like this:
>
>>> n = Rational.random()
> '1/2'
sympy.Rational(numpy.random.randint(100), numpy.random.randint(100))
>
>>> n = Irrational.random()
> '1.414214532'
>
umpy or math modules then this would probably affect
things.
-- Andy
On Mon, Jan 30, 2012 at 1:49 PM, Vincent MAILLE wrote:
> Hi,
>
> I try :
> e=exp(1)
> simplify(log(e))
>
> And the result is log(e) not 1. Do you know why ?
>
> Thanks,
> Vincent
>
> --
>
No, but the code that is generated is usually small. I would just add
them to the code.
Do you have a case where this isn't possible?
-- Andy
On Tue, Jan 24, 2012 at 10:01 AM, quasilister wrote:
> is it possible to pass printf statements to codegen for C code
> generation?
&
27;s not useful enough for SymPy to make
> it worth the effort and risk.
Traits is a lot more than just type checking and if that is all you
want I wouldn't recommend it. It should really be thought of as a
large number of programming patterns, many of which are targeted
towards GUI pro
I do use eclipse quite a bit but eclipse isn't very good at
interpreted languages. The best python IDE that I have seen is
WingWare.
Python's debugger can do what you are saying, its just not visual.
-- Andy
On Tue, Nov 8, 2011 at 3:40 PM, Joachim Durchholz wrote:
> Am 08.
tia when it was built.
-- Andy
2011/11/8 Ondřej Čertík :
> Hi,
>
> I finally needed to generate Fortran code from a SymPy expression. I
> couldn't find any documentation for it. Is there any? I found the
> FCodeGen object, but
> it has no useful docstring So I looked at
re lots of people who
have done it, including yours truly. The issue is that FEM is usually
done for very large problems for which symbolics is prohibatively
expensive. The FEniCS, Sundance, and others approach is to use
symbolics to describe operators for building a numeric matrix, SyFi
took your appr
My suggestion would be to continue with the matrixify solution and
write functions to fix up the expression tree as need be. The whole
issue of making Add/Mul/Pow extensible is separate but the logic can
be transferred pretty easily.
-- Andy
On Wed, Jul 13, 2011 at 1:44 PM, Aaron Meurer wrote
Be sure to go support the sprint and add your ideas in the comments.
-- Andy
http://conference.scipy.org/scipy2011/sprints.php
On Wed, Jul 6, 2011 at 3:10 AM, Mateusz Paprocki wrote:
> Hi,
>
> On 6 July 2011 04:37, Andy Ray Terrel wrote:
>>
>> If you guys have a couple of
If you guys have a couple of topics that we could maybe pull others in
with let me know.
-- Andy
On Tue, Jul 5, 2011 at 8:47 PM, Mateusz Paprocki wrote:
> Hi,
>
> On 6 July 2011 03:43, Aaron Meurer wrote:
>>
>> Yes, I'll be there too. Mateusz wil be at the confere
Anyone interested in the SciPy sprints?
http://conference.scipy.org/scipy2011/sprints.php
I should be around.
-- Andy
--
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 unsubs
Hi Ondrej,
Glad you like it.
I hope this pull request worked, first time for me working with git
and github.
https://github.com/sympy/sympy/pull/415
I'm open to suggestions/improvements.
Andy
On Jun 13, 8:02 pm, Ondrej Certik wrote:
> Hi Andy,
>
> On Mon, Jun 13, 2011 at
Hi,
I wrote a simple function to fit polynomials. Its based on this
article.
http://mathworld.wolfram.com/LeastSquaresFittingPolynomial.html
Maybe it is useful for you.
from sympy import Float, Matrix, S, Symbol, Integer, lambdify, sqrt
def fit_poly(x, y, sym, degree=1):
"""
Fit polynom
Hi,
I wrote a simple function to fit polynomials. Its based on this
article.
http://mathworld.wolfram.com/LeastSquaresFittingPolynomial.html
--
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.
T
Feel free to ask me to look at a branch. That's what I'm here for.
Additionally what is "quality" code is usually subject to the dev. If
it is PEP 8 compliant and doesn't have any major design flaws its
usually okay.
-- Andy
On Fri, Jun 3, 2011 at 7:45 PM, Aaron S. Me
be the best fit for all linear algebraic operations, it is
the mathematical tradition.
-- Andy
On Thu, May 26, 2011 at 6:09 PM, Ondrej Certik wrote:
> On Thu, May 26, 2011 at 2:49 PM, Brian Granger wrote:
>> +1 on manipulate
>> +1 on matrices or matrix, -1 on linear instead of ma
= (sympy.Rational(21,10)*x*(1-y)**2 + 2*y*x) / X**3
In [22]: sympy.simplify(expr)
Out[22]: (105*x - 110*x*y + 105*x*y**2)/(50*X**3)
In the dev version I just get completely wrong results.
-- Andy
On Tue, May 24, 2011 at 11:29 AM, Bartosz
wrote:
> Hi all,
>
> I have been trying to
On Tue, May 24, 2011 at 11:42 AM, Robert Kern wrote:
> On Tue, May 24, 2011 at 10:44, Vinzent Steinberg
> wrote:
>> On 24 Mai, 05:08, Matthew wrote:
>>> You're right - it's unclear if this should be an event or a random
>>> variable. Thanks for the heads up on 'or'. I was hoping to use | for
>>>
On Sun, May 22, 2011 at 11:48 PM, Ronan Lamy wrote:
> Le lundi 23 mai 2011 à 01:38 +0100, Ronan Lamy a écrit :
>> Le dimanche 22 mai 2011 à 17:25 +0100, Ronan Lamy a écrit :
>> > Le dimanche 22 mai 2011 à 09:51 -0600, Aaron S. Meurer a écrit :
>> > > On May 22, 201
On Sun, May 22, 2011 at 7:32 PM, Aaron S. Meurer wrote:
>
> On May 22, 2011, at 5:16 PM, Andy Ray Terrel wrote:
>
>> On Sun, May 22, 2011 at 1:49 PM, Andy Ray Terrel
>> wrote:
>>> On Sun, May 22, 2011 at 1:12 PM, Mateusz Paprocki wrote:
>>>> Hi,
>&
wouldn't work either. It would be an infinite loop.
operator.mul just calls the dispatches to the appropriate
.__mul__/.__rmul
-- Andy
>
>
>>
>> Aaron Meurer
>>
>>
>> On May 21, 2011, at 9:11 PM, Andy Ray Terrel
>> wrote:
>>
>>> My experience
On Sun, May 22, 2011 at 1:49 PM, Andy Ray Terrel wrote:
> On Sun, May 22, 2011 at 1:12 PM, Mateusz Paprocki wrote:
>> Hi,
>>
>> On 22 May 2011 18:17, Aaron S. Meurer wrote:
>>>
>>> Is it possible to implement x*y*z as reduce(operator.mul, [x, y, z])?
>
On Sun, May 22, 2011 at 12:35 PM, Ondrej Certik wrote:
> On Sun, May 22, 2011 at 8:34 AM, Andy Ray Terrel
> wrote:
>> On Sat, May 21, 2011 at 10:51 PM, Ondrej Certik wrote:
>>> On Sat, May 21, 2011 at 8:21 PM, Andy Ray Terrel
>>> wrote:
>>>> On
x, y, z])
> Out[3]: x⋅y⋅z
> In [4]: type(_)
> Out[4]:
> but I wouldn't use it on large examples because it takes O(n**2) steps to
> canonicalize the inputs (similar problem with sum([x,y,z]), we have even an
> issue open for this).
>
Yes this was my fear. Maybe Ronan&
On Sat, May 21, 2011 at 10:51 PM, Ondrej Certik wrote:
> On Sat, May 21, 2011 at 8:21 PM, Andy Ray Terrel
> wrote:
>> On Sat, May 21, 2011 at 10:10 PM, Ronan Lamy wrote:
>>> Le samedi 21 mai 2011 à 21:50 -0500, Andy Ray Terrel a écrit :
>>>> On Sun, May 1
On Sat, May 21, 2011 at 10:10 PM, Ronan Lamy wrote:
> Le samedi 21 mai 2011 à 21:50 -0500, Andy Ray Terrel a écrit :
>> On Sun, May 15, 2011 at 6:54 PM, Brian Granger wrote:
>> > On Sat, May 14, 2011 at 1:49 PM, Vinzent Steinberg
>> > wrote:
>> >&
jects. Right now I have to do ugly hack that fix things up
after the fact.
-- Andy
On Sun, Jul 25, 2010 at 1:04 PM, Brian Granger wrote:
>
>
> On Sat, Jul 24, 2010 at 5:14 PM, Ronan Lamy wrote:
>>
>> Le samedi 24 juillet 2010 à 13:10 -0700, Brian Granger a écrit :
>>
t; by reverting the removal.
>>
>> If it is not used, I think we can remove it.
>
> +1
>
Please don't do this. I use op_priority all the time. Its the one
reason I haven't release my code because I depend on this
functionality.
In fact I was just about to mail t
matrix computing, sometime the underlying process that produces the
matrix is simple enough that you don't want to force a structure on it
until absolutely necessary.
-- Andy
On Fri, Apr 15, 2011 at 2:41 PM, Aaron S. Meurer wrote:
> We should structure the classes so that there is mini
On Fri, Apr 15, 2011 at 8:16 PM, Ondrej Certik wrote:
> On Wed, Mar 30, 2011 at 3:34 PM, Andy Ray Terrel
> wrote:
>> If you want some inspiration you can look at Syfi project for FEM. My
>> library, ignition, has a few symbolic fluxes generateing FVM Riemann
>> solvers
On Wed, Apr 6, 2011 at 9:05 AM, Tim Lahey wrote:
> On Wed, Apr 6, 2011 at 1:40 AM, Andy Ray Terrel wrote:
>>
>> Well I could use matrix expressions, and already have a prototype
>> implementation in Ignition.
>>
>> https://github.com/aterrel/ignition/tree/mast
have writing solvers. Linking to previous projects
or giving some description of the experience would help the proposal.
You need to flesh out the details of the timeline more. Having a
week-by-week detail would be beneficial.
-- Andy
On Tue, Apr 5, 2011 at 10:31 AM, nakul wrote:
> Hi,
>
&g
Hello Saptarshi,
This looks very promising! There are certainly a huge hole in SymPy's
functionality. I have certainly had to make simple versions of the
combinatorial objects for my own code. I look forward to your Rubik's
cube example.
-- Andy
On Wed, Apr 6, 2011 at 7:44 AM,
them to a vector:
>>
>> A*B*C*D*E*...(Y*(Z*v))
>>
>> We could do the matrix-matrix muls first and then apply to the vector:
>>
>> (A*B*C*D*E*...Y*Z)*v
>>
>> But the product of all the matrices is usually dense, and we don't
>> want to have to
On Tue, Apr 5, 2011 at 12:23 AM, Brian Granger wrote:
> On Sun, Apr 3, 2011 at 11:17 PM, Andy Ray Terrel
> wrote:
>> On Mon, Apr 4, 2011 at 9:10 AM, Andy Ray Terrel
>> wrote:
>>> On Mon, Apr 4, 2011 at 8:58 AM, Frank K. wrote:
>>>>
>>>>>
On Mon, Apr 4, 2011 at 9:10 AM, Andy Ray Terrel wrote:
> On Mon, Apr 4, 2011 at 8:58 AM, Frank K. wrote:
>>
>>> > There's also the line somewhere in between numerical matrices and
>>> > symbolic matrices, which is matrices with exact numeric values (inst
On Mon, Apr 4, 2011 at 8:21 AM, Brian Granger wrote:
> Andy,
>
>> We currently have several students interested in symbolic sparse
>> matrix calculations for GSOC. IMHO, we could use a linear algebra
>> interface more compatible with scipy.linalg but I don't have
On Mon, Apr 4, 2011 at 8:58 AM, Frank K. wrote:
>
>> > There's also the line somewhere in between numerical matrices and symbolic
>> > matrices, which is matrices with exact numeric values (instances of
>> > Rational), to consider.
>>
>> Not sure what you are getting at here.
>>
>
> There are so
are getting at here.
>
> I remember people posting to this list with symbolic matrices in the past.
> Maybe a search will show how people are using them.
The only things I could find were with small matrices.
-- Andy
>
> Aaron Meurer
>
> On Apr 3, 2011, at 9:10 AM, Andy Ray
organizing what
the student projects should implement.
-- Andy
--
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 unsubscribe from this group, send email to
sympy+unsubscr...@google
.
Of course, in the interest of sympy being free of dependencies I would
hope you project could help build a suitable interface with the sparse
matrices that could be used if one of these other sparse packages are
not available.
-- Andy
On Sun, Apr 3, 2011 at 8:07 AM, Brian Granger wrote:
> Nakul
For better or for worse, SymPy has always been a place where patches
that meet a minimum standard are pushed in. In the interest of not
going 1.5 years between releases, I suggest we create issues for what
needs to be done and push Mateusz's code.
-- Andy
On Sat, Apr 2, 2011 at 6:02 AM, Ma
Are there any plans for releasing soon? It been a year and I'd like
to release my library, which only works on dev.
-- Andy
--
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.
fine,
I think the field has enough work for lots of people.
Also, please include several examples of what the code should do (in a
simple example style) at the end of the summer. This will give us a
concrete target to hit. Basically taking a more agile coding
practice.
-- Andy
On Thu, Mar 31
thing others are not working upon.
In the past when two candidates were chosen with similar projects, we
managed to separate out what each would do after the application
period. Its much more important to put your best effort forward on
something you are passionate about than back off with a less
code from symbolics is widely being widely used.
Nonetheless, implementing more solvers would certainly be interesting.
-- Andy
On Wed, Mar 30, 2011 at 3:55 PM, Vinzent Steinberg
wrote:
> On Mar 29, 6:04 pm, nakul wrote:
>> Hi Everyone,
>>
>> Thanks for the reply.
>&g
On Tue, Mar 29, 2011 at 11:35 PM, Matthew Brett wrote:
> Hi,
>
> On Tue, Mar 29, 2011 at 11:43 AM, Andy Ray Terrel
> wrote:
>> On Tue, Mar 29, 2011 at 7:22 PM, Aaron S. Meurer wrote:
>>>
>>> On Mar 29, 2011, at 12:51 AM, Andy Ray Terrel wrote:
>>&
On Tue, Mar 29, 2011 at 7:22 PM, Aaron S. Meurer wrote:
>
> On Mar 29, 2011, at 12:51 AM, Andy Ray Terrel wrote:
>
>> On Tue, Mar 29, 2011 at 9:13 AM, Tim Lahey wrote:
>>> On 03-29-2011, at 1:44 AM, Andy Ray Terrel wrote:
>>>
>>>> There are some major
On Tue, Mar 29, 2011 at 9:13 AM, Tim Lahey wrote:
> On 03-29-2011, at 1:44 AM, Andy Ray Terrel wrote:
>
>> There are some major confusions on this list about the difference
>> between algorithms and storage.
>
> I'm not confused and I'm not sure if other people
outline the
actual design of the project.
And please do put this on the wiki, I only opened this attachment
because google can do it for me, otherwise I would not have.
-- Andy
On Tue, Mar 29, 2011 at 12:43 AM, Aaron S. Meurer wrote:
> Hi.
> I can see that you put a lot of work into this.
ngs in python. With that said,
some day SymPy will be much faster than it is today (or at least I
hope) and such structures may be commonplace if they are there.
The project becomes much more interesting if you take Ronan's point of
view of redesigning the Matrix class or perhaps implement
On Mon, Mar 28, 2011 at 9:12 PM, Ronan Lamy wrote:
> Le lundi 28 mars 2011 à 20:12 +0300, Andy Ray Terrel a écrit :
>> On Mon, Mar 28, 2011 at 2:03 AM, Frank K. wrote:
>> > Thanks to everyone for suggestions and input. I was thinking of
>> > implementing sparse m
t the
developer's guide [1]. If there is something that isn't documented
well enough, look at the tests (inside the test directory of each
source folder).
Also don't forget you need to have a patch submitted via github before
we will accept the application. You can find easy to fix issues
representation of the
numbers that are used, numerical algorithms are just particularly
susceptible to stability problems because their numbers are inexact.
Its not stability that makes numerical algorithms terrible for
symbolics but rather the in place iterations that tend to expand
symbolics.
-- Andy
f you don't finish what
you want that is okay but if you don't get any work done that is bad.
Your mentor should keep regular tabs on what you are doing to guide
you so this situation doesn't happen.
-- Andy
>
> Frank
>
> --
> You received this message because you a
Aaron,
I don't understand your comment. The storage of a sparse matrix has
nothing to do with the types being stored. Everything is still exact
and has nothing at all to do with numerical stability. Algorithms are
about stability (even in symbolics), storage is about space and
access.
--
where there are several storage schemes, mostly because
different algorithms with different storage formats. Hope that helps
a bit.
-- Andy
[0] http://docs.scipy.org/doc/scipy/reference/sparse.html
On Sun, Mar 27, 2011 at 5:42 AM, Frank K. wrote:
> Hello all! My name is Frank Kreimendahl
e a
decent understanding of the library, see our development page [2].
Feel free to ask more questions on the list for help.
-- Andy
[0] http://code.google.com/p/sympy/issues/list?q=label:EasyToFix
[1] https://github.com/sympy/sympy/wiki/GSoC-2011-Application-Template
[2] http://sympy.org/development.html
w how well the statistics
package handles probability distributions, my guess is that there will
be need to make sure these are easy to use as well.
-- Andy
On Sat, Mar 26, 2011 at 2:30 PM, Andy Ray Terrel
wrote:
> Am I missing something? When I go to that link I get a "Create N
Am I missing something? When I go to that link I get a "Create New Page" page.
-- Andy
On Sat, Mar 26, 2011 at 12:29 AM, Aaron S. Meurer wrote:
> You might also look at issue 2206, which is very simple compared to what you
> want to do, but might be the best way to implement
On Sun, Feb 13, 2011 at 8:54 PM, Brian Granger wrote:
> Andy,
>
> On Sun, Feb 13, 2011 at 11:34 AM, Andy Ray Terrel
> wrote:
>> I'm collaborating with some people on generating kernels for opencl
>> and nvidia. Probably the big issue is not getting code that
Chatting with people it looks like one of the biggest factors the
proposal is missing is talking about the broader impact of sympy. It
seems Google wants to fund people who are highly visible.
Do we have download statistics and user statistics somewhere?
-- Andy
On Sat, Feb 12, 2011 at 11:22
solved, I
could spend some cycles helping people speed it up.
-- Andy
On Sun, Feb 13, 2011 at 1:12 PM, Vinzent Steinberg
wrote:
> On 12 Feb., 16:43, william ratcliff
> wrote:
>> One of our thoughts was that we should autogenerate C code that could be run
>> on a GPUI hope to b
Do you know if there are any successful application around?
-- Andy
On Sat, Feb 12, 2011 at 3:23 PM, Aaron S. Meurer wrote:
> We are going to apply as an organization again. Google has not opened the
> applications for organizations yet, but I have started with last year's
>
Is there a plan this year, I didn't find any data and the deadline for
applying is getting closer.
-- Andy
--
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 unsubscribe
I think this would be a great contribution to the SymPy physics
module. Can you put some usage doc strings? Then, we can put it in
the appropriate places.
-- Andy
On Wed, Nov 10, 2010 at 3:10 AM, Philippe wrote:
> some usage if needed..
> this is my unittest file.
> the lag
sion limit error.
-- Andy
On Sat, Oct 30, 2010 at 7:16 AM, Philippe wrote:
> Hi,
>
> I am new to sympy.
> I try to derive an equation of that form: T = k * x'
> x if a function of time ; x = f(t)
> x' is diff(x, t)
>
> I would like to get
> T2 = diff(T,
On Tue, Sep 28, 2010 at 1:32 PM, Øyvind Jensen wrote:
> ti., 28.09.2010 kl. 10.00 -0500, skrev Andy Ray Terrel:
>> I have been working on some linear algebra algorithms and have hit a
>> situation that I don't know if it has been addressed by people before.
>> Any tho
e inverse class
(__div__ already implements things by Pow(expr, -1)). Roughly anytime
someone calls __div__ I really need it to call my expr_has_inverse
function to see if it is legit.
-- Andy
>
> Aaron Meurer
>
> On Sep 28, 2010, at 9:00 AM, Andy Ray Terrel wrote:
>
>> I have
red a code that does something similar in
Mathematica, it checks registered patterns and then calls the
appropriate matching function.)
-- Andy
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy...@googl
Yup I just updated last week.
On Sat, Sep 25, 2010 at 1:37 PM, Aaron S. Meurer wrote:
> Let me guess, you are running Python 2.6.6. See issue 2041. If you know how
> to fix any of these, that would be great.
>
> Aaron Meurer
>
> On Sep 25, 2010, at 12:33 PM, Andy Ray Terrel
On my Mac OS X 10.6.4 laptop running python 2.6, I'm getting a large
number of failed test, see [0]. I don't get these error in python2.4
or python2.7.
It looks like most are just things that are not written very robustly
or is my system messed up? Are other people seeing this happen
do instead:
for k in AssumeMeths._assume_defined:
exec "is_%s = property(make__get_assumption('Basic', '%s'))" % (k,k)
del k
So we are already adding is_Foo for every assumption.
-- Andy
On Thu, Sep 23, 2010 at 9:25 PM, Aaron S. Meurer wrote:
>
How would hasattr help you? It doesn't tell you if there is a
instance of a class in the arg tree only if the instance has a
specific attribute. I guess nobody has needed __getatrr__ yet.
-- Andy
On Thu, Sep 23, 2010 at 8:50 PM, Aaron S. Meurer wrote:
> How does the speed compare if
hould try to keep it out of the core (maybe put it in the
assumptions).
Of course once Indexed elements start propogating to other modules it
might be necessary to do this. For now I vote that we either include a
depth first search for the properties.
-- Andy
On Thu, Sep 23, 2010 at 6:27 PM, Nic
On Thu, Sep 23, 2010 at 2:21 PM, Nicholas Kinar wrote:
>
>> expr.args gives a python tuple of the arguments that can be iterated
>> through in the normal ways.
>>
>>
>
> for i in (1, 42, 'this'):
>
>>
>> ... print i
>> ...
>> 1
>> 42
>> this
>>
>
> expr = 1+x+42/x
> for
core.containers.Tuple
-- Andy
On Wed, Sep 15, 2010 at 2:15 AM, Aaron S. Meurer wrote:
> No. This needs to be fixed, preferably to the second variant. Actually, we
> need to find a way to do both without using tuples, which screw up .arg
> parsing algorithms that expect Basic o
I like abc. It makes life easier in a shell.
Chris why not just do:
from sympy.abc import *
from sympy import S
-- Andy
On Wed, Aug 25, 2010 at 4:30 PM, Ondrej Certik wrote:
> On Wed, Aug 25, 2010 at 1:57 PM, smichr wrote:
>> Some variables like C and S are used automatically
Just to reiterate the point.
+10
-- Andy
On Tue, Aug 17, 2010 at 8:39 AM, Vinzent Steinberg
wrote:
> On 17 Aug., 07:43, Ondrej Certik wrote:
>> I am ok with dropping 2.4 too. I would keep 2.5 for now.
>
> Is there actually anyone who wants to keep 2.4 compability?
>
> I&#
On Mon, Aug 2, 2010 at 2:38 PM, Ondrej Certik wrote:
> On Mon, Aug 2, 2010 at 12:35 PM, Ondrej Certik wrote:
>> On Mon, Aug 2, 2010 at 12:32 PM, Ondrej Certik wrote:
>>> Hi Andy,
>>>
>>> thanks for raising this up.
>>>
>>> On Mon, Aug 2,
irst local library
import method. The second method is fragile and the third method
ignores the beauty of namespaces. I would also kill any private
imports.
Please give your opinion so I can further comment on the code I'm reviewing.
-- Andy
--
You received this message because you are s
On Tue, Jul 13, 2010 at 11:21 PM, Brian Granger wrote:
> On Tue, Jul 13, 2010 at 9:15 PM, Ondrej Certik wrote:
>> On Tue, Jul 13, 2010 at 8:48 PM, Aaron S. Meurer wrote:
>>>
>>> On Jul 13, 2010, at 9:35 PM, Ondrej Certik wrote:
>>>
On Tue, Jul 13, 2010 at 8:31 PM, Brian Granger wrote:
Okay everything looks good for me. I will go ahead and push it in.
-- Andy
On Wed, Jul 7, 2010 at 11:09 AM, Andy Ray Terrel wrote:
> On Wed, Jul 7, 2010 at 6:45 AM, Øyvind Jensen wrote:
>> I rebased to current master and squashed some of the commits. It's
>> all
On Wed, Jul 7, 2010 at 6:45 AM, Øyvind Jensen wrote:
> I rebased to current master and squashed some of the commits. It's
> all at http://github.com/jegerjensen/sympy/tree/fortran_codegen5
>
> At the end I added two commits:
> - rename SymTuple to Tuple
> - rename the file symtuple.py to containe
fects, and providing a search tool for others to see what reviews
are going on. I'm not committed to either system, but as far as code
reviews go we have been talking about finding a better solution for a
long time.
-- Andy
On Tue, Jul 6, 2010 at 7:58 PM, Aaron S. Meurer wrote:
> Well, Safari
On Tue, Jul 6, 2010 at 4:02 PM, Andy Ray Terrel wrote:
> On Tue, Jul 6, 2010 at 2:33 PM, Ronan Lamy wrote:
>> Le mardi 06 juillet 2010 à 13:29 -0500, Andy Ray Terrel a écrit :
>>> Hello all,
>>>
>>> Øyvind's fortran code branch is ready to go in, but I
On Tue, Jul 6, 2010 at 2:33 PM, Ronan Lamy wrote:
> Le mardi 06 juillet 2010 à 13:29 -0500, Andy Ray Terrel a écrit :
>> Hello all,
>>
>> Øyvind's fortran code branch is ready to go in, but I did the review
>> through the SmartBear code collaboration server. I
more about how the system works see the SmartBear
documentation [3 -- 4], also to upload code for other reviews the
server needs to use the 6.001 version of the client which can found at
[5].
-- Andy
[0] http://github.com/jegerjensen/sympy/tree/fortran_codegen4
[1] http://hosted.smartbear.com/
hub.com/jegerjensen/sympy/blob/fortran_codegen4/sympy/tensor/indexed.py
>
This is quite interesting, but for the sake of your GSOC project I
think it best to finish up the codegen facilities we have now. Theano
would be another dependency to use this functionality and I would
rather see at least
1 - 100 of 131 matches
Mail list logo
