Compute the minpoly of a matrix over an integer ring using modular arithmetic. More...
#include <iostream>#include <cmath>#include "linbox/field/field-traits.h"#include "linbox/algorithms/matrix-hom.h"#include "linbox/vector/vector-domain.h"#include "linbox/randiter/random-prime.h"#include "linbox/util/commentator.h"#include <fflas-ffpack/ffpack/ffpack.h>#include "linbox/algorithms/cra-builder-early-multip.h"
Include dependency graph for minpoly-integer.h:
Namespaces | |
| LinBox | |
| Namespace in which all linbox code resides. | |
Detailed Description
Compute the minpoly of a matrix over an integer ring using modular arithmetic.
- Todo:
- better filter out repeated primes
