On multidimensional Diophantine approximation of algebraic numbers

DOI10.1016/j.jnt.2016.07.002zbMath1419.11097OpenAlexW2515614974WikidataQ114157407 ScholiaQ114157407MaRDI QIDQ331138

Michael E. Pohst, Csanád Bertók, Attila Pethoe

Publication date: 26 October 2016

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2016.07.002

zbMATH Keywords

Diophantine approximationcontinued fractionsJacobi-Perron algorithmLLL-algorithm

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Continued fractions and generalizations (11J70) Simultaneous homogeneous approximation, linear forms (11J13)

Related Items

Algebraic number fields and the LLL algorithm ⋮ Every Salem number is a difference of two Pisot numbers ⋮ Approximations of Algebraic Irrationalities with Matrices

Cites Work

• Unnamed Item
• Factoring polynomials with rational coefficients
• On computing fundamental units
• The Jacobi-Perron algorithm its theory and application
• Finding simultaneous Diophantine approximations with prescribed quality
• Computation of Independent Units in Number Fields by Dirichlet's Method
• A monte carlo method for factorization
• Calculation of the Regulator of Q(√D) by use of the Nearest Integer Continued Fraction Algorithm
• On norm form equations

This page was built for publication: On multidimensional Diophantine approximation of algebraic numbers