Comment #7 on issue 2200 by padiaan...@gmail.com: limit(sin(x),x,oo) should
raise an error
http://code.google.com/p/sympy/issues/detail?id=2200
Pull request ID 2035
--
You received this message because this project is configured to send all
issue notifications to this address.
You may
Status: New
Owner:
Labels: Type-Defect Priority-Medium
New issue 3776 by cjx...@gmail.com: Unable to integrate function involving
sech^2
http://code.google.com/p/sympy/issues/detail?id=3776
Tried to do the following definite integral:
integrate(x**2/cosh(x)**2,(x,0,oo))
which I know
Updates:
Status: Valid
Labels: Integration
Comment #1 on issue 3776 by asmeu...@gmail.com: Unable to integrate
function involving sech^2
http://code.google.com/p/sympy/issues/detail?id=3776
The indefinite integral can be expressed in terms of the polylogarithm:
Comment #8 on issue 2200 by padiaan...@gmail.com: limit(sin(x),x,oo) should
raise an error
http://code.google.com/p/sympy/issues/detail?id=2200
Where I would be possible to get the test bed for series module ?
--
You received this message because this project is configured to send all
Yes, I saw that.
On 23.04.2013 00:15, Chris Smith wrote:
Note that flatten is already optimized for the case of adding or
multiplying by a rational since we always know where that arg is.
--
You received this message because you are subscribed to the Google
Groups sympy group.
To unsubscribe
On 04/23/2013 12:32 AM, Aaron Meurer wrote:
Is this the same thing as the matrix derivative described in the
matrix cookbook (see
https://code.google.com/p/sympy/issues/detail?id=2759)? If so, then
the answer is no.
Aaron Meurer
On Sun, Apr 21, 2013 at 7:28 AM, Saurabh Jha
Actually I was talking about this thing explained on page number 8 of
this document.
http://see.stanford.edu/materials/aimlcs229/cs229-notes1.pdf
I think implementation of this thing maybe a good start for fixing
issue 2759.
-Saurabh
On Apr 23, 4:21 pm, Alan Bromborsky abro...@verizon.net
Le 22/04/2013 10:27, Tom Bachmann a écrit :
I attach the output. Here is my reading:
- simplify spends 70% in together and powsimp
- together spends 99% in object creation
- powsimp spends 95% in object creation
- AssocOp.__new__ spends 90% in flatten
- flatten has now obvious hotspot
What I
On Tue, Apr 23, 2013 at 9:30 AM, Ronan Lamy ronan.l...@gmail.com wrote:
Le 22/04/2013 10:27, Tom Bachmann a écrit :
I attach the output. Here is my reading:
- simplify spends 70% in together and powsimp
- together spends 99% in object creation
- powsimp spends 95% in object creation
-
On 23.04.2013 16:30, Ronan Lamy wrote:
Le 22/04/2013 10:27, Tom Bachmann a écrit :
I attach the output. Here is my reading:
- simplify spends 70% in together and powsimp
- together spends 99% in object creation
- powsimp spends 95% in object creation
- AssocOp.__new__ spends 90% in flatten
-
Hi there!
There are two books about applications of Geometric Algebra to
Physics (Clifford Algebra to Geometric Calculus by Hestenes and Sobczyk and
Geometric Algebra for Physicists by Doran and Lasenby). An optimal
implementation of Physics would implement a Geometric Algebraic structure
Can the tensor implimentation related to covariant and contravariant co
ordinate systems and moving through different co ordinate systems be
helpful.I mean to say could covariant and contravariant transforms form the
basis for tensor module.Thanks.
On Wed, Apr 24, 2013 at 12:17 AM, F. B.
I started working on such an implementation yesterday. It has already an
index-contraction system. Give me some days to finish it, then I'll post it.
This part is not only helpful, it is ESSENTIAL to all modern physics!
On Tuesday, April 23, 2013 8:52:40 PM UTC+2, Amit wrote:
Can the tensor
Sir ,
I would like to work on it as a project this summer (GSoC) with additional
features.I would also like to add the basis conception using determinants.I
was moving from different topics and have fixed my self onto this and have
started writing a proposal.I guess I satisfy the requirements and
These
covariant and contravariant co ordinate systems
moving through different co ordinate systems
index-contraction system
can mean a lot of different things in the context of a CAS. Some of
them are already implemented in sympy or numpy. For instance:
1. naive index contraction:
- naive
So would these mean starting afresh or just adding more to the present
system. And my idea is the matrix transforms method between various co
ordinate systems which would be applied to covariant and contravariant co
ordinates.I have been working on this stream of ideas and would also like
to add
Frankly, I think that there is a very urgent need to implement a working
tensor module enabling the usage of the Einstein summation convention. I had
a look at sympy.tensor, but it looks like that module is still far away from
working (unless I didn't figure out correctly how it works).
So would these mean starting afresh or just adding more to the present
system. And my idea is the matrix transforms method between various co
ordinate systems which would be applied to covariant and contravariant co
ordinates.
This seems very well suited to be an extension to `diffgeom`.
So can I get some insight on how to proceed because this was the thing I
have been mentioning but could not find sufficient enough material and was
clubbing with some diffused ideas to make a project out of it.
It would be great if GSoC were a platform but it was not the case also I
would like to
For the case of `diffgeom` you can see the proposal which started it
last year and my reports on it:
https://github.com/sympy/sympy/wiki/GSoC-2012-Application-Stefan-Krastanov:-Vector-Analysis
http://blog.krastanov.org/diff-geometry-in-python/
This is not the only way to proceed, but it is one
Is everything what you have mentioned implemented ??
I was thinking on these lines :
Given a system we have a matrix to compute the contravaraint co ordinates
wrt to the original basis (The given basis). In covariant coordinates the
basis itself have a different representation but this would
Some notes:
- what you said about polynomials concerns vector spaces, not manifolds
- what you said about coordinate systems (as opposed to bases)
concerns manifolds and it is well within the scope of `diffgeom`
`diffgeom` has some rudimentary support for 2D and 3D flat space. It
would be
I was thinking on the lines of connecting these co ordinates with bases
(manifold intersection bases). I guess I was able to convey my ideas
across.I would like to work on this. Yes I was referring to vector spaces
and does such a implementation exist ?? Thanks.
On Wed, Apr 24, 2013 at 2:03 AM,
http://blog.krastanov.org/category/sympy-2/gsoc-diffgeom/
I was going through this and it would of really some great help in making a
proposal if some light is thrown on what has been implemented so far.Thanks.
On Wed, Apr 24, 2013 at 2:44 AM, Amit Jamadagni bitsjamada...@gmail.comwrote:
I
OK, well my intention for now is to allow using physical formulae involving
tensors inside SymPy.
I do not know enough maths to work on the diffgeom module. I think I will
go on with my multilinear-indexed map. It's fixed on a basis, it works just
likes matrices in many dimensions.
I started
All that is on the blog is implemented. Some parts of the original
proposal (the github wikipage) are not yet implemented. It is all in
the diffgeom folder in sympy (just clone the git repo from github).
Look at the code in rn.py (it is quite simple and it is not necessary
to understand the rest
On 23 April 2013 23:42, F. B. franz.bona...@gmail.com wrote:
OK, well my intention for now is to allow using physical formulae involving
tensors inside SymPy.
Such helper function could be very useful, but it would be easier to
discuss them when they get into a pull request.
I do not know
In a previous discussion about implementing Coding Theory, it was mentioned
that stuff relating to finite fields, and algorithms on matrices whose
entries are finite fields need to be implemented too. It seems like the
Polynomial Manipulation Module has finite fields, but I can't seem to find
On Tue, Apr 23, 2013 at 6:01 PM, Shravas Rao shra...@gmail.com wrote:
In a previous discussion about implementing Coding Theory, it was
mentioned that stuff relating to finite fields, and algorithms on matrices
whose entries are finite fields need to be implemented too. It seems like
the
Only cyclic finite fields are implemented. F_q for q = p^n for n 1
is not implemented yet.
Your main focus should be getting these to work in the polys domains.
Working with them in the matrices will be automatic once the matrices
support domains.
Aaron Meurer
On Tue, Apr 23, 2013 at 4:01 PM,
I have scanned through the code and this image has given me a cleaner
picture.
http://krastanov.files.wordpress.com/2012/08/painful_christoffel_symbols.png
Now if I am not wrong there is still a need for the implementation of
implementation of covariance as the contravariance (as I understand) is
To all the students who are applying for GSoC, don't fret about the
formatting too much in Melange. Just try to make it look as good as
you can. I know from personal experience that getting the formatting
right is next to impossible. If you can't get it to come out well, or
if there is some
Hello,
I thought that working with Group Theory for my GSoC 2013 project would be
ideal.
I have familiarized myself with the GAP library and their approach to group
theory
problems, and have a fairly extensive knowledge of group theory (at the
undergraduate
level, at any rate).
The
Hi,
my name is Katja Sophie Hotz and I am studying Technical Mathematics at the
Vienna University of Technology.
I'm in the last year of my master and have specialized in Mathematics in
Computer Science.
I would like to work on the GSoC project Univariate polynomials over
algebraic domains.
It's not clear from your email if you have looked at what SymPy has already,
or if you have looked at the archives of the sympy list to see what
previous replies
on this topic are. It is also not clear what exactly the procedure for
implementing
character theory would be. (GAP for example uses a
I'm referring to the dual group in the context of the Petery-Weyl theorem
from harmonic analysis, which applies to any compact group. The dual group
consists of irreducible homomorphisms from the group to the space of
unitary operators. And by matrix representations, I mean defining the
I'm referring to the dual group in the context of the Petery-Weyl theorem
from harmonic analysis, which applies to any compact group. The dual group
consists of irreducible homomorphisms from the group to the space of
unitary operators. And by matrix representations, I mean defining the
On Tue, Apr 23, 2013 at 7:27 PM, Tyler Hannan than...@u.rochester.eduwrote:
I'm referring to the dual group in the context of the Petery-Weyl theorem
from harmonic analysis, which applies to any compact group. The dual group
consists of irreducible homomorphisms from
The Peter-Weyl Theorem
Actually, the Peter-Weyl Theorem is a generalization of the Pontryagin
duality, and by extending the definition of the homomorphisms from the
circle group to generalized unitary matricies asserts the existence of an
algebraic dual group even if the group is not necessarily abelian. I
On Tue, Apr 23, 2013 at 7:56 PM, Tyler Hannan than...@u.rochester.eduwrote:
Actually, the Peter-Weyl Theorem is a generalization of the Pontryagin
duality, and by extending the definition of the homomorphisms from the
circle group to generalized unitary matricies asserts the existence of an
You'll want to take a look at Mateusz's recent work in the polys
module, both at https://github.com/sympy/sympy/pull/1840 and at
https://github.com/mattpap/sympy/tree/new-polys.
Other than that, my recommendation is to keep digging into the polys
code. It can be dense, so take some time to try to
I have been reading what Harold E. has to say about units, from what I have
gotten out of the reading it seems like very interesting and important
work. I would be very glad to contribute to that. What would you suggest I
do as the proposal to for the GSoC? Also I am familiar with
An example of this would be given the parameters
Domain: The set of programs, P.
Let S(x) represent x has a syntax error.
Let C(x) represent x will compile
and the the logic statement ForAll(p) Element(P); S(p) = !C(p)
And it would return the English sentence: “If a program has a syntax error,
Oh, we currently don't have any quantifier support, so that would have
to be added first.
Aaron Meurer
On Tue, Apr 23, 2013 at 8:36 PM, Marsci estebanm...@gmail.com wrote:
An example of this would be given the parameters
Domain: The set of programs, P.
Let S(x) represent x has a syntax error.
The idea presented in this paper is rather simple. I wish I had known
about it when I wrote separatevars. It would take about a day to
implement, at most (plus review time). It's not suggested that a
project focus on just this method, but rather that it can be part of a
larger project on ODEs. By
Hello everyone,
Where it would be possible to get the test cases for series module
(especially limits) so that correctness of modified code (function,
classes) could be tracked ?
Ankur Padia.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To
All the tests for SymPy are in the tests subdirectoires. In this case,
look in sympy/series/tests. You can run the tests with bin/test, or
from inside Python with sympy.test(), and you can run them on just the
series module with bin/test series or sympy.test('series').
Aaron Meurer
On Tue, Apr
47 matches
Mail list logo
