RationalChineseRemainderVarPrec< RatCRABase, RatRecon > Struct Template Reference

Chinese remainder of vector of rationals. More...

#include <rational-cra-var-prec.h>

Public Member Functions
template<class Function , class RandPrimeIterator >
Integer &	operator() (Integer &num, Integer &den, Function &Iteration, RandPrimeIterator &genprime)
	The Rational CRA loop. More...

Detailed Description

template<class RatCRABase, class RatRecon = RReconstruction<Givaro::ZRing<Integer>, ClassicMaxQRationalReconstruction<Givaro::ZRing<Integer> > >>
struct LinBox::RationalChineseRemainderVarPrec< RatCRABase, RatRecon >

Chinese remainder of vector of rationals.

VarPrec: Variable preconditioner = lift random combination of residues

Compute the reconstruction of rational numbers Either by Early Termination see [Dumas, Saunder, Villard, JSC 32 (1/2), pp 71-99, 2001], Or via a bound on the size of the Integers.

Member Function Documentation

operator()()

Integer& operator() ( Integer &  num, Integer &  den, Function &  Iteration, RandPrimeIterator &  genprime  )

inline

The Rational CRA loop.

Given a function to generate residues mod a single prime, this loop produces the residues resulting from the Chinese remainder process on sufficiently many primes to meet the termination condition.

Parameters

Iteration

Function object of two arguments, Iteration(r, p), given prime p it outputs residue(s) r. This loop may be parallelized. Iteration must be reentrant, thread safe. For example, Iteration may be returning the coefficients of the minimal polynomial of a matrix mod p.

Warning

We won't detect bad primes.

Parameters

	genprime	RandIter object for generating primes.
[out]	num	the rational numerator
[out]	den	the rational denominator

---

The documentation for this struct was generated from the following file:

• rational-cra-var-prec.h