fglmDdata Class Reference

Public Member Functions
	fglmDdata (int dimension)
	~fglmDdata ()
int	getBasisSize () const
BOOLEAN	candidatesLeft () const
fglmDelem	nextCandidate ()
void	newBasisElem (poly &m, fglmVector v, fglmVector p, number &denom)
void	updateCandidates (poly m, const fglmVector v)
void	newGroebnerPoly (fglmVector &v, poly &p)
void	gaussreduce (fglmVector &v, fglmVector &p, number &denom)
ideal	buildIdeal ()

Private Attributes
int	dimen
oldGaussElem *	gauss
BOOLEAN *	isPivot
int *	perm
int	basisSize
polyset	basis
int *	varpermutation
int	groebnerBS
int	groebnerSize
ideal	destId
List< fglmDelem >	nlist

Detailed Description

Definition at line 758 of file fglmzero.cc.

Constructor & Destructor Documentation

fglmDdata()

fglmDdata::fglmDdata

(

int

dimension

)

Definition at line 793 of file fglmzero.cc.

{
    int k;
    dimen= dimension;
    basisSize= 0;
    //. All arrays run from [1]..[dimen], thus omAlloc( dimen + 1 )!
#ifndef HAVE_EXPLICIT_CONSTR
    gauss= new oldGaussElem[ dimen+1 ];
#else
    gauss= (oldGaussElem *)omAlloc( (dimen+1)*sizeof( oldGaussElem ) );
#endif
    isPivot= (BOOLEAN *)omAlloc( (dimen+1)*sizeof( BOOLEAN ) );
    for ( k= dimen; k > 0; k-- ) isPivot[k]= FALSE;
    perm= (int *)omAlloc( (dimen+1)*sizeof( int ) );
    basis= (polyset)omAlloc( (dimen+1)*sizeof( poly ) );
    varpermutation = (int*)omAlloc( ((currRing->N)+1)*sizeof(int) );
    // Sort ring variables by increasing values (because of weighted orderings)
    ideal perm_id = idMaxIdeal(1);
    intvec *iv = idSort(perm_id,TRUE);
    idDelete(&perm_id);
    for(int i = (currRing->N); i > 0; i--) varpermutation[(currRing->N)+1-i] = (*iv)[i-1];
    delete iv;
 
    groebnerBS= 16;
    groebnerSize= 0;
    destId= idInit( groebnerBS, 1 );
}

~fglmDdata()

fglmDdata::~fglmDdata

(

)

Definition at line 821 of file fglmzero.cc.

{
  // STICKYPROT2("dimen= %i", dimen);
  // STICKYPROT2("basisSize= %i", basisSize);
  //    fglmASSERT( dimen == basisSize, "Es wurden nicht alle BasisElemente gefunden!" );
    int k;
#ifndef HAVE_EXPLICIT_CONSTR
    delete [] gauss;
#else
    // use basisSize instead of dimen because of fglmquot!
    for ( k= basisSize; k > 0; k-- )
        gauss[k].~oldGaussElem();
    omFreeSize( (ADDRESS)gauss, (dimen+1)*sizeof( oldGaussElem ) );
#endif
    omFreeSize( (ADDRESS)isPivot, (dimen+1)*sizeof( BOOLEAN ) );
    omFreeSize( (ADDRESS)perm, (dimen+1)*sizeof( int ) );
    // use basisSize instead of dimen because of fglmquot!
    //. Remember: There is no poly in basis[0], thus k > 0
    for ( k= basisSize; k > 0; k-- )
        pLmDelete( basis[k]);
    omFreeSize( (ADDRESS)basis, (dimen+1)*sizeof( poly ) );
    omFreeSize( (ADDRESS)varpermutation, ((currRing->N)+1)*sizeof(int) );
}

Member Function Documentation

buildIdeal()

ideal fglmDdata::buildIdeal ( )

inline

Definition at line 786 of file fglmzero.cc.

    {
        idSkipZeroes( destId );
        return destId;
    }

candidatesLeft()

BOOLEAN fglmDdata::candidatesLeft ( ) const

inline

Definition at line 780 of file fglmzero.cc.

{ return ( nlist.isEmpty() ? FALSE : TRUE ); }

gaussreduce()

void fglmDdata::gaussreduce	(	fglmVector &	v,
		fglmVector &	p,
		number &	denom
	)

Definition at line 979 of file fglmzero.cc.

{
    int k;
    number fac1, fac2;
    number temp;
    fglmASSERT( pdenom == NULL, "pdenom in gaussreduce should be NULL" );
    pdenom= nInit( 1 );
    number vdenom = v.clearDenom();
    if ( ! nIsZero( vdenom ) && ! nIsOne( vdenom ) ) {
        p.setelem( p.size(), vdenom );
    }
    else {
        nDelete( &vdenom );
    }
    number gcd = v.gcd();
    if ( ! nIsZero( gcd ) && ! nIsOne( gcd ) ) {
        v /= gcd;
        number temp= nMult( pdenom, gcd );
        nDelete( &pdenom );
        pdenom= temp;
    }
    nDelete( & gcd );
 
    for ( k= 1; k <= basisSize; k++ ) {
 
        if ( ! v.elemIsZero( perm[k] ) ) {
            fac1= gauss[k].fac;
            fac2= nCopy( v.getconstelem( perm[k] ) );
            v.nihilate( fac1, fac2, gauss[k].v );
            fac1= nMult( fac1, gauss[k].pdenom );
            temp= nMult( fac2, pdenom );
            nDelete( &fac2 );
            fac2= temp;
              p.nihilate( fac1, fac2, gauss[k].p );
            temp= nMult( pdenom, gauss[k].pdenom );
            nDelete( &pdenom );
            pdenom= temp;
 
            nDelete( & fac1 );
            nDelete( & fac2 );
            number gcd = v.gcd();
            if ( ! nIsZero( gcd ) && ! nIsOne( gcd ) )
            {
                v /= gcd;
                number temp= nMult( pdenom, gcd );
                nDelete( &pdenom );
                pdenom= temp;
            }
            nDelete( & gcd );
            gcd= p.gcd();
            temp= n_SubringGcd( pdenom, gcd, currRing->cf );
            nDelete( &gcd );
            gcd= temp;
            if ( ! nIsZero( gcd ) && ! nIsOne( gcd ) )
            {
                p /= gcd;
                temp= nDiv( pdenom, gcd );
                nDelete( & pdenom );
                pdenom= temp;
                nNormalize( pdenom );
            }
            nDelete( & gcd );
        }
    }
}

getBasisSize()

int fglmDdata::getBasisSize ( ) const

inline

Definition at line 779 of file fglmzero.cc.

{ return basisSize; }

newBasisElem()

void fglmDdata::newBasisElem	(	poly &	m,
		fglmVector	v,
		fglmVector	p,
		number &	denom
	)

Definition at line 854 of file fglmzero.cc.

{
// inserts m as a new basis monom. m is NOT copied but directly inserted.
// returns m=NULL to indicate, that now basis is oweing m.
    basisSize++;
    basis[basisSize]= m;
    m= NULL;
    int k= 1;
    while ( nIsZero(v.getconstelem(k)) || isPivot[k] ) {
        k++;
    }
    fglmASSERT( k <= dimen, "Error(1) in fglmDdata::pivot-search");
    number pivot= v.getconstelem( k );
    int pivotcol = k;
    k++;
    while ( k <= dimen ) {
        if ( ! nIsZero( v.getconstelem(k) ) && ! isPivot[k] ) {
            if ( nGreater( v.getconstelem( k ), pivot ) ) {
                pivot= v.getconstelem( k );
                pivotcol= k;
            }
        }
        k++;
    }
    fglmASSERT( ! nIsZero( pivot ), "Error(2) fglmDdata::Pivotelement ist Null" );
    isPivot[ pivotcol ]= TRUE;
    perm[basisSize]= pivotcol;
 
    pivot= nCopy( v.getconstelem( pivotcol ) );
#ifndef HAVE_EXPLICIT_CONSTR
    gauss[basisSize].insertElem( v, p, denom, pivot );
#else
    gauss[basisSize].oldGaussElem( v, p, denom, pivot );
#endif
}

newGroebnerPoly()

void fglmDdata::newGroebnerPoly	(	fglmVector &	v,
		poly &	p
	)

Definition at line 936 of file fglmzero.cc.

{
    //. Baue das Polynom von oben nach unten:
    fglmASSERT( p.size() == basisSize+1, "GP::newGroebnerPoly: p has wrong size" );
    int k;
    poly result = m;
    poly temp = result;
    m= NULL;
    if ( nGetChar() > 0 ) {
        number lead = nCopy( p.getconstelem( basisSize+1 ) );
        p /= lead;
        nDelete( & lead );
    }
    if ( nGetChar() == 0 ) {
        number gcd= p.gcd();
        fglmASSERT( ! nIsZero( gcd ), "FATAL: gcd and thus p is zero" );
        if ( ! nIsOne( gcd ) )
            p /= gcd;
        nDelete( & gcd );
    }
    pSetCoeff( result, nCopy( p.getconstelem( basisSize+1 ) ) );
    for ( k= basisSize; k > 0; k-- ) {
        if ( ! nIsZero( p.getconstelem( k ) ) ) {
            temp->next= pCopy( basis[k] );
            pIter( temp );
            pSetCoeff( temp, nCopy( p.getconstelem( k ) ) );
        }
    }
    pSetm( result );
    if ( ! nGreaterZero( pGetCoeff( result ) ) ) result= pNeg( result );
    if ( groebnerSize == IDELEMS( destId ) ) {
        pEnlargeSet( & destId->m, IDELEMS( destId ), groebnerBS );
        IDELEMS( destId )+= groebnerBS;
    }
    (destId->m)[groebnerSize]= result;
    groebnerSize++;
}

nextCandidate()

fglmDelem fglmDdata::nextCandidate

(

)

Definition at line 846 of file fglmzero.cc.

{
    fglmDelem result = nlist.getFirst();
    nlist.removeFirst();
    return result;
}

updateCandidates()

void fglmDdata::updateCandidates	(	poly	m,
		const fglmVector	v
	)

Definition at line 891 of file fglmzero.cc.

{
    ListIterator<fglmDelem> list = nlist;
    poly newmonom = NULL;
    int k = (currRing->N);
    BOOLEAN done = FALSE;
    int state = 0;
    while ( k >= 1 )
    {
        newmonom = pCopy( m );
        pIncrExp( newmonom, varpermutation[k] );
        pSetm( newmonom );
        done= FALSE;
        while ( list.hasItem() && (!done) )
        {
            if ( (state= pCmp( list.getItem().monom, newmonom )) < 0 )
                list++;
            else done= TRUE;
        }
        if ( !done )
        {
            nlist.append( fglmDelem( newmonom, v, k ) );
            break;
        }
        if ( state == 0 )
        {
            list.getItem().newDivisor();
            pLmDelete( & newmonom );
        }
        else
        {
            list.insert( fglmDelem( newmonom, v, k ) );
        }
        k--;
    }
    while ( --k >= 1 )
    {
        newmonom= pCopy( m );
        pIncrExp( newmonom, varpermutation[k] );
        pSetm( newmonom );
        nlist.append( fglmDelem( newmonom, v, k ) );
    }
}

Field Documentation

basis

polyset fglmDdata::basis

private

Definition at line 766 of file fglmzero.cc.

basisSize

int fglmDdata::basisSize

private

Definition at line 765 of file fglmzero.cc.

destId

ideal fglmDdata::destId

private

Definition at line 772 of file fglmzero.cc.

dimen

int fglmDdata::dimen

private

Definition at line 761 of file fglmzero.cc.

gauss

oldGaussElem* fglmDdata::gauss

private

Definition at line 762 of file fglmzero.cc.

groebnerBS

int fglmDdata::groebnerBS

private

Definition at line 770 of file fglmzero.cc.

groebnerSize

int fglmDdata::groebnerSize

private

Definition at line 771 of file fglmzero.cc.

isPivot

BOOLEAN* fglmDdata::isPivot

private

Definition at line 763 of file fglmzero.cc.

nlist

List<fglmDelem> fglmDdata::nlist

private

Definition at line 774 of file fglmzero.cc.

perm

int* fglmDdata::perm

private

Definition at line 764 of file fglmzero.cc.

varpermutation

int* fglmDdata::varpermutation

private

Definition at line 768 of file fglmzero.cc.

---

The documentation for this class was generated from the following file:

• kernel/fglm/fglmzero.cc