linbox
|
Limited doc so far. More...
#include <rational-reconstruction.h>
Public Member Functions | |
RationalReconstruction (const LiftingContainer &lcontainer, const Ring &r=Ring(), int THRESHOLD=DEF_THRESH) | |
Constructor. | |
const LiftingContainer & | getContainer () const |
Get the LiftingContainer. | |
template<class Vector > | |
bool | getRational (Vector &num, Integer &den, int switcher) const |
Handler to switch between different rational reconstruction strategy. | |
template<class Vector > | |
bool | getRational (Vector &num, Integer &den) const |
no doc. | |
template<class InVect1 , class InVect2 > | |
Integer & | dot (Integer &d, const InVect1 &v1, const InVect2 &v2) const |
No doc. | |
template<class Vector > | |
bool | getRational1 (Vector &num, Integer &den) const |
Reconstruct a vector of rational numbers from p-adic digit vector sequence. | |
template<class Vector > | |
bool | getRational2 (Vector &num, Integer &den) const |
Reconstruct a vector of rational numbers from p-adic digit vector sequence. | |
template<class ConstIterator > | |
void | PolEval (Vector &y, ConstIterator &Pol, size_t deg, Integer &x) const |
NO DOC. | |
template<class Vector1 > | |
bool | getRational3 (Vector1 &num, Integer &den) const |
Reconstruct a vector of rational numbers from p-adic digit vector sequence. | |
template<class Vector1 > | |
bool | getRationalET (Vector1 &num, Integer &den, const Integer &den_app=1) const |
early terminated analog of getRational3. |
Limited doc so far.
Used, for instance, after LiftingContainer.
RationalReconstruction | ( | const LiftingContainer & | lcontainer, |
const Ring & | r = Ring() , |
||
int | THRESHOLD = DEF_THRESH |
||
) | [inline] |
Constructor.
lcontainer | NO DOC |
r | NO DOC |
THRESHOLD | NO DOC |
bool getRational | ( | Vector & | num, |
Integer & | den, | ||
int | switcher | ||
) | const [inline] |
Handler to switch between different rational reconstruction strategy.
Allow early termination and direct fast method Switch is made by using a threshold as the third argument (default is set to that of constructor THRESHOLD
Integer& dot | ( | Integer & | d, |
const InVect1 & | v1, | ||
const InVect2 & | v2 | ||
) | const [inline] |
No doc.
bool getRational1 | ( | Vector & | num, |
Integer & | den | ||
) | const [inline] |
Reconstruct a vector of rational numbers from p-adic digit vector sequence.
An early termination technique is used. Answer is a pair (numerator, common denominator) The trick to reconstruct the rational solution (V. Pan) is implemented. Implement the certificate idea, preprint submitted to ISSAC'05
bool getRational2 | ( | Vector & | num, |
Integer & | den | ||
) | const [inline] |
Reconstruct a vector of rational numbers from p-adic digit vector sequence.
An early termination technique is used. Answer is a vector of pair (num, den)
void PolEval | ( | Vector & | y, |
ConstIterator & | Pol, | ||
size_t | deg, | ||
Integer & | x | ||
) | const [inline] |
NO DOC.
y | ? |
Pol | ? |
deg | ? |
x | ? |
bool getRational3 | ( | Vector1 & | num, |
Integer & | den | ||
) | const [inline] |
Reconstruct a vector of rational numbers from p-adic digit vector sequence.
compute all digits and reconstruct rationals only once Result is a vector of numerators and one common denominator