Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithm for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation. Mathematica implementations of these algorithms are described. Nontrivial examples are given in order to
โฆ LIBER โฆ
Identities of nonterminating series by Zeilberger's algorithm
โ Scribed by Tom H. Koornwinder
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 495 KB
- Volume
- 99
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A Mathematica Version of Zeilberger's Al
โ
Peter Paule; Markus Schorn
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 665 KB
Simple proof of Macdonald's identities f
โ
Z. L. Leibenzon
๐
Article
๐
1991
๐
Springer US
๐
English
โ 260 KB
ESTIMATION OF THE EXPONENTIAL AUTOREGRES
โ
Z. Shi; H. Aoyama
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 229 KB
Exponential autoregression (EAR) is a kind of useful non-linear time series model that has properties similar to those of non-linear random vibrations. This model is of autoregressive form with amplitude-dependent coefficients, so parameter estimation is a non-linear optimization problem. To achieve
Trigonometric series summable by means o
โ
G. G. Gevorkyan
๐
Article
๐
1992
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 813 KB
Solution of St. Venant's torsion problem
โ
R.D. Mindlin
๐
Article
๐
1975
๐
Elsevier Science
๐
English
โ 387 KB
A class of algorithms for obtaining rati
โ
J. A. Murphy; M. R. O'Donohoe
๐
Article
๐
1977
๐
Springer
๐
English
โ 407 KB