Related papers: Discretized fractional substantial calculus
We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…
We implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
Solutions to fractional models inherently exhibit non-smooth behavior, which significantly deteriorates the accuracy and therefore efficiency of existing numerical methods. We develop a two-stage data-infused computational framework for…
Let $B=(B_1(t),..,B_d(t))$ be a $d$-dimensional fractional Brownian motion with Hurst index $\alpha\le 1/4$, or more generally a Gaussian process whose paths have the same local regularity. Defining properly iterated integrals of $B$ is a…
Shape calculus concerns the calculation of directional derivatives of some quantity of interest, typically expressed as an integral. This article introduces a type of shape calculus based on localized dilation of boundary faces through…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
Using kicked differential equations of motion with derivatives of noninteger orders, we obtain generalizations of the dissipative standard map. The main property of these generalized maps, which are called fractional maps, is long-term…
Computational costs of numerically solving multidimensional partial differential equations (PDEs) increase significantly when the spatial dimensions of the PDEs are high, due to large number of spatial grid points. For multidimensional…
Conical functions appear in a large number of applications in physics and engineering. In this paper we describe an extension of our module CONICAL for the computation of conical functions. Specifically, the module includes now a routine…
A new calculus based on fractal subsets of the real line is formulated. In this calculus, an integral of order $\alpha, 0 < \alpha \leq 1$, called $F^\alpha$-integral, is defined, which is suitable to integrate functions with fractal…
In this work, we propose a numerical approach for simulations of large deformations of interfaces in a level set framework. To obtain a fast and viable numerical solution in both time and space, temporal discretization is based on the…
Fractional partial differential equations (FDEs) are used to describe phenomena that involve a "non-local" or "long-range" interaction of some kind. Accurate and practical numerical approximation of their solutions is challenging due to the…
While the definition of a fractional integral may be codified by Riemann and Liouville, an agreed-upon fractional derivative has eluded discovery for many years. This is likely a result of integral definitions including numerous constants…
When applying the finite-differences method to numerically solve the one-dimensional diffusion equation, one must choose discretization steps $\Delta x$, $\Delta t$ in space and time, respectively. By applying large-deviation theory on the…
Spectral discretizations of fractional derivative operators are examined, where the approximation basis is related to the set of Jacobi polynomials. The pseudo-spectral method is implemented by assuming that the grid, used to represent the…
The solutions to many problems in the mathematical, computational, and physical sciences often involve multidimensional integrals. A direct numerical evaluation of the integral incurs a computational cost that is exponential in the number…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
In the present article, a new method for the evaluation of fractional derivatives of arbitrary real order is proposed. Numerous but inequivalent formulations have been given in the past. Some of them exhibit unsatisfactory properties such…
We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…
We propose a numerical accountant for evaluating the tight $(\varepsilon,\delta)$-privacy loss for algorithms with discrete one dimensional output. The method is based on the privacy loss distribution formalism and it uses the recently…