Hi,
My sympy-foo is a bit rusty now, but I think you would have to implement
this in core.Pow to get automatic simplification of that expression.
However, there may be good reasons to avoid putting all kinds of special
cases into the core module.
The terms should vanish when you apply Wick's th
> Right now, Indexed Objects offer me more flexibility in defining index
> ranges. To derive SAPT in second quantization, one needs two classes of
> creation/annihilation operators {a^{\dagger},a} and {b^{\dagger},b}, where
> anticommutation relations hold within each group, but each operator
You might want to have a look at the secondquant module, and the coupled
cluster example that ships with sympy:
https://github.com/sympy/sympy/blob/master/examples/intermediate/coupled_cluster.py
Øyvind
--
You received this message because you are subscribed to the Google Groups
"sympy" group
James,
this contribution is just awesome! Great work!
Assuming that no serious issues show up, I'd vote that from 0.7.6, ufuncify
should use your new backend by default.
Øyvind
On Thursday, August 28, 2014 5:07:07 AM UTC+2, James Crist wrote:
>
> I still need to do some cleanups and add tests,
Hi Björn,
It is really cool that you are working on this, thanks for the PRs! I am
not uptodate on the inner workings of SymPy any longer, but I will take a
look at the patches and see if there is anything I can add.
Øyvind
On Wednesday, April 2, 2014 1:13:52 PM UTC+2, Björn Dahlgren wrote:
>
has obvious speed improvements, since the
> parameter values could be bound prior to evaluating the function 1000
> values or so within the integration routine.
>
> If anyone has advice to speed it up, it's very welcome.
>
> Did that make much sense?
>
>
>
> On Thu
On Thursday, October 24, 2013 9:45:43 AM UTC+2, Federico Vaggi wrote:
>
> https://gist.github.com/FedericoV/7132880 here you go.
>
It looks like the function statment line needs to be continued on several
lines, and it should be quite easy to fix.
If you look at line 693 of the file sympy/utili
>> If you don't mind, maybe we should CC the mailing list?
>
> Go for it. I've been flooding the list recently which is why I didn't do
> this earlier.
>
> I've recently been working on a Theano-like graph for SymPy (a Computation
> object). I'm may be reinventing something. I'm working off of th
:1,"Joan Creus":1,"Siddhanathan
> Shanmugam":1,"Julio Idichekop Filho":1,"Aaron Meurer":1,"Oyvind
> Jensen":2,"Chris Smith":7,"Toon Verstraelen":6,"Øyvind Jensen":70}
>
> I've read through the source and docs
I don't think the functionality you describe is implemented, but I think it
should not be too hard to create a general function for that. To get you
started: The implicit summation is handled in tensor.index_methods.py. You
can use get_contraction_structure() to determine the indices that have
> sympy.physics.mechanics?
+1
--
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...@googlegroups.com.
For more options, visit this
I haven't dived into the quantum module, so I don't know how to answer
your question. But I think maybe it will be easier to find a good
solution if you look at it from the other end. What is it that you
ultimately want to do? What is the intended use of the function you
are implementing?
Øyvin
to., 17.03.2011 kl. 10.35 -0700, skrev Brian Granger:
> On Thu, Mar 17, 2011 at 1:34 AM, Øyvind Jensen
> wrote:
> > ma., 14.03.2011 kl. 11.00 -0700, skrev Ondrej Certik:
> >> On Mon, Mar 14, 2011 at 3:11 AM, Øyvind Jensen
> >> wrote:
> >> > Alexande
ma., 14.03.2011 kl. 11.00 -0700, skrev Ondrej Certik:
> On Mon, Mar 14, 2011 at 3:11 AM, Øyvind Jensen
> wrote:
> > Alexander, All,
> >
> > How is it going with your tensor implementation? I put together some
> > code to implement variance of tensors a
Alexander, All,
How is it going with your tensor implementation? I put together some
code to implement variance of tensors and uploaded it to github in my
tensor_contractions branch [0]. If you would like to build on that,
feel free to do so. If you have already made your own implementation,
pl
On 9 Mar, 18:02, Alexander Gallego wrote:
> Hi.
> I've seen what you have done and it's amazing!!! I still have a lot to learn.
> What I did was much simpler, but still I'll try to incorporate what I
> did in your code, though it would be a slow process since I'm actually
> working on cosmology, n
Alexander,
Brian expressed everything very well, and I am sure that your
contributions will be very much appreciated!
I worked on the tensor module[0] during the summer. At the moment, it
doesn't really deserve its name: We have implemented indexed objects
and implicit summation, but concepts l
The new quantum module looks very nice, thanks for doing all that
work!
to., 10.02.2011 kl. 21.02 -0800, skrev Brian Granger:
> Øyvind and others interested in sympy.physics.quantum,
>
> As you have seen the quantum stuff is in. I have been looking at
> secondquant to see how it will be to mov
Chris, was this after all a positive review of
https://github.com/sympy/sympy/pull/85
?
--
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+u
sø., 16.01.2011 kl. 22.57 +0545, skrev Chris Smith:
> Øyvind Jensen wrote:
> > sø., 16.01.2011 kl. 07.14 -0800, skrev smichr:
> >> The branch jeger/fix_doctests3 does not raise any errors under win32.
> >> However, rewriting the test is a shallow fix of the problem wh
sø., 16.01.2011 kl. 07.14 -0800, skrev smichr:
> The branch jeger/fix_doctests3 does not raise any errors under win32.
> However, rewriting the test is a shallow fix of the problem which
> appears to be that -Object.method has tigher binding on the negation
> that it does on the method so that -Ant
lø., 15.01.2011 kl. 11.59 -0700, skrev Aaron S. Meurer:
> Are you sure this isn't issue 2041? What Python version is this with?
> Your paths indicate that it is Python 2.6. If this is 2.6.6, then it
> is issue 2041 (which hasn't been pushed in yet because it hasn't been
> reviewed).
>
> The
ma., 10.01.2011 kl. 13.27 -0800, skrev Jeff:
> Hi Aaron,
>
> Thanks for your answer for my question on the post "define
> commutative functions" at
> http://groups.google.com/group/sympy/browse_thread/thread/e35d8c170855be68
>
> Suppose I would like to have f(x,y) == f(y,x) is true. x, y could
Thank you Ondrej for all that you have done! It is good to hear that you
are still going to be around :-)
And congrats Aaron!
Øyvind
ti., 04.01.2011 kl. 21.56 +0100, skrev Ondrej Certik:
> Hi,
>
> I am officially passing the leadership of the SymPy project to Aaron
> Meurer. I just pushed in th
ti., 23.11.2010 kl. 12.59 -0800, skrev Ondrej Certik:
> Hi,
>
> here is how to run the coupled cluster example:
>
> $ python examples/intermediate/coupled_cluster.py
>
> and it prints:
>
> https://gist.github.com/712508
>
> the link to theory that it prints is:
> http://www.ccc.uga.edu/lec_top
fr., 19.11.2010 kl. 10.24 -0800, skrev Julien Rioux:
> Hi all,
>
> How can I tell the fcode printer to print integers and rationals as
> reals?
>
> For example I would like the following output:
> >>> expr = sqrt(1-x**2).series(x,n=20).removeO()
> >>> print fcode(expr)
> 1 - x**2/2 - x**4/8
> code.
>
> cheers,
>
> omar
>
>
> On Sat, Nov 13, 2010 at 20:20, Aaron S. Meurer wrote:
> >
> > On Nov 13, 2010, at 4:23 AM, Øyvind Jensen wrote:
> >
> >> fr., 12.11.2010 kl. 11.19 -0700, skrev Aaron Meurer:
> >>> If I understand you
fr., 12.11.2010 kl. 11.19 -0700, skrev Aaron Meurer:
> If I understand you correctly, you will implicitly sum over Symbol
> indices and loop over Idx indices, right? If so, that sounds like a
> good idea, except why do you want to use Symbol instead of creating a
> new class?
Well, maybe a new cl
So, I'm working on a simple python API that one
> can use to write his simulation code that will emit the complete
> fortran code. And using sympy the user could almost write down the
> discretized PDEs and get the corresponding fortran loops...
>
> cheers,
>
> omar
> I am very interested in how you insert the code into your fortran
> code. Do you generate a simple module, compile it and link it? Or how
> do you insert it on the fly?
>
Yeah, that would be interesting to hear about!
Øyvind
> Ondrej
>
--
You received this message because you are subscri
on., 10.11.2010 kl. 10.56 -0800, skrev Omar Awile:
> Hi all,
Hi
>
> I've recently started playing around with sympy. I am mainly
> interested in the fcode printer module as I would like to be able to
> write symbolic expressions and generate on the fly fortran code that
> is inserted into a fort
to., 21.10.2010 kl. 10.29 -0600, skrev Aaron S. Meurer:
> Well, that's not surprising. 99% of the time, when sympy hangs (but still
> finishes) it is hanging in expand(). This is a place where a slight machine
> difference can make a difference, too, because of the way expand works.
> Basica
> Ryan
>
> On Thu, Oct 21, 2010 at 6:37 AM, Øyvind Jensen
> wrote:
> >> Any idea what could make this machine so unhappy to run sympy?
> >
> > In my (limited) experience, memory is the bottle-neck when you see the
> > kind of slow down you describe. You
> Any idea what could make this machine so unhappy to run sympy?
In my (limited) experience, memory is the bottle-neck when you see the
kind of slow down you describe. You may try to clear the cache at some
point in your calculation.
>>> from sympy.core.cache import clear_cache
>>> clear_cache()
to., 07.10.2010 kl. 17.46 -0600, skrev Nicholas Kinar:
> Hello,
>
> Working again with the FDTD re-arrangement of terms, I am wondering if
> there is any way to run collect() on indices of an IndexedBase object
> using the current master sympy git repository. Rather than having (n+1)
> express
Well, maybe you have found a bug, maybe not. Could you try to narrow it
down a little? I would suggest to
1. Reproduce the problem with a simpler expression.
2. Put some print statements in the code to figure out exactly where the
problem occurs.
If you can identify the problem more precisely,
sø., 03.10.2010 kl. 05.49 -0700, skrev Mark Dewing:
> Here's a first pass at replacing the tuple in the Sum/Integral limits
> with Tuple.
>
> http://github.com/markdewing/sympy/tree/limit-tuple
>
> All the tests pass, but I didn't try it beyond the set of tests.
>
Cool. This should make it pos
ti., 28.09.2010 kl. 13.43 -0500, skrev Andy Ray Terrel:
> 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 th
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 thoughts would be appreciated.
>
> In my system I have a base object TensorProps with shape
fr., 24.09.2010 kl. 10.25 -0600, skrev Nicholas Kinar:
> > Hmm. To me, it seems like ccode() should be able to do this on its own.
> > Maybe you could submit it as a patch to ccode(). Or maybe it really can
> > and neither of us know about it. Øyvind (or anyone)?
> > There is a lot of pending
fr., 24.09.2010 kl. 09.34 -0600, skrev Aaron S. Meurer:
> On Sep 24, 2010, at 9:20 AM, Nicholas Kinar wrote:
>
> > Hello,
> >
> > Suppose that I have an expression such as the one given below:
> >
> > M = Indexed('M')
> > var('A B C')
> > i,j,n = symbols('i j n', integer = True)
> >
> > expr =
to., 23.09.2010 kl. 18.54 -0700, skrev Ondrej Certik:
> On Thu, Sep 23, 2010 at 6:42 PM, Andy Ray Terrel
> wrote:
> > The problem with the is_Foo construct is that every basic has to carry
> > it, so every object grows. The reason (maybe historic) there are some
> > there is that its faster to a
ma., 20.09.2010 kl. 22.06 -0600, skrev Aaron S. Meurer:
> Yeah, see one of my previous emails on this thread. I was doing something
> stupid, and so it didn't work when I tried it. The problem now is with
>
> >>> m.args[-1] == n
> False
>
A workaround is to use :
>>> m.args[-1] == Idx(n)
Tr
sø., 19.09.2010 kl. 17.19 -0600, skrev Nicholas Kinar:
> > In the mean time I found an easy way to do the Wild() trick in collect,
> > and have uploaded to github, the branch is fix_collect. I am trying to
> > use the pull request feature, without any luck so far...
> >
> > Ųyvind
>
> That's very
how easy that one would be to implement, but I think it would
> be preferable to the first one, actually.
>
> Aaron Meurer
>
> On Sep 19, 2010, at 2:37 PM, Øyvind Jensen wrote:
>
> >>
> >>> And Øyvind, I don't think it's a bug that collect doe
>
> > And Øyvind, I don't think it's a bug that collect doesn't respect
> > Wild. It's just not implemented. Someone suggested that subs might do
> > substitutions using Wilds and I put that work into t2. And this thread
> > provided a test case for it, but doing expr.subs(W**(n+1), u*W**(n+1),
>
>
> And Øyvind, I don't think it's a bug that collect doesn't respect
> Wild. It's just not implemented.
Yeah, that was kind of what I meant :-)
> Someone suggested that subs might do
> substitutions using Wilds and I put that work into t2. And this thread
> provided a test case for it, but do
sø., 19.09.2010 kl. 12.01 -0600, skrev Aaron S. Meurer:
> OK, ignore that. I was using i as a loop variable (using i as a Symbol is a
> bad idea because of this, imho).
>
> But now I get this strange error:
>
> In [48]: M(i, j, n).args[3]
> Out[48]: n
>
> In [49]: M(i, j, n).args[3] == n
> O
> Moreover, I think that something like this would be extremely useful as
> a function incorporated into the sympy distribution:
> >>> collect(expr2.subs([(a**(n+1), u*a**(n+1)) for a in _]), u)
Another approach would be to use Wild symbols when calling collect().
Like this:
>>> from sympy.tens
> expr3 = collect( expr2, M**(n+1), exact=True )
This doesn't work because it is M(2, 1)**(n+1) that is present in expr2,
and not M**(n+1). So you must use:
expr3 = collect( expr2, M(2, 1)**(n+1), exact=True)
Øyvind
> # end code
>
> Here is the output of the print statement:
>
> A*M(1, 1)**
to., 16.09.2010 kl. 22.10 -0600, skrev Aaron S. Meurer:
> Hi again.
>
> On Sep 16, 2010, at 9:51 PM, Nicholas Kinar wrote:
>
> >
> >>> I think you want the collect() function and the .as_independent method.
> >>> The easiest way to manipulate Equalities is to first convert them into
> >>> reg
fr., 03.09.2010 kl. 09.08 -0700, skrev klmn:
> Dear all,
>
> I am trying to implement various schemes for storing Gaunt
> coefficients (integrals of 3 spherical harmonics) calculated
> symbolically. Ondrej, I remember you offered me help for this, now I
> have to ask for it.
>
> It appears that a
fr., 03.09.2010 kl. 11.27 +0530, skrev Rahul Siddharthan:
> Aaron, Chris,
> Thanks for the replies!
>
> Aaron wrote:
> > This is great. SymPy code is *MUCH* easier to read than some lisp, in my
> > opinion.
>
> So far, yes and no. The main thing is that I needed to implement
> structured "tupl
I'd drop 2.4 any day. The biggest pain for me during the summer was the
doctest: +SKIP flag which requires 2.5. In the autowrap module I need
to +SKIP several doctests in case compilers and backends are not
installed.
Øyvind
--
You received this message because you are subscribed to the Google
On 13 Aug, 18:56, Ondrej Certik wrote:
> On Fri, Aug 13, 2010 at 1:30 AM, Øyvind Jensen
> wrote:
> > fr., 13.08.2010 kl. 01.17 -0700, skrev Ondrej Certik:
> >> On Fri, Aug 13, 2010 at 12:42 AM, Øyvind Jensen
> >> wrote:
> >> > I implemented
fr., 13.08.2010 kl. 01.17 -0700, skrev Ondrej Certik:
> On Fri, Aug 13, 2010 at 12:42 AM, Øyvind Jensen
> wrote:
> > I implemented the radial wave functions for an isotropic harmonic
> > oscillator in the spirit of Ondrej's hydrogen solutions. Tests are
> > missing,
I implemented the radial wave functions for an isotropic harmonic
oscillator in the spirit of Ondrej's hydrogen solutions. Tests are
missing, so it is not ready, but here it is anyway:
http://github.com/jegerjensen/sympy/compare/master...sho
I named the radial function 'R_nl', identical to the ra
ma., 02.08.2010 kl. 12.32 -0700, skrev Ondrej Certik:
> Hi Andy,
>
> thanks for raising this up.
>
> On Mon, Aug 2, 2010 at 7:30 AM, Andy Ray Terrel wrote:
> > I'm just bringing this up because of some code I'm reviewing and I'm
> > not sure what the community prefers.
> >
> > The beloved PEP 8
to., 22.07.2010 kl. 07.44 -0700, skrev smichr:
> > Ok, it's up, and it's
> > here:http://hosted.smartbear.com/sympy/go?page=ReviewDisplay&reviewid=3
> >
> > I guess since Aaron has already reviewed on github you will not use
> > it, for the first round at least. Anyway, it's up so you can play
>
ma., 19.07.2010 kl. 23.27 -0700, skrev Brian Granger:
> Hi,
>
> Currently, Commutator in the quantum modules is implemented as a
> Function. I am not sure this makes sense. Oyvind or Ondrej, do you
> recall why this choice was made? Also, I am wondering about other
> quantum things that are fun
On 18 Jul, 03:10, "Aaron S. Meurer" wrote:
> > Given the complexity of the patchset, I would recommend to use the
> > smartbear web hosted tool that Andy and I used for reviewing the fortran
> > code generator. Andy fixed it so that we have a free hosting for the
> > Sympy project on their demo
On 18 Jul, 13:26, smichr wrote:
> > > Øyvind
>
> I just set up an account with name smichr. Initial impressions of the
> clean interface are good. Let me know what to do next.
Ok, it's up, and it's here:
http://hosted.smartbear.com/sympy/go?page=ReviewDisplay&reviewid=3
I guess since Aaron ha
Can you create an account please? I need to setup your account as the
Author.
Øyvind
On 17 Jul, 15:22, Øyvind Jensen wrote:
> On 17 Jul, 14:18, smichr wrote:
>
>
>
> > On Jul 16, 3:32 pm, Øyvind Jensen wrote:
>
> > > fr., 16.07.2010 kl. 03.00 -0700, skrev smichr:
On 17 Jul, 14:18, smichr wrote:
> On Jul 16, 3:32 pm, Øyvind Jensen wrote:
>
>
>
> > fr., 16.07.2010 kl. 03.00 -0700, skrev smichr:
> > Given the complexity of the patchset, I would recommend to use the
> > smartbear web hosted tool that Andy and I used for
fr., 16.07.2010 kl. 13.25 -0700, skrev Brian Granger:
> Hi,
>
> Currently in secondquant and quantum we are making Bra and Ket
> subclasses of State:
>
> class State(Expr):
> class Bra(State):
> class Ket(State):
>
> the other option would be to make the ket/bra-ness an option:
>
> bra = State(
fr., 16.07.2010 kl. 13.05 -0700, skrev Brian Granger:
> Hi,
>
> In the quantum mechanics modules (quantum.py and secondquant.py) we
> have expressions that are combinations of operators (A, B, C, D, ...)
> states (|alpha>, |beta>, ) and scalars. Ignoring tensor products, you
> can have alternatin
fr., 16.07.2010 kl. 03.00 -0700, skrev smichr:
> Hi all,
>
> I have a lot of work that I have separated out into about 35 issues.
> The work deals with everything from minor editing of code, to handling
> of non-commutatives in simplifications and (hopefully) a total purge
> of power-rule infracti
This will be very useful, nice!
Øyvind
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sy...@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsubscr...@googlegroups.com.
For more options, vi
on., 07.07.2010 kl. 11.50 -0700, skrev Brian Granger:
> On Wed, Jul 7, 2010 at 11:20 AM, Øyvind Jensen
> wrote:
> > on., 07.07.2010 kl. 10.48 -0700, skrev Brian Granger:
> >> Hi,
> >>
> >> Matt and I are working on the subtle issues in the quantum GSoC
>
on., 07.07.2010 kl. 10.48 -0700, skrev Brian Granger:
> Hi,
>
> Matt and I are working on the subtle issues in the quantum GSoC
> project and we are running into issues with multiple inheritance in
> sympy. I wanted to get some thoughts on this.
>
> First, because sympy classes do not use super,
on., 07.07.2010 kl. 10.48 -0700, skrev Brian Granger:
> Hi,
>
> Matt and I are working on the subtle issues in the quantum GSoC
> project and we are running into issues with multiple inheritance in
> sympy. I wanted to get some thoughts on this.
>
> First, because sympy classes do not use super,
On 7 Jul, 04:14, Andy Ray Terrel wrote:
> I hadn't used the code comments in github before. They look nice and
> may be easier for others to use rather than depend on the SmartBear
> software. The only downside is it is there isn't as good an interface
> for saying what the defects are, showin
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 containers.py
However, I didn't put Set into the container file. Appare
>From a hijacked thread in sympy-patches:
ma., 05.07.2010 kl. 14.04 -0700, skrev Brian Granger:
> On Mon, Jul 5, 2010 at 1:28 PM, Ronan Lamy wrote:
> > Le lundi 05 juillet 2010 à 19:17 +0200, Øyvind Jensen a écrit :
> >> > Yep. I just got back from SciPy and I talk
> > Aren't some results dependent on assumptions? I don't see how you can
> > cache independent of assumptions and not have problems.
>
> For example:
>
> 1) check that there are no global or local assumptions set
> 2) store the expression
>
>
> retrieve:
>
> * check 1)
> * use cache
How a
Hello list,
it would be cool if you have opinions on what I have been doing on
code generation lately. It is all on github:
http://github.com/jegerjensen/sympy/tree/fortran_codegen4
The current state is that I have refactored the codegen framework into
a more object oriented form by moving logic
>
> For following the issue changes, I prefer [1] by the way. This is
> besides our mailing list the channel for patches. It has the advantage
> that patches do not get forgotten.
>
> Vinzent
>
>
> [1] http://code.google.com/p/sympy/updates/list
>
Vincent,
Thanks for the tip, and thanks for
on., 16.06.2010 kl. 11.09 -0600, skrev Aaron S. Meurer:
> Actually, there's a mailing list for issue changes here:
>
>
> http://groups.google.com/group/sympy-issues
>
Thanks, I think that's the one I really wanted. For some reason I
overlooked it on the sympy.org page.
Cheers,
Øyvind
--
Yo
> I just recently discovered the discussions I was missing:
> - http://code.google.com/p/sympy/feeds
> -- Check out the feed for Issue updates.
Oh, great! I was also looking for a way to stay updated on the issues.
So by now I subscribe to
1) sympy list
2) sympy-patches list
3) the issue-up
ti., 15.06.2010 kl. 10.11 -0700, skrev smichr:
> There were a large number of changes pushed in today. Were these all
> issues that were up for public review? (If there were issue numbers
> attached to the changes in the commit log I wouldn't have to ask but I
> only saw one of the nearly 30 that h
> >
> How do you make substitute check and see if the co and contra-variant
> ranks of the tensor being substituted are the same as the original?
>
You could try to overload Basic._eval_subs()
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To pos
I'm running it in my working directory without installing it. I added a
__init__.py file with just the line "import tensor", and now it works.
[...@ubuntulaptop sympy (alan)]$ cat sympy/tensor/__init__.py
import tensor
>
> The problem I see with regard to using the functions associated with
>
I'm at commit d0acf2e92ebbd921b492f4db430d967bc7bea091 and try to run
the examples, but I get an error:
[...@ubuntulaptop sympy (alan)]$ python sympy/tensor/examples/
testtensor.py
Traceback (most recent call last):
File "sympy/tensor/examples/testtensor.py", line 3, in
from sympy.tensor.te
> The is an explanation of how the abstract tensors are realized in the
> documentation of sympy-tensor. Just go to doc and make html.
Thanks, the documention is informative and well written!
>
> I don't know enough about the inner workings of sympy to know what I
> should subclass Tensor to E
Hi Alan and Comer,
As Andy mentioned I am working on code generation. Right now I focus
on array arguments, trying to generate code that will loop over arrays
and perform calculations on the array elements. The plan is described
here http://code.google.com/p/sympy/wiki/CodeGenerationIdeas .
It
If you use vim, and put these lines in .vimrc and it will highlight
trailing whitespace for you:
if has('gui_running')
hi WhiteSpaceEOL guibg=#FF
else
hi WhiteSpaceEOL ctermbg=Red
endif
: match WhitespaceEOL /\s\+\%#\@ There are a few reasons that trailing whitespace is bad. For one t
86 matches
Mail list logo
