Changeset f3c6e5 in git
- Timestamp:
- Jul 26, 2006, 3:48:05 PM (17 years ago)
- Branches:
- (u'spielwiese', 'd1b01e9d51ade4b46b745d3bada5c5f3696be3a8')
- Children:
- 6e3cab4cadf40a95b799d76008c2f5305dbcbe6b
- Parents:
- 7f7c25e5e9c095ee25b7bfbfbfd3d7e6a7f3575a
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/primdec.lib
r7f7c25e rf3c6e5 1 1 /////////////////////////////////////////////////////////////////////////////// 2 version="$Id: primdec.lib,v 1.12 4 2006-07-26 11:50:30Singular Exp $";2 version="$Id: primdec.lib,v 1.125 2006-07-26 13:48:05 Singular Exp $"; 3 3 category="Commutative Algebra"; 4 4 info=" 5 5 LIBRARY: primdec.lib Primary Decomposition and Radical of Ideals 6 AUTHORS: Gerhard Pfister, pfister@mathematik.uni-kl.de (GTZ) 7 @* Wolfram Decker, decker@math.uni-sb.de (SY) 8 @* Hans Schoenemann, hannes@mathematik.uni-kl.de (SY) 9 @*Santiago Laplagne, slaplagn@dm.uba.ar (GTZ)6 AUTHORS: Gerhard Pfister, pfister@mathematik.uni-kl.de (GTZ)@* 7 Wolfram Decker, decker@math.uni-sb.de (SY)@* 8 Hans Schoenemann, hannes@mathematik.uni-kl.de (SY)@* 9 Santiago Laplagne, slaplagn@dm.uba.ar (GTZ) 10 10 11 11 OVERVIEW: … … 5423 5423 if(#[j] == "KL") { 5424 5424 algorithm = "KL"; 5425 valid = 1 }5425 valid = 1;} 5426 5426 if(#[j] == "SL") { 5427 5427 algorithm = "SL"; 5428 valid = 1 }5428 valid = 1;} 5429 5429 if(#[j] == "noFacstd") { 5430 5430 useFac = 0; 5431 valid = 1 }5431 valid = 1;} 5432 5432 if(#[j] == "facstd") { 5433 5433 useFac = 1; 5434 valid = 1 }5434 valid = 1;} 5435 5435 if(#[j] == "equiRad") { 5436 5436 il = 1; 5437 valid = 1 }5437 valid = 1;} 5438 5438 if(#[j] == "fullRad") { 5439 5439 il = 0; 5440 valid = 1 }5440 valid = 1;} 5441 5441 } 5442 5442 if(valid == 0) { … … 5469 5469 pr = facstd(i); 5470 5470 } else { 5471 pr = i 5471 pr = i; 5472 5472 } 5473 5473 option(set, op); … … 5522 5522 // 5523 5523 static proc radicalKL(ideal I, ideal ser, list #) { 5524 // ideal I 5525 // ideal ser 5526 // list # 5524 // ideal I The ideal for which the radical is computed 5525 // ideal ser Used to reduce components already obtained 5526 // list # If #[1] = 1, equiradical is computed. 5527 5527 5528 5528 // I needs to be a Groebner basis. … … 5927 5927 dbprint(printlevel - voice, "// The dimension is ", dim(groebner(J))); 5928 5928 5929 int allMaximal = 0; // Compute the zerodim reduction for only one indep set.5930 ideal re = 1; // No reduction is need, there are not redundant components.5931 list emptyList = list(); // Look for primes of any dimension, not only of max dimension.5929 int allMaximal = 0; // Compute the zerodim reduction for only one indep set. 5930 ideal re = 1; // No reduction is need, there are not redundant components. 5931 list emptyList = list(); // Look for primes of any dimension, not only of max dimension. 5932 5932 list result = radicalReduction(J, re, allMaximal, emptyList); 5933 5933 … … 7485 7485 // Output = primaryDec where primaryDec is the list of the minimal 7486 7486 // associated primes and the primary components corresponding to these primes. 7487 7488 7487 { 7489 7488 ideal P = 1; … … 7504 7503 // Debug 7505 7504 dbprint(printlevel - voice, "// We intersect the prime ideals obtained."); 7506 /*7507 for (k = 1; k <= size(pd); k++) {7508 P = intersect(P, pd[k]);7509 };7510 */7511 7505 P = intersect(P, pd[2]); 7512 7506 // Debug 7513 7507 dbprint(printlevel - voice, "// Intersection finished."); 7514 7508 } else { 7515 stop = 1 7509 stop = 1; 7516 7510 } 7517 7511 } 7512 7518 7513 // Returns only the primary components, not the radical. 7519 7514 return(primaryDec); 7520 } ;7515 } 7521 7516 7522 7517 /////////////////////////////////////////////////////////////////////////////// … … 7996 7991 else 7997 7992 { 7998 7999 7993 lres1=psi(@lh); 8000 7994 lres0=psi1(lres1);
Note: See TracChangeset
for help on using the changeset viewer.