A rational approach to the Prelle-Singer algorithm

Yiu Kwong MAN; Malcolm A. H. MACCALLUM

doi:10.1006/jsco.1997.0111

A rational approach to the Prelle-Singer algorithm

Yiu Kwong MAN
, Malcolm A. H. MACCALLUM

Department of Mathematics and Information Technology (MIT)

Research output: Contribution to journal › Articles › peer-review

29 Citations (Scopus)

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	https://doi.org/10.1006/jsco.1997.0111
Publication status	Published - Jul 1997

Access to Document

10.1006/jsco.1997.0111Licence: Other

Other files and links

@article{7c30e34ed4924a4aae4b83333876c56e,

title = "A rational approach to the Prelle-Singer algorithm",

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 {\textcopyright} 1997 Academic Press Limited.",

author = "MAN, \{Yiu Kwong\} and MACCALLUM, \{Malcolm A. H.\}",

year = "1997",

month = jul,

doi = "10.1006/jsco.1997.0111",

language = "English",

volume = "24",

pages = "31--43",

journal = "Journal of Symbolic Computation",

issn = "0747-7171",

publisher = "Academic Press",

number = "1",

}

TY - JOUR

T1 - A rational approach to the Prelle-Singer algorithm

AU - MAN, Yiu Kwong

AU - MACCALLUM, Malcolm A. H.

PY - 1997/7

Y1 - 1997/7

N2 - 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.

AB - 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.

UR - https://doi.org/10.1006/jsco.1997.0111

UR - https://www.scopus.com/pages/publications/0031185297

U2 - 10.1006/jsco.1997.0111

DO - 10.1006/jsco.1997.0111

M3 - Articles

SN - 0747-7171

VL - 24

SP - 31

EP - 43

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

IS - 1

ER -

A rational approach to the Prelle-Singer algorithm

Abstract

Access to Document

Other files and links

Fingerprint