Difference between revisions of "ApCoCoA-1:Weyl.WRedGB"

From ApCoCoAWiki
m
m (insert version info)
 
(4 intermediate revisions by 3 users not shown)
Line 1: Line 1:
   <command>
+
   {{Version|1}}
 +
<command>
 
     <title>Weyl.WRedGB</title>
 
     <title>Weyl.WRedGB</title>
 
     <short_description>Computes reduced Groebner basis of a D-ideal in Weyl algebra <tt>A_n</tt>.</short_description>
 
     <short_description>Computes reduced Groebner basis of a D-ideal in Weyl algebra <tt>A_n</tt>.</short_description>
Line 6: Line 7:
 
</syntax>
 
</syntax>
 
     <description>
 
     <description>
This function converts Groebner basis <tt>GB</tt> computed by ApCoCoAServer into the reduced Groebner Basis. If <tt>GB</tt> is not a Groebner basis then the output will not be the reduced Groebner basis. In fact, this function reduces a list <tt>GB</tt> of Weyl polynomials using <ref>Weyl.WNR</ref> into a new list <tt>L</tt> such that <tt>Ideal(L) = Ideal(GB)</tt>.
+
This function converts Groebner basis <tt>GB</tt> computed by ApCoCoAServer into the reduced Groebner Basis. If <tt>GB</tt> is not a Groebner basis then the output will not be the reduced Groebner basis. In fact, this function reduces a list <tt>GB</tt> of Weyl polynomials using <ref>ApCoCoA-1:Weyl.WNR|Weyl.WNR</ref> into a new list <tt>L</tt> such that <tt>Ideal(L) = Ideal(GB)</tt>.
 
<par/>
 
<par/>
<em>Note:</em> This function is faster than <ref>Weyl.WRGB</ref> for a list <tt>GB</tt> of large size.
+
<em>Note:</em> This function is faster than <ref>ApCoCoA-1:Weyl.WRGB|Weyl.WRGB</ref> for a list <tt>GB</tt> of large size.
 
<itemize>
 
<itemize>
 
<item>@param <em>GB</em> Groebner Basis of an ideal in the Weyl algebra.</item>
 
<item>@param <em>GB</em> Groebner Basis of an ideal in the Weyl algebra.</item>
Line 20: Line 21:
 
Weyl.WRedGB(L);
 
Weyl.WRedGB(L);
 
[1]
 
[1]
 +
-------------------------------
 +
-- Done.
 +
-------------------------------
 +
</example>
 +
<example>
 +
A2::=ZZ/(7)[x[1..2],y[1..2]]; -- define appropriate ring
 +
Use A2;
 +
I:=Ideal(2x[1]^14y[1]^7,x[1]^2y[1]^3+x[1]^2-1,y[2]^7-1,x[2]^3y[2]^2-x[2]y[2]-3x[2]-1);
 +
GbI:=Weyl.WGB(I,0);Len(GbI);
 +
 +
-------------------------------
 +
-- CoCoAServer: computing Cpu Time = 0.485
 +
-------------------------------
 +
42  -- size of complete GB of the ideal I
 +
-------------------------------
 +
Time GbI:=Weyl.WRedGB(GbI);
 +
 +
Cpu time = 10.89, User time = 11
 +
-------------------------------
 +
11  -- GbI is now reduced Groebner Basis of the ideal I.
 +
-------------------------------
 +
-- Done.
 
-------------------------------
 
-------------------------------
 
</example>
 
</example>
 +
 
   </description>
 
   </description>
 
     <seealso>
 
     <seealso>
       <see>Weyl.WNormalForm</see>
+
       <see>ApCoCoA-1:Weyl.WNormalForm|Weyl.WNormalForm</see>
       <see>Weyl.WGB</see>
+
       <see>ApCoCoA-1:Weyl.WGB|Weyl.WGB</see>
       <see>Weyl.WRGB</see>
+
       <see>ApCoCoA-1:Weyl.WRGB|Weyl.WRGB</see>
       <see>Weyl.WRGBS</see>
+
       <see>ApCoCoA-1:Weyl.WRGBS|Weyl.WRGBS</see>
       <see>Introduction to Groebner Basis in CoCoA</see>
+
       <see>ApCoCoA-1:Introduction to Groebner Basis in CoCoA|Introduction to Groebner Basis in CoCoA</see>
       <see>Introduction to CoCoAServer</see>
+
       <see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see>
 
     </seealso>
 
     </seealso>
 
     <types>
 
     <types>
Line 37: Line 61:
 
     <key>weyl.wredgb</key>
 
     <key>weyl.wredgb</key>
 
     <key>wredgb</key>
 
     <key>wredgb</key>
     <wiki-category>Package_weyl</wiki-category>
+
     <wiki-category>ApCoCoA-1:Package_weyl</wiki-category>
 
   </command>
 
   </command>

Latest revision as of 10:40, 7 October 2020

This article is about a function from ApCoCoA-1.

Weyl.WRedGB

Computes reduced Groebner basis of a D-ideal in Weyl algebra A_n.

Syntax

Weyl.WRedGB(GB:LIST):LIST

Description

This function converts Groebner basis GB computed by ApCoCoAServer into the reduced Groebner Basis. If GB is not a Groebner basis then the output will not be the reduced Groebner basis. In fact, this function reduces a list GB of Weyl polynomials using Weyl.WNR into a new list L such that Ideal(L) = Ideal(GB).

Note: This function is faster than Weyl.WRGB for a list GB of large size.

  • @param GB Groebner Basis of an ideal in the Weyl algebra.

  • @result The reduced Groebner Basis of the given ideal.

Example

A1::=QQ[x,d];	--Define appropriate ring
Use A1;
L:=[x,d,1];
Weyl.WRedGB(L);
[1]
-------------------------------
-- Done.
-------------------------------

Example

A2::=ZZ/(7)[x[1..2],y[1..2]]; -- define appropriate ring
Use A2;
I:=Ideal(2x[1]^14y[1]^7,x[1]^2y[1]^3+x[1]^2-1,y[2]^7-1,x[2]^3y[2]^2-x[2]y[2]-3x[2]-1);
GbI:=Weyl.WGB(I,0);Len(GbI);

-------------------------------
-- CoCoAServer: computing Cpu Time = 0.485
-------------------------------
42   -- size of complete GB of the ideal I
-------------------------------
Time GbI:=Weyl.WRedGB(GbI);

Cpu time = 10.89, User time = 11
-------------------------------
11  -- GbI is now reduced Groebner Basis of the ideal I.
-------------------------------
-- Done.
-------------------------------


See also

Weyl.WNormalForm

Weyl.WGB

Weyl.WRGB

Weyl.WRGBS

Introduction to Groebner Basis in CoCoA

Introduction to CoCoAServer