Related papers: Polynomial Approximation and $\omega^r_\phi (f,t)$…
In the 1960s Cargo and Shisha proved some majorizations for the distance among quasi-arithmetic means (defined as f^{-1}(\sum_{i=1}^{n} w_i f(a_i) for any continuous, strictly monotone function f:I->R, where I is an interval, and…
The paper concerns the uniform polynomial approximation of a function $f$, continuous on the unit Euclidean sphere of ${\mathbb R}^3$ and known only at a finite number of points that are somehow uniformly distributed on the sphere. First we…
We extend the proximity technique of Solymosi and Zahl [J. Combin. Theory, Ser. A (2024)] to the setting of trivariate polynomials. In particular, we prove the following result: Let $f(x,y,z)=(x-y)^2+(\varphi(x)-z)^2$, where $\varphi(x)\in…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
Covariance pooling is a feature pooling method with good classification accuracy. Because covariance features consist of second-order statistics, the scale of the feature elements are varied. Therefore, normalizing covariance features using…
In this paper, a $k$-th generalized modulus of smoothness is defined based on an asymmetric operator of generalized translation and a theorem is proved about the coincidence of class of functions defined by this modulus and a class of…
If f is a smooth function on a Hodge manifold, we construct a canonical sequence of real algebraic functions that converge to f in the smooth topology. The definition of of the approximants is inspired by Berezin-Toeplitz quantization. The…
An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
The main purpose of the paper is to study sharp estimates of approximation of periodic functions in the H\"older spaces $H_p^{r,\alpha}$ for all $0<p\le\infty$ and $0<\alpha\le r$. By using modifications of the classical moduli of…
A fully implementable filtered polynomial approximation on spherical shells is considered. The method proposed is a quadrature-based version of a filtered polynomial approximation. The radial direction and the angular direction of the…
We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…
In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…
Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…
Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_q$ of $q$ elements. A polynomial in $\mathbb{F}_q[t]$ is called $m$-smooth (or $m$-friable) if all its irreducible factors are of degree at most $m$. In this…
We obtain the exact-order estimates for approximations by Fourier sums, best approximations and best orthogonal trigonometric approximations in metrics of spaces L_s, 1\leq s<\infty, of classes of 2\pi-periodic functions, whose…
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
An important question in the theory of approximate integration is to study the conditions on the nodes $x_{k,n}$ and weights $w_{k,n}$ that allow an estimate of the form $$ \sup_{f\in \mathcal{B}_\gamma}|\sum_k…
The article deals with the mixed modulus of smoothness of positive order and the best approximation by ''angle'' of functions from the Lorentz space $L_{p, \tau}(\mathbb{T}^{m})$. The properties of the mixed modulus of smoothness, the sharp…