A Rational Approach to the Prelle–Singer Algorithm

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.