Changeset 38c165 in git
- Timestamp:
- May 12, 2000, 2:17:19 PM (23 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 06f16f99b85c345dd60a647c2025081e13cfa7c2
- Parents:
- fa1af627353fd9365bd5fdad189f015e30251a16
- Location:
- Singular/LIB
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/LIB/poly.lib
rfa1af6 r38c165 1 // $Id: poly.lib,v 1.2 5 2000-03-15 17:17:09 siebertExp $1 // $Id: poly.lib,v 1.26 2000-05-12 12:17:16 krueger Exp $ 2 2 //(GMG, last modified 22.06.96) 3 3 //(obachman: 17.12.97 -- added katsura) 4 4 /////////////////////////////////////////////////////////////////////////////// 5 5 6 version="$Id: poly.lib,v 1.2 5 2000-03-15 17:17:09 siebertExp $";6 version="$Id: poly.lib,v 1.26 2000-05-12 12:17:16 krueger Exp $"; 7 7 info=" 8 8 LIBRARY: poly.lib PROCEDURES FOR MANIPULATING POLYS, IDEALS, MODULES … … 580 580 degBound=0; 581 581 string mp=string(minpoly); 582 execute "ring R=("+charstr(br)+"),(x(1..n),z),dp;";583 execute "minpoly=number("+mp+");";582 execute("ring R=("+charstr(br)+"),(x(1..n),z),dp;"); 583 execute("minpoly=number("+mp+");"); 584 584 ideal irrel=x(1..n); 585 585 map f=br,irrel; -
Singular/LIB/presolve.lib
rfa1af6 r38c165 1 // $Id: presolve.lib,v 1.1 2 1999-09-21 17:32:17 Singular Exp $1 // $Id: presolve.lib,v 1.13 2000-05-12 12:17:17 krueger Exp $ 2 2 //(GMG) 3 3 /////////////////////////////////////////////////////////////////////////////// 4 4 5 version="$Id: presolve.lib,v 1.1 2 1999-09-21 17:32:17 Singular Exp $";5 version="$Id: presolve.lib,v 1.13 2000-05-12 12:17:17 krueger Exp $"; 6 6 info=" 7 7 LIBRARY: presolve.lib PROCEDURES FOR PRE-SOLVING POLYNOMIAL EQUATIONS … … 97 97 if( fi == 0 or find(ordstr(P),"a") != 0 ) 98 98 { 99 execute "ring newP = ("+charstr(P)+"),("+varstr(P)+"),dp;";99 execute("ring newP = ("+charstr(P)+"),("+varstr(P)+"),dp;"); 100 100 ideal i = imap(P,i); 101 101 } … … 251 251 if( ordstr(P) != "c,dp(n)" ) 252 252 { 253 execute "ring newP = ("+charstr(P)+"),("+varstr(P)+"),(c,dp);";253 execute("ring newP = ("+charstr(P)+"),("+varstr(P)+"),(c,dp);"); 254 254 ideal k1 = imap(P,k1); 255 255 ideal k2 = imap(P,k2); … … 363 363 if ( size(b) != 0 ) { b = b[1,size(b)-1]; } 364 364 else { a = a[1,size(a)-1]; } 365 execute "ring gnir ="+charstr(P)+",("+a+b+"),dp;";365 execute("ring gnir ="+charstr(P)+",("+a+b+"),dp;"); 366 366 ideal i = imap(P,i); 367 367 list L = elimpart(i,n,e)+list(n); … … 418 418 string newvar = string(L[4]); 419 419 L = L[1],p; 420 execute "ring r1=("+charstr(P)+"),("+newvar+"),"+"dp;";420 execute("ring r1=("+charstr(P)+"),("+newvar+"),"+"dp;"); 421 421 list L = imap(P,L); 422 422 //------------------- find "best" ordering of variables ---------------------- … … 444 444 { 445 445 intvec hi = hilbvec(L[1]); // Hilbert-series of i 446 execute "ring r2=("+charstr(P)+"),("+varstr(basering)+",@homo),dp;";446 execute("ring r2=("+charstr(P)+"),("+varstr(basering)+",@homo),dp;"); 447 447 list L = imap(r1,L); 448 448 L[1] = homog(L[1],@homo); // @homo = homogenizing var … … 532 532 if ( @s==0 ) 533 533 { 534 execute "ring "+@s1+"=("+charstr(@P)+"),("+varstr(@P)+"),("+@o+");";534 execute("ring "+@s1+"=("+charstr(@P)+"),("+varstr(@P)+"),("+@o+");"); 535 535 def @id = imap(@P,@id); 536 536 verbose(noredefine); … … 567 567 if ( @h != 0 ) 568 568 { 569 execute "ring @Q=("+charstr(@P)+"),("+varstr(@P)+",@homo),("+@o+");";569 execute("ring @Q=("+charstr(@P)+"),("+varstr(@P)+",@homo),("+@o+");"); 570 570 def @id = imap(@P,@id); 571 571 kill @P; … … 594 594 else { @o = @o[1,size(@o)-8] + @o[size(@o)-1,2]; } 595 595 } 596 execute "ring @P=("+charstr(@Q)+"),("+@va+"),("+@o+");";596 execute("ring @P=("+charstr(@Q)+"),("+@va+"),("+@o+");"); 597 597 def @id = imap(@Q,@id); 598 598 } … … 701 701 if ( size(#) == 2 ) { @c = #[1]; @o = #[2]; } 702 702 string @si = typeof(@id)+" @i = "+string(@id)+";"; //** weg 703 execute "ring @r=("+@c+"),("+varstr(basering)+"),("+@o+");";703 execute("ring @r=("+@c+"),("+varstr(basering)+"),("+@o+");"); 704 704 //**def i = imap(P,@id); 705 execute @si; //** weg705 execute(@si); //** weg 706 706 //show(basering); 707 707 @i = std(@i); … … 795 795 dbprint( pr,"","// variables which did not occur:",L[3] ); 796 796 797 execute "ring "+s1+"=("+charstr(P)+"),("+newvar+"),("+s2+");";797 execute("ring "+s1+"=("+charstr(P)+"),("+newvar+"),("+s2+");"); 798 798 def id = imap(P,id); 799 799 export(basering); … … 943 943 @o=@o[1..size(@o)-1]; 944 944 //------------------ create new ring and make objects global ----------------- 945 execute "ring "+@s1+"=("+charstr(@P)+"),("+@va+"),("+@o+");";945 execute("ring "+@s1+"=("+charstr(@P)+"),("+@va+"),("+@o+");"); 946 946 def @id = imap(@P,@id); 947 execute "def "+ @s2+"=@id;";947 execute("def "+ @s2+"=@id;"); 948 948 execute("export("+@s1+");"); 949 949 execute("export("+@s2+");"); -
Singular/LIB/ring.lib
rfa1af6 r38c165 1 // $Id: ring.lib,v 1.1 0 1999-07-07 16:38:27 obachmanExp $1 // $Id: ring.lib,v 1.11 2000-05-12 12:17:17 krueger Exp $ 2 2 //(GMG, last modified 03.11.95) 3 3 /////////////////////////////////////////////////////////////////////////////// 4 4 5 version="$Id: ring.lib,v 1.1 0 1999-07-07 16:38:27 obachmanExp $";5 version="$Id: ring.lib,v 1.11 2000-05-12 12:17:17 krueger Exp $"; 6 6 info=" 7 7 LIBRARY: ring.lib PROCEDURES FOR MANIPULATING RINGS AND MAPS … … 70 70 kill R,R1; 71 71 if(system("with","Namespaces")) { 72 kill Top::R,Top::R1; 72 if( nameof(Current) == "Ring" ) { 73 kill Top::R,Top::R1; 74 } else { 75 kill Ring::R,Ring::R1; 76 } 73 77 } 74 78 } … … 120 124 kill R,Q,Q'; 121 125 if(system("with","Namespaces")) { 122 kill Top::R,Top::Q'; 126 if( nameof(Current) == "Ring" ) { 127 kill Top::R,Top::Q'; 128 } else { 129 kill Ring::R,Ring::Q'; 130 } 123 131 } 124 132 } … … 181 189 kill R,Q,Q'; 182 190 if(system("with","Namespaces")) { 183 kill Top::R,Top::Q'; 191 if( nameof(Current) == "Ring" ) { 192 kill Top::R,Top::Q'; 193 } else { 194 kill Ring::R,Ring::Q'; 195 } 184 196 } 185 197 } … … 218 230 kill r,R; 219 231 if(system("with","Namespaces")) { 220 kill Top::r,Top::R; 232 if( nameof(Current) == "Ring" ) { 233 kill Top::r,Top::R; 234 } else { 235 kill Ring::r,Ring::R; 236 } 221 237 } 222 238 } … … 254 270 kill S5, S30; 255 271 if(system("with","Namespaces")) { 256 kill Top::S5,Top::S30; 272 if( nameof(Current) == "Ring" ) { 273 kill Top::S5,Top::S30; 274 } else { 275 kill Ring::S5,Ring::S30; 276 } 257 277 } 258 278 } … … 291 311 kill P5, P30; 292 312 if(system("with","Namespaces")) { 293 kill Top::P5,Top::P30; 313 if( nameof(Current) == "Ring" ) { 314 kill Top::P5,Top::P30; 315 } else { 316 kill Ring::P5,Ring::P30; 317 } 294 318 } 295 319 } … … 448 472 kill r,R1,R2,R3,R4; 449 473 if(system("with","Namespaces")) { 450 kill Top::R1,Top::R2,Top::R3,Top::R4; 474 if( nameof(Current) == "Ring" ) { 475 kill Top::R1,Top::R2,Top::R3,Top::R4; 476 } else { 477 kill Ring::R1,Ring::R2,Ring::R3,Ring::R4; 478 } 451 479 } 452 480 } … … 679 707 kill R,Q,S,T; 680 708 if(system("with","Namespaces")) { 681 kill Top::R,Top::Q,Top::S,Top::T; 682 } 683 } 684 /////////////////////////////////////////////////////////////////////////////// 709 if( nameof(Current) == "Ring" ) { 710 kill Top::R,Top::Q,Top::S,Top::T; 711 } else { 712 kill Ring::R,Ring::Q,Ring::S,Ring::T; 713 } 714 } 715 } 716 /////////////////////////////////////////////////////////////////////////////// -
Singular/LIB/solve.lib
rfa1af6 r38c165 1 1 /////////////////////////////////////////////////////////////////////////////// 2 2 3 version="$Id: solve.lib,v 1.1 4 1999-12-02 23:03:52 wenkExp $";3 version="$Id: solve.lib,v 1.15 2000-05-12 12:17:18 krueger Exp $"; 4 4 info=" 5 5 LIBRARY: solve.lib PROCEDURES TO SOLVE POLYNOMIAL SYSTEMS … … 565 565 string nrings= "ring "+orings+"C=(real,"+string(prec) 566 566 +",I),("+varstr(basering)+"),lp;"; 567 execute nrings;567 execute(nrings); 568 568 569 569 if ( pdebug>=0 ) … … 786 786 string nrings= "ring "+orings+"C=(real,"+string(prec) 787 787 +",I),("+varstr(basering)+"),lp;"; 788 execute nrings;788 execute(nrings); 789 789 790 790 if ( pdebug>=0 ) -
Singular/LIB/spcurve.lib
rfa1af6 r38c165 1 // $Id: spcurve.lib,v 1. 8 1999-07-21 10:10:36 Singular Exp $1 // $Id: spcurve.lib,v 1.9 2000-05-12 12:17:18 krueger Exp $ 2 2 // (anne, last modified 31.5.99) 3 3 ///////////////////////////////////////////////////////////////////////////// 4 4 5 version="$Id: spcurve.lib,v 1. 8 1999-07-21 10:10:36 Singular Exp $";5 version="$Id: spcurve.lib,v 1.9 2000-05-12 12:17:18 krueger Exp $"; 6 6 info=" 7 7 LIBRARY: spcurve.lib PROCEDURES FOR CM CODIMENSION 2 SINGULARITIES … … 817 817 } 818 818 string ringre=" ring r=" + charstr(rt) + ",(x,y,z), Ws(" + string(wl[1]) + ");"; 819 execute ringre;819 execute(ringre); 820 820 matrix M=imap(rt,M); 821 821 int ne=size(M); … … 874 874 + string(wl[1]) + ");"; 875 875 } 876 execute ringre;876 execute(ringre); 877 877 module temp=imap(r,t1qh); 878 878 ideal t1qh=mod2id(temp,iv); … … 1287 1287 // do the interreduction and convert back 1288 1288 //---------------------------------------------------------------------- 1289 execute tempstr;1289 execute(tempstr); 1290 1290 def motemp=imap(r,motemp); 1291 1291 motemp=interred(motemp); -
Singular/LIB/standard.lib
rfa1af6 r38c165 1 // $Id: standard.lib,v 1.4 7 1999-10-19 12:42:51 obachmanExp $1 // $Id: standard.lib,v 1.48 2000-05-12 12:17:18 krueger Exp $ 2 2 ////////////////////////////////////////////////////////////////////////////// 3 3 4 version="$Id: standard.lib,v 1.4 7 1999-10-19 12:42:51 obachmanExp $";4 version="$Id: standard.lib,v 1.48 2000-05-12 12:17:18 krueger Exp $"; 5 5 info=" 6 6 LIBRARY: standard.lib PROCEDURES WHICH ARE ALWAYS LOADED AT START-UP … … 46 46 } 47 47 else { os = #[1]; } 48 execute "ring sr=("+charstr(dr)+"),("+varstr(dr)+"),"+os+";";48 execute("ring sr=("+charstr(dr)+"),("+varstr(dr)+"),"+os+";"); 49 49 ideal i= fetch(dr,i); 50 50 intvec opt= option(get); … … 88 88 } 89 89 90 execute "ring S = ("+charstr(R)+"),("+varstr(R)+",@t),dp;";90 execute("ring S = ("+charstr(R)+"),("+varstr(R)+",@t),dp;"); 91 91 ideal i=homog(imap(R,i),@t); 92 92 intvec v=hilb(std(i),1); 93 execute "ring T = ("+charstr(R)+"),("+varstr(R)+",@t),("+ordstr(R)+");";93 execute("ring T = ("+charstr(R)+"),("+varstr(R)+",@t),("+ordstr(R)+");"); 94 94 ideal i=fetch(S,i); 95 95 ideal a=std(i,v); … … 770 770 "),("+varstr(basering)+",@t,@w),dp;"; 771 771 def @newP=basering; 772 execute s;772 execute(s); 773 773 module b=imap(@newP,b); 774 774 module a=imap(@newP,a); … … 793 793 "),("+varstr(basering)+",@t),dp;"; 794 794 def @newP=basering; 795 execute s;795 execute(s); 796 796 module b=imap(@newP,b); 797 797 module a=imap(@newP,a); … … 817 817 "),("+varstr(basering)+",@t),dp;"; 818 818 def @newP=basering; 819 execute s;819 execute(s); 820 820 module b=imap(@newP,b); 821 821 module a=imap(@newP,a); … … 835 835 { 836 836 def R=basering; 837 execute 838 ("+varstr(basering)+",@t),(C,dp);" ;837 execute("ring gnir = ("+charstr(basering)+"), 838 ("+varstr(basering)+",@t),(C,dp);"); 839 839 ideal i=var(nvars(basering))*imap(R,i)+(var(nvars(basering))-1)*imap(R,j); 840 840 ideal j=eliminate(i,var(nvars(basering))); -
Singular/LIB/tst.lib
rfa1af6 r38c165 1 // $Id: tst.lib,v 1.2 2 1999-11-23 14:20:48 obachmanExp $1 // $Id: tst.lib,v 1.23 2000-05-12 12:17:19 krueger Exp $ 2 2 //(obachman, last modified 6/30/98) 3 3 ///////////////////////////////////////////////////////////////////////////// 4 4 5 version="$Id: tst.lib,v 1.2 2 1999-11-23 14:20:48 obachmanExp $";5 version="$Id: tst.lib,v 1.23 2000-05-12 12:17:19 krueger Exp $"; 6 6 info=" 7 7 LIBRARY: tst.lib PROCEDURES FOR RUNNING AUTOMATIC TST TESTS … … 149 149 else 150 150 { 151 execute "int tst_int_timer = " + tst_timer[15,size(tst_timer)] + ";";151 execute("int tst_int_timer = " + tst_timer[15,size(tst_timer)] + ";"); 152 152 return (tst_int_timer); 153 153 }
Note: See TracChangeset
for help on using the changeset viewer.