In this article algorithmic methods are presented that have essentially been introduced into computer algebra systems like Maple, Mathematica or REDUCE within the last decade. The main ideas are due to Stanley and Zeilberger. Some of them had already been discovered in the last century by Beke, but because of their complexity the underlying algorithms have fallen into oblivion. We give a survey of these techniques, show how they can be used to identify transcendental functions, and present implementations of these algorithms in computer algebra systems.
展开▼
