Parallel Integer Relation Detection: Techniques and Applications

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Bailey, David H., Broadhurst, David J.
Format: Preprint
Published: 1999
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918162974375936
author Bailey, David H.
Broadhurst, David J.
author_facet Bailey, David H.
Broadhurst, David J.
contents Let $\{x_1, x_2, ..., x_n\}$ be a vector of real numbers. An integer relation algorithm is a computational scheme to find the $n$ integers $a_k$, if they exist, such that $a_1 x_1 + a_2 x_2 + ... + 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 number theory, quantum field theory and chaos theory.
format Preprint
id arxiv_https___arxiv_org_abs_math_9905048
institution arXiv
publishDate 1999
record_format arxiv
spellingShingle Parallel Integer Relation Detection: Techniques and Applications
Bailey, David H.
Broadhurst, David J.
Numerical Analysis
High Energy Physics - Theory
Mathematical Physics
Let $\{x_1, x_2, ..., x_n\}$ be a vector of real numbers. An integer relation algorithm is a computational scheme to find the $n$ integers $a_k$, if they exist, such that $a_1 x_1 + a_2 x_2 + ... + 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 number theory, quantum field theory and chaos theory.
title Parallel Integer Relation Detection: Techniques and Applications
topic Numerical Analysis
High Energy Physics - Theory
Mathematical Physics
url https://arxiv.org/abs/math/9905048