My Project
Data Structures | Macros | Enumerations | Functions | Variables
mpr_base.h File Reference
#include "kernel/numeric/mpr_numeric.h"

Go to the source code of this file.

Data Structures

class  resMatrixBase
 Base class for sparse and dense u-Resultant computation. More...
 
class  uResultant
 Base class for solving 0-dim poly systems using u-resultant. More...
 

Macros

#define SNONE   -1
 
#define SFREE   -2
 

Enumerations

enum  mprState {
  mprOk , mprWrongRType , mprHasOne , mprInfNumOfVars ,
  mprNotReduced , mprNotZeroDim , mprNotHomog , mprUnSupField
}
 

Functions

uResultant::resMatType determineMType (int imtype)
 
mprState mprIdealCheck (const ideal theIdeal, const char *name, uResultant::resMatType mtype, BOOLEAN rmatrix=false)
 
ideal loNewtonPolytope (const ideal id)
 

Variables

EXTERN_VAR size_t gmp_output_digits
 

Macro Definition Documentation

◆ SFREE

#define SFREE   -2

Definition at line 15 of file mpr_base.h.

◆ SNONE

#define SNONE   -1

Definition at line 14 of file mpr_base.h.

Enumeration Type Documentation

◆ mprState

enum mprState
Enumerator
mprOk 
mprWrongRType 
mprHasOne 
mprInfNumOfVars 
mprNotReduced 
mprNotZeroDim 
mprNotHomog 
mprUnSupField 

Definition at line 96 of file mpr_base.h.

97{
98 mprOk,
100 mprHasOne,
106};
@ mprNotHomog
Definition: mpr_base.h:104
@ mprInfNumOfVars
Definition: mpr_base.h:101
@ mprHasOne
Definition: mpr_base.h:100
@ mprNotReduced
Definition: mpr_base.h:102
@ mprWrongRType
Definition: mpr_base.h:99
@ mprNotZeroDim
Definition: mpr_base.h:103
@ mprOk
Definition: mpr_base.h:98
@ mprUnSupField
Definition: mpr_base.h:105

Function Documentation

◆ determineMType()

uResultant::resMatType determineMType ( int  imtype)

◆ loNewtonPolytope()

ideal loNewtonPolytope ( const ideal  id)

Definition at line 3190 of file mpr_base.cc.

3191{
3192 simplex * LP;
3193 int i;
3194 int /*n,*/totverts,idelem;
3195 ideal idr;
3196
3197 // n= (currRing->N);
3198 idelem= IDELEMS(id); // should be n+1
3199
3200 totverts = 0;
3201 for( i=0; i < idelem; i++) totverts += pLength( (id->m)[i] );
3202
3203 LP = new simplex( idelem+totverts*2+5, totverts+5 ); // rows, cols
3204
3205 // evaluate convex hull for supports of id
3206 convexHull chnp( LP );
3207 idr = chnp.newtonPolytopesI( id );
3208
3209 delete LP;
3210
3211 return idr;
3212}
int i
Definition: cfEzgcd.cc:132
Linear Programming / Linear Optimization using Simplex - Algorithm.
Definition: mpr_numeric.h:195
static unsigned pLength(poly a)
Definition: p_polys.h:191
#define IDELEMS(i)
Definition: simpleideals.h:23

◆ mprIdealCheck()

mprState mprIdealCheck ( const ideal  theIdeal,
const char *  name,
uResultant::resMatType  mtype,
BOOLEAN  rmatrix = false 
)

Variable Documentation

◆ gmp_output_digits

EXTERN_VAR size_t gmp_output_digits

Definition at line 115 of file mpr_base.h.