Luckily I have been learning lisp on the side for fun for a while.
I'll have to take a look at that.
Josh
On Apr 30, 10:39 am, Nick Alexander <[EMAIL PROTECTED]> wrote:
> Joshua Kantor <[EMAIL PROTECTED]> writes:
> > I am actually interested in the internal representations and
> > manipula
Joshua Kantor <[EMAIL PROTECTED]> writes:
> I am actually interested in the internal representations and
> manipulation required to do this sort of thing. I.e. how would one
> duplicate the internal workings of maxima in python.
If you speak lisp, Norvig's book
http://norvig.com/paip.html
is
Last time I looked plural applies to rings
that can be defined using relations of the form
x_i x_j=sum of lower monomials
This is good for enveloping algebras, rings
of differential operators etc but not completely
general (notable exceptions are Sklyanin algebras).
The maxima package "affine" by
On 4/30/07, Joshua Kantor <[EMAIL PROTECTED]> wrote:
> This is similiar to defining a non-commutative ring by declaring
> relations and then trying to simplify an expression in that ring.
I have never used it, but I think Singular now includes a package
called "plural"
which is supposed to be a h
> This way the basic simplification is also trivial, so what remains is
> the question of more sophisticated simplifications using some
> identities, but I guess that's the same problem as with ratsimp,
> expand, combine, factor etc. One just need to write a special method
> with a special algorit
> Its important that I don't want to assume that we are in a polynomial
> ring or this is trivial. I'm actually interesting in x and y being
> tensors and wondering how
> to program from scratch tensor calculus. Even in this case the example
> x+y+x is a bit trivial but suppose that I want it to r
I don't believe that sage actually does the type type of
simplification I'm describing in any of its own code. RingElement for
example eventually calls the base rings addition which in all cases
that I can think of reduces to addition in a number field and the
simplification happens automatically
That's exactly what SymPy is doing. You can look at the design
document, if you are interested:
http://code.google.com/p/sympy/wiki/HowItWorks
You can also look at ginac, they are basically doing the same as SymPy
(only a little more complicated). But the basic things like
x+y+x = 2*x+y
is SAG
I am actually interested in the internal representations and
manipulation required to do this sort of thing. I.e. how would one
duplicate the internal workings of maxima in python.
Josh
On Apr 29, 10:21 pm, Michel <[EMAIL PROTECTED]> wrote:
> The way maxima works that from the view point
> of
The way maxima works that from the view point
of the user there are very few automatic simplifications.
There are however a lot of "expression manipulation commands" like
"expand",
"ratsimp", "factor", "trigexpand" etc...
Some automatic simplifications are 12+14=26, x+x=2*x.
Internally of course
10 matches
Mail list logo
