Related papers: Analytical and Numerical Approaches for Finding Fu…
Recently, fractional differential equations have been investigated via the famous variational iteration method. However, all the previous works avoid the term of fractional derivative and handle them as a restricted variation. In order to…
Local fractional derivative and integrals are revealed as one of useful tools to deal with everywhere continuous but nowhere differentiable functions in fractal areas ranging from fundamental science to engineering. In this paper, a…
We consider autonomous stochastic ordinary differential equations (SDEs) and weak approximations of their solutions for a general class of sufficiently smooth path-dependent functionals f. Based on tools from functional It\^o calculus, such…
We present a novel numerical scheme to approximate the solution map $s\mapsto u(s) := \mathcal{L}^{-s}f$ to partial differential equations involving fractional elliptic operators. Reinterpreting $\mathcal{L}^{-s}$ as interpolation operator…
This article presents a convenient approach to Fourier analysis for the investigation of functions and distributions defined in $\mathbb{T}^m \times \mathbb{R}^n$. Our approach involves the utilization of a mixed Fourier transform,…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
A new analytical approximation function is proposed to accurately fit the solution of a fractional differential equation of order one-half, whose nonhomogeneous term is defined by a modified Bessel function of the first kind. The exact…
We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that…
In this paper a spline based integral approximation is utilized to propose a sequence of approximations to the error function that converge at a significantly faster manner than the default Taylor series. The approximations can be improved…
Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…
This paper is a generalization of the previous work (Yang et.al, J. Comput. Phys. 330 (2017), 863-883) to the 3-D irregular convex domains. The analytical calculation formula of fractional derivatives of finite element basis functions are…
We apply recently constructed functional bases to the numerical conformal bootstrap for 1D CFTs. We argue and show that numerical results in this basis converge much faster than the traditional derivative basis. In particular, truncations…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
The Nonlinear Forward-Backward (NFB) algorithm, also known as warped resolvent iterations, is a splitting method for finding zeros of sums of monotone operators. In particular cases, NFB reduces to well-known algorithms such as…
Real life signals are in general non--stationary and non--linear. The development of methods able to extract their hidden features in a fast and reliable way is of high importance in many research fields. In this work we tackle the problem…
A simple analytic expression for the non-singlet structure function $f_{NS}$ is given. The expression is derived from the result of Ref. [1] obtained by low $x$ resummation of the quark ladder diagrams in the double logarithmic…
For a slice--regular quaternionic function $f,$ the classical exponential function $\exp f$ is not slice--regular in general. An alternative definition of exponential function, the $*$-exponential $\exp_*$, was given: if $f$ is a…
The iteration sequence based on the BLUES (Beyond Linear Use of Equation Superposition) function method for calculating analytic approximants to solutions of nonlinear ordinary differential equations with sources is elaborated upon. Diverse…
We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial time and is guaranteed to find a feasible integer solution…
A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…