Related papers: Polynomial approximation of piecewise analytic fun…

We consider the problem of finding the best harmonic or analytic approximant to a given function. We discuss when the best approximant is unique, and what regularity properties the best approximant inherits from the original function. All…

Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…

Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic…

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…

In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

A function $f$ is arc-smooth if the composite $f\circ c$ with every smooth curve $c$ in its domain of definition is smooth. On open sets in smooth manifolds the arc-smooth functions are precisely the smooth functions by a classical theorem…

We present a method for constructing global analytical expressions that approximate a function over its entire range. These approximations not only mirror the original function as accurately as desired, but are purposefully created to…

We present the class of semi-admissible subsets of an open Riemann surface on which Carleman approximation by non-critical holomorphic functions is possible. In particular we characterize closed sets with empty interior on which continuous…

It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…

The piecewise-concave function may be used to approximate a wide range of other functions to arbitrary precision over a bounded set. In this short paper, this property is proven for three function classes: (a) the multivariate twice…

We investigate asymptotic polynomial approximation for a class of weighted Bloch functions in the unit disc. Our main result is a structural theorem on asymptotic polynomial approximation in the unit disc, in the flavor of the classical…

In the present paper, we discuss several basic properties of a class of quasiconformal close-to-convex harmonic mappings with starlike analytic part, such results as coefficient inequalities, an integral representation, a growth theorem, an…

We characterize precisely the possible rate of decay of the anti-analytic half of a trigonometric series converging to zero almost everywhere.

Let $X$ be a Banach holomorphic function space on the unit disk. A linear polynomial approximation scheme for $X$ is a sequence of bounded linear operators $T_n:X\to X$ with the property that, for each $f\in X$, the functions $T_n(f)$ are…

In previous works, an approach to the study of cyclic functions in reproducing kernel Hilbert spaces has been presented, based on the study of so called \emph{optimal polynomial approximants}. In the present article, we extend such approach…

In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…

We show that $C^0$-fine approximation of convex functions by smooth (or real analytic) convex functions on $\R^d$ is possible in general if and only if $d=1$. Nevertheless, for $d\geq 2$ we give a characterization of the class of convex…

We determine the most general form of a smooth function on Young diagrams, that is, a polynomial in the interlacing or multirectangular coordinates whose value depends only on the shape of the diagram. We prove that the algebra of such…