Go to the source code of this file.
Enumerator |
---|
mprOk |
|
mprWrongRType |
|
mprHasOne |
|
mprInfNumOfVars |
|
mprNotReduced |
|
mprNotZeroDim |
|
mprNotHomog |
|
mprUnSupField |
|
Definition at line 96 of file mpr_base.h.
ideal loNewtonPolytope |
( |
const ideal |
id | ) |
|
Definition at line 3192 of file mpr_base.cc.
3196 int totverts,idelem;
3203 for( i=0; i < idelem; i++) totverts +=
pLength( (id->m)[i] );
3205 LP =
new simplex( idelem+totverts*2+5, totverts+5 );
3209 idr = chnp.newtonPolytopesI(
id );
Linear Programming / Linear Optimization using Simplex - Algorithm.
static int pLength(poly a)
Definition at line 94 of file mpr_inout.cc.
104 if ( rmatrix ) numOfVars++;
109 if (
IDELEMS(theIdeal) != numOfVars )
112 for ( k=
IDELEMS(theIdeal) - 1; (state ==
mprOk) && (k >= 0); k-- )
114 poly p = (theIdeal->m)[k];
128 if ( state !=
mprOk ) mprPrintError( state,
"" );
BOOLEAN p_IsHomogeneous(poly p, const ring r)
static BOOLEAN rField_is_R(const ring r)
static BOOLEAN rField_is_Q_a(const ring r)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pIsConstant(p)
like above, except that Comp might be != 0
static BOOLEAN rField_is_Q(const ring r)
static BOOLEAN rField_is_long_C(const ring r)
static BOOLEAN rField_is_long_R(const ring r)