CALCULATION OF HYPERGEOMETRIC SERIES WITH QUASI-LINEAR TIME AND LINEAR SPACE COMPLEXITY

被引:0
作者
Yakhontov, S. V. [1 ]
机构
[1] St Petersburg State Univ, Math & Mech Fac, Dept Informat, 28 Univ Skiy Prosp, St Petersburg 198504, Russia
来源
VESTNIK SAMARSKOGO GOSUDARSTVENNOGO TEKHNICHESKOGO UNIVERSITETA-SERIYA-FIZIKO-MATEMATICHESKIYE NAUKI | 2011年 / 03期
关键词
constructive real numbers; hypergeometric series; quasi-linear time; linear space complexity;
D O I
暂无
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
A simple for practical implementation algorithm with the time complexity O(M(n)log(n)(2)) and space complexity O(n) for the evaluation of hypergeometric series with rational coefficients on the Schonhage machine is constructed (here M(n) is the complexity of integer multiplication). It is shown that this algorithm is suitable in practical informatics for constructive analogues of often used constants of analysis.
引用
收藏
页码:149 / 156
页数:8
相关论文
共 6 条
  • [1] Cheng H., 2005, SIGSAM Bulletin, V39, P41, DOI 10.1145/1101884.1101886
  • [2] Gourdon X., BINARY SPLITTING MET
  • [3] Haible B., 1998, Algorithmic Number Theory. Third International Symposium, ANTS-III. Proceedings, P338, DOI 10.1007/BFb0054873
  • [4] Ko K.-I, 1991, PROGR THEORETICAL CO
  • [5] SCHONHAGE A, 1994, FAST ALGORITHMS MULT
  • [6] Yakhontov S. V., 2010, FLINSPACE CONSTRUCTI