Related papers: Korovkin-type approximation results through summab…
In this article, we analyze the approximation properties of the new family of Durrmeyer type exponential sampling operators. We derive the point-wise and uniform approximation theorem and Voronovskaya type theorem for these generalized…
We consider solving nonconvex composite optimization problems in which the sum of a smooth function and a nonsmooth function is minimized. Many of convergence analyses of proximal gradient-type methods rely on global descent property…
The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
This paper investigates summability principles for multilinear summing operators. The main result presents a novel inclusion theorem for a class of summing operators, which generalizes several classical results. As applications, we derive…
If $\omega_t > \beta$ for every $t \in \mathbb{N}$ and for some $\beta > 0$, then the sequence $\{\omega_t\}_{t \in \mathbb{N}}$ represents a weighted sequence of real numbers. In this article, we primarily introduce the concepts of rough…
Randomized orthogonal projection methods (ROPMs) can be used to speed up the computation of Krylov subspace methods in various contexts. Through a theoretical and numerical investigation, we establish that these methods produce…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
In this paper we introduce the Stancu type generalization of the q-Bernstein-Schurer-Kantorovich operators and examine their approximation properties. We investigate the convergence of our operators with the help of the Korovkin's…
In this paper we prove Korovkin type theorem for iterates of general positive linear operators $T:C\left[ 0,1\right] \rightarrow C\left[ 0,1\right] $ and derive quantitative estimates in terms of modulus of smoothness. In particular, we…
We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…
In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which $s$-variate problems can be approximated to within $\varepsilon$ by using, say, polynomially many in $s$…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…
In this paper we extend the classical Korovkin theorems to the framework of comonotone additive, sublinear and monotone operators. Based on the theory of Choquet capacities, several concrete examples illustrating our results are also…
The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…
We overview results on the topic of Poisson approximation that are missed in existing surveys. The topic of Poisson approximation to the distribution of a sum of integer-valued random variables is presented as well. We do not restrict…
A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. The method is provably effective but not practical, so the applications involve heuristic approximations. Perhaps…
The purpose of this paper is to construct a bivariate generalization of new family of Kantorovich type sampling operators $(K_w^{\varphi}f)_{w>0}.$ First, we give the pointwise convergence theorem and a Voronovskaja type theorem for these…
Low-rank Krylov methods are one of the few options available in the literature to address the numerical solution of large-scale general linear matrix equations. These routines amount to well-known Krylov schemes that have been equipped with…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…