Hi! I just found the following: sage: P.<x,y,z> = QQ[] sage: def test1(x,y,z): ....: for i in range(100): ....: p = (x+y+z)^i ....: sage: def test2(x,y,z): ....: x = singular(x) ....: y = singular(y) ....: z = singular(z) ....: for i in range(100): ....: p = (x+y+z)^i ....: sage: %time test1(x,y,z) CPU times: user 2.66 s, sys: 0.00 s, total: 2.66 s Wall time: 2.67 s sage: %time test2(x,y,z) CPU times: user 0.15 s, sys: 0.08 s, total: 0.23 s Wall time: 1.94 s
The timings were obtained with sage-4.6.2. So, replacing libSingular with Singular-via-pexpect saves much of the computation time. Is that something to worry about? Best regards, Simon -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
