LastInvariantFactor< _Ring, _Solver > Class Template Reference

This is used in a Smith Form algorithm. More...

#include <last-invariant-factor.h>

Public Member Functions
	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.
template<class IMatrix , class Vector >
Integer &	lastInvariantFactor (Integer &lif, const IMatrix &A, const Vector &PrimeL) const
	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) const
	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{.... More...
template<class IMatrix >
Integer &	lastInvariantFactor (Integer &lif, const IMatrix &A) const
	Compute the last invariant factor.
template<class IMatrix >
Integer &	lastInvariantFactor_Bonus (Integer &lif, Integer &Bonus, const IMatrix &A) const
	Compute the last invariant factor with Bonus.

Detailed Description

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.

Member Function Documentation

lastInvariantFactor_Bonus()

Integer& lastInvariantFactor_Bonus ( Integer &  lif, Integer &  Bonus, const IMatrix &  A, const Vector &  PrimeL  ) const

inline

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{....

}

---

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

• last-invariant-factor.h