Changeset a1bbf6 in git
- Timestamp:
- Mar 31, 2015, 10:47:36 AM (8 years ago)
- Branches:
- (u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')
- Children:
- 2851932a1bfd822c8a77ba701ab4061fda4db650
- Parents:
- f6cd60bc278fb9a300668ad9a5c51e492c8b6409320644e83870d617264b4e83eea678323a62d15a
- Files:
-
- 4 added
- 4 deleted
- 4 edited
- 3 moved
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/nfmodstd.lib
rf6cd60 ra1bbf6 1 1 //////////////////////////////////////////////////////////////////////////////// 2 version="version algemodstd.lib 4.0.1.0 Sep_2014 "; // $Id$2 version="version nfmodstd.lib 4.0.1.0 Sep_2014 "; // $Id$ 3 3 category="Commutative Algebra"; 4 4 info=" 5 5 6 LIBRARY: algemodstd.lib Groebner bases of ideals in polynomial rings6 LIBRARY: nfmodstd.lib Groebner bases of ideals in polynomial rings 7 7 over algebraic number fields 8 8 AUTHORS: D.K. Boku boku@mathematik.uni-kl.de … … 33 33 PROCEDURES: 34 34 chinrempoly(l,m); chinese remaindering for polynomials 35 algemodStd(I); standard basis of I over algebraic number field using modular methods35 nfmodStd(I); standard basis of I over algebraic number field using modular methods 36 36 "; 37 37 … … 443 443 intvec opt = option(get); 444 444 option(redSB); 445 I = modular(" Algemodstd::LiftPolyCRT", list(I), PrimeTestTask, Modstd::deleteUnluckyPrimes_std,445 I = modular("Nfmodstd::LiftPolyCRT", list(I), PrimeTestTask, Modstd::deleteUnluckyPrimes_std, 446 446 PtestStd, Modstd::finalTest_std,536870909); 447 447 attrib(I, "isSB", 1); … … 452 452 //////////////////////////////////////////////////////////////////////////////// 453 453 /* main procedure */ 454 proc algemodStd(ideal I, list #)455 "USAGE: algemodStd(I, #); I ideal, # optional parameters454 proc nfmodStd(ideal I, list #) 455 "USAGE: nfmodStd(I, #); I ideal, # optional parameters 456 456 RETURN: standard basis of I over algebraic number field 457 457 NOTE: The procedure passes to @ref{modStd} if the ground field has no … … 459 459 are directly passed to @ref{modStd}. 460 460 SEE ALSO: modStd 461 EXAMPLE: example algemodStd; shows an example461 EXAMPLE: example nfmodStd; shows an example 462 462 " 463 463 { … … 512 512 minpoly =a^2+1; 513 513 ideal k=(a/2+1)*x^2+2/3y, 3*x-a*y+ a/7+2; 514 ideal I= algemodStd(k);514 ideal I=nfmodStd(k); 515 515 I; 516 516 ring r2 =(0,a),(x,y,z),dp; 517 517 minpoly =a^3 +2; 518 518 ideal k=(a^2+a/2)*x^2+(a^2 -2/3*a)*yz, (3*a^2+1)*zx-(a+4/7)*y+ a+2/5; 519 ideal IJ= algemodStd(k);519 ideal IJ=nfmodStd(k); 520 520 IJ; 521 521 ring r3=0,(x,y),dp;// ring without parameter 522 522 ideal I = x2 + y, xy - 7y + 2x; 523 I= algemodStd(I);523 I=nfmodStd(I); 524 524 I; 525 525 } -
Tst/Long/nfmodstd_l.tst
rf6cd60 ra1bbf6 1 1 LIB "tst.lib"; 2 LIB " algemodstd.lib";2 LIB "nfmodstd.lib"; 3 3 tst_init(); 4 proc tst_test_ algemodstd(ideal I)4 proc tst_test_nfmodstd(ideal I) 5 5 { 6 ideal Jtst = algemodStd(I);6 ideal Jtst = nfmodStd(I); 7 7 Jtst; 8 8 } … … 16 16 -x*w^7+y*w^7]; 17 17 18 tst_test_ algemodstd(HJa);18 tst_test_nfmodstd(HJa); 19 19 kill r; 20 20 ring r=(0,a),(x,y,z,w,u,v,n),dp; … … 24 24 8*x^3+(12*a+a^2)*y^3 +x*z^2+3, 25 25 (7*a^2-a)*x^2*y^4+18*y^3*z^2+y^3*z^3]; 26 tst_test_ algemodstd(I1);26 tst_test_nfmodstd(I1); 27 27 28 28 ideal HUa = [a*x+(a-1)*y+(a+2)*w+u,x*y+(a-1)*y*z+z*w + (a+2)*x*w+a*w*u, 29 29 a*x*y*z+(a+5)*y*z*w+a*x*y*u+(a+2)*x*w*u+a*z*w*u,(a-11)*x*y*z*w+(a+5)*x*y*z*u+a*x*y*w*u + 30 30 a*x*z*w*u+a*y*z*w*u,(a + 3)*x*y*z*w*u -(a+23)*v^5]; 31 tst_test_ algemodstd(HUa);31 tst_test_nfmodstd(HUa); 32 32 kill r; 33 33 ring r=(0,a),(x,y,z,w,u,v,n),dp; … … 36 36 + (a+1)*z*w*u+x*y*v+x*u*v+w*u*v,(a-1)*x*y*z*w + y*z*w*u +x*y*z*v +x*y*u*v+ x*w*u*v+ z*w*u*v, 37 37 x*y*z*w*u+(a+1)*x*y*z*w*v+x*y*z*u*v+x*y*w*u*v+x*z*w*u*v+y*z*w*u*v,x*y*z*w*u*v-a+2]; 38 tst_test_ algemodstd(I6a);38 tst_test_nfmodstd(I6a); 39 39 kill r; 40 40 ring r=(0,a),(x,y,z,w,u,v,n),dp; … … 43 43 2*w*y^3-10*y^2 - 10*w*y,(w^2-a^2+2*a)*x + 11*w*y*z-2*z, (-z^2 + 4*w^2+a^2+2)*x*z 44 44 + (4*w*z^2 + 2*w^3-10*w)*y + 4*z^2-10*w^2 + a^2+a]; 45 tst_test_ algemodstd(I);45 tst_test_nfmodstd(I); 46 46 ideal I1= [(2*w*y-(2*a+3)*z^2)*x-z*y^2-z^2*x, 47 47 2*z*x^2*w + (4*w*y + 5*z^2)*x^2 + (4*z*y^2 + 4*z^2*w)*x + 2*w*y^3-10*x^2*y^2 - 10*x*w*y*z, 48 48 (w^2-(a^2+a)*y*z)*x + 11*w*y*z-2*z^3, 49 49 (-z^2 + 4*w^2 + (a^2+2)*y^2)*x*z + (4*w*z^2 + 2*w^3-10*w^3)*y + 4*z^2*x*y-10*w^2*x*z + (a^2+2)*y^3*w]; 50 tst_test_ algemodstd(I1);50 tst_test_nfmodstd(I1); 51 51 kill r; 52 52 ring r=(0,a),(x,y,z,w,u),dp; … … 55 55 (a + 2)*x*w + a*w*u,a*x*y*z + (a + 5)*y*z*w + a*x*y*u + (a+2)*x*w*u + a*z*w*u, 56 56 (a-11)*x*y*z*w + (a + 5)*x*y*z*u + a*x*y*w*u + a*x*z*w*u + a*y*z*w*u,(a + 3)*x*y*z*w*u + a+23]; 57 tst_test_ algemodstd(Ua);57 tst_test_nfmodstd(Ua); 58 58 kill r; 59 59 -
Tst/Long/ok_l2.lst
rf6cd60 ra1bbf6 1 algemodstd_l1 nfmodstd_l 2 2 bug_tr642 3 3 bug_tr677 -
Tst/Short.lst
rf6cd60 ra1bbf6 2 2 Short/alexpoly.tst 3 3 Short/algebralib.tst 4 Short/ algemodstd_s4 Short/nfmodstd_s 5 5 Short/allres_s.tst 6 6 Short/arcAtPoint.tst -
Tst/Short/nfmodstd_s.tst
rf6cd60 ra1bbf6 1 1 LIB "tst.lib"; 2 LIB " algemodstd.lib";2 LIB "nfmodstd.lib"; 3 3 tst_init(); 4 4 5 proc tst_test_ algemodstd(ideal I)5 proc tst_test_nfmodstd(ideal I) 6 6 { 7 ideal Jtst = algemodStd(I);7 ideal Jtst = nfmodStd(I); 8 8 Jtst; 9 9 } … … 15 15 8*x^3+(12+a)*y^3+x*z^2+3, 16 16 (7-a)*x^2*y^4+18*y^3*z^2+y^3*z^3]; 17 tst_test_ algemodstd(HIa);17 tst_test_nfmodstd(HIa); 18 18 ideal HJa=[(2*a+3)*x*y^4*z^2 + (a+2)*x^2*y^3*z*w-x^2*y^3*z*w + 2*x*y*z^2*w^3 + (7*a-1)*y^3*w^4, 19 19 2*x^2*y^4*z + x^2*y*z^2*w^2-a*x*y^2*z^2*w^2 + (a+11)*x^2*y*z*w^3 -12*x*w^6 + 12*y*w^6, … … 22 22 -x*w^7+y*w^7]; 23 23 24 tst_test_ algemodstd(HJa);24 tst_test_nfmodstd(HJa); 25 25 ideal HBa =[x+(a/2147483647)*x*y+(a/2147483646)*y*z, 26 26 x^2*z + (a/2147483647)*y^3 + (a+1)*y*z^2, 27 27 (2*a*x)/3-(7*a*y)/23 + (9*z)/7]; 28 28 29 tst_test_ algemodstd(HBa);29 tst_test_nfmodstd(HBa); 30 30 kill r; 31 31 ring r=(0,a),(x,y,z,w,u),dp; … … 34 34 (a+3)*x*y^2*z^2 + (a+1)*x^5 + (a-11)*y^2*z^2, 35 35 (a+2)*x*y*z + (a+7)*x^3 + 12*y^3 + 1,3*x^3 +(a- 4)*y^3 + y*z^2]; 36 tst_test_ algemodstd(ka);36 tst_test_nfmodstd(ka); 37 37 38 38 ideal Hka=[(a+5)*x^3*y^2*z + (a-3)*y^3*x^2*z + (a+7)*x*y^2*z^2, … … 40 40 4*x*y*z + (a+7)*x^3 + 12*y^3 + a*z^3, 41 41 3*x^3 +(a- 4)*y^3 + y*z^2]; 42 tst_test_ algemodstd(Hka);42 tst_test_nfmodstd(Hka); 43 43 44 44 ideal Ua = [a*x + (a-1)*y + z + (a+2)*w + u,x*y + (a-1)*y*z + z*w + 45 45 (a + 2)*x*w + a*w*u,a*x*y*z + (a + 5)*y*z*w + a*x*y*u + (a+2)*x*w*u + a*z*w*u, 46 46 (a-11)*x*y*z*w + (a + 5)*x*y*z*u + a*x*y*w*u + a*x*z*w*u + a*y*z*w*u,(a + 3)*x*y*z*w*u + a+23]; 47 tst_test_ algemodstd(Ua);47 tst_test_nfmodstd(Ua); 48 48 kill r; 49 49 -
libpolys/polys/nc/gb_hack.h
r320644 ra1bbf6 51 51 D(ideal sca_mora(const ideal, const ideal, const intvec *, const intvec *, kStrategy, const ring _currRing)) 52 52 53 D(poly k NF(ideal, ideal, poly, int, int, const ring _currRing))53 D(poly k_NF(ideal, ideal, poly, int, int, const ring _currRing)) 54 54 55 55 #endif // # ifdef PLURAL_INTERNAL_DECLARATIONS_GB_HACK
Note: See TracChangeset
for help on using the changeset viewer.