相关论文: Fast logarithmic Fourier-Laplace transform of noni…

We develop a general framework for estimating the $L_\infty(\mathbb{T}^d)$ error for the approximation of multivariate periodic functions belonging to specific reproducing kernel Hilbert spaces (RHKS) using approximants that are…

The purpose of this note is to provide an expository introduction to some more curious integral formulas and transformations involving generating functions. We seek to generalize these results and integral representations which effectively…

Let $f$ be an $E$-function (in Siegel's sense) not of the form $e^{\beta z}$, $\beta \in \overline{\mathbb{Q}}$, and let $\log$ denote any fixed determination of the complex logarithm. We first prove that there exists a finite set $S(f)$…

We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…

In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…

The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…

Asymptotic expansions are obtained for contour integrals of the form \[ \int_a^b \exp \left( - zp(t) + z^{\nu /\mu } r(t) \right)q(t)dt, \] in which $z$ is a large real or complex parameter, $p(t)$, $q(t)$ and $r(t)$ are analytic functions…

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.…

This article introduces the Generalized Fourier Series (GFS), a novel spectral method that extends the clas- sical Fourier series to non-periodic functions. GFS addresses key challenges such as the Gibbs phenomenon and poor convergence in…

In recent years there has been a growing interest in the fractional Fourier transform driven by its large number of applications. The literature in this field follows two main routes. On the one hand, the areas where the ordinary Fourier…

This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the…

In this paper, we study the asymptotics and fast computation of the one-sided oscillatory Hilbert transforms of the form $$H^{+}(f(t)e^{i\omega t})(x)=-int_{0}^{\infty}e^{i\omega t}\frac{f(t)}{t-x}dt,\qquad \omega>0,\qquad x\geq 0,$$ where…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

This manuscript introduces a generalization of the Mellin integral transform within the framework of weighted fractional calculus with respect to an increasing function. The proposed transform is much more suitable for working with…

By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…

Given a nonincreasing null sequence $T = (T_j)_{j \ge 1}$ of nonnegative random variables satisfying some classical integrability assumptions and $\mathbb{E}(\sum_{j}T_{j}^{\alpha})=1$ for some $\alpha>0$, we characterize the solutions of…

We propose a mesh refinement technique for solving elliptic difference equations on unbounded domains based on the fast lattice Green's function (FLGF) method. The FLGF method exploits the regularity of the Cartesian mesh and uses the fast…

Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…

We present a spin-dependent extension of the non-orthogonal generalized Wannier function (NGWF) formalism within the framework of linear-scaling density functional theory (LS-DFT) as implemented in the ONETEP code. In traditional LS-DFT…

The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…