Changeset 054075 in git
 Timestamp:
 Jul 1, 2005, 12:32:24 PM (19 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b52fc4b2495505785981d640dcf7eb3e456778ef')
 Children:
 8de0cee385a202e9f07ff4632113ccb3c0bff430
 Parents:
 8d5c5fe2a46548f5bfe950d7cdc98a3b7546996c
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/lejeune.lib
r8d5c5fe r054075 1 1 2 2 //* mode:C++;* 3 // $Id: lejeune.lib,v 1.1 4 20050701 09:36:55cremer Exp $3 // $Id: lejeune.lib,v 1.15 20050701 10:32:24 cremer Exp $ 4 4 5 5 … … 90 90 setring R; 91 91 def resultf_set=resultdiff; 92 //resultf_set;~;93 92 export(resultf_set); 94 93 return(R); … … 132 131 resultdiff=simplify(resultdiff,2); 133 132 export(resultdiff); // exports the result 134 resultdiff;~;135 133 return(R); // return the ring 136 134 } … … 210 208 proc a_z (int n) // returns nth letter of the alphabet 211 209 { 212 if(1>n>26) // input admissible?210 if(1>n>26) // input admissible? 213 211 { 214 212 "n must range between 1 and 26!"; … … 225 223 226 224 225 227 226 proc g_set (poly f,intvec H) // puts together the single steps from 228 { // f_setstep227 { // g_setstep 229 228 def r=basering; 230 229 int startvar=nvars(basering); … … 235 234 setring R; 236 235 ideal J,I; 237 for(i=2;i< =b;i++)236 for(i=2;i<b;i++) // the steps equal to F 238 237 { 239 238 setring r; 240 def tmp= g_setstep(f,intvec(H[1..i]));239 def tmp=f_setstep(f,intvec(H[1..i])); 241 240 setring R; 242 I=imap(tmp, resultg_set);241 I=imap(tmp,resultf_set); 243 242 kill tmp; 244 243 J=J,I; 245 244 } 245 setring r; // last step, special for G 246 def tmp=g_setstep(f,H);; 247 setring R; 248 I=imap(tmp,resultg_set); 249 kill tmp; 250 J=J,I; 251 246 252 J=simplify(J,4); 247 253 J=simplify(J,2); … … 257 263 258 264 259 proc g_setstep (poly f,intvec H) // returns the conditions for onestep265 proc g_setstep (poly f,intvec H) // returns the conditions for the last step 260 266 { 261 267 int p; // loop variable … … 276 282 } 277 283 } 278 def R=g_formaldiff(f,b1,c,H[b]); // actual step284 def R=g_formaldiff(f,b1,c,H[b]); // actual computations 279 285 setring R; 280 286 def resultg_set=g_resultdiff; 281 287 export(resultg_set); 282 288 return(R); 283 } 284 285 289 } 286 290 287 291 … … 298 302 299 303 proc g_formaldiff (poly f,int i,int a,int k) 300 { "k=";k;~;304 { 301 305 int s,t,v; // loop variables 302 306 int u; … … 310 314 ideal m2,J,g_resultdiff; 311 315 for(v=1;v<=k;v++) // consider the different tcoeff. 312 { "v=";v;~;316 { 313 317 fkv=coe[a+v,1]; 314 m=fkv; "m=";m;~; 315 if(v<k) 316 { 317 J=fkv; 318 } 319 for(s=1;s<=kv;s++) 320 { "s=";s;~; 321 m1=m1^s;"m1=";m1;~; 318 m=fkv; 319 J=fkv; 320 for(s=1;s<=kv+1;s++) // remark: "s<=kv+1" special!for G!!! 321 { 322 m1=m1^s; 322 323 u=size(m1); 323 324 for(t=1;t<=u;t++) 324 325 { 325 326 m2=contract(m1[t],m); // actual differentiation 326 J=J,m2; m2;~;327 J=J,m2; 327 328 } 328 329 } … … 330 331 } 331 332 g_resultdiff=simplify(g_resultdiff,2); 332 //g_resultdiff;~;333 333 export(g_resultdiff); // exports the result 334 return(R); // return the ring334 return(R); // return the ring 335 335 } 336 336 … … 361 361 362 362 363 proc order (poly f) 363 proc order (poly f) // gives first elem. of Nash series 364 364 { 365 365 poly g=homog(f,var(1));
Note: See TracChangeset
for help on using the changeset viewer.