|
linbox
|
Test the EGV divide and conquer SNF alg. More...
#include "linbox/linbox-config.h"#include "linbox/randiter/random-prime.h"#include "linbox/algorithms/last-invariant-factor.h"#include "linbox/algorithms/one-invariant-factor.h"#include "linbox/algorithms/smith-form-binary.h"#include "linbox/algorithms/smith-form-adaptive.h"#include "linbox/blackbox/scompose.h"#include "linbox/blackbox/random-matrix.h"#include "linbox/algorithms/rational-solver.h"#include <givaro/modular.h>#include "linbox/util/commentator.h"#include "test-smith-form.h"Typedefs | |
| typedef Givaro::ZRing< Integer > | PIR |
| typedef Givaro::Modular< double > | Field |
| using | PrimeGenerator = PrimeIterator<IteratorCategories::HeuristicTag> |
| typedef DixonSolver< PIR, Field, PrimeGenerator > | Solver |
| typedef LastInvariantFactor< PIR, Solver > | LIF |
| typedef OneInvariantFactor< PIR, LIF, SCompose, RandomMatrix > | OIF |
| typedef SmithFormBinary< PIR, OIF > | SF |
Functions | |
| template<typename Vect> | |
| void | spaceBumps (size_t m, size_t n, Vect &bumps, Vect &lumps) |
| template<typename Mat, typename Vect> | |
| bool | checkBumpsLumps (SF &sf, Mat &A, Vect &d, Vect &x, const Vect &bumps, const Vect &lumps) |
| int | main (int argc, char **argv) |
Test the EGV divide and conquer SNF alg.
| typedef Givaro::Modular<double> Field |
| typedef DixonSolver<PIR, Field, PrimeGenerator> Solver |
| typedef LastInvariantFactor<PIR, Solver> LIF |
| typedef OneInvariantFactor<PIR, LIF, SCompose, RandomMatrix> OIF |
| typedef SmithFormBinary<PIR, OIF > SF |
| void spaceBumps | ( | size_t | m, |
| size_t | n, | ||
| Vect & | bumps, | ||
| Vect & | lumps ) |
| bool checkBumpsLumps | ( | SF & | sf, |
| Mat & | A, | ||
| Vect & | d, | ||
| Vect & | x, | ||
| const Vect & | bumps, | ||
| const Vect & | lumps ) |
| int main | ( | int | argc, |
| char ** | argv ) |