Differential rational normal forms and a reduction algorithm for hyperexponential func

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Differential rational normal forms and a reduction algorithm for hyperexponential func

Full text

Pdf (215 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2004 international symposium on Symbolic and algebraic computation table of contents

Santander, Spain

Pages: 183 - 190

Year of Publication: 2004

ISBN:1-58113-827-X

Authors

Keith Geddes	University of Waterloo, Waterloo, ON, Canada
Ha Le	INRIA Rocquencourt, Cedex, France
Ziming Li	Chinese Academy of Sciences, Beijing, China

Sponsors

ACM: Association for Computing Machinery
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1005285.1005313 What is a DOI?

ABSTRACT

We describe differential rational normal forms of a rational function and their properties. Based on these normal forms, we present an algorithm which, given a hyperexponential function T(x), constructs two hyperexponential functions T;_1;(x) and T;_2;(x) such that T(x) = T;_1;^'(x) + T;_2;(x) and T;_2;(x) is minimal in some sense. The algorithm can be used to accelerate the differential Gosper's algorithm and to compute right factors of the telescopers.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. A. Abramov , M. Petkovsek, Rational normal forms and minimal decompositions of hypergeometric terms, Journal of Symbolic Computation, v.33 n.5, p.521-543, May 2002 [doi>10.1006/jsco.2002.0529]
	2	S. Abramov and M. Petkovsek. Proof of a conjecture of Wilf and Zeilberger. University of Ljubljana, Preprint series, 39, 2001.
	3	G. Almkvist , D. Zeilberger, The method of differentiating under the integral sign, Journal of Symbolic Computation, v.10 n.6, p.571-591, Dec. 1990 [doi>10.1016/S0747-7171(08)80159-9]
	4	Manuel Bronstein, Symbolic integration I: transcendental functions, Springer-Verlag New York, Inc., New York, NY, 1997
	5	Keith O. Geddes , Stephen R. Czapor , George Labahn, Algorithms for computer algebra, Kluwer Academic Publishers, Norwell, MA, 1992
	6	K.O. Geddes, H.Q. Le. An algorithm to compute the minimal telescopers for rational functions (differential-integral case). In A.M. Cohen, X. Gao, N. Takayama, Eds., International Congress of Mathematical Software, World Scientific, 453-463, 2002.
	7	J. Gerhard. Modular algorithms in symbolic summation and symbolic integration. Ph.D. thesis, Universitöt-Gesamthochschule Paderborn, 2001.
	8	W. Koepf. Hypergeometric summation: an algorithmic approach to summation and special function identities. Vieweg, Braunschweig/Wiesbaden, 1998.