Integer relation detection

被引：44

作者：

Bailey, DH ^{[1
]}

机构：

[1] Univ Calif Berkeley, Lawrence Berkeley Lab, Berkeley, CA 94720 USA

来源：

COMPUTING IN SCIENCE & ENGINEERING | 2000年 / 2卷 / 01期

关键词：

D O I：

10.1109/5992.814653

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Practical algorithms for integer relation detection have become a staple in the emerging discipline of experimental mathematics-using modern computer technology to explore mathematical questions. After briefly discussing the problem of integer relation detection the author describes several recent, remarkable applications of these techniques in both mathematics and physics.

引用

页码：24 / 28

页数：5

共 18 条

[1] On the rapid computation of various polylogarithmic constants [J].

Bailey, D ;

Borwein, P ;

Plouffe, S .

MATHEMATICS OF COMPUTATION, 1997, 66 (218) :903-913

[2]

Bailey D., 1994, Experimental Mathematics, V3, P17, DOI [DOI 10.1080/10586458.1994.10504573, 10.1080/10586458.1994.10504573]

[3] A Fortran 90-based multiprecision system [J].

Bailey, DH .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1995, 21 (04) :379-387

[4] ALGORITHM 719 - MULTIPRECISION TRANSLATION AND EXECUTION OF FORTRAN PROGRAMS [J].

BAILEY, DH .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1993, 19 (03) :288-319

[5]

BAILEY DH, 1999, UNPUB PARALLEL INTEG

[6] EXPLICIT EVALUATION OF EULER SUMS [J].

BORWEIN, D ;

BORWEIN, JM ;

GIRGENSOHN, R .

PROCEEDINGS OF THE EDINBURGH MATHEMATICAL SOCIETY, 1995, 38 :277-294

[7]

BORWEIN D, 1995, P AM MATH SOC, V123, P111

[8]

BORWEIN JM, 1999, CENTRAL BINOMIAL SUM

[9]

BORWEIN JM, 1998, ELECT J COMBINATORIC, V5

[10]

BORWEIN JM, 1997, ELECT J COMBINATORIC, V4

← 1 2 →