Changeset a9c298 in git for kernel/f5gb.h
 Timestamp:
 Nov 20, 2013, 4:54:25 PM (9 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 0de0509972719531e2a4b51ec9fd0e44a66fd2fd
 Parents:
 e4014563a82388c4b39dfa37db24cbe159b24a35
 gitauthor:
 Hans Schoenemann <hannes@mathematik.unikl.de>20131120 16:54:25+01:00
 gitcommitter:
 Hans Schoenemann <hannes@mathematik.unikl.de>20131120 16:54:42+01:00
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

kernel/f5gb.h
re40145 ra9c298 38 38 /* 39 39 ================================================== 40 computes incrementally gbs of subsets of the input 41 gb{f_m} > gb{f_m,f_(m1)} > gb{f_m,...,f_1} 40 computes incrementally gbs of subsets of the input 41 gb{f_m} > gb{f_m,f_(m1)} > gb{f_m,...,f_1} 42 42 ================================================== 43 43 */ … … 47 47 ================================================================ 48 48 computes a list of critical pairs for the next reduction process 49 the first element is always "useful" thus the critical pair 50 computed is either "useful" or "useless" depending on the second 49 the first element is always "useful" thus the critical pair 50 computed is either "useful" or "useless" depending on the second 51 51 element which generates the critical pair. 52 52 first element in gPrev is always the newest element which must … … 64 64 * Checks all remaining critical pairs, i.e. those of higher degree, 65 65 * by the two Buchberger criteria. 66 * return value: 0, if all remaining critical pairs are deleted by 66 * return value: 0, if all remaining critical pairs are deleted by 67 67 * Buchberger's criteria 68 68 * 1, otherwise 69 69 */ 70 bool arrisCheck(CNode* first,LNode* firstGCurr, long arrisdeg); 70 bool arrisCheck(CNode* first,LNode* firstGCurr, long arrisdeg); 71 71 72 72 /* 73 73 ================================================================ 74 74 computes a list of critical pairs for the next reduction process 75 the first element is always "useless" thus the critical pair 75 the first element is always "useless" thus the critical pair 76 76 computed is "useless". 77 77 first element in gPrev is always the newest element which must … … 131 131 /*! 132 132 * ================================================================================ 133 * searches for reducers of temp similar to the symbolic preprocessing of F4 and 133 * searches for reducers of temp similar to the symbolic preprocessing of F4 and 134 134 * divides them into a "good" and "bad" part: 135 * 135 * 136 136 * the "good" ones are the reducers which do not corrupt the label of temp, with 137 137 * these the normal form of temp is computed 138 138 * 139 * the "bad" ones are the reducers which corrupt the label of temp, they are tested 139 * the "bad" ones are the reducers which corrupt the label of temp, they are tested 140 140 * later on for possible new RuleOlds and Spolynomials to be added to the algorithm 141 141 * ================================================================================ 142 142 */ 143 void findReducers(LNode* l, LList* sPolyList, ideal gbPrev, LList* gPrev, LList* reducers, CListOld* critPairs, RList* rules, LTagList* lTag, RTagList* rTag, int termination, PList* rejectedGBList, int plus); 143 void findReducers(LNode* l, LList* sPolyList, ideal gbPrev, LList* gPrev, LList* reducers, CListOld* critPairs, RList* rules, LTagList* lTag, RTagList* rTag, int termination, PList* rejectedGBList, int plus); 144 144 145 145 /* … … 149 149 ===================================================================================== 150 150 */ 151 inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, CListOld* critPairs, RList* RuleOlds, LTagList* lTag, RTagList* rTag, ideal gbPrev, PList* rejectedGBList, int plus); 151 inline void topReduction(LNode* l, LList* sPolyList, LList* gPrev, CListOld* critPairs, RList* RuleOlds, LTagList* lTag, RTagList* rTag, ideal gbPrev, PList* rejectedGBList, int plus); 152 152 153 153 /* … … 159 159 160 160 poly p_MergeEq_q(poly p, poly q, const ring r); 161 */ 161 */ 162 162 /* 163 163 =====================================================================
Note: See TracChangeset
for help on using the changeset viewer.