linbox
test-smith-form-binary.C File Reference

Test the EGV divide and conquer SNF alg. More...

Typedefs

typedef Givaro::ZRing< IntegerPIR
 
typedef Givaro::Modular< double > Field
 
using PrimeGenerator = PrimeIterator<IteratorCategories::HeuristicTag>
 
typedef DixonSolver< PIR, Field, PrimeGeneratorSolver
 
typedef LastInvariantFactor< PIR, SolverLIF
 
typedef OneInvariantFactor< PIR, LIF, SCompose, RandomMatrixOIF
 
typedef SmithFormBinary< PIR, OIFSF
 

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)
 

Detailed Description

Test the EGV divide and conquer SNF alg.

Typedef Documentation

◆ PIR

typedef Givaro::ZRing<Integer> PIR

◆ Field

typedef Givaro::Modular<double> Field

◆ PrimeGenerator

◆ Solver

◆ LIF

◆ OIF

◆ SF

typedef SmithFormBinary<PIR, OIF > SF

Function Documentation

◆ spaceBumps()

template<typename Vect>
void spaceBumps ( size_t m,
size_t n,
Vect & bumps,
Vect & lumps )

◆ checkBumpsLumps()

template<typename Mat, typename Vect>
bool checkBumpsLumps ( SF & sf,
Mat & A,
Vect & d,
Vect & x,
const Vect & bumps,
const Vect & lumps )

◆ main()

int main ( int argc,
char ** argv )