Related papers: Generalized Fourier-Bessel operator and almost-per…
The fast Fourier transform (FFT) based matrix-free ansatz interpolatory approximations of periodic functions are fundamental for efficient realization in several applications.In this work we design, analyze, and implement similar…
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…
Frequency estimation is a fundamental problem in many areas. The well-known A&M and its variant estimators have established an estimation framework by iteratively interpolating the discrete Fourier transform (DFT) coefficients. In general,…
In this paper a new class of radial basis functions based on hyperbolic trigonometric functions will be introduced and studied. We focus on the properties of their generalised Fourier transforms with asymptotics. Therefore we will compute…
In this paper, we first give two uniform asymptotic approximations of the eigenfunctions of the weighted finite Fourier transform operator, defined by ${\displaystyle \mathcal F_c^{(\alpha)} f(x)=\int_{-1}^1 e^{icxy}…
We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…
Although the study of functional calculus has already established necessary and sufficient conditions for operators to be fractionalized, this paper aims to use our well-conceived notion of integer powers of operators to construct…
In this paper, we study the problem of interpolating a continuous function at $(n+1)$ equally-spaced points in the interval $[0,1]$, using shifts of a kernel on the $(1/n)$-spaced infinite grid. The archetypal example here is approximation…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…
It is well known that approximation of functions on $[0,1]$ whose periodic extension is not continuous fail to converge uniformly due to rapid Gibbs oscillations near the boundary. Among several approaches that have been proposed toward the…
This is a brief survey of recent results by the authors devoted to one of the most important operators of integral geometry. Basic facts about the analytic family of cosine transforms on the unit sphere and the corresponding Funk transform…
The FC-Gram algorithm approximates non-periodic functions to high order by constructing a periodic extension with controlled boundary behavior and applying trigonometric interpolation. In this paper we introduce a generalized FC-Gram…
Let $T$ be a square matrix with a real spectrum, and let $f$ be an analytic function. The problem of the approximate calculation of $f(T)$ is discussed. Applying the Schur triangular decomposition and the reordering, one can assume that $T$…
Properties of the four families of recently introduced special functions of two real variables, denoted here by $E^\pm$, and $\cos^\pm$, are studied. The superscripts $^+$ and $^-$ refer to the symmetric and antisymmetric functions…
This paper deals with approximation of smooth convex functions $f$ on an interval by convex algebraic polynomials which interpolate $f$ at the endpoints of this interval. We call such estimates "interpolatory". One important corollary of…
In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
We introduce an adaptation of integral approximation operators to set-valued functions (SVFs, multifunctions), mapping a compact interval $[a,b]$ into the space of compact non-empty subsets of ${\mathbb R}^d$. All operators are adapted by…
We consider the class GM(2b) in pointwise estimate of the deviations in strong mean of almost periodic functions from matrix means of partial sums of their Fourier series.