[BACK]Return to bfct CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / lib

Diff for /OpenXM_contrib2/asir2000/lib/bfct between version 1.6 and 1.7

version 1.6, 2000/12/13 05:37:31 version 1.7, 2000/12/14 01:38:37
Line 45 
Line 45 
  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,   * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.   * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
  *   *
  * $OpenXM: OpenXM_contrib2/asir2000/lib/bfct,v 1.5 2000/12/11 02:00:42 noro Exp $   * $OpenXM: OpenXM_contrib2/asir2000/lib/bfct,v 1.6 2000/12/13 05:37:31 noro Exp $
 */  */
 /* requires 'primdec' */  /* requires 'primdec' */
   
Line 77  def ann(F)
Line 77  def ann(F)
         return G4;          return G4;
 }  }
   
 def indicial1(F)  def indicial1(F,V)
 {  {
         V = vars(F);          V = vars(F);
         W = append([y1,t],V);          W = append([y1,t],V);
Line 90  def indicial1(F)
Line 90  def indicial1(F)
                 B = cons(DV[I]+y1*diff(F,V[I])*dt,B);                  B = cons(DV[I]+y1*diff(F,V[I])*dt,B);
         }          }
         dp_nelim(1);          dp_nelim(1);
         G0 = dp_weyl_gr_main(B,append(W,DW),0,0,6);          /* we use homogenization (heuristically determined) */
           G0 = dp_weyl_gr_main(B,append(W,DW),1,0,6);
         G1 = map(subst,G0,y1,1);          G1 = map(subst,G0,y1,1);
         Mat = newmat(2,2,[[-1,1],[0,1]]);          Mat = newmat(2,2,[[-1,1],[0,1]]);
         G2 = map(psi,G1,t,dt);          G2 = map(psi,G1,t,dt);
Line 140  def compare_first(A,B)
Line 141  def compare_first(A,B)
   
 def bfct(F)  def bfct(F)
 {  {
         G4 = indicial1(F);  
         V = vars(F);          V = vars(F);
         N = length(V);          N = length(V);
         D = newvect(N);          D = newvect(N);
   
         for ( I = 0; I < N; I++ )          for ( I = 0; I < N; I++ )
                 D[I] = [deg(F,V[I]),V[I]];                  D[I] = [deg(F,V[I]),V[I]];
         qsort(D,compare_first);          qsort(D,compare_first);
Line 152  def bfct(F)
Line 153  def bfct(F)
         for ( I = N-1, DV = []; I >= 0; I-- )          for ( I = N-1, DV = []; I >= 0; I-- )
                 DV = cons(strtov("d"+rtostr(V[I])),DV);                  DV = cons(strtov("d"+rtostr(V[I])),DV);
         V1 = cons(s,V); DV1 = cons(ds,DV);          V1 = cons(s,V); DV1 = cons(ds,DV);
         G0 = dp_weyl_gr_main(G4,append(V1,DV1),0,1,0);  
         Minipoly = weyl_minipoly(G0,append(V1,DV1),0,s);          G0 = indicial1(F,reverse(V));
           G1 = dp_weyl_gr_main(G0,append(V1,DV1),0,1,0);
           Minipoly = weyl_minipoly(G1,append(V1,DV1),0,s);
         return Minipoly;          return Minipoly;
 }  }
   
Line 291  def weyl_nf_mod(B,G,PS,Mod)
Line 294  def weyl_nf_mod(B,G,PS,Mod)
   
 def weyl_hen_ttob(T,NF,LHS,V,MOD)  def weyl_hen_ttob(T,NF,LHS,V,MOD)
 {  {
         if ( length(T) == 1 )  
                 return car(T);  
         T0 = time()[0]; M = etom(weyl_leq_nf(T,NF,LHS,V)); TE = time()[0] - T0;          T0 = time()[0]; M = etom(weyl_leq_nf(T,NF,LHS,V)); TE = time()[0] - T0;
         T0 = time()[0]; U = henleq(M,MOD); TH = time()[0] - T0;          T0 = time()[0]; U = henleq(M,MOD); TH = time()[0] - T0;
         if ( dp_gr_print() ) {          if ( dp_gr_print() ) {
Legend:
Removed from v.1.6  
changed lines
  Added in v.1.7
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>