Algebraische Darstellung transzendenter Funktionen
Please always quote using this URN: urn:nbn:de:0297-zib-1524
- 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.
Download full text files
Additional Services
| Author: | Wolfram Koepf |
|---|---|
| Document Type: | ZIB-Report |
| Date of first Publication: | 1994/09/29 |
| Series (Serial Number): | ZIB-Report (SC-94-24) |
| ZIB-Reportnumber: | SC-94-24 |
| Published in: | Erschienen in: Computeralgebra-Rundbrief 16 der Fachgruppe Computeralgebra der GI-DMV-GAMM, 1995, pp. 12-18 |
