科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期1997-7
