Publication Date:
2015-06-01
Description:
In this article algorithmic methods are presented that have been incorporated in computer algebra systems in the last five years. The methods can be used to identify transcendental functions. The essential idea due to Zeilberger is to represent the functions by systems of holonomic differential and recurrence equations, and the identification procedure utilizes algorithms of Stanley and Zeilberger. Also a noncommutative version of the Buchberger algorithm can be applied.
Keywords:
ddc:000
Language:
German
Type:
reportzib
,
doc-type:preprint
Format:
application/postscript
Format:
application/pdf