Computing closed form solutions of first order ODEs using the prelle-singer procedure

Research output: Contribution to journalArticles

30 Citations (Scopus)

Abstract

The Prelle-Singer procedure is an important method for formal solution of first order ODEs. Two different REDUCE implementations (PSODE versions 1 & 2) of this procedure are presented in this paper. The aim is to investigate which implementation is more efficient in solving different types of ODEs (such as exact, linear, separable, linear in coefficients, homogeneous or Bernoulli equations). The test pool is based on Kamke's collection of first order and first degree ODEs. Experimental results, timings and comparison of efficiency and solvability with the present REDUCE differential equation solver (ODESOLVE) and a MACSYMA implementation (ODEFI) of the Prelle-Singer procedure are provided. Discussion of technical difficulties and some illustrative examples are also included. Copyright © 1993 Academic Press. All rights reserved.
Original languageEnglish
Pages (from-to)423-443
JournalJournal of Symbolic Computation
Volume16
Issue number5
DOIs
Publication statusPublished - Nov 1993

Citation

Man, Y. K. (1993). Computing closed form solutions of first order ODEs using the prelle-singer procedure. Journal of Symbolic Computation, 16(5), 423-443. doi: 10.1006/jsco.1993.1057

Fingerprint Dive into the research topics of 'Computing closed form solutions of first order ODEs using the prelle-singer procedure'. Together they form a unique fingerprint.