pmint - The Poor Man's Integrator
pmint is a very short (95 lines)
for integrating transcendental elementary or special functions.
It is based on recent improvements to a powerful heuristic called
parallel integration. While it is not meant to be as complete as
the large commercial integrators based on the Risch algorithm,
its very small size makes it easy to port to any computer algebra
system or library capable of factoring multivariate polynomials.
Because it is applicable to special functions (such as Airy, Bessel,
Whittaker, Lambert), it is able to compute integrals not handled
by the existing integrators.
pmint is not meant as a replacement for existing integrators, but
either as an extension, or as a cheap and powerful alternative for any
computer algebra project.
Download a worksheet of examples.
References for parallel integration
J.H.Davenport (1982): On the Parallel Risch Algorithm (I),
Proceedings of EUROCAM'82, LNCS 144, Springer, 144-157.
J.H.Davenport (1982): On the Parallel Risch Algorithm (III): Use of Tangents,
SIGSAM Bulletin 16, 3-6.
J.H.Davenport, B.M.Trager (1985): On the Parallel Risch Algorithm (II),
ACM Transactions on Mathematical Software 11, 356-362.
J.Fitch (1981): User-based integration software,
Proceedings of SYMSAC'81, ACM Press, 245-248.
K.Geddes, L.Stefanus (1989): On the Risch-Norman Integration Method and
its Implementation in Maple, Proceedings of ISSAC'89, ACM Press, 212-217.
S.H.Harrington (1979): A new symbolic integration system in reduce,
The Computer Journal 22, 127-131.
A.C.Norman, P.M.A.Moore (1977):
Implementing the new Risch Integration Algorithm,
Proceedings of the 4th International Colloquium
on Advanced Computing Methods in Theoretical Physics, 99-110.
Last update: 11 May 2005