Re: Stack size

[Karim BELABAS <Karim.Belabas@math.u-psud.fr>]

On Fri, 12 Sep 2003, Franck MICHEL wrote:
> Probably a naive question, but: is it possible to use more than 2.1Gb of
> stack size with Pari on a 32-bit machine?

Depends on your 'malloc' implementation. Presumably, the answer is no.

> The problem is to compute serreverse(s) (where s depends on x and b, with
> complex floating point coefficients, 4500 digits) and to avoid "the PARI
> stack overflows"...

A much easier way out is to add a few garbage collection statements in
serreverse(). I did this in CVS (unstable version).

Perhaps it solves your problem ?

If not, please give an example of a problematic series.

Cheers,

    Karim.
-- 
Karim Belabas                     Tel: (+33) (0)1 69 15 57 48
Dép. de Mathématiques, Bât. 425   Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud              http://www.math.u-psud.fr/~belabas/
F-91405 Orsay (France)            http://www.parigp-home.de/  [PARI/GP]