Computation of the best Diophantine approximations and of fundamental units of algebraic fields

DOI10.1134/S1064562416030017zbMath1353.11116OpenAlexW2471772418MaRDI QIDQ334388

Alexander D. Bruno

Publication date: 1 November 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562416030017

Mathematics Subject Classification ID

Units and factorization (11R27) Algebraic number theory computations (11Y40) Homogeneous approximation to one number (11J04)

Related Items (2)

Unnamed Item ⋮ Computation of the fundamental units of number rings using a generalized continued fraction

Cites Work

• The structure of multidimensional Diophantine approximations
• New generalization of continued fraction. I
• The quickhull algorithm for convex hulls
• Calculation of fundamental units of number rings by means of the generalized continued fraction
• Exact algorithms and software in optimization and polyhedral computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of the best Diophantine approximations and of fundamental units of algebraic fields