相关论文: The Fourier expansion approximation for high-accur…
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…
Fourier extensions have been shown to be an effective means for the approximation of smooth, nonperiodic functions on bounded intervals given their values on an equispaced, or in general, scattered grid. Related to this method are two…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…
Recently, the butterfly approximation scheme and hierarchical approximations have been proposed for the efficient computation of integral transforms with oscillatory and with asymptotically smooth kernels. Combining both approaches, we…
In this paper it is proposed a very simple method for estimating the maximal operator in $L_1$. Using this method one can considerably improve the existing theorems on convergence almost-everywhere of eigenfunction expansions of an…
Several construction methods for rational approximations to functions of one real variable are described in the present paper; the computational results that characterize the comparative accuracy of these methods are presented; an effect of…
A new uniform asymptotic expansion for the incomplete gamma function $\Gamma(a,z)$ valid for large values of $z$ was given by the author in {\it J. Comput. Appl. Math.} {\bf 148} (2002) 323--339. This expansion contains a complementary…
We present a practical framework to prove, in a simple way, two-terms asymptotic expansions for Fourier integrals $$ {\mathcal I}(t) = \int_{\mathbb R}({\rm e}^{it\phi(x)}-1) {\rm d} \mu(x) $$ where $\mu$ is a probability measure on…
Basis Function (BF) expansions are a cornerstone of any engineer's toolbox for computational function approximation which shares connections with both neural networks and Gaussian processes. Even though BF expansions are an intuitive and…
A numerical recipe is given for obtaining the density image of an initially compact quantum mechanical wavefunction that has expanded by a large but finite factor under free flight. The recipe given avoids the memory storage problems that…
We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…
We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…
This paper proposes a unique optimization approach for estimating the minimax rational approximation and its application for evaluating matrix functions. Our method enables the extension to generalized rational approximations and has the…
We present a new combinatorial approach to the computation of the (real) Fourier expansions of $\cos^n(t)$ and $\sin^n(t)$, where $n\geq 1$ is an integer. As an application, we compute the Fourier expansions of $f(t)=\frac{1}{a-\cos t}$ and…
We consider a method for the approximation of iterated stochastic integrals of arbitrary multiplicity $k$ $(k\in \mathbb{N})$ with respect to the infinite-dimensional $Q$-Wiener process using the mean-square approximation method of iterated…
For any pair $(X,Z)$ of correlated random variables we can think of $Z$ as a randomized function of $X$. Provided that $Z$ is short, one can make this function computationally efficient by allowing it to be only approximately correct. In…
In this paper, we propose a numerical method of computing an integral whose integrand is a slowly decaying oscillatory function. In the proposed method, we consider a complex analytic function in the upper-half complex plane, which is…
Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for…
We investigate the rational approximation of fractional powers of unbounded positive operators attainable with a specific integral representation of the operator function. We provide accurate error bounds by exploiting classical results in…
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…