Go to the source code of this file.
◆ SFREE
◆ SNONE
◆ mprState
| Enumerator | 
|---|
| mprOk  |  | 
| mprWrongRType  |  | 
| mprHasOne  |  | 
| mprInfNumOfVars  |  | 
| mprNotReduced  |  | 
| mprNotZeroDim  |  | 
| mprNotHomog  |  | 
| mprUnSupField  |  | 
Definition at line 96 of file mpr_base.h.
 
 
◆ determineMType()
◆ loNewtonPolytope()
      
        
          | ideal loNewtonPolytope  | 
          ( | 
          const ideal  | 
          id | ) | 
           | 
        
      
 
Definition at line 3191 of file mpr_base.cc.
 3192{
 3195  int totverts,idelem;
 3196  ideal idr;
 3197 
 3198  
 3200 
 3201  totverts = 0;
 3202  for( 
i=0; 
i < idelem; 
i++) totverts += 
pLength( (id->m)[
i] );
 
 3203 
 3204  LP = 
new simplex( idelem+totverts*2+5, totverts+5 ); 
 
 3205 
 3206  
 3208  idr = chnp.newtonPolytopesI( id );
 3209 
 3210  delete LP;
 3211 
 3212  return idr;
 3213}
Linear Programming / Linear Optimization using Simplex - Algorithm.
 
static int pLength(poly a)
 
 
 
 
◆ mprIdealCheck()
◆ gmp_output_digits