Changeset 76d26c in git
- Timestamp:
- Oct 14, 2013, 6:45:42 PM (9 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 7476bc5b8ce22fb85faf9749e7e05b330e99f9c5
- Parents:
- 08fa62c9765eb4775a2b8570706325428bd1b390
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/derham.lib
r08fa62 r76d26c 725 725 annihilators we computed for L[i] ->this will ensure we can compute 726 726 the maps of the MV complex*/ 727 minroot= Derham::minIntRoot(findminintroot);727 minroot=minIntRootD(findminintroot); 728 728 for (j=1; j<=i; j++) 729 729 { … … 811 811 s-parametric annihilators we computed for L[i] ->this will 812 812 ensure we can compute the maps of the MV complex*/ 813 minroot= Derham::minIntRoot(findminintroot);813 minroot=minIntRootD(findminintroot); 814 814 for (j=1; j<=i; j++) 815 815 { … … 4230 4230 for (i=1; i<=size(G4); i++) 4231 4231 { 4232 minmax[i]= Derham::minIntRoot(G4[i],1);4232 minmax[i]=minIntRootD(G4[i],1); 4233 4233 if (size(minmax[i])!=0) 4234 4234 { … … 5531 5531 //////////////////////////////////////////////////////////////////////////////////// 5532 5532 5533 static proc minIntRoot (list L,list #)5534 "USAGE:minIntRoot (L [,M]); L list, M optinonal list5533 static proc minIntRootD(list L,list #) 5534 "USAGE:minIntRootD(L [,M]); L list, M optinonal list 5535 5535 ASSUME:L a list of univariate polynomials with rational coefficients @* 5536 5536 the variable of the polynomial is s if size(#)==0 (needed for proc
Note: See TracChangeset
for help on using the changeset viewer.