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
✦ 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
Finite element nodal ordering algorithms
✍
Kaveh, A. ;Behfar, S. M. R.
📂
Article
📅
1995
🏛
John Wiley and Sons
🌐
English
⚖ 437 KB
Efficient high order finite elements for
✍
Alberto Peano
📂
Article
📅
1976
🏛
Springer Netherlands
🌐
English
⚖ 711 KB
High-order curved finite elements
✍
E. L. Wachspress
📂
Article
📅
1981
🏛
John Wiley and Sons
🌐
English
⚖ 667 KB
Some new summation formulae for the gene
✍
Harold Exton
📂
Article
📅
1997
🏛
Elsevier Science
🌐
English
⚖ 180 KB
A consideration of odd and even terms of hypergeometric series of higher order leads to new summation formulae with arguments 1 and -1.
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