The Schreier-Sims algorithm for matrix groups

Publication date 27 October 2004

Software, source code, etc. for problems pertaining to group theory (20-04) Linear algebraic groups over finite fields (20G40) Other matrix groups over finite fields (20H30) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Abstract: This is the report of a project with the aim to make a new implementation of the Schreier-Sims algorithm in GAP, specialized for matrix groups. The standard Schreier-Sims algorithm is described in some detail, followed by descriptions of the probabilistic Schreier-Sims algorithm and the Schreier-Todd-Coxeter-Sims algorithm. Then we discuss our implementation and some optimisations, and finally we report on the performance of our implementation, as compared to the existing implementation in GAP, and we give benchmark results. The conclusion is that our implementation in some cases is faster and consumes much less memory.

This page was built for publication: The Schreier-Sims algorithm for matrix groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474631)