Hi there, the following code is really, really really (REALLY!) slow:
sage: IP = InfinitePolynomialRing(QQ) sage: x = IP.gen() sage: x10000 = x[10000] sage: %time 1/2*x10000 CPU times: user 0.86 s, sys: 0.00 s, total: 0.86 s Wall time: 0.87 s 1/2*x10000 Alright, so that was slow. Let's try something new: sage: x10001 = x[10001] sage: %time 1/2*x10000 CPU times: user 49.56 s, sys: 0.03 s, total: 49.60 s Wall time: 50.62 s 1/2*x10000 50 seconds! The second try is a bit faster (I assume some maps were already constructed): sage: %time 1/2*x10000 CPU times: user 7.74 s, sys: 0.00 s, total: 7.74 s Wall time: 7.86 s 1/2*x10000 I lost track of coercion/categories, thus any pointers how to fix this would be greatly appreciated. Patches even more ;) Cheers, Martin PS: This stuff slows down the linear programming stuff quite a bit. -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://www.informatik.uni-bremen.de/~malb _jab: martinralbre...@jabber.ccc.de -- 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
