Difference between revisions of "ApCoCoA-1:DA.DiffAutoReduce"
From ApCoCoAWiki
Line 23: | Line 23: | ||
<type>polynomial</type> | <type>polynomial</type> | ||
</types> | </types> | ||
− | <see>DA.DiffTO</see> | + | |
− | <see>DA.DiffReduce</see> | + | <seealso> |
+ | <see>DA.DiffTO</see> | ||
+ | <see>DA.DiffReduce</see> | ||
+ | </seealso> | ||
<key>DiffAutoReduce</key> | <key>DiffAutoReduce</key> |
Revision as of 11:21, 24 April 2009
DA.DiffAutoReduce
Computes a reduced list of differential polynomials.
Syntax
DA.DiffAutoReduce(G:LIST):LIST
Description
DA.DiffAutoReduce computes for a given set G of differential polynomials a list of reduced differential polynomials H, s.t. every element of G reduces to zero wrt. H.
@param G A set of differential polynomials.
@return A list of reduced differential polynomials.
Example
Use Q[x[1..1,0..20]]; Use Q[x[1..1,0..20]], Ord(DA.DiffTO("Lex")); DA.DiffAutoReduce([x[1,2]^2+x[1,0]^2+3, x[1,1]+3x[1,0]]); ------------------------------- [x[1,1] + 3x[1,0], 82x[1,0]^2 + 3] -------------------------------
See also