Difference between revisions of "ApCoCoA-1:DA.DiffReduce"

From ApCoCoAWiki
m (Bot: Category moved)
m (fixed links to namespace ApCoCoA)
Line 6: Line 6:
 
</syntax>
 
</syntax>
 
<description>
 
<description>
<ref>DA.DiffReduce</ref> computes the differential normal form of <tt>F</tt> wrt. the set of differential polynomials <tt>G</tt>.
+
<ref>ApCoCoA-1:DA.DiffReduce|DA.DiffReduce</ref> computes the differential normal form of <tt>F</tt> wrt. the set of differential polynomials <tt>G</tt>.
 
To this end, the elements of <tt>G</tt> are differentiated sufficiently often and the usual normal form is built.
 
To this end, the elements of <tt>G</tt> are differentiated sufficiently often and the usual normal form is built.
 
<itemize>
 
<itemize>
Line 25: Line 25:
 
<type>polynomial</type>
 
<type>polynomial</type>
 
</types>
 
</types>
<see>DA.DiffTO</see>
+
<see>ApCoCoA-1:DA.DiffTO|DA.DiffTO</see>
 
<key>DiffReduce</key>
 
<key>DiffReduce</key>
 
<key>DA.DiffReduce</key>
 
<key>DA.DiffReduce</key>

Revision as of 08:09, 7 October 2020

DA.DiffReduce

Computes a differential normal form of a differential polynomial wrt. a list of differential polynomials.

Syntax

DA.DiffReduce(F:POLY, G:LIST):POLY

Description

DA.DiffReduce computes the differential normal form of F wrt. the set of differential polynomials G.

To this end, the elements of G are differentiated sufficiently often and the usual normal form is built.

  • @param F Differential polynomial to compute the normal form of.

  • @param G List of differential polynomials to wrt. which the normal form of F is computed.

  • @return Normal form of F wrt. G.

Example

Use QQ[x[1..1,0..20]];
Use QQ[x[1..1,0..20]], Ord(DA.DiffTO(<quotes>Lex</quotes>));
DA.DiffReduce(x[1,2]^2+x[1,0]^2+3, [x[1,1]+3x[1,0]]);
-------------------------------
82x[1,0]^2 + 3
-------------------------------

DA.DiffTO