Parallel integer relation detection: Techniques and applications

Abstract

Let { x 1 , x 2 , ⋯ , x n } \{x_1, x_2, \cdots , x_n\} be a vector of real numbers. An integer relation algorithm is a computational scheme to find the n n integers a k a_k , if they exist, such that a 1 x 1 + a 2 x 2 + ⋯ + a n x n = 0 a_1 x_1 + a_2 x_2 + \cdots + a_n x_n= 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 mathematical number theory, quantum field theory and chaos theory.