Dear all,
I'm curious about performance of Singular computations which are run
from sage:
I tried the following test:
---
cat singulartest.sage
R = singular.ring(0,'(a,b,c,w,x,y,z)','lp');
I = singular.ideal('x5-abc3', 'x7-w5a5b5', 'bc3-a7', 'b2a3c5x-yzw2',\
'xyz-wz2ab', 'bx-awz9')
S = I.std()
Ir = S.radical()
Sr = Ir.std()
quit
---
VS:
----
LIB "primdec.lib";
ring R = 0,(a,b,c,w,x,y,z),lp;
ideal I = x5-abc3, x7-w5a5b5, bc3-a7, b2a3c5x-yzw2, xyz-wz2ab, bx-
awz9;
ideal s = std(I);
ideal Ir = radical(s);
ideal Sr = std(Ir);
Sr;
quit;
----
The result is
time /usr/local/sage/local/bin/Singular singulartest.sing
[...]
real 0m32.112s
user 0m31.509s
sys 0m0.295s
time sage singulartest.sage
[...]
real 0m42.653s
user 0m1.027s
sys 0m0.262s
Looking at "top" during the computation it seems to me that the
spawned Singular process is just taking more time to do the
computation. It does not look like overhead of the python wrapper to
me.
Furthermore some experiments showed that the time difference scales
with the size of the problem.
Does anybody know what's going on here ? Is the bundled libsingular
compiled with less optimization ??
I would love to use sage/python/cython since I want to combine
computations in different programs but it has to be as fast as
possible.
Any comment is appreciated
Thomas
---------------------------------------------------------------------
Thomas Kahle
Max Planck Institute for Mathematics in the Sciences
Inselstr. 22-26, 04103 Leipzig
Tel: +49(0) 341-9959-545
[EMAIL PROTECTED], http://personal-homepages.mis.mpg.de/kahle/
---------------------------------------------------------------------
--~--~---------~--~----~------------~-------~--~----~
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-support
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
