Related papers: Transcendental Functions on Continued Fractions
We present a rigorous analytic proof of a generalized continued fraction (GCF) identity for the transcendental constant $8/\pi^2$, a result recently conjectured via the algorithmic framework of the Ramanujan Machine. Distinct from canonical…
In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
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…
Within the gossamer numbers which extend the real numbers to include infinitesimals and infinities we prove the Fundamental Theorem of Calculus (FTC). Riemann sums are also considered in the gossamer number system, and their non-uniqueness…
This work explores an unexpected application of Implicit Computational Complexity (ICC) to parallelize loops in imperative programs. Thanks to a lightweight dependency analysis, our algorithm allows splitting a loop into multiple loops that…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We present an approach for regression problems that employs analytic continued fractions as a novel representation. Comparative computational results using a memetic algorithm are reported in this work. Our experiments included fifteen…
This work is an extension of previous work by Alazah et al. [M. Alazah, S. N. Chandler-Wilde, and S. La Porte, Numerische Mathematik, 128(4):635-661, 2014]. We split the computation of the Fresnel Integrals into 3 cases: a truncated Taylor…
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…
We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…
Fractional vector calculus is discussed in the spherical coordinate framework. A variation of the Legendre equation and fractional Bessel equation are solved by series expansion and numerically. Finally, we generalize the hypergeometric…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
Recently Raayoni et al. announced various conjectures on continued fractions of fundamental constants automatically generated with machine learning techniques. In this paper we prove some of their stated conjectures for Euler number $e$ and…
We provide new methods to straightforwardly obtain compact and analytic expressions for epsilon-expansions of functions appearing in both field and string theory amplitudes. An algebraic method is presented to explicitly solve for…
The theory of fractional calculus in the complex plane was not built with a specific application in mind. The main obstacle to application was the difficulty with obtaining analytic continuations of fractional derivatives and integrals. It…
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…
It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…
The paper deals with the problem of approximating the functions of several variables by branched continued fractions, in particular, multidimensional A- and J-fractions with independent variables. A generalization of Gragg's algorithm is…
We give a new algorithm of slow continued fraction expansion related to any real cubic number field as a 2-dimensional version of the Farey map. Using our algorithm, we can find the generators of dual substitutions (so-called tiling…