On Mon, Jun 2, 2008 at 7:18 PM, Robert Bradshaw <[EMAIL PROTECTED]> wrote: > > On Jun 2, 2008, at 6:43 PM, Mike Hansen wrote: > >> Hello, >> >> This is definitely not a problem with coercion -- it's a problem with >> the iterator for G. > > Coercion...always the scapegoat :-) >
I made several optimization and improvements and posted the result at http://trac.sagemath.org/sage_trac/ticket/3353 David -- thanks for reporting this!! I hope somebody will referee it. Now the calculation David posted is "a bazillion times faster' (and I made matrix group arithmetic 40 times faster while I was at it). sage: p = 5 sage: G = GL(2,p) sage: z = iter(G) sage: z <iterator object at 0x8113910> sage: time z.next() CPU times: user 0.06 s, sys: 0.02 s, total: 0.08 s Wall time: 0.37 s [0 1] [1 0] sage: time z.next() CPU times: user 0.00 s, sys: 0.00 s, total: 0.00 s Wall time: 0.00 s [0 1] [1 1] sage: time z.next() CPU times: user 0.00 s, sys: 0.00 s, total: 0.00 s Wall time: 0.00 s [0 1] [1 2] sage: time z.next() CPU times: user 0.00 s, sys: 0.00 s, total: 0.00 s Wall time: 0.00 s [0 1] [1 4] sage: time z.next() CPU times: user 0.00 s, sys: 0.00 s, total: 0.00 s Wall time: 0.00 s [0 1] [1 3] --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com 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 -~----------~----~----~----~------~----~------~--~---
