Base class for sparse and dense u-Resultant computation.
virtual number getSubDet()
virtual ideal getSubMatrix()
virtual poly getUDet(const number *)
virtual ideal getMatrix()
resMatrixBase(const resMatrixBase &)
virtual number getDetAt(const number *)
virtual IStateType initState() const
complex root finder for univariate polynomials based on laguers algorithm
Base class for solving 0-dim poly systems using u-resultant.
poly linearPoly(const resMatType rmt)
rootContainer ** specializeInU(BOOLEAN matchUp=false, const number subDetVal=NULL)
ideal extendIdeal(const ideal gls, poly linPoly, const resMatType rmt)
rootContainer ** interpolateDenseSP(BOOLEAN matchUp=false, const number subDetVal=NULL)
uResultant(const uResultant &)
resMatrixBase * accessResMat()
poly interpolateDense(const number subDetVal=NULL)
int nextPrime(const int p)
EXTERN_VAR size_t gmp_output_digits
uResultant::resMatType determineMType(int imtype)
mprState mprIdealCheck(const ideal theIdeal, const char *name, uResultant::resMatType mtype, BOOLEAN rmatrix=false)
ideal loNewtonPolytope(const ideal id)
int name
New type name for int.