Parallel integer relation detection: Techniques and applications

Let {x1,x2,···,xn} be a vector of real numbers. An integer relation algorithm is a computational scheme to find the n integers ak, if they exist, such that a1x1 + a2x2 + ··· + anxn = 0. In the past few years, integer relation algorithms have been utilized to discover new results in mathematics and physics. Existing programs for this purpose require very large amounts of computer time, due in part to the requirement for multiprecision arithmetic, yet are poorly suited for parallel processing. This paper presents a new integer relation algorithm designed for parallel computer systems, but as a bonus it also gives superior results on single processor systems. Single- and multi-level implementations of this algorithm are described, together with performance results on a parallel computer system. Several applications of these programs are discussed, including some new results in number theory, quantum field theory and chaos theory.

[1]  D. J. Broadhurst,et al.  Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops , 1996, hep-th/9609128.

[2]  Jonathan M. Borwein,et al.  Experimental Evaluation of Euler Sums , 1994, Exp. Math..

[3]  Jonathan M. Borwein,et al.  Central Binomial Sums, Multiple Clausen Values, and Zeta Values , 2001, Exp. Math..

[4]  Jonathan M. Borwein,et al.  Combinatorial Aspects of Multiple Zeta Values , 1998, Electron. J. Comb..

[5]  D. H. Lehmer.  Factorization of Certain Cyclotomic Functions , 1933 .

[6]  D. J. Broadhurst.  Massive 3-loop Feynman diagrams reducible to SC$^*$ primitives of algebras of the sixth root of unity , 1999 .

[7]  Jonathan M. Borwein,et al.  Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k , 1996, Electron. J. Comb..

[8]  D. J. Broadhurst,et al.  Beyond the triangle and uniqueness relations: non-zeta counterterms at large N from positive knots , 1996 .

[9]  David J. Broadhurst,et al.  Polylogarithmic ladders, hypergeometric series and the ten millionth digits of ?(3) and ?(5) , 1998 .

[10]  David H. Bailey,et al.  Analysis of PSLQ, an integer relation finding algorithm , 1999, Math. Comput..

[11]  Jonathan M. Borwein,et al.  Pi and the AGM , 1999 .

[12]  David H. Bailey,et al.  Multiprecision Translation and Execution of Fortran Programs , 1993 .

[13]  David Bailey,et al.  On the rapid computation of various polylogarithmic constants , 1997, Math. Comput..

[14]  R. Forcade,et al.  Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two , 1979 .

[15]  Anthony Skjellum,et al.  Using MPI - portable parallel programming with the message-parsing interface , 1994 .

[16]  J. Borwein,et al.  Explicit evaluation of Euler sums , 1995 .

[17]  Jonathan M. Borwein,et al.  On an intriguing integral and some series related to (4) , 1995 .

[18]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[19]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[20]  David H. Bailey,et al.  A Fortran 90-based multiprecision system , 1995, TOMS.

[21]  David H. Bailey,et al.  A seventeenth-order polylogarithm ladder , 1999 .

[22]  Jeffrey C. Lagarias,et al.  Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers , 1989, STACS.