The Schreier-Sims algorithm for matrix groups
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-Tod...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.48550/arxiv.math/0410593 |