A generalized Apagodu-Zeilberger algorithm
From MaRDI portal
Abstract: The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this algorithm which is applicable to arbitrary -finite functions. In analogy to the hypergeometric case, we introduce the notion of proper -finite functions. We show that the algorithm always succeeds for these functions, and we give a tight a priori bound for the order of the output operator.
Recommendations
Cites work
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Cylindrical algebraic decomposition using validated numerics
- Definability and decision problems in arithmetic
- scientific article; zbMATH DE number 1952952 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- The Jordan Curve Theorem, Formally and Informally
Cited in
(8)- A generalization of the Massey-Ding algorithm
- Some open problems related to creative telescoping
- Reduction-based creative telescoping for Fuchsian D-finite functions
- scientific article; zbMATH DE number 220697 (Why is no real title available?)
- Extensions of the AZ-Algorithm and the Package MultiIntegrate
- Nested Integrals and Rationalizing Transformations
- Comments on Risch's \textit{On the integration of elementary functions which are built up using algebraic operations}
- On the existence of telescopers for P-recursive sequences
This page was built for publication: A generalized Apagodu-Zeilberger algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452384)