Related papers: Transcendental Functions on Continued Fractions
Gosper developed an algorithm for performing arithmetic on continued fractions (CFs), and introduced continued logarithms (CLs) as a variant of continued fractions better suited to representing extremely large (or small) numbers. CLs are…
The problem of developing an arithmetic for continued fractions (in order to perform, e.g., sums and products) does not have a straightforward solution and has been addressed by several authors. In 1972, Gosper provided an algorithm to…
We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…
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 present several continued fraction algorithms, each of which gives an eventually periodic expansion for every quadratic element of ${\mathbb Q}_p$ over ${\mathbb Q}$ and gives a finite expansion for every rational number. We also give,…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
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…
Higher transcendental function occur frequently in the calculation of Feynman integrals in quantum field theory. Their expansion in a small parameter is a non-trivial task. We report on a computer program which allows the systematic…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
A widely used approach to compute the action $f(A)v$ of a matrix function $f(A)$ on a vector $v$ is to use a rational approximation $r$ for $f$ and compute $r(A)v$ instead. If $r$ is not computed adaptively as in rational Krylov methods,…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
Adolf Hurwitz proposed in 1887 a continued fraction algorithm for complex numbers: Hurwitz continued fractions (HCF). Among other similarities between HCF and regular continued fractions, quadratic irrational numbers over $\mathbb{Q}(i)$…
We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…
Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
In this paper we consider continued fraction (CF) expansions on intervals different from $[0,1]$. For every $x$ in such interval we find a CF expansion with a finite number of possible digits. Using the natural extension, the density of the…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
We describe an adaptive greedy algorithm for Thiele continued-fraction approximation of a function defined on a continuum domain in the complex plane. The algorithm iteratively selects interpolation nodes from an adaptively refined set of…