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()
poly linearPoly(const resMatType rmt)
uResultant::resMatType determineMType(int imtype)
virtual poly getUDet(const number *)
Base class for sparse and dense u-Resultant computation.
rootContainer ** specializeInU(BOOLEAN matchUp=false, const number subDetVal=NULL)
virtual number getDetAt(const number *)
virtual ideal getMatrix()
int nextPrime(const int p)
virtual ideal getSubMatrix()
mprState mprIdealCheck(const ideal theIdeal, const char *name, uResultant::resMatType mtype, BOOLEAN rmatrix=false)
rootContainer ** interpolateDenseSP(BOOLEAN matchUp=false, const number subDetVal=NULL)
char name(const Variable &v)
poly interpolateDense(const number subDetVal=NULL)
uResultant(const ideal _gls, const resMatType _rmt=sparseResMat, BOOLEAN extIdeal=true)
ideal extendIdeal(const ideal gls, poly linPoly, const resMatType rmt)
virtual number getSubDet()
ideal loNewtonPolytope(const ideal id)