Related papers: A Fourier continuation framework for high-order ap…
In this paper, we are interested in the reiterated homogenization of linear elliptic equations of the form $-\frac{\partial}{\partial x_{i}} \left(a_{i j} \left(\frac{x}{\varepsilon}, \frac{x}{\varepsilon^{2}}\right) \frac{\partial…
Given a graphical model (GM), computing its partition function is the most essential inference task, but it is computationally intractable in general. To address the issue, iterative approximation algorithms exploring certain local…
Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…
We first consider the problem of approximating a few eigenvalues of a rational matrix-valued function closest to a prescribed target. It is assumed that the proper rational part of the rational matrix-valued function is expressed in the…
In the present work, the notion of Cubic Spline Super Fractal Interpolation Function (SFIF) is introduced to simulate an object that depicts one structure embedded into another and its approximation properties are investigated. It is shown…
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…
In this paper we propose an approximation method for high-dimensional $1$-periodic functions based on the multivariate ANOVA decomposition. We provide an analysis on the classical ANOVA decomposition on the torus and prove some important…
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range…
A multidimesional function $y(\vec r)$ defined by a sample of points $\{\vec r_i,y_i\}$ is approximated by a differentiable function $\widetilde y(\vec r)$. The problem is solved by using the Gauss-Hermite folding method developed in the…
Truncating the Fourier transform averaged by means of a generalized Hausdorff operator, we approximate the adjoint to that Hausdorff operator of the given function. We find the formulas for the rate of approximation in various metrics in…
Based on the superconvergent approximation at some point (depending on the fractional order $\alpha$, but not belonging to the mesh points) for Gr\"{u}nwald discretization to fractional derivative, we develop a series of high order…
Hermite polynomials and functions have extensive applications in scientific and engineering problems. Although it is recognized that employing the scaled Hermite functions rather than the standard ones can remarkably enhance the…
This paper presents a fast "two-dimensional Fourier Continuation" (2D-FC) method for the construction of biperiodic extensions of smooth, non-periodic functions defined over general two-dimensional (2D) domains, including domains with…
This paper constructs adaptive sparse grid collocation method onto arbitrary order piecewise polynomial space. The sparse grid method is a popular technique for high dimensional problems, and the associated collocation method has been well…
In this paper, we relate the framework of mod-$\phi$ convergence to the construction of approximation schemes for lattice-distributed random variables. The point of view taken here is that of Fourier analysis in the Wiener algebra, allowing…
In this paper, we attempt to compare two distinct branches of research on second-order optimization methods. The first one studies self-concordant functions and barriers, the main assumption being that the third derivative of the objective…
In this paper, we analyze a function space consisting of functions for which both the function and its Fourier transform exhibit Gaussian decay together with exponential growth governed by suitable weight functions. First, we examine…
Fast Fourier Transform (FFT)-based solvers for the Poisson equation are highly efficient, exhibiting $O(N\log N)$ computational complexity and excellent parallelism. However, their application is typically restricted to simple, regular…
The paper presents a general strategy to solve ordinary differential equations (ODE), where some coefficient depend on the spatial variable and on additional random variables. The approach is based on the application of a recently developed…
In previous articles, we showed that, based on large-order asymptotic behavior, one can approximate a divergent series via the parametrization of a specific hypergeometric approximant. The analytical continuation is then carried out through…