Hi Volker, On 2013-01-21, Volker Braun <[email protected]> wrote: > LLL_gram() is a good deal faster than checking positive definiteness:
Sorry, your post came while I wrote my post. If checking positive definiteness can be a bottle neck then my suggestion to test it by default is not good. > I guess this means that positive definiteness could be checked much more=20 > efficiently. But for now we should probably just implement=20 > LLL_gram(check=3DTrue) in Sage. Problem: If the "check" option is True by default then the user will have to wait for the positive definiteness test by default. But if it is False by default then the user will wait forever (by default) if Pari hangs. What is the lesser evil? If qflllgram does what one needs here, one could perhaps make chosing a Pari algorithm an option in the LLL_gram method? Best regards, Simon -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en.
