70 poly interpolateDense(
const number subDetVal=
NULL );
86 int nextPrime(
const int p );
complex root finder for univariate polynomials based on laguers algorithm
Base class for solving 0-dim poly systems using u-resultant.
virtual IStateType initState() const
resMatrixBase * accessResMat()
uResultant::resMatType determineMType(int imtype)
virtual poly getUDet(const number *)
Base class for sparse and dense u-Resultant computation.
virtual number getDetAt(const number *)
virtual ideal getMatrix()
char name(const Variable &v)
virtual ideal getSubMatrix()
mprState mprIdealCheck(const ideal theIdeal, const char *name, uResultant::resMatType mtype, BOOLEAN rmatrix=false)
virtual number getSubDet()
ideal loNewtonPolytope(const ideal id)