[GiNaC-list] memory allocation, matrices

[Marko Riedel]

Hi folks,

I'm going to ask a very basic question, namely if you can point me to
a tutorial where GiNaC's memory managment is described. I read the
tutorial from your website but I could not find any info on this.

I am familiar with the retain/release mechanism of used by Cocoa and
GNUstep, and the use of autorelease pools. If you could compare these
concepts to their GiNaC equivalents, that would be of great help.
E.g. in Objective C I can create a tree of objects and either free
them myself or put them into an autorelease pool that will be emptied
by the runloop. How would I do this in GiNaC?

Suppose I create a matrix of rational functions, a single entry of
which I'm interested in retaining. I would like to free the matrix and
retain that one function. Can you provide a code snippet that does
this?

I would also like to know what the limitations of the linear equation
solver are. How many variables can it handle? What are the time and
space complexities of the solver in terms of the number of variables
and the number of equations?

Thanks in advance for any help you may be able to give.

Best regards,

Marko Riedel

+-------------------------------------------------------------+
| Marko Riedel, EDV Neue Arbeit gGmbH, mriedel at lsi.upc.es     |
| http://www.geocities.com/markoriedelde/index.html           |
+-------------------------------------------------------------+