Martin Baker wrote:
>
> Initially a was just happy to find algorithms that worked in each
> direction albeit for small groups. However now, of course, I am keen to
> get these implementations to scale up as much as possible.
I looked at the implementation and AFAICS the first problem is
your 'next' function -- you perform search to find action of
inverse generator. But in Todd-Coxeter coset table is
supposed to contain entries both for generator and its
inverse so no need to search. I will try such modification,
it should give about 100-1000 speedup for larger examples,
so then we will be able to find out what other problem
may be. Cannon et all report groups having 100000 elements
on _much_ smaller machine that we have avilable now, so
probably we need other improvements. but this is first
step to make algorithm testable on more realistic data.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
