compute closed forms of indefinite sums

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
- テンソル解析
- パッケージ
- ファンクションアドバイザ
- ベキ級数
- ベクトル解析
- 不活性関数
- 代数
- 因数分解と方程式解法
- 基本数学
- 基本的な注意事項
- 変分法
- 変換
- 幾何
- 微分代数方程式
- 微分幾何学
- 微分方程式
- 微積分
- 数
- 数値計算
- 数学関数
- 数論
- 最適化
- 特殊関数
- 統計
- 線形代数
- 群論
- 評価
- 論理
- 過去のパッケージ
- 金融
- 離散数学
  - グラフ理論
  - 組合せ論
  - 総和と差分方程式
  - 離散変換
  - OrderBasis コマンド
  - 積
- piecewise examples
- グラフ電卓
- 区分関数
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

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:

(1)

s := -(1/3)/(n-3/2+(1/2)*5^(1/2))-(1/3)/(n-1/2+(1/2)*5^(1/2))-(1/3)/(n+1/2+(1/2)*5^(1/2))

(2)

Check the telescoping equation:

(3)

A hypergeometrically summable term:

(4)

(5)

(1/2)*(2^n)^2/(n*(2*n+1)*binomial(2*n, n))

(6)

The method of accurate summation:

f := (1/5)*((1/2+(1/2)*5^(1/2))^n-(1/2-(1/2)*5^(1/2))^n)^2

(7)

-(3/10)*((1/2+(1/2)*5^(1/2))^n-(1/2-(1/2)*5^(1/2))^n)^2-(1/10)*((1/2+(1/2)*5^(1/2))^(n+1)-(1/2-(1/2)*5^(1/2))^(n+1))^2+(1/10)*((1/2+(1/2)*5^(1/2))^(n+2)-(1/2-(1/2)*5^(1/2))^(n+2))^2