Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions
From MaRDI portal
Publication:4015975
DOI10.1137/0221054zbMath0763.11027MaRDI QIDQ4015975
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
multidimensional continued fraction algorithms; selection rules; diophantine inequality; reduced lattice basis
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
11J70: Continued fractions and generalizations
11J25: Diophantine inequalities
65Y20: Complexity and performance of numerical algorithms
Related Items
An optimal, stable continued fraction algorithm for arbitrary dimension, ALGEBRAIC PROPERTIES OF WEAK PERRON NUMBERS, What do continued fractions accomplish?, Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design, A multidimensional continued fraction based on a high-order recurrence relation