On Mon, Dec 11, 2006 at 04:34:07PM -0500, sen1 at math.msu.edu wrote:
> Hello,
>
> I have a very simple sparse matrix routine (finds the largest
> eigenvalue of a non-negative square matrix), which runs just fine in
> maxima with gcl. ( I wrote it because I could not find such a
> routine in the maxima files. Is there one?)
>
> For testing, I tried cmucl, and the thing would not
> run: stated something about being "out of heap space." There were
> some arcane remarks about how to dynamically allocate more heap space
> which I did not understand.
>
> Question: Is cmucl a low end type of lisp for "teaching"?
>
> Which of the freely available types of lisp are good for
> computation?
No, in fact CMUCL is a rather high powered lisp, normally excellent
for fast computation because it has very good type inference and
specialization code.
SBCL is a spinoff from CMUCL which has its aim to become more easily
ported and more maintainable.
both SBCL and CMUCL generate native code. CMUCL has an additional
bytecode compiler which SBCL doesn't have (or didn't last I looked).
The fact that you borked CMUCL is a bit surprising but you may simply
need to increase the heap space from whatever the default is. I
believe there is a command line switch. CMUCL may be generating
bytecode for the maxima function, and that may be less space
efficient, in which case, running the "compile" function on your
maxima function might be helpful.
Dunno beyond that.
--
Daniel Lakeland
dlakelan at street-artists.org
http://www.street-artists.org/~dlakelan