Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions

DOI10.1137/0221054zbMath0763.11027OpenAlexW2091330756MaRDI QIDQ4015975

Bettina Just

Publication date: 6 December 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221054

zbMATH Keywords

multidimensional continued fraction algorithmsselection rulesdiophantine inequalityreduced lattice basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Continued fractions and generalizations (11J70) Diophantine inequalities (11J25) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

What do continued fractions accomplish? ⋮ ALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS ⋮ Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design ⋮ An optimal, stable continued fraction algorithm for arbitrary dimension ⋮ A multidimensional continued fraction based on a high-order recurrence relation

This page was built for publication: Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions