Changeset 662ece in git
 Timestamp:
 Feb 22, 2013, 11:21:00 AM (11 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b21a664aa22dc6e196223af8a74ad4885e83547c')
 Children:
 e070751c183f5cec7c3ec5339a0b53ff93302566
 Parents:
 a77d2792a2d6c14b59535b46c2dee9aba649b9b0
 gitauthor:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20130222 11:21:00+01:00
 gitcommitter:
 Oleksandr Motsak <motsak@mathematik.unikl.de>20130222 11:24:00+01:00
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/derham.lib
ra77d27 r662ece 499 499 annihilators we computed for L[i] >this will ensure we can compute 500 500 the maps of the MV complex*/ 501 minroot=minIntRoot (findminintroot);501 minroot=minIntRoot0(findminintroot); 502 502 for (j=1; j<=i; j++) 503 503 { … … 583 583 sparametric annihilators we computed for L[i] >this will 584 584 ensure we can compute the maps of the MV complex*/ 585 minroot=minIntRoot (findminintroot);585 minroot=minIntRoot0(findminintroot); 586 586 for (j=1; j<=i; j++) 587 587 { … … 3420 3420 for (i=1; i<=size(G4); i++) 3421 3421 { 3422 minmax[i]=minIntRoot (G4[i],1);3422 minmax[i]=minIntRoot0(G4[i],1); 3423 3423 if (size(minmax[i])!=0) 3424 3424 { … … 4296 4296 //////////////////////////////////////////////////////////////////////////////////// 4297 4297 4298 static proc minIntRoot (list L,list #)4299 "USAGE:minIntRoot (L [,M]); L list, M optinonal list4298 static proc minIntRoot0(list L,list #) 4299 "USAGE:minIntRoot0(L [,M]); L list, M optinonal list 4300 4300 ASSUME:L a list of univariate polynomials with rational coefficients @* 4301 4301 the variable of the polynomial is s if size(#)==0 (needed for proc 
Tst/Plural.lst
ra77d27 r662ece 41 41 ; Plural/ucha2.tst 42 42 Plural/ucha4.tst 43 Plural/derham.tst 43 ;;; Plural/derham.tst ;; too long for now
Note: See TracChangeset
for help on using the changeset viewer.