Mathematics – Numerical Analysis
Scientific paper
1999-05-09
Math.Comput. 70 (2001) 1719-1736
Mathematics
Numerical Analysis
18 pages, LaTeX
Scientific paper
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.
Bailey David H.
Broadhurst David J.
No associations
LandOfFree
Parallel Integer Relation Detection: Techniques and Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Integer Relation Detection: Techniques and Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Integer Relation Detection: Techniques and Applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-81526