Asymptotics of sums of hypergeometric terms

被引：1

作者：

Ryabenko, AA ^{[1
]}

Skorokbodov, SL ^{[1
]}

机构：

[1] Russian Acad Sci, Ctr Comp, Moscow 119991, Russia

来源：

PROGRAMMING AND COMPUTER SOFTWARE | 2005年 / 31卷 / 02期

基金：

俄罗斯基础研究基金会;

关键词：

Operating System; Artificial Intelligence; Software Engineer; Hypergeometric Term;

D O I：

10.1007/s11086-005-0015-7

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The asymptotics of sums of hypergeometric terms was discussed. The combination of symbolic transformations and methods of computational mathematics made it possible to efficiently construct the desired expansions. It was showed that the asymptotic series discussed ensure high relative accuracy of ε=10-10 for the sums Sn when n>100, which is often quite sufficient in applied problems. The method is similar to the saddle-point method for constructing asymptotics of integrals and is based on the analysis of the behavior of the term fk(n) in a neighborhood of its maximum.

引用

页码：65 / 72

页数：8

共 12 条

[1]

DAVYDYCHEV AI, 2003, 02214 DESY, P29

[2]

Diver F.W.J., 1974, ASYMPTOTICS SPECIAL, DOI 10.1201/9781439864548

[3]

Fedoryuk M.V., 1987, ASIMPTOTIKA INTEGRAL

[4]

GELFAND IM, 1992, USP MAT NAUK, V47, P3

[5]

Knuth D. E., 1973, The Art of Computer Programming Volume 3, Sorting and Searching, VIII

[6]

MIKHLIN SG, 1970, VARIATSIONNYE METODY

[7]

Petkovsek M., 1996, A = B

[8]

Prudnikov A.P., 1983, Integraly i ryady. Spetsial'nye funktsii (Integrals and Series. SpecialFunctions)

[9]

Riordan J., 1968, COMBINATORIAL IDENTI

[10]

VARCHENKO A, 1992, INT C MATH KYOT

← 1 2 →