1)solve to solve a system and “variable: expression” will assign that expression to that variable. You can then substitute the results into a later expression using a “,”. So you might do
That will solve the system and then substitute those solutions into the expression for z.
2)pi, e, and the imaginary unit are called %pi, %e and %i respectively.
3)The symbolic solver is a lot less powerful than mathematica but you can do
load(“to_poly_solve”);
To get a polynomial solver that will at least get you all the roots of polynomials and does better on most trigonometric equations.
load(“drawdf”);
Is useful for drawing vector fields, phase portraits and that type of thing.
4) you can use a single quote to delay evaluation of something. Like say you want to write a differential equation and you don’t want it to actually try to evaluate the derivative inline, you can write something like
…for a forced harmonic oscilator. Or whatever. This is useful if you want to mess with the expression a bit before you try to solve the expression (eg doing substitutions or whatnot).*
We used maxima extensively in high school. I remember that I forgot to bring my laptop when we had our first maxima lesson. My teachers understandably scolded me for not bringing my laptop to school, but to their surprise I found an online version of maxima. [1] While it was good enough for this period, in contrast to this implementation it was truly awful.
I just think it's kinda sad that a lot of people never heard of maxima, as it is a pretty decent tool once you learn how to use it.
That sounds stupid. What if someone doesn't have a laptop? Even if do, cannot see why one's obligated to bring it along.
>in contrast to this implementation it was truly awful
It surely has the advantage of interactivity. The version you linked seems to restart the session in every query. On the other hand, seems more stable. Both `invert(matrix([2,3,1], [a,0,0], [1,4,8]));` and `draw3d(explicit(x^2+y^2,x,-1,1,y,-1,1));` that run fine in UFV's DMa version fail to run in the submitted one.
> That sounds stupid. What if someone doesn't have a laptop? Even if do, cannot see why one's obligated to bring it along.
Where I live, the school issues laptops to students, so not bringing the laptop is today's not bringing your textbook. (As a point of fact, my daughter is in 10th grade and has had exactly one physical textbook so far; the rest have been digital)
(to_lisp);
(loop for i below 1000000 count t) takes 0.34 seconds on my system with vanilla maxima (on gcl). In the browser it takes about 7 seconds, so it must be a factor of 21 in computer time. Using sbcl outside maxima it takes 0.002 seconds. So one can get some idea about performance.
Apart from the restriction to bytecode interpretation already mentioned, one reason for the slowness is that the sort of C with garbage collection that ECL needs is quite difficult to do in Webassembly. There is no way to scan previous stack frames for pointers in wasm, so all pointers to heap objects (or everything that looks like it might be one) have to be kept around somewhere in the heap where the GC can find them. This is really expensive and slows down the code a lot.
Of course, another approach would be to use the new wasm GC interface. But that requires defining a new ABI for garbage collected C, writing a new backend for LLVM, etc. So that would also be a lot of work to implement. Right now, there just is no efficient way to run programs that depend on bdwgc on wasm.
Web version of ecl when compiler is invoked at runtime, uses one-pass bytecodes compiler, so things tend to lack optimization unless compiled beforehand.
It feels faster than the other web-hosted maxima instances out there and if you take into account the cost of installing common lisp and maxima (I only need to use this about twice a year so I don't keep them live), it can be much faster than a local instance.
I've tried Maxima on a few occasions but the syntax somehow fails to agree with me.
Been looking for a self-hosted alternative to Wolfram Alpha, and just stumbled over Mathics, which has a Django front-end[1]. Rough but usable Mathematica alternative, at least for basic use.
tangential: can Macsyma/Maxima do symbolic boolean algebra, reducing formulae to bog standard "OR of ANDs" form?
(I've tried looking at the doc, and it's clearly not a feature they showcase, and as others have said, the way it works is not intuitive to me. I really need this, but trying to do it in lisp is becoming its own project and I want to get back to my project. I found some really nice online reducers, but the UIs are not conducive to pasting/putting in simultaneous equations, and using those outputs as inputs again)
maxima has logic package, written in 2009 by alexey beshenov. it lives in share/logic which is also where the texi docs are. it's included with the op version,
load(logic);
logic_simp (a or (b or false or (a or b)));
characteristic_vector (a xor b);
zhegalkin_form ((a implies b) or c);
e : ((a or b) xor c) and d$
logic_equiv (e, zhegalkin_form (e));
logic_diff (a or b or c, a);
demorgan (boolean_form (a nor b nor c));
It looks like the wasm file here is not fully optimized. Reading the wasm and JS, I'd guess -O1 perhaps? Linking with -O3 would make it smaller and possibly faster (10% smaller binary in a quick local test, and it removes 90% of locals, which should speed things up too)
But it is possible that it's already fast enough for the purposes here, and this doesn't matter.
It's worse, it is -O0 -- this is because of the GC and binaryen/llvm interaction. For GC to work we need to spill stack call pointers (and binaryen has such a flag!), but for the optimization level 1 and above said pointers are sometimes optimized away :3
I'm experimenting with WASI and the GC extension for WASM, but that's months from today if we speak about complete port (given my time capacity at the moment).
WasmGC would be the best solution here, yeah, then the VM handles pointers for you.
Otherwise, I could look into the SpillPointers issue for you if you want - optimizations should not remove GC pointers, so that sounds like a bug. If so feel free to file an issue with a testcase. (But WasmGC would be best, avoiding all that.)
As far as I know, optimization levels higher than -O0 work fine with SpillPointers. But at least in a cursory first look I had a while ago, the optimizations made things slower overall. I guess they might lead actually to more "moving pointers in and out of the heap" since the SpillPointers pass is done at the very end. But this should all be investigated more thoroughly.
Hey! Thanks for the offer and thanks for the correction. I've revisited relevant threads and it seems that it is indeed -O0 because things are slower with higher optimization levels (I must have misremembered).
```
the optimization level -O0 is used because higher optimization
levels seem to interfere with the binaryen options needed to get the
garbage collector to work correctly and tend slow down the program
(might be worth experimenting with the optimization options)
```
This brings back memories. We used this in my mechanical engineering mechanisms class. It was cool to have the (simplified!) symbolic formulas describing the movements we were designing.
Common Lisp does not require TCO. This runs on emscripten port of Embeddable Common Lisp - this platform support is relatively new. I'm also working on WASI port and an optimizing compiler at runtime (currently we use bytecodes compiler when running).
The platform supporting tail-recursion is irrelevant to hosting languages that support it; e.g. the JVM does (or at least did) not support tail recursion, but kawa scheme (which does) runs just fine on the JVM.
> While this has resulted in some incompatibilities between Macsyma and Maxima, programs written in the Macsyma algebraic language can often be run, with only minor changes, in either system.
because nobody knows maxima, some things to try. also plot2d/plot3d work, so that's pretty neat. the whole thing is powered by https://ecl.common-lisp.dev and the op announcement is here https://mailman3.common-lisp.net/hyperkitty/list/ecl-devel@c...
One thing I would add for people who are new to this is you can do
??something; to get the internal help. So say I want to know how to solve ODEs in maxima, do
??ode; …and you’ll get help. It generally does a search and presents a numbered list of options and you’ll want to type a number and a semicolon.
Some other useful things:
1)solve to solve a system and “variable: expression” will assign that expression to that variable. You can then substitute the results into a later expression using a “,”. So you might do
That will solve the system and then substitute those solutions into the expression for z.2)pi, e, and the imaginary unit are called %pi, %e and %i respectively.
3)The symbolic solver is a lot less powerful than mathematica but you can do
To get a polynomial solver that will at least get you all the roots of polynomials and does better on most trigonometric equations. Is useful for drawing vector fields, phase portraits and that type of thing.4) you can use a single quote to delay evaluation of something. Like say you want to write a differential equation and you don’t want it to actually try to evaluate the derivative inline, you can write something like
…for a forced harmonic oscilator. Or whatever. This is useful if you want to mess with the expression a bit before you try to solve the expression (eg doing substitutions or whatnot).*Thank you! As someone with no prior Maxima experience, those were some great starting points for me to learn and explore!
Note `plot3d(...);` doesn't seem to work: the output image is missing/broken.
you probably didn't define the function, f(x,y), which is the line before plot3d. it's a slightly buggy behavior
plot3d did work for me (on Chrome). Impressive.
We used maxima extensively in high school. I remember that I forgot to bring my laptop when we had our first maxima lesson. My teachers understandably scolded me for not bringing my laptop to school, but to their surprise I found an online version of maxima. [1] While it was good enough for this period, in contrast to this implementation it was truly awful.
I just think it's kinda sad that a lot of people never heard of maxima, as it is a pretty decent tool once you learn how to use it.
[1] http://www.dma.ufv.br/maxima/index.php
>scolded me for not bringing my laptop to school
That sounds stupid. What if someone doesn't have a laptop? Even if do, cannot see why one's obligated to bring it along.
>in contrast to this implementation it was truly awful
It surely has the advantage of interactivity. The version you linked seems to restart the session in every query. On the other hand, seems more stable. Both `invert(matrix([2,3,1], [a,0,0], [1,4,8]));` and `draw3d(explicit(x^2+y^2,x,-1,1,y,-1,1));` that run fine in UFV's DMa version fail to run in the submitted one.
> That sounds stupid. What if someone doesn't have a laptop? Even if do, cannot see why one's obligated to bring it along.
Where I live, the school issues laptops to students, so not bringing the laptop is today's not bringing your textbook. (As a point of fact, my daughter is in 10th grade and has had exactly one physical textbook so far; the rest have been digital)
(to_lisp); (loop for i below 1000000 count t) takes 0.34 seconds on my system with vanilla maxima (on gcl). In the browser it takes about 7 seconds, so it must be a factor of 21 in computer time. Using sbcl outside maxima it takes 0.002 seconds. So one can get some idea about performance.
Perhaps it could be combined with J (array language), like in the playground https://code.jsoftware.com/wiki/Playground that is using webassembly
It seems to work very well locally without connection to the web.
Apart from the restriction to bytecode interpretation already mentioned, one reason for the slowness is that the sort of C with garbage collection that ECL needs is quite difficult to do in Webassembly. There is no way to scan previous stack frames for pointers in wasm, so all pointers to heap objects (or everything that looks like it might be one) have to be kept around somewhere in the heap where the GC can find them. This is really expensive and slows down the code a lot.
Of course, another approach would be to use the new wasm GC interface. But that requires defining a new ABI for garbage collected C, writing a new backend for LLVM, etc. So that would also be a lot of work to implement. Right now, there just is no efficient way to run programs that depend on bdwgc on wasm.
What is bdwgc ? gc==garbage collection ?
The Boehm-Demers-Weiser garbage collecting memory allocation library.
https://www.hboehm.info/gc/
Web version of ecl when compiler is invoked at runtime, uses one-pass bytecodes compiler, so things tend to lack optimization unless compiled beforehand.
It feels faster than the other web-hosted maxima instances out there and if you take into account the cost of installing common lisp and maxima (I only need to use this about twice a year so I don't keep them live), it can be much faster than a local instance.
I'll add options to run Maxima:
* [Maxima on Android](https://play.google.com/store/apps/details?id=jp.yhonda), built with ECL.
* [Maxima on Jupyter](https://github.com/robert-dodier/maxima-jupyter)
* Maxima can be used via [SageMath](https://www.sagemath.org/) and [KDE Cantor](https://apps.kde.org/cantor/).
* Of course, with Emacs: [maxima-mode](https://gitlab.com/sasanidas/maxima) ([screenshot](https://community.linuxmint.com/img/screenshots/maxima-emacs...))
and [maxima-interface](https://github.com/jmbr/maxima-interface) to ease the interface between Maxima and Common Lisp.
* it can be used [from a Lisp REPL](https://mahmoodsheikh36.github.io/post/20230510181916-maxima...).
(and [wxMaxima](https://wxmaxima-developers.github.io/wxmaxima/): a graphical frontend as mentioned earlier)
(find the links and more scientific libraries for CL on https://github.com/CodyReichert/awesome-cl)
Raymond Toy posted this on the ECL mailing list: https://mailman3.common-lisp.net/hyperkitty/list/ecl-devel@c...
It's called "Embeddable Common Lisp", not "Embedded Common Lisp".
https://ecl.common-lisp.dev/
I've tried Maxima on a few occasions but the syntax somehow fails to agree with me.
Been looking for a self-hosted alternative to Wolfram Alpha, and just stumbled over Mathics, which has a Django front-end[1]. Rough but usable Mathematica alternative, at least for basic use.
[1]: https://github.com/Mathics3/mathics-django
There is also Expreduce which is a CAS written in Go that follows Mathematica syntax.
https://corywalker.github.io/expreduce-docs/
Similar project: PARI/GP on WASM https://pari.math.u-bordeaux.fr/gpexpwasm.html
How do Maxima and SymPy compare in terms of capability, features and speed (native, not WASM)?
tangential: can Macsyma/Maxima do symbolic boolean algebra, reducing formulae to bog standard "OR of ANDs" form?
(I've tried looking at the doc, and it's clearly not a feature they showcase, and as others have said, the way it works is not intuitive to me. I really need this, but trying to do it in lisp is becoming its own project and I want to get back to my project. I found some really nice online reducers, but the UIs are not conducive to pasting/putting in simultaneous equations, and using those outputs as inputs again)
maxima has logic package, written in 2009 by alexey beshenov. it lives in share/logic which is also where the texi docs are. it's included with the op version,
etc. there's more stuff in docsIt looks like the wasm file here is not fully optimized. Reading the wasm and JS, I'd guess -O1 perhaps? Linking with -O3 would make it smaller and possibly faster (10% smaller binary in a quick local test, and it removes 90% of locals, which should speed things up too)
But it is possible that it's already fast enough for the purposes here, and this doesn't matter.
It's worse, it is -O0 -- this is because of the GC and binaryen/llvm interaction. For GC to work we need to spill stack call pointers (and binaryen has such a flag!), but for the optimization level 1 and above said pointers are sometimes optimized away :3
I'm experimenting with WASI and the GC extension for WASM, but that's months from today if we speak about complete port (given my time capacity at the moment).
Interesting, thanks for the details!
WasmGC would be the best solution here, yeah, then the VM handles pointers for you.
Otherwise, I could look into the SpillPointers issue for you if you want - optimizations should not remove GC pointers, so that sounds like a bug. If so feel free to file an issue with a testcase. (But WasmGC would be best, avoiding all that.)
As far as I know, optimization levels higher than -O0 work fine with SpillPointers. But at least in a cursory first look I had a while ago, the optimizations made things slower overall. I guess they might lead actually to more "moving pointers in and out of the heap" since the SpillPointers pass is done at the very end. But this should all be investigated more thoroughly.
Hey! Thanks for the offer and thanks for the correction. I've revisited relevant threads and it seems that it is indeed -O0 because things are slower with higher optimization levels (I must have misremembered).
Relevant links: https://gitlab.com/embeddable-common-lisp/ecl/-/merge_reques... https://github.com/ivmai/bdwgc/issues/650
Most notably an entry in the INSTALL file:
``` the optimization level -O0 is used because higher optimization levels seem to interfere with the binaryen options needed to get the garbage collector to work correctly and tend slow down the program (might be worth experimenting with the optimization options) ```
This brings back memories. We used this in my mechanical engineering mechanisms class. It was cool to have the (simplified!) symbolic formulas describing the movements we were designing.
Nice. I've been using this Maxima interpreter: http://www.dma.ufv.br/maxima/index.php
Is there a place to get a wxmaxima installer for Windows other than SourceForge? I no longer trust stuff from there.
There seems to be a github repo here with binaries (but you need to get maxima separately, probably from sourceforge): https://github.com/wxMaxima-developers/wxmaxima
This is great?
Feature request: A way to easily copy old expressions into the current input field (to fix mistakes).
How did you get Common Lisp running on wasm? I thought wasm didn’t support tail call recursive
Common Lisp does not require TCO. This runs on emscripten port of Embeddable Common Lisp - this platform support is relatively new. I'm also working on WASI port and an optimizing compiler at runtime (currently we use bytecodes compiler when running).
Oh wow.
I always thought TCO was part of the spec itself.
Scheme requires TCO. It is a different Lisp (it also has standard[s]).
And revisions[n].
CL is not particularly functionally oriented. Many things like this are absent (or present, in some cases).
The platform supporting tail-recursion is irrelevant to hosting languages that support it; e.g. the JVM does (or at least did) not support tail recursion, but kawa scheme (which does) runs just fine on the JVM.
Nitpick: JVM supports recursive tail calls, but doesn't have the "tail call elimination" optimization that would make tail calls consume 0 stack.
That's a reasonable nitpick; tail-recursion is just a special case of tail-calls, and you can do tail-calls without TCE, just not unboundedly.
WASM supports tail calls and multiple return values now
I love Maxima, i don't really need a CAS much these days but whenever I do, I will turn to Maxima.
omg, macsyma is still alive and I can now manipulate real tensors in the browser?
This is maxima, not macsyma.
https://en.m.wikipedia.org/wiki/Maxima_(software)
How different is it?
> While this has resulted in some incompatibilities between Macsyma and Maxima, programs written in the Macsyma algebraic language can often be run, with only minor changes, in either system.
Symbolic tensor manipulation is still supported https://maxima-on-wasm.pages.dev/doc/html/Package-itensor#Pa...
It's the only Macsyma anyone's running these days, so maybe if Symbolics hadn't killed it off there'd be another version more deserving of the title.