Efficient computing of n-dimensional simultaneous Diophantine approximation problems

MaRDI QIDQ5167102zbMATH OpenFDO

Authors

Publication date 9 July 2014

Full work available at URL http://www.acta.sapientia.ro/acta-info/C5-1/info51-2.pdf

zbMATH Keywords

Diophantine approximation

Mathematics Subject Classification ID

Simultaneous homogeneous approximation, linear forms (11J13) Number-theoretic algorithms; complexity (11Y16) Approximation to algebraic numbers (11J68)

Recommendations

• Distributed computing of simultaneous Diophantine approximation problems
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Simultaneous diophantine approximation
• Structure of the best Diophantine approximations and multidimensional generalizations of the continued fraction
• Finding simultaneous Diophantine approximations with prescribed quality

Cited in

(7)

• scientific article; zbMATH DE number 599115 (Why is no real title available?)
• Finding simultaneous Diophantine approximations with prescribed quality
• Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Distributed computing of simultaneous Diophantine approximation problems
• Information transfer fidelity in spin networks and ring-based quantum routers
• Computer technology of constructing \(T\)-efficient algorithms for computing \({\varepsilon}\)-solutions of computational and applied mathematical problems

Describes a project that uses

Uses Software

• PARI/GP

This page was built for publication: Efficient computing of \(n\)-dimensional simultaneous Diophantine approximation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167102)