Distributed computing of simultaneous Diophantine approximation problems
نویسندگان
چکیده
In this paper we present the Multithreaded Advanced Fast Rational Approximation algorithm – MAFRA – for solving n-dimensional simultaneous Diophantine approximation problems. We show that in some particular applications the Lenstra-Lenstra-Lovász (L) algorithm can be substituted by the presented one in order to reduce their practical running time. MAFRA was implemented in the following architectures: an Intel Core i5-2450M CPU, an AMD Radeon 7970 GPU card and an Intel cluster with 88 computing nodes. Mathematics Subject Classification (2010): 68R01, 11J68.
منابع مشابه
Rational points near manifolds and metric Diophantine approximation
This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarńık type theorems for submanifolds of Rn. These problems have attracted a lot of interest since Kleinbock and Margulis proved a related conjecture of Alan Baker and V.G. Sprindžuk. They have been settled for planar curves but remain open in higher dimensions. In this...
متن کاملBest Simultaneous Diophantine Approximations under a Constraint on the Denominator
We investigate the problem of best simultaneous Diophantine approximation under a constraint on the denominator, as proposed by Jurkat. New lower estimates for optimal approximation constants are given in terms of critical determinants of suitable star bodies. Tools are results on simultaneous Diophantine approximation of rationals by rationals with smaller denominator. Finally, the approximati...
متن کاملUsing Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation
While quantum computers might speed up in principle certain computations dramatically , in pratice, though quantum computing technology is still in its infancy. Even we cannot clearly envison at present what the hardware of that machine will be like. Nevertheless, we can be quite conndent that it will be much easier to build any practical quantum computer operating on a few number of quantum bi...
متن کاملTest sets of the knapsack problem and simultaneous diophantine approximation
Absact This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the co...
متن کاملKnapsack Public Key Cryptosystems And
This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from Diophantine approximation. Shamir’s attack on the basic Merkle-Hellman knapsack cryptosystem is shown to depend on the existence of ‘‘unusually good’’ simultaneous Diophantine approximations to a vector constructed from the public key. This aspect of Shamir’s attack carries o...
متن کامل