Related papers: Multivariate exact and falsified sampling approxim…
In this paper, we consider estimators for an additive functional of $\phi$, which is defined as $\theta(P;\phi)=\sum_{i=1}^k\phi(p_i)$, from $n$ i.i.d. random samples drawn from a discrete distribution $P=(p_1,...,p_k)$ with alphabet size…
We consider a signal reconstruction problem for signals $F$ of the form $ F(x)=\sum_{j=1}^{d}a_{j}\delta\left(x-x_{j}\right),$ from their moments $m_k(F)=\int x^kF(x)dx.$ We assume $m_k(F)$ to be known for $k=0,1,\ldots,N,$ with an absolute…
We obtain approximation formulas for fractional integrals and derivatives of Riemann-Liouville and Marchaud types with a variable fractional order. The approximations involve integer-order derivatives only. An estimation for the error is…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
The problem of extrapolation and interpolation of asymptotic series is considered. Several new variants of improving the accuracy of the self-similar approximants are suggested. The methods are illustrated by examples typical of chemical…
This paper addresses a problem of estimating an additive functional given $n$ i.i.d. samples drawn from a discrete distribution $P=(p_1,...,p_k)$ with alphabet size $k$. The additive functional is defined as…
We consider the problem of evaluating the cumulative distribution function (CDF) of the sum of order statistics, which serves to compute outage probability (OP) values at the output of generalized selection combining receivers. Generally,…
Approximations of non-smooth multivariate functions return low-order approximations in the vicinities of the singularities. Most prior works solve this problem for univariate functions. In this work we introduce a method for approximating…
Approximative properties of linear summation methods of Fourier series are considered in the Orlicz type spaces ${\mathcal S}_{M}$. In particular, in terms of approximations by such methods, constructive characteristics are obtained for…
The first order loss function and its complementary function are extensively used in practical settings. When the random variable of interest is normally distributed, the first order loss function can be easily expressed in terms of the…
In this paper we study direct and inverse approximation inequalities in $L^{p}(\mathbb{R}^{d})$, $1<p<\infty$, with the Dunkl weight. We obtain these estimates in their sharp form substantially improving previous results. We also establish…
The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…
Let $\bx_j = \btheta +\bep_j, j=1,...,n$, be observations of an unknown parameter $\btheta$ in a Euclidean or separable Hilbert space $\scrH$, where $\bep_j$ are noises as random elements in $\scrH$ from a general distribution. We study the…
In Musilak-Orlicz type spaces ${\mathcal S}_{\bf M}$, direct and inverse approximation theorems are obtained in terms of the best approximations of functions and generalized moduli of smoothness. The question of the exact constants in…
Let $\Gamma$ be a crystal group in $\mathbb R^d$. A function $\varphi:\mathbb R^d\longrightarrow \mathbb C$ is said to be {\em crystal-refinable} (or $\Gamma-$refinable) if it is a linear combination of finitely many of the rescaled and…
Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…
We study the problem of estimating the value of a known smooth function $f$ at an unknown point $\boldsymbol{\mu} \in \mathbb{R}^n$, where each component $\mu_i$ can be sampled via a noisy oracle. Sampling more frequently components of…
This paper proposes a novel localized Fourier extension method for approximating non-periodic functions via domain segmentation. By partitioning the computational domain into subregions with uniform discretization scales, the method…
Real data are constrained to finite sampling rates, which calls for a suitable mathematical description of the corrections to the finite-time estimations of the dynamic equations. Often in the literature, lower order discrete time…
In this paper we focus on the linear functionals defining an approximate version of the gradient of a function. These functionals are often used when dealing with optimization problems where the computation of the gradient of the objective…