 |
My Project
debian-1:4.1.1-p2+ds-4build2
|
virtual IStateType initState() const
poly interpolateDense(const number subDetVal=NULL)
virtual number getDetAt(const number *)
virtual number getSubDet()
rootContainer ** interpolateDenseSP(BOOLEAN matchUp=false, const number subDetVal=NULL)
mprState mprIdealCheck(const ideal theIdeal, const char *name, uResultant::resMatType mtype, BOOLEAN rmatrix=false)
ideal extendIdeal(const ideal gls, poly linPoly, const resMatType rmt)
ideal loNewtonPolytope(const ideal id)
uResultant(const ideal _gls, const resMatType _rmt=sparseResMat, BOOLEAN extIdeal=true)
resMatrixBase * accessResMat()
Base class for solving 0-dim poly systems using u-resultant.
uResultant::resMatType determineMType(int imtype)
virtual ideal getSubMatrix()
char name(const Variable &v)
poly linearPoly(const resMatType rmt)
virtual ideal getMatrix()
virtual poly getUDet(const number *)
complex root finder for univariate polynomials based on laguers algorithm
int nextPrime(const int p)
rootContainer ** specializeInU(BOOLEAN matchUp=false, const number subDetVal=NULL)
Base class for sparse and dense u-Resultant computation.