linbox
|
Benchmarking fixed CRA routines. More...
#include "benchmarks/benchmark.h"
#include "linbox/util/debug.h"
#include "linbox/field/modular.h"
#include "linbox/field/modular-balanced.h"
#include "linbox/matrix/random-matrix.h"
#include "linbox/algorithms/blas-domain.h"
#include "linbox/algorithms/rns.h"
#include <linbox/algorithms/cra-domain.h>
#include "linbox/algorithms/cra-early-multip.h"
#include "linbox/integer.h"
#include "linbox/util/iml_wrapper.h"
Namespaces | |
namespace | LinBox |
Namespace in which all linbox code resides. | |
Functions | |
template<bool Unsigned> | |
int | bench_cra (index_t n, index_t m, index_t l, LinBox::PlotData< index_t > &Data) |
Bench CRA. |
Benchmarking fixed CRA routines.
Here we make benchmarks for CRT (Chinese Remaindering Theorem/Algorithm) in the following case. Let be a vector of size
and whose entries have at most
bits (signed or unsigned). Suppose that we only know
for many primes
. We try and reconstruct
from these residues.
We benchmark for one vector or repetitions on different vectors.
We use the implementations in LinBox, Givaro, IML and NTL (if the latter two are available).
int bench_cra | ( | index_t | n, |
index_t | m, | ||
index_t | l, | ||
LinBox::PlotData< index_t > & | Data | ||
) |
Bench CRA.
n | size of vector to reconstruct (>1) |
m | number of vectors to reconstruct |
l | size of the integers |
Unsigned | use >=0 random integers or not. |
Data | collects timings |