Just off the top of my head, would checking the limit of the function at
the point of dispute do?
For instance,
>>> a = limit(log(x), x, 0)
gives - oo
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving e
> This is in my pythonstartups.py file in the `my` folder in the sympy
> directory.
>
>
Sorry - to be clear: the pythonstartups.py file is in my cps branch; it
works best with the uneval branch, however, for which a PR has been made.
--
You received this message because you are subscribed to the
> There are a few things
>
> - The current implementation is a dense representation that is
> basically a list of lists of coefficients. Unfortunately, this is
> every inefficient for multivariate polynomials, so if you have a lot
> of generators, it will slow things down.
>
That's understa
My uneval branch (https://github.com/sympy/sympy/pull/2080) will make it
easier to work with unevaluated Mul since these (there) are no longer
flattened when they are part of an Add. I use this capability with a
step-wise manipulator for my younger students that I have been testing.
LG (LGbra) all
To all the GSoC students, we are now reviewing your applications in
Melange. If we have any questions, we will add comments to your
proposals.
In the meanwhile, if you feel like there is nothing more you can do at
this point, you are wrong. While it's true that the deadline has
passed for writing
On Mon, May 6, 2013 at 8:03 PM, Chris Swierczewski wrote:
> Hello Aaron,
>
>> > # find largest power of x appearing in the denominator.
>> > # this is sufficient since we've shifted the curve and its
>> > # singularity to appear at x=0
>>
>> If I understand what you want, you can use s
Hello Aaron,
> # find largest power of x appearing in the denominator.
> > # this is sufficient since we've shifted the curve and its
> > # singularity to appear at x=0
>
> If I understand what you want, you can use sqf() to do this far more
> efficiently. Or if you know it will be
There has already been some discussion on this at
https://code.google.com/p/sympy/issues/detail?id=2440 and
https://code.google.com/p/sympy/issues/detail?id=2442. To reiterate
some of the arguments from there:
- Regardless of what we do, we should be consistant. There are five
main classes that u
Aaron recommended that I bring this up here.
https://github.com/sympy/sympy/pull/2066 is a PR that allows, Lambdas,
Sums, Products and Integrals to compare as equal regardless of the bound
symbols used.
Lambda(x, x + 2) == Lambda(y, y + 2)
The Sum-like things, however, only compare as equal
log(16) is no longer changed at https://github.com/sympy/sympy/pull/2080;
Mul and Add also flatten less.
--
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 sympy+unsubscr.
The page is open source, at github.com/sympy/sympy.github.com/, so
pull requests are welcome. I agree with your points.
Also take a look at https://github.com/sympy/sympy.github.com/issues/61.
Aaron Meurer
On Mon, May 6, 2013 at 6:04 PM, Fawaz Mohammed wrote:
> I'm new to the community and i ho
On Mon, May 6, 2013 at 5:56 PM, Chris Swierczewski wrote:
> Hello,
>
> I'll describe what I'd like to do in general, just in case I'm missing a
> much more efficient way of doing it, and then I'll describe what I'm trying
> out in SymPy.
>
> There are three ingredients to this problem:
>
> a polyn
I'm new to the community and i hope i can help in the improvement.
I have went through the main page and I noticed that it can be improved
(i.e. its design and content) if we resolve the following issues:
a. Duplicate Documentation's link one in toolbar and the other in quick
links.
b
Hello,
I'll describe what I'd like to do in general, just in case I'm missing a
much more efficient way of doing it, and then I'll describe what I'm trying
out in SymPy.
There are three ingredients to this problem:
- a polynomial f(x,y) with coefficients that could be algebraic (e.g.
sqrt
I think the discussion at https://github.com/sympy/sympy/pull/2070 is
relevant here, because that is just another case of the same thing
(evaluating a function at a numbers).
To quote an argument from Raoul on when this should happen
"Today in irc, I argued that there should be two heuristic rule
Dividing by zero is not the only place where you can have a real
discontinuity. It can also occur from taking a fractional power of a
negative number (like sqrt(x)), or a pole in a function (like log(x)
at x=0). For the first, we need good inequality solving. For the
second, we need to invent an AP
Hi there!
The exponential map of the differential operator can be regarded as a
translation operator, eg:
Exp( a * diff_x ) f( x ) = f( x + a )
This can be seen by Taylor expanding both sides.
Other kinds of operators generate different transformations.
What about adding this feature to the O
For starters https://github.com/sympy/sympy/tree/master/doc/src/tutorial
(clone, create the new po file, make a pull request).
I think there are some translations also in the webpage repo.
On 6 May 2013 21:51, Fawaz Mohammed wrote:
> Could you elaborate more on the .po files (e.g. package name,
Could you elaborate more on the .po files (e.g. package name, location of
files). So that i can working on this.
Thanks
On Saturday, May 4, 2013 8:48:30 AM UTC-7, Stefan Krastanov wrote:
>
> Translating the documentation as a whole probably is not worth it as
> it will be out of date by the
Am 06.05.2013 19:10, schrieb Aaron Meurer:
By the way, on a technical side, what should we do about the tutorial
translations? If things go according to my plan, the current
translations will become completely obsolete. Should we scrap them
completely until new ones are written? Should we leave t
I have created a wiki page for idioms and antipatterns:
https://github.com/sympy/sympy/wiki/Idioms-and-Antipatterns. Let's try
to collect them all here, from all over SymPy. We can then gather
them together into appropriate narrative documentation in Sphinx.
Aaron Meurer
On Mon, May 6, 2013 at
As many of you may have already noticed, Ondrej and I are presenting a
tutorial for SymPy at SciPy 2013. See
http://conference.scipy.org/scipy2013/tutorials.php. We look forward
to seeing all of you who are attending the conference there.
My hope this year is that we can improve our documentatio
Sure, I'd love to hear about how one could get evaluate=False to work
better. I assume you used it in order to write out the solutions to the
problems.
Duane
On Thursday, May 2, 2013 5:39:56 AM UTC-5, gsagrawal wrote:
>
> It may be late to reply on this topic.
> but i just want to add that al
23 matches
Mail list logo