>> I somehow wonder why the stack exhausts in a GB computations. > Probaly better alternative is to find out what causes large stack > usage and change code to use heap.
OK. I agree that this would be the better alternative, but now it is getting hard. Either the problem is in the lists connected to long polynomials or in the length of the lists involved in the GB computation. Both seems reasonable to me, but before I try to look into that code, can you perhaps tell me whether you mean exactly that I should look for recursion over lists in SPAD code or do you actually mean Lisp code (where I would have no clue how to search)? Ralf -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
