𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hypergeometric Summation Algorithms for High-order Finite Elements

✍ Scribed by A. Bećirović; P. Paule; V. Pillwein; A. Riese; C. Schneider; J. Schöberl


Publisher
Springer Vienna
Year
2006
Tongue
English
Weight
178 KB
Volume
78
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Algorithms for m-fold Hypergeometric Sum
✍ Wolfram Koepf 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Zeilberger's algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms \(F(n, k)\) is extended to certain nonhypergeometric terms. An expression \(F(n, k)\) is called hypergeometric term if both \(F(n+1, k) / F(n, k)\) and \(F(n, k+1) / F(n, k)\) are rational fun

Asymptotic summation for second-order fi
✍ S. Castillo; M. Pinto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 787 KB

Conditional summable hypotheses are given to obtain asymptotic summation of some 2 x 2 difference systems. We obtain asymptotic formulae of the solutions of a perturbed system, knowing the recessive and dominant solutions of the unperturbed system. The Casoratian is generally nonconstant and nonconv