OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP
The Meataxe algorithm is a popular algorithm to test modules for irreducibility. I review the theory and particular cases of the Meataxe algorithm and the analogies that can be drawn from normal forms of matrices. I describe my implementation of an algorithm already implemented in GAP (Groups, Alg...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
The University of Arizona.
2016
|
| Online Access: | http://hdl.handle.net/10150/614112 http://arizona.openrepository.com/arizona/handle/10150/614112 |
| Summary: | The Meataxe algorithm is a popular algorithm to test modules for irreducibility. I review the theory and particular cases of
the Meataxe algorithm and the analogies that can be drawn from normal forms of matrices. I describe my implementation
of an algorithm already implemented in GAP (Groups, Algorithms, Programming) to compute the simple composition
factors of a module, and implement changes that should in theory speed up computations with large modules. I then test
and evaluate predictions. |
|---|