๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast algorithm for proving terminating hypergeometric identities

โœ Scribed by Doron Zeilberger

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
338 KB
Volume
80
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Two-Line Algorithm for Provingq-Hyperg
A Two-Line Algorithm for Provingq-Hypergeometric Identities
โœ Lily Yen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

We show that q-hypergeometric identities ร F n, k s 1 can be proved by k checking that they are correct for only finitely many, N say, values of n. We give a specific a priori formula for N, as a polynomial of degree 24 in the parameters of ลฝ . F n, k . We see this because of the presence of ''q'',

A Mathematica Version of Zeilberger's Al
A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities
โœ Peter Paule; Markus Schorn ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 665 KB

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

A Fast Algorithm for Particle Simulation
A Fast Algorithm for Particle Simulations
โœ L. Greengard; V. Rokhlin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 407 KB

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potenti

A Fast Algorithm for Grid Generation
A Fast Algorithm for Grid Generation
โœ Stephen A. Jordan; Malcolm L. Spaulding ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 556 KB