Changeset bd0aeb in git
 Timestamp:
 Jun 23, 2005, 3:52:12 PM (19 years ago)
 Branches:
 (u'fiekerDuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '648d28f488f6ff08f5607ff229b9ad9e4a5b93c2')
 Children:
 a868907fc6dd9b59a0d27bd87056410c92a84223
 Parents:
 e7ff6bef3e40732ca87472519b69d1fc7a29d922
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

Singular/LIB/lejeune.lib
re7ff6b rbd0aeb 1 1 2 2 //* mode:C++;* 3 // $Id: lejeune.lib,v 1.4 20050623 13:40:16 cremer Exp $ 3 // $Id: lejeune.lib,v 1.5 20050623 13:52:12 cremer Exp $ 4 4 5 5 6 info=" … … 14 15 ringchange(i); changes the ring to the one needed in ith step 15 16 plugin_coeffs(i,f) plugs tpolys into f, up to power i 16 maxidealstep(i,N); returns ideal needed for contraction in ith step ;17 maxidealstep(i,N); returns ideal needed for contraction in ith step 17 18 N is number of variables of input f 18 19 formaldiff(f,k); computes the formal derivatives D_I with I<k … … 55 56 resultdiff=resultdiff,J; 56 57 } 57 resultdiff;~ 58 export(resultdiff); 59 return(R); 58 export(resultdiff); // exports the result 59 return(R); // return the ring 60 60 61 61 } … … 66 66 { 67 67 def r=basering; 68 def R=ringchange(i); 69 setring R; 68 def R=ringchange(i); // changes the ring 69 setring R; // makes it new basering; 70 70 ideal I=tpolys(i,startvar); 71 poly g=imap(r,f); 72 export(g); 73 map h=r,I; 74 ideal J=h(f); 75 export(h); 76 matrix result=coeffs(J[1],t); 77 export result; 78 return(R); 71 poly g=imap(r,f); // maps f to new basering 72 export(g); // export it 73 map h=r,I; // define map according to our purpose 74 ideal J=h(f); // gives f with power series plugged in 75 export(h); 76 matrix result=coeffs(J[1],t); // gives the tcoefficients 77 export result; // export it i.o. to use it later on 78 return(R); // return ring (ring change!) 79 79 } 80 80 … … 84 84 { 85 85 int startvar=nvars(basering); 86 export(startvar); 86 export(startvar); 87 87 string str=variables(startvar,i); 88 def R=changevar(""+varstr(r)+",t,"+variables(startvar,i)+""); 89 return(R); 88 def R=changevar(""+varstr(r)+",t,"+variables(startvar,i)+""); // change 89 return(R); // return the ring, needed in future proc 90 90 } 91 91 … … 101 101 for (s=1;s<=i;s++) 102 102 { 103 str=""+a_z(u)+"("+string(s)+")"; 104 l[(u1)*i+s]=str; 103 str=""+a_z(u)+"("+string(s)+")"; // creates new variables 104 l[(u1)*i+s]=str; // saves them in a list 105 105 } 106 106 } 107 107 //l=insert(l,"t"); 108 string str1=string(l); 109 return(str1); 108 string str1=string(l); // makes the list into a string, 109 return(str1); // (needed for ring change) 110 110 } 111 111 112 112 113 proc a_z (int n) // returns nth letter of the alphabet113 proc a_z (int n) // returns nth letter of the alphabet 114 114 { 115 115 if((n<1)(n>26)) // input admissible? … … 127 127 proc tpolys (int i,int k) // constructs polynomials a(1)*t+... 128 128 { // has to be called from tpolys 129 int s,t; 129 int s,t; // loop variables 130 130 int v; 131 131 poly sum; … … 147 147 148 148 149 proc maxidealstep (int i,int N) 150 { 149 proc maxidealstep (int i,int N) // returns ideal needed for 150 { // differentiation in ith step 151 151 ideal I=var(N+1+i); 152 152 int j;
Note: See TracChangeset
for help on using the changeset viewer.