This is the homepage of a project aimed at improving the GAP implementation of Schreier-Sims algorithm for matrix groups.
GAP already includes an implementation of this algorithm, but that one works with permutation groups, and for other groups it first computes a permutation representation (a faithful action) and then work with the resulting permutation group. This package provides an implementation that is restricted to matrix groups, and work with the matrices directly, and this makes it more efficient in most cases.
Project development summary
Information about the Schreier-Sims algorithm can be found in the following books (an in lots of other places)
Last updated: 2004-09-29, by Henrik Bäärnhielm