qfminim, still

[Paul van Wamelen <wamelen@marais.math.lsu.edu>]

Dear Pari developers,

In the latest cvs version, qfminim with the flag equal to 2 (that is
for dealing with non-integral coefficients) still seems to have
problems. If I ask for no vectors to be returned it frequently uses
far too much stack. If it's just counting vectors it shouldn't need
much space at all. In the example below you should not need any
stack. But if I give it stack it eventually gives a segmentation
fault:


                   GP/PARI CALCULATOR Version 2.0.20 (beta)
                 UltraSparc (MicroSparc kernel) 32-bit version
               (readline v2.2 enabled, extended help available)

                          Copyright (C) 1989-1999 by
          C. Batut, K. Belabas, D. Bernardi, H. Cohen and M. Olivier.

Type ? for help, \q to quit.
Type ?12 for how to get moral (and possibly technical) support.

   realprecision = 28 significant digits
   seriesprecision = 16 significant terms
   format = g0.28

parisize = 4000000, primelimit = 500000
? \p 50
   realprecision = 57 significant digits (50 digits displayed)
? allocatemem
  ***   Warning: doubling stack size; new stack = 8.0 MBytes.
? allocatemem
  ***   Warning: doubling stack size; new stack = 16.0 MBytes.
? Qmat = [0.11111111142950462791900419192593924719487380725487, -0.00000000044141825543241733328461090412551550996248818534046, -0.0046054381467568259236777825641845653129934921505820, 0.00000000082561993263073136967588884446489982248337458881702, 0.038635811317388343874396556955187628307051565237413, 0.0000000039645760491395902357459405247647019818269609588387; -0.00000000044141825543241733328461090412551550996248818534046, 0.0046054401948401722732572256263644491552603112974067, -0.0000000021681710211017411306315624970670902017066120060358, -0.00019088820659796711609144969852886241544434950149656, 0.0000000019273522517840565489394111956876184777881944388131, 0.0016014033726717144144943028469320526510865781850956; -0.0046054381467568259236777825641845653129934921505820, -0.0000000021681710211017411306315624970670902017066120060358, 0.00019089826643329496448646797772466747434229839737825, -0.000000010649685460199778543705962575800000918117200949902, -0.0016014123151610674236949!
!
!
169313830521559863035403205, 0.0000000094668248273505562427227276986441958676813403356850; 0.00000000082561993263073136967588884446489982248337458881702, -0.00019088820659796711609144969852886241544434950149656, -0.000000010649685460199778543705962575800000918117200949902, 0.0000079499444847306153140167078674499951232269335091466, -0.000000013611376428718291455371476742820098136782315853172, -0.000066369575380829930580721745907528486242029093839243; 0.038635811317388343874396556955187628307051565237413, 0.0000000019273522517840565489394111956876184777881944388131, -0.0016014123151610674236949169313830521559863035403205, -0.000000013611376428718291455371476742820098136782315853172, 0.013434552120571585399766106448559252386466590415539, -0.000000024119667755470040300206841483399357575447912861272; 0.0000000039645760491395902357459405247647019818269609588387, 0.0016014033726717144144943028469320526510865781850956, 0.0000000094668248273505562427227276986441958676813403356850, -0.0!
!
!
00066369575380829930580721745907528486242029093839243, -0.0!
00000024119667755470040300206841483399357575447912861272, 0.00055693278005627188997670408774096794891665647413037];
? qfminim(Qmat*10^4,1,0,2)
  ***   bug in GP (Segmentation Fault), please report
? 



Happy computing!

Paul van Wamelen