The Slow Continued Fraction Algorithm Via 2 × 2 Integer Matrices
From MaRDI portal
Recommendations
- Matrices, continued fractions, and fast algorithms
- A matrix Euclidean algorithm and matrix continued fraction expansions
- A matrix Euclidean algorithm and matrix continued fraction expansions
- Continued fraction algorithm for matrix exponentials
- A two-dimensional continued fraction algorithm with Lagrange and Dirichlet properties
- scientific article; zbMATH DE number 6158060
- Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions
- An algorithm for a 2-D continued fraction inversion
- On some symmetric multidimensional continued fraction algorithms
Cited in
(11)- On the proof of continued fraction expansions for irrationals
- Continued fractions, the group \(GL(2, \mathbb Z)\), and Pisot numbers
- A Collatz-type conjecture on the set of rational numbers
- scientific article; zbMATH DE number 1175370 (Why is no real title available?)
- Continued fraction expansions of matrix eigenvectors
- Slow continued fractions and permutative representations of \(\mathcal{O}_N\)
- On a matrix form of a theorem of Galois on purely periodic continued fractions
- From infinite ergodic theory to number theory (and possibly back)
- Euclid meets Popeye: the Euclidean algorithm for \(2\times 2\) matrices
- Products of matrices and and the distribution of reduced quadratic irrationals
- Constructing families of long continued fractions.
This page was built for publication: The Slow Continued Fraction Algorithm Via 2 × 2 Integer Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666920)
