Related papers: A fast convolution method for the fractional Lapla…
In this work, we propose novel discretizations of the spectral fractional Laplacian on bounded domains based on the integral formulation of the operator via the heat-semigroup formalism. Specifically, we combine suitable quadrature formulas…
We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a simple exact algorithm running in $O(n^{2.89})$ time, which…
The convolution quadrature method originally developed for the Riemann-Liouville fractional calculus is extended in this work to the Hadamard fractional calculus by using the exponential type meshes. Local truncation error analysis is…
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to…
In this paper, we develop a direct method of moving planes for the fractional Laplacian. Instead of conventional extension method introduced by Caffarelli and Silvestre, we work directly on the non-local operator. Using the integral…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
We study computing the convolution of a private input $x$ with a public input $h$, while satisfying the guarantees of $(\epsilon, \delta)$-differential privacy. Convolution is a fundamental operation, intimately related to Fourier…
We address a linear fractional differential equation and develop effective solution methods using algorithms for inversion of triangular Toeplitz matrices and the recently proposed QTT format. The inverses of such matrices can be computed…
We propose an efficient algorithm for the approximation of fractional integrals by using Runge--Kutta based convolution quadrature. The algorithm is based on a novel integral representation of the convolution weights and a special…
In this paper we consider how to use the convolution method to construct approximations, which consist of fuzzy numbers sequences with good properties, for a general fuzzy number. It shows that this convolution method can generate…
We propose two easy-to-implement fast algorithms based on moment-matching to compute the nonlocal potential $\varphi(\textbf{x})=(U\ast \rho)(\textbf{x})$ on bounded domain, where the kernel $U$ is singular at the origin and the density…
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…
We present a method to rapidly approximate convolution quadrature (CQ) approximations, based on a piecewise polynomial interpolation of the Laplace domain operator, which we call the \emph{parsimonious} convolution quadrature method. For…
This paper presents a general framework of high-order finite difference (HFD) schemes for the tempered fractional Laplacian (TFL) based on new generating functions obtained from the discrete symbols. Specifically, for sufficiently smooth…
This paper provides a finite difference discretization for the backward Feynman-Kac equation, governing the distribution of functionals of the path for a particle undergoing both reaction and diffusion [Hou and Deng, J. Phys. A: Math.…
We study a discretization technique for the parabolic fractional obstacle problem in bounded domains. The fractional Laplacian is realized as the Dirichlet-to-Neumann map for a nonuniformly elliptic equation posed on a semi-infinite…
Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
The purpose of this work is to study a finite element method for finding solutions to the eigenvalue problem for the fractional Laplacian. We prove that the discrete eigenvalue problem converges to the continuous one and we show the order…