# Difference between revisions of "ApCoCoA-1:DA.DiffAutoReduce"

From ApCoCoAWiki

(Description update.) |
|||

Line 12: | Line 12: | ||

</itemize> | </itemize> | ||

<example> | <example> | ||

− | Use | + | Use QQ[x[1..1,0..20]]; |

− | Use | + | Use QQ[x[1..1,0..20]], Ord(DA.DiffTO(<quotes>Lex</quotes>)); |

DA.DiffAutoReduce([x[1,2]^2+x[1,0]^2+3, x[1,1]+3x[1,0]]); | DA.DiffAutoReduce([x[1,2]^2+x[1,0]^2+3, x[1,1]+3x[1,0]]); | ||

------------------------------- | ------------------------------- |

## Revision as of 10:57, 28 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 QQ[x[1..1,0..20]]; Use QQ[x[1..1,0..20]], Ord(DA.DiffTO(<quotes>Lex</quotes>)); 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