Related papers: Approximation by linear methods of classes of $(\p…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…

In the paper we consider the problem of multivariate function approximation in polynomial basis. In order to solve this problem, we adjust the least squares method (LSM) by adding information about derivatives of the function. This…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

In the first part of this paper we introduced an algorithm that uses reachable set approximation to approximate the minimum time function of linear control problems. To illustrate the error estimates and to demonstrate differences to other…

This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

We develop a wavelet like representation of functions in $L^p(\mathbb{R})$ based on their Fourier--Hermite coefficients; i.e., we describe an expansion of such functions where the local behavior of the terms characterize completely the…

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

The present paper is devoted to construction of an optimal quadrature formula for approximation of Fourier integrals in the Hilbert space $W_2^{(1,0)}[a,b]$ of non-periodic, complex valued functions. Here the quadrature sum consists of…

We give a class of Fourier multipliers with non-symmetric symbols and explicit norm bounds on $L^p$ spaces by using the stochastic calculus of L\'evy processes and Burkholder-Wang estimates for differentially subordinate martingales.

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…

If we cannot obtain all terms of a series, or if we cannot sum up a series, we have to turn to the partial sum approximation which approximate a function by the first several terms of the series. However, the partial sum approximation often…

We consider the problem of approximation of matrix functions of class $L^p$ on the unit circle by matrix functions analytic in the unit disk in the norm of $L^p$, $2\le p<\be$. For an $m\times n$ matrix function $\Phi$ in $L^p$, we consider…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Based on Stein's method, we derive upper bounds for Poisson process approximation in the $L_1$-Wasserstein metric $d_2^{(p)}$, which is based on a slightly adapted $L_p$-Wasserstein metric between point measures. For the case $p=1$, this…

In this paper, we answer a question of Cai-Hambrook in (arXiv$\colon$ 2403.19410). Furthermore, we compute the Fourier dimension of the multiplicative $\psi$-well approximable set $$M_2^{\times}(\psi)=\left\{(x_1,x_2)\in [0,1]^{2}\colon…