THE METHOD OF CREATIVE TELESCOPING

被引：253

作者：

ZEILBERGER, D

机构：

[1] Department of Mathematics and Computer Science, Temple University, Philadelphia, Pennsylvania

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1991年 / 11卷 / 03期

关键词：

D O I：

10.1016/S0747-7171(08)80044-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on Gosper's algorithm for definite hypergeometric summation, and its theoretical justification relies on Bernstein's theory of holonomic systems. © 1991, Academic Press Limited. All rights reserved.

引用

页码：195 / 204

页数：10

共 23 条

[11] Graham R. L., 1989, CONCRETE MATH
[12] Knuth D. E., 2011, ART COMPUTER PROGRAM, V4
[13] Knuth D.E., 1997, ART COMPUTER PROGRAM, V3
[14] LAFON JC, 1983, COMPUTER ALGEBRA SYM
[15] WILF H, IN PRESS B AM MATH S
[16] WILF HS, IN PRESS J AM MATH S
[17] SOME HYPERGEOMETRIC ORTHOGONAL POLYNOMIALS
WILSON, JA
[J]. SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 1980, 11 (04) : 690 - 701
[18] HOW LIKELY IS POLYA DRUNKARD TO STAY IN X GREATER-THAN-OR-EQUAL-TO Y GREATER-THAN-OR-EQUAL-TO Z
WIMP, J
ZEILBERGER, D
[J]. JOURNAL OF STATISTICAL PHYSICS, 1989, 57 (5-6) : 1129 - 1135
[19] RESURRECTING THE ASYMPTOTICS OF LINEAR RECURRENCES
WIMP, J
ZEILBERGER, D
[J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1985, 111 (01) : 162 - 176
[20] A FAST ALGORITHM FOR PROVING TERMINATING HYPERGEOMETRIC IDENTITIES
ZEILBERGER, D
[J]. DISCRETE MATHEMATICS, 1990, 80 (02) : 207 - 211

← 1 2 3 →