Maple Student Edition
Maple Personal Edition
Maple Player for iPad
Maple T.A. MAA Placement Test Suite
Maple T.A. Connector for Blackboard Software
Möbius Project Home Page
View Math Apps
Machine Design / Industrial Automation
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Other Application Areas
High Schools & Two-Year Colleges
Testing & Assessment
High Performance Computing
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
SumTools[IndefiniteSum][Rational] - compute closed forms of indefinite sums of rational functions
Rational(f, k, options)
rational function in k
(optional) equation of the form failpoints=true or failpoints=false
The Rational(f, k) command computes a closed form of the indefinite sum of f with respect to k.
Rational functions are summed using Abramov's algorithm (see the References section). For the input rational function f⁡k, the algorithm computes two rational functions s⁡k and t⁡k such that f⁡k=s⁡k+1−s⁡k+t⁡k and the denominator of t⁡k has minimal degree with respect to k. The non-rational part, ∑kt⁡k, is then expressed in terms of the digamma and polygamma functions.
If the option failpoints=true (or just failpoints for short) is specified, then the command returns a pair g,p,q, where
g is the closed form of the indefinite sum of f w.r.t. k,
p is a list containing the integer poles of f, and
q is a list containing the poles of s and t that are not poles of f.
See SumTools[IndefiniteSum][Indefinite] for more detailed help.
The following expression is rationally summable.
Check the telescoping equation:
A non-rationally summable example.
Compute the fail points.
Indeed, f is not defined at n=0,3,5, and g is not defined at n=1,2,4.
Abramov, S.A. "Indefinite sums of rational functions." Proceedings ISSAC'95, pp. 303-308. 1995.
Download Help Document