Related papers: New modular multiplication and division algorithms…
Continued fractions have a long history in number theory, especially in the area of Diophantine approximation. The aim of this expository paper is to survey the main results on the theory of $p$--adic continued fractions, i.e. continued…
We prove a continued fraction expansion for the reciprocal of a certain $q$-series. All the specialists in the world are asked whether it is new or not.
We detail the continued fraction expansion of the square root of a monic polynomials of even degree. We note that each step of the expansion corresponds to addition of the divisor at infinity, and interpret the data yielded by the general…
We obtain approximation formulas for fractional integrals and derivatives of Riemann-Liouville and Marchaud types with a variable fractional order. The approximations involve integer-order derivatives only. An estimation for the error is…
We analyze several generic proximal splitting algorithms well suited for large-scale convex nonsmooth optimization. We derive sublinear and linear convergence results with new rates on the function value suboptimality or distance to the…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
The development of algorithmic fractal dimensions in this century has had many fruitful interactions with geometric measure theory, especially fractal geometry in Euclidean spaces. We survey these developments, with emphasis on connections…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
Recently a new class of continued fraction algorithms, the $(N,\alpha$)-expansions, was introduced for each $N\in\mathbb{N}$, $N\geq 2$ and $\alpha \in (0,\sqrt{N}-1]$. Each of these continued fraction algorithms has only finitely many…
In this paper, we revisit the diffusive representations of fractional integrals established in \cite{diethelm2023diffusive} to explore novel variants of such representations which provide highly efficient numerical algorithms for the…
Continued fractions whose elements are polynomial sequences have been carefully studied mostly in the cases where the degree of the numerator polynomial is less than or equal to two and the degree of the denominator polynomial is less than…
We show that the Dirac factorization method can be successfully employed to treat problems involving operators raised to a fractional power. The technique we adopt is based on an extension of the Pauli matrices and the properties of the…
We introduce an efficient algorithm, called partition of unity extension or PUX, to construct an extension of desired regularity of a function given on a complex multiply connected domain in $2D$. Function extension plays a fundamental role…
We give a direct and simple proof of Touchard's continued fraction, provide an extension of it, and transform it into similar expansions related to Motzkin and Schroeder numbers. Another proof is then given that uses only induction. We use…
Large and moderate deviation principles are proved for Engel continued fractions, a new type of continued fraction expansion with non-decreasing partial quotients in number theory.
The inspiral of two compact objects in gravitational wave astronomy is described by a post-Newtonian expansion in powers of $(v/c)$. In most cases, it is believed that the post-Newtonian expansion is asymptotically divergent. A standard…
The direct calculation of the Generalized operator entropy proves difficult by the appearance of rational exponents of matrices. The main motivation of this work is to overcome these difficulties and to present a practical and efficient…
This work proposes a conformable fractional predictor-corrector algorithm for solving conformable fractional differential equations. Fractional calculus is finding applications in various scientific fields, but existing numerical methods…
We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In…
The most widely used algorithm for floating point complex division, known as Smith's method, may fail more often than expected. This document presents two improved complex division algorithms. We present a proof of the robustness of the…