On Friday 23 November 2007 16:57, William Stein wrote: > Singular errors or not, Singular is really pitiful at this problem > compared to Magma -- which is what we should have as a baseline > for solid robust behavior in this case: > > In SAGE (via libsingular) on a 2.33Ghz laptop: > > sage: R.<p10,g0,g1,g2,g3,g4,X1,X2> = QQ[]; t = > -p10^170*X1^10*X2^10+p10^130*X1^10*X2^5+p10^130*X1^5*X2^10-p10^90*X1^5*X2^5 >+p10^80*X1^5*X2^5-p10^40*X1^5-> sage: time a = t.factor() > CPU times: user 10.80 s, sys: 8.91 s, total: 19.71 s > sage: time a = t.factor() > CPU times: user 3.34 s, sys: 2.39 s, total: 5.73 s > sage: time a = t.factor() > CPU times: user 21.52 s, sys: 15.10 s, total: 36.62 s
Yes, I agree that singular is way slower than it should be. I'm pretty certain that I've seen it do this factorization in less than a second (which is plenty fast enough for my task of the day), but it's still pretty pathetic. Anyhow, getting them to do the factorization the "fast way" every time would be a wonderful improvement. On the slow times, it just about be faster to pop up a question box and ask the user to enter the factors. :-) -- Joel --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
