Changeset 62e942 in git
 Timestamp:
 Jun 30, 2005, 4:03:37 PM (18 years ago)
 Branches:
 (u'jengelhdatetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
 Children:
 a04d1f9ce550211f34c7952ed8934d6634a90d99
 Parents:
 8cfae9e49d7d3f953224e84978f38bdc5d131bbd
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/lejeune.lib
r8cfae9 r62e942 1 1 2 2 //* mode:C++;* 3 // $Id: lejeune.lib,v 1.1 1 20050624 13:40:06cremer Exp $3 // $Id: lejeune.lib,v 1.12 20050630 14:03:37 cremer Exp $ 4 4 5 5 … … 36 36 { // f_setstep 37 37 def r=basering; 38 int startvar=nvars(basering); 39 export(startvar); 38 40 int b=size(H); 39 41 int i; … … 47 49 setring R; 48 50 I=imap(tmp, resultf_set); 51 I=simplify(I,2); 52 I=simplify(I,4); 53 I=idealsimplify(I); 54 I=idealsimplify(I);I;~; 49 55 kill tmp; 50 56 J=J,I; 51 52 } 53 J=simplify(J,2); 54 J=slimgb(radical(J)); 57 } 58 //J=idealsimplify(J);J;~; 59 //J=simplify(J,4); 60 //J=simplify(J,2); 61 //J=std(J); 55 62 J; 56 63 return(R); … … 59 66 60 67 61 proc f_setstep (poly f,intvec H) 68 proc f_setstep (poly f,intvec H) // returns the conditions for one step 62 69 { 63 70 int p; // loop variable 64 71 int m_0=order(f); 65 int startvar=nvars(basering);66 72 int b=size(H); 67 73 int c=sum(H,1..b1); … … 94 100 { 95 101 int s,t,v; // loop variables 96 int u; 102 int u; 97 103 def R=plugin_coeffs(f,i); // plugs the power series in... 98 104 setring R; // changes the ring … … 240 246 } 241 247 } 248 249 250 proc idealsimplify (ideal I) 251 { 252 int i,j; 253 int divisornumber=0; 254 int pos; 255 for(j=1;j<=ncols(I);j++) 256 { 257 for(i=1;i<=nvars(basering);i++) 258 { 259 if(modd(I[j],var(i))==0) 260 { 261 divisornumber++; 262 pos=i; 263 } 264 } 265 if(divisornumber==1) 266 { 267 I[j]=var(pos); 268 } 269 divisornumber=0; 270 } 271 return(I); 272 } 273 274 275 276 proc nonzerosize (intvec v) 277 { 278 int k=size(v); 279 int i; 280 int zaehler=0; 281 int sum=0; 282 for(i=1;i<=k;i++) 283 { 284 if(v[i]!=0) 285 { 286 zaehler++; 287 sum=sum+v[i]; 288 } 289 } 290 list l=zaehler,sum; 291 return(l); 292 } 293 294 295 296 proc modd (poly f, poly g) 297 { 298 poly result=f(f/g)*g; 299 return(result); 300 }
Note: See TracChangeset
for help on using the changeset viewer.