Related papers: Continued fractions and Parallel SQUFOF
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
Let $p$ be a prime number and $K$ be a field with embeddings into $\mathbb{R}$ and $\mathbb{Q}_p$. We propose an algorithm that generates continued fraction expansions converging in $\mathbb{Q}_p$ and is expected to simultaneously converge…
Continued fractions in the field of $p$--adic numbers have been recently studied by several authors. It is known that the real continued fraction of a positive quadratic irrational is eventually periodic (Lagrange's Theorem). It is still…
Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to obtain periodic representations for algebraic irrationals, as it is for continued fractions and quadratic irrationals. Since continued fractions…
Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$. We consider…
In this paper we recall some results and some criteria on the convergence of matrix continued fractions. The aim of this paper is to give some properties and results of continued fractions with matrix arguments. Then we give continued…
This paper presents a "two-dimensional Fourier Continuation" method (2D-FC) for construction of bi-periodic extensions of smooth non-periodic functions defined over general two-dimensional smooth domains. The approach can be directly…
We develop a continued fraction algorithm in finite extensions of $\Q_p$ generalising certain algorithms in $\Q_p$, and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the…
We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…
This paper is a short survey of the recent results on examples of periodic two-dimensional continued fractions (in Klein's model). In the last part of this paper we formulate some questions, problems and conjectures on geometrical…
We present a computational framework for piecewise constant functions (PCFs) and use this for several types of computations that are useful in statistics, e.g., averages, similarity matrices, and so on. We give a linear-time,…
The paper examines the structure of the periodic continued fraction for $\sqrt{d}$ and gives formulae for the central term as well as the repeated partial quotients occurring in its period.
We develop the geometry of Hurwitz continued fractions, a major tool in understanding the approximation properties of complex numbers by ratios of Gaussian integers. Based on a thorough study of the geometric properties of Hurwitz continued…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
Quadratic irrationals posses a periodic continued fraction expansion. Much less is known about cubic irrationals. We do not even know if the partial quotients are bounded, even though extensive computations suggest they might follow…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
In this paper, we present a review of three widely-used practical square root algorithms. We then describe a unifying framework where each of these well-known algorithms can be seen as a special case of it. The framework with singular…
In an earlier paper we introduced the notion of 'bifurcating continued fractions' in a heuristic manner. In this paper a formal theory is developed for the 'bifurcating continued fractions'.