|
| | LastInvariantFactor (const Solver &_solver=Solver(), const Ring &_r=Ring(), int _threshold=DEFAULTLIFTHRESHOLD) |
| | _Ring, an integer ring, _Solver, a function which solves Ax = b over the quotient field of _Ring.
|
| |
| void | setThreshold (int _threshold) |
| |
| int | getThreshold () const |
| |
| const Solver & | getSolver () const |
| |
| void | setSolver (const Solver &s) |
| |
| template<class IMatrix, class Vector> |
| Integer & | lastInvariantFactor (Integer &lif, const IMatrix &A, const Vector &PrimeL) |
| | Compute the last invariant factor of an integer matrix, by solving linear system, ignoring these factors of primes in list PrimeL.
|
| |
| template<class IMatrix, class Vector> |
| Integer & | lastInvariantFactor_Bonus (Integer &lif, Integer &Bonus, const IMatrix &A, const Vector &PrimeL) |
| | Compute the last invariant factor of an integer matrix, by solving linear system, ignoring these factors of primes in list PrimeL Implement the Bonus in ref{....
|
| |
| template<class IMatrix, class Vector> |
| Integer & | lastInvariantFactor1 (Integer &lif, Vector &r_num, const IMatrix &A, const bool oldMatrix=false) |
| |
| template<class Vector> |
| Integer & | bonus (Integer &Bonus, const Integer r1_den, const Integer r2_den, Vector &r1_num, Vector &r2_num) const |
| |
| template<class IMatrix> |
| Integer & | lastInvariantFactor (Integer &lif, const IMatrix &A) |
| | Compute the last invariant factor.
|
| |
| template<class IMatrix> |
| Integer & | lastInvariantFactor_Bonus (Integer &lif, Integer &Bonus, const IMatrix &A) |
| | Compute the last invariant factor with Bonus.
|
| |
template<class _Ring, class _Solver>
class LinBox::LastInvariantFactor< _Ring, _Solver >
This is used in a Smith Form algorithm.
This computes the last invariant factor of an integer matrix, whether zero or not, by rational solving.