Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
DOI10.1090/S0273-0979-1979-14691-3zbMATH Open0424.10021OpenAlexW2040569180MaRDI QIDQ3858342FDOQ3858342
Authors: Rodney W. Forcade, Helaman Ferguson 
Publication date: 1979
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0273-0979-1979-14691-3
Radix representation; digital problems (11A63) Continued fractions and generalizations (11J70) (zeta (s)) and (L(s, chi)) (11M06) Algebraic numbers; rings of algebraic integers (11R04) Lattices and convex bodies (number-theoretic aspects) (11H06) Algebraic independence; Gel'fond's method (11J85)
Cited In (20)
- A numerical transcendental method in algebraic geometry: computation of Picard groups and related invariants
- On a question of N. Chevallier related to simultaneous Diophantine approximation
- On periodic sequences for algebraic numbers
- Periodic point processes: theory and application
- Analysis of PSLQ, an integer relation finding algorithm
- An optimal, stable continued fraction algorithm for arbitrary dimension
- A Short Proof of the Existence of Vector Euclidean Algorithms
- On the Euler scale and the \({\mu}\)Euclidean integer relation algorithm
- Parallel integer relation detection: techniques and applications
- Extending the PSLQ Algorithm to Algebraic Integer Relations
- Factoring polynomials with rational coefficients
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals
- Rational approximations, multidimensional continued fractions, and lattice reduction
- Selected applications of LLL in number theory
- A two-dimensional Minkowski \(?(x)\) function
- Empirical determinations of Feynman integrals using integer relation algorithms
- Numerical results on relations between fundamental constants using a new algorithm
- The inverse Mellin transform via analytic continuation
- Farey nets and multidimensional continued fractions
- Experimental Evaluation of Euler Sums
This page was built for publication: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858342)
