Related papers: A Fourier continuation framework for high-order ap…
Approximations by Trefftz functions are rapidly gaining popularity in the numerical solution of boundary value problems of mathematical physics. By definition, these functions satisfy locally, in weak form, the underlying differential…
Convergence of diagonal Pad\'e approximants is studied for a class of functions which admit the integral representation $ {\mathfrak F}(\lambda)=r_1(\lambda)\int_{-1}^1\frac{td\sigma(t)}{t-\lambda}+r_2(\lambda), $ where $\sigma$ is a finite…
We consider the problem of approximating $[0,1]^{d}$-periodic functions by convolution with a scaled Gaussian kernel. We start by establishing convergence rates to functions from periodic Sobolev spaces and we show that the saturation rate…
We show how spectral filters can improve the convergence of numerical schemes which use discrete Hilbert transforms based on a sinc function expansion, and thus ultimately on the fast Fourier transform. This is relevant, for example, for…
We investigate numerically efficient approximations of eigenspaces associated to symmetric and general matrices. The eigenspaces are factored into a fixed number of fundamental components that can be efficiently manipulated (we consider…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
In the present article we study strong approximation of solutions of scalar stochastic differential equations (SDEs) with bounded and $\alpha$-H\"older continuous drift coefficient and constant diffusion coefficient at time point $1$.…
This article considers the extension of two-grid $hp$-version discontinuous Galerkin finite element methods for the numerical approximation of second-order quasilinear elliptic boundary value problems of monotone type to the case when…
In this work, we propose a novel formulation for the solution of partial differential equations using finite element methods on unfitted meshes. The proposed formulation relies on the discrete extension operator proposed in the aggregated…
On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…
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…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
In this work, we apply a semi-Lagrangian spectral method for the Vlasov-Poisson system, previously designed for periodic Fourier discretizations, by implementing Legendre polynomials and Hermite functions in the approximation of the…
Arbitrary high order numerical methods for time-harmonic acoustic scattering problems originally defined on unbounded domains are constructed. This is done by coupling recently developed high order local absorbing boundary conditions (ABCs)…
It is well-known that sparse grid algorithm has been widely accepted as an efficient tool to overcome the "curse of dimensionality" in some degree. In this note, we first give the error estimate of hyperbolic cross (HC) approximations with…
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…
Fractional order controllers become increasingly popular due to their versatility and superiority in various performance. However, the bottleneck in deploying these tools in practice is related to their analog or numerical implementation.…
Polynomial reproduction plays a relevant role in deriving error estimates for various approximation schemes. Local reproduction in a quasi-uniform setting is a significant factor in the estimation of error and the assessment of stability…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
Local meshless methods obtain higher convergence rates when RBF approximations are augmented with monomials up to a given order. If the order of the approximation method is spatially variable, the numerical solution is said to be p-refined.…