Related papers: Characterization of approximation schemes satisfyi…
There are many results on the simultaneous approximation by sequences of special positive linear operators. In the year 1978, Ismail and May as well as Volkov independently studied operators of exponential type covering the most classical…
The main object of this paper is to construct a new genuine Bernstein-Durrmeyer type operators which have better features than the classical one. Some direct estimates for the modified genuine Bernstein-Durrmeyer operator by means of the…
A mathematical proposition with a trainable pair, operator and quantum circuit, are introduced to approximate functions expressed as cubic Taylor polynomials, numerical simulations illustrate three cases.
We study the problem of approximating the level set of an unknown function by sequentially querying its values. We introduce a family of algorithms called Bisect and Approximate through which we reduce the level set approximation problem to…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…
Recent analysis of classical algorithms resulted in their axiomatization as transition systems satisfying some simple postulates, and in the formulation of the Abstract State Machine Theorem, which assures us that any classical algorithm…
In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several…
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous…
We investigate the classes of functions whose minimization diagrams can be approximated efficiently in \Re^d. We present a general framework and a data-structure that can be used to approximate the minimization diagram of such functions.…
We propose a novel and efficient algorithm for the collaborative preference completion problem, which involves jointly estimating individualized rankings for a set of entities over a shared set of items, based on a limited number of…
This survey paper contains a detailed self-contained introduction to Korovkin-type theorems and to some of their applications concerning the approximation of continuous functions as well as of L^p-functions, by means of positive linear…
We study periodic approximations of aperiodic Schr\"odinger operators on lattices in Lie groups with dilation structure. The potentials arise through symbolic substitution systems that have been recently introduced in this setting. We…
In this paper, we study a strong inverse approximation theorem and saturation order for the family of Kantorovich exponential sampling operators. The class of log-uniformly continuous and bounded functions, and class of log-H\"{o}lderian…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
In this paper, we propose and study a new semi-random model for graph partitioning problems. We believe that it captures many properties of real--world instances. The model is more flexible than the semi-random model of Feige and Kilian and…
The problem of explaining the behavior of deep neural networks has recently gained a lot of attention. While several attribution methods have been proposed, most come without strong theoretical foundations, which raises questions about…
We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals of the signature of…
In this short communication I generalize the method of obtaining quasi-Feynman formulas described in my previous paper on that topic. The theorem presented allows to obtain the solution to the Cauchy problem for the Schr\"odinger equation…