Abstract
We present an approach to computing the Darboux polynomials required in the Prelle-Singer algorithm which avoids algebraic extensions of the constant field, and describe a partial implementation in REDUCE in which the leading terms of the polynomials are obtained by a modified version of the method described by Christopher and Collins. Copyright © 1997 Academic Press Limited.
| Original language | English |
|---|---|
| Pages (from-to) | 31-43 |
| Journal | Journal of Symbolic Computation |
| Volume | 24 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jul 1997 |