The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA MATHEMATICA - Issue no. 4 / 2014  
         
  Article:   DISTRIBUTED COMPUTING OF SIMULTANEOUS DIOPHANTINE APPROXIMATION PROBLEMS.

Authors:  .
 
       
         
  Abstract:   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-Lovasz (L3) algorithm can be substituted by the presente done in order to reduce their practical running time. MAFRA was implemented in the following architectures: an Intel Core i5-2450M CPU, an AMD Radeon 7970GPU card and an Intel cluster with 88 computing nodes.

Mathematics Subject Classi fication (2010): 68R01, 11J68.
Keywords: Diophantine approximation, rational approximation.
 
         
     
         
         
      Back to previous page