Maple Professionel
Maple Académique
Maple Edition Étudiant
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professionel
MapleSim Académique
Maple T.A. - Suite d'examens de classement
Maple T.A. MAA Placement Test Suite
Möbius - Didacticiels de mathématiques en ligne
Machine Design / Industrial Automation
Aéronautique
Ingénierie des véhicules
Robotics
Energie
System Simulation and Analysis
Model development for HIL
Modélisation du procédé pour la conception de systèmes de contrôle
Robotics/Motion Control/Mechatronics
Other Application Areas
Enseignement des mathématiques
Enseignement de l’ingénierie
Enseignement secondaire et supérieur (CPGE, BTS)
Tests et évaluations
Etudiants
Modélisation financière
Recherche opérationnelle
Calcul haute performance
Physique
Webinaires en direct
Webinaires enregistrés
Agenda des évènements
Forum MaplePrimes
Blog Maplesoft
Membres Maplesoft
Maple Ambassador Program
MapleCloud
Livres blancs techniques
Bulletin électronique
Livres Maple
Math Matters
Portail des applications
Galerie de modèles MapleSim
Cas d'Etudes Utilisateur
Exploring Engineering Fundamentals
Concepts d’enseignement avec Maple
Centre d’accueil utilisateur Maplesoft
Centre de ressources pour enseignants
Centre d’assistance aux étudiants
SumTools[IndefiniteSum][Indefinite] - compute closed forms of indefinite sums
Calling Sequence
Indefinite(f, k, opt)
Parameters
f
-
expression depending on k
k
name
opt
(optional) equation of the form failpoints=true or failpoints=false
Description
The Indefinite(f, k) command computes a closed form of the indefinite sum of with respect to .
The command uses a combination of algorithms handling various classes of summands. They include the classes of polynomials, rational functions, and hypergeometric terms and j-fold hypergeometric terms, functions for which their minimal annihilators can be constructed, for example, d'Alembertian terms. For more information, see LinearOperators.
A library extension mechanism is also used to include sums for which an algorithmic approach to finding closed forms does not yet exist. Currently the computable summands include expressions containing the harmonic function, logarithmic function, digamma and polygamma functions, and sin, cos, and the exponential functions.
If the option failpoints=true (or just failpoints for short) is specified, then the command returns a pair , where
is a closed form of the indefinite sum of w.r.t. , as above,
is a list of intervals where does not exist, and
is a list of points where the computed sum does not satisfy the telescoping equation or does not exist.
If such points appear in the summation interval, the discrete Newton-Leibniz formula may fail.
If the command is unable to compute one of the lists , the command returns .
Examples
An example of a rationally summable expression:
Check the telescoping equation:
A hypergeometrically summable term:
The method of accurate summation:
Example for the library extension mechanism:
Compute the fail points:
Indeed, is not defined for any negative integer:
Error, numeric exception: division by zero
The sum is not defined at :
Note that in this example, however, the limit exists:
Rewriting in terms of GAMMA functions introduces additional singularities at negative integers:
In the following rational example, the limit does not exist:
See Also
SumTools[DefiniteSummation], SumTools[IndefiniteSum], SumTools[IndefiniteSum][Hypergeometric], SumTools[Summation]
Download Help Document