Changeset 9bb97e in git for kernel/f5gb.h


Ignore:
Timestamp:
Feb 6, 2009, 9:12:35 PM (14 years ago)
Author:
Christian Eder
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')
Children:
fcb80223d452f79f3b3e1a62b71d291a5fc64943
Parents:
b3e45f80f34104e744829011d4460dcee8e1e365
Message:
implementation of computeSPols, start of reduction and topReduction


git-svn-id: file:///usr/local/Singular/svn/trunk@11353 2c84dea3-7e68-4137-9b89-c4e89433aadc
File:
1 edited

Legend:

Unmodified
Added
Removed

  • kernel/f5gb.h

    rb3e45f r9bb97e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: f5gb.h,v 1.21 2009-02-04 19:27:12 ederc Exp $ */
     4/* $Id: f5gb.h,v 1.22 2009-02-06 20:12:35 ederc Exp $ */
    55/*
    66* ABSTRACT: f5gb interface
    … …  
    3535==================================================
    3636*/
    37 LList* F5inc(int* i, poly* f_i, LList* gPrev, poly* ONE);
     37LList* F5inc(int i, poly f_i, LList* gPrev, ideal gbPrev, poly ONE, int* reductionToZero);
    3838
    3939/*
    … …  
    6565==========================================================================================================
    6666*/
    67 bool criterion2(poly* t, LNode* l, RTagList* rTag, Rule* lastRuleTested);
    68  
     67bool criterion2(poly* t, LPoly* l, RTagList* rTag, Rule* lastRuleTested);
     68
     69/*
     70==================================
     71Computation of S-Polynomials in F5
     72==================================
     73*/
     74void computeSPols(CNode* first, RTagList* rTag, RList* rules, LList* sPolyList, int* reductionsToZero);
     75
     76/*
     77========================================================================
     78reduction including subalgorithm topReduction() using Faugere's criteria
     79========================================================================
     80*/
     81LNode* reduction(LList* sPolyList, LList* completed, ideal gbPrev, int* reductionsToZero);
     82
     83/*
     84=====================================================================================
     85top reduction in F5, i.e. reduction of a given S-polynomial by labeled polynomials of
     86the same index whereas the labels are taken into account
     87=====================================================================================
     88*/
     89LNode* topReduction(LNode* l, LList* gPrev, LList* completed);
     90
     91/*
     92=====================================================================
     93subalgorithm to find a possible reductor for the labeled polynomial l
     94=====================================================================
     95*/
     96LPoly* findReductor(LNode* l, LList* gPrev, LList* completed);
     97
    6998/*
    7099======================================
Note: See TracChangeset for help on using the changeset viewer.