Changeset ec9b96 in git
 Timestamp:
 May 11, 2006, 8:53:25 PM (17 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '00e2e9c41af3fde1273eb3633f4c0c7c3db2579d')
 Children:
 c4224163d0b5a68d0df32d84c36aa034616eeb0c
 Parents:
 ab9844937566dae9f75927a6ac2989457ff9e881
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/center.lib
rab9844 rec9b96 1 1 /////////////////////////////////////////////////////////////////////////////// 2 version="$Id: center.lib,v 1. 19 20060505 14:36:12motsak Exp $"2 version="$Id: center.lib,v 1.20 20060511 18:53:25 motsak Exp $" 3 3 category="Noncommutative" 4 4 info=" … … 1058 1058 int m = (k > 0); 1059 1059 1060 int MinDeg = 6; // starting guess for Maximal Bounding Degree, 61061 int Delta = 4; // increment of it, 41060 int @MinDeg = 1; // starting guess for Maximal Bounding Degree, 6 1061 int @Delta = 1; // increment of it, 4 1062 1062 1063 1063 if( m and (D <= 0) ) 1064 1064 { 1065 1065 // minimal guess 1066 D = MinDeg;1066 D = @MinDeg; 1067 1067 } 1068 1068 … … 1207 1207 1208 1208 // Init new grades: 1209 for( j = D + 1; j <= (D + Delta); j++ )1209 for( j = D + 1; j <= (D + @Delta); j++ ) 1210 1210 { 1211 1211 FOUND_LEADING_MONOMIALS[j] = ideal(); … … 1225 1225 { 1226 1226 // minimal degree: 1227 d = mindeg (FLM);1227 d = mindegInt(FLM); /// ### /// 1228 1228 1229 1229 // take all of minimal degree: … … 1233 1233 1234 1234 // Add them in the same way: 1235 for( j = 1; j <= (D + Delta); j = j + d ) // For every degree (j*d) of T, do:1235 for( j = 1; j <= (D + @Delta); j = j + d ) // For every degree (j*d) of T, do: 1236 1236 { 1237 for( l = j; (l + d) <= (D + Delta); l++ )1237 for( l = j; (l + d) <= (D + @Delta); l++ ) 1238 1238 { 1239 1239 if( (l + d) > D ) // Only new should be updated! … … 1259 1259 setring NCRING; 1260 1260 1261 /* 1262 if(toprint()) 1263 { 1264 typeof(@Delta); @Delta; 1265 typeof(D); D; 1266 }; 1267 */ 1261 1268 // And set new Bound 1262 D = D + Delta;1269 D = D + @Delta; 1263 1270 } 1264 1271 … … 1421 1428 while( size(q) > 0 ) 1422 1429 { 1423 d = maxdeg (p);1430 d = maxdegInt(p); /// ### /// 1424 1431 1425 1432 if( (0 < d) and (d <= N) ) … … 1482 1489 } 1483 1490 1491 1492 /******************************************************/ 1493 static proc mindegInt( ideal I ) 1494 { 1495 /*4DEBUG*/ if( defined( @@@DEBUG ) ){ BCall( "mindegInt", I ); }; /*4DEBUG*/ 1496 1497 intmat D = mindeg(I); 1498 1499 int min = D[1, 1]; int m; 1500 1501 for( int c = 2; c <= ncols(D); c++ ) 1502 { 1503 m = D[1, c]; 1504 1505 if( m < min ) 1506 { 1507 min = m; 1508 } 1509 } 1510 1511 /*4DEBUG*/ if( defined( @@@DEBUG ) ){ ECall( "mindegInt", min ); }; /*4DEBUG*/ 1512 1513 return( min ); 1514 } 1515 1484 1516 /******************************************************/ 1485 1517 proc sa_reduce( ideal V ) // 'subalgebra basis' computation … … 1540 1572 FLM[1] = 0; // ...and kill it from FLM 1541 1573 1542 d = maxdeg ( p );1574 d = maxdegInt( p ); 1543 1575 T = ideal(p); 1544 1576 … … 1652 1684 FLM[1] = 0; // ...and kill it from FLM 1653 1685 1654 d = maxdeg (q);1686 d = maxdegInt(q); 1655 1687 T = ideal(q); 1656 1688
Note: See TracChangeset
for help on using the changeset viewer.