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
size_t	gmp_output_digits

Macro Definition Documentation

#define SFREE   -2

Definition at line 15 of file mpr_base.h.

#define SNONE   -1

Definition at line 14 of file mpr_base.h.

Enumeration Type Documentation

enum mprState

Enumerator
mprOk
mprWrongRType
mprHasOne
mprInfNumOfVars
mprNotReduced
mprNotZeroDim
mprNotHomog
mprUnSupField

Definition at line 96 of file mpr_base.h.

{
    mprOk,
    mprWrongRType,
    mprHasOne,
    mprInfNumOfVars,
    mprNotReduced,
    mprNotZeroDim,
    mprNotHomog,
    mprUnSupField
};

Function Documentation

uResultant::resMatType determineMType

(

int

imtype

)

Definition at line 134 of file mpr_inout.cc.

{
  switch ( imtype )
  {
  case MPR_DENSE:
    return uResultant::denseResMat;
  case 0:
  case MPR_SPARSE:
    return uResultant::sparseResMat;
  default:
    return uResultant::none;
  }
}

ideal loNewtonPolytope

(

const ideal

id

)

Definition at line 3190 of file mpr_base.cc.

{
  simplex * LP;
  int i;
  int /*n,*/totverts,idelem;
  ideal idr;

  // n= (currRing->N);
  idelem= IDELEMS(id);  // should be n+1

  totverts = 0;
  for( i=0; i < idelem; i++) totverts += pLength( (id->m)[i] );

  LP = new simplex( idelem+totverts*2+5, totverts+5 ); // rows, cols

  // evaluate convex hull for supports of id
  convexHull chnp( LP );
  idr = chnp.newtonPolytopesI( id );

  delete LP;

  return idr;
}

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

Definition at line 93 of file mpr_inout.cc.

{
  mprState state = mprOk;
  // int power;
  int k;

  int numOfVars= mtype == uResultant::denseResMat?(currRing->N)-1:(currRing->N);
  if ( rmatrix ) numOfVars++;

  if ( mtype == uResultant::none )
    state= mprWrongRType;

  if ( IDELEMS(theIdeal) != numOfVars )
    state= mprInfNumOfVars;

  for ( k= IDELEMS(theIdeal) - 1; (state == mprOk) && (k >= 0); k-- )
  {
    poly p = (theIdeal->m)[k];
    if ( pIsConstant(p) ) state= mprHasOne;
    else
    if ( (mtype == uResultant::denseResMat) && !p_IsHomogeneous(p, currRing) )
      state=mprNotHomog;
  }

  if ( !(rField_is_R(currRing)||
         rField_is_Q(currRing)||
         rField_is_long_R(currRing)||
         rField_is_long_C(currRing)||
         (rmatrix && rField_is_Q_a(currRing))) )
    state= mprUnSupField;

  if ( state != mprOk ) mprPrintError( state, "" /* name */ );

  return state;
}

Variable Documentation

size_t gmp_output_digits

Definition at line 44 of file mpr_complex.cc.