An ordinary differential equation solver for REDUCE

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Progress and plans for the implementation of an ordinary differential equation solver in REDUCE 3.3 are reported; the aim is to incorporate the best available methods for obtaining closed-form solutions, and to aim at the ‘best possible’ alternative when this fails. It is hoped that this will become a part of the standard REDUCE program library. Elementary capabilities have already been implemented (to the level of a first course for students), i.e methods for first order differential equations of simple types (separable, ‘homogeneous’, ‘reducible to homogeneous’, linear, exact and Bernoulli) and linear equations of any order with constant coefficients. The further methods to be used include: for first-order equations, an adaptation of Shtokhamer's [1] MACSYMA program based on the results of Prelle and Singer [2]; for higher-order linear equations, factorisation of the operator where possible, and use of methods following results of Singer [3,4] and others; and for non-linear equations, the exploitation of Lie symmetries.

Cite

CITATION STYLE

APA

MacCallum, M. A. H. (1989). An ordinary differential equation solver for REDUCE. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 358 LNCS, pp. 196–205). Springer Verlag. https://doi.org/10.1007/3-540-51084-2_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free