Related papers: Polynomial approximation in slice regular Fock spa…
We calculate the least upper bounds of pointwise and uniform approximations for classes of $2\pi$-periodic functions expressible as convolutions of an arbitrary square summable kernel with functions, which belong to the unit ball of the…
Approximation by polynomials on a triangle is studied in the Sobolev space $W_2^r$ that consists of functions whose derivatives of up to $r$-th order have bounded $L^2$ norm. The first part aims at understanding the orthogonal structure in…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…
In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…
In this paper, we introduce Kondratiev spaces of fractional smoothness based on their close relation to refined localization spaces. Moreover, we investigate relations to other approaches leading to extensions of the scale of Kondratiev…
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 study multivariate integration and approximation for functions belonging to a weighted reproducing kernel Hilbert space based on half-period cosine functions in the worst-case setting. The weights in the norm of the function space depend…
It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…
In this paper, we lay the foundations of the theory of slice regular functions in several variables ranging in any real alternative $^*$-algebra, including quaternions, octonions and Clifford algebras. This theory is an extension of the…
This review paper highlights the main aspects of the development of research related to the solution of extreme problems in the theory of approximation in the spaces ${\mathcal S}^p$ and $B{\mathcal S}^p$ of periodic and almost periodic…
We propose novel smooth approximations to the classical rounding function, suitable for differentiable optimization and machine learning applications. Our constructions are based on two approaches: (1) localized sigmoid window functions…
We investigate the density of square-free values of polynomials with large coefficients over the rational function field $\mathbb{F}_q[t]$. Some interesting questions answered as special cases of our results include the density of…
For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…
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…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We develop a discrete extension operator for trimmed spline spaces consisting of piecewise polynomial functions of degree $p$ with $k$ continuous derivatives. The construction is based on polynomial extension from neighboring elements…
We make the case for neural network objects and extend an already existing neural network calculus explained in detail in Chapter 2 on \cite{bigbook}. Our aim will be to show that, yes, indeed, it makes sense to talk about neural network…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…