Applications of integer relation algorithms

被引：11

作者：

Borwein, JM ^{[1
]}

Lisonek, P ^{[1
]}

机构：

[1] Simon Fraser Univ, Dept Math & Stat, Ctr Expt & Construct Math, Burnaby, BC V5A 1S6, Canada

来源：

DISCRETE MATHEMATICS | 2000年 / 217卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(99)00256-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c such that ca(T) = 0. We discuss the algorithms for finding such integer relations from the user's point of view, by presenting examples of their applications and by reviewing the available software implementations. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

引用

页码：65 / 82

页数：18

共 41 条

[1] Borwein and Bradley's Apery-like formulae for ζ(4n+3)
Almkvist, G
Granville, A
[J]. EXPERIMENTAL MATHEMATICS, 1999, 8 (02) : 197 - 203
[2] On the rapid computation of various polylogarithmic constants
Bailey, D
Borwein, P
Plouffe, S
[J]. MATHEMATICS OF COMPUTATION, 1997, 66 (218) : 903 - 913
[3] A Fortran 90-based multiprecision system
Bailey, DH
[J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1995, 21 (04): : 379 - 387
[4] ALGORITHM 719 - MULTIPRECISION TRANSLATION AND EXECUTION OF FORTRAN PROGRAMS
BAILEY, DH
[J]. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1993, 19 (03): : 288 - 319
[5] BAILEY DH, 1989, MATH COMPUT, V53, P649, DOI 10.1090/S0025-5718-1989-0979934-9
[6] NUMERICAL RESULTS ON THE TRANSCENDENCE OF CONSTANTS INVOLVING PI, E, AND EULER CONSTANT
BAILEY, DH
[J]. MATHEMATICS OF COMPUTATION, 1988, 50 (181) : 275 - 281
[7] BAILEY DH, 1997, CANADIAN MATH SOC C, V20, P73
[8] BELLARD F, 1997, PI CHALLENGE PUBLIC
[9] Borwein J., 1996, SIGSAM Bulletin, V30, P2, DOI 10.1145/235699.235700
[10] Borwein J.M., 1998, Electron. J. Comb., V5, pR38, DOI 10.37236/1376

← 1 2 3 4 5 →