Related papers: Incomplete Pad\'e approximation and convergence of…

Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…

There are several kinds of universal Taylor series. In one such kind the universal approximation is required at every boundary point of the domain of definition $\OO$ of the universal function $f$. In another kind the universal…

The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…

Type I Hermite--Pad\'e polynomials for a set of functions $f_0, f_1, ..., f_s$ at infinity, $Q_{n,0}$, $Q_{n,1}$, ..., $Q_{n,s}$, is defined by the asymptotic condition $$…

Authors introduce the concept of harmonically $(s,m)$-convex functions in second sense in \cite{II}.In this article, we establish some Hermite-Hadamard type inequalities of this class of functions.

Present work contains a method to obtain Jackson and Stechkin type inequalities of approximation by integral functions of finite degree (IFFD) in some variable exponent Lebesgue space of real functions defined on $\boldsymbol{R}:=\left(…

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 develop a general, functional calculus approach to approximation of $C_0$-semigroups on Banach spaces by bounded completely monotone functions of their generators. The approach comprises most of well-known approximation formulas, yields…

It is well-known that the left term of the classical Hermite-Hadamard inequality is closer to the integral mean value than the right one. We show that in the multivariate case it is not true. Moreover, we introduce some related inequality…

We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Pad\'e approximation problem in [Van Barel and…

We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…

A sequence of approximations for the determinant and its logarithm of a complex matrixis derived, along with relative error bounds. The determinant approximations are derived from expansions of det(X)=exp(trace(log(X))), and they apply to…

Function approximation and recovery via some sampled data have long been studied in a wide array of applied mathematics and statistics fields. Analytic tools, such as the Poincar\'e inequality, have been handy for estimating the…

We consider the problem of under and over-approximating the image of general vector-valued functions over bounded sets, and apply the proposed solution to the estimation of reachable sets of uncertain non-linear discrete-time dynamical…

It is well known that approximation of functions on $[0,1]$ whose periodic extension is not continuous fail to converge uniformly due to rapid Gibbs oscillations near the boundary. Among several approaches that have been proposed toward the…

We explain that, like the usual Pad\'e approximants, the barycentric Pad\'e approximants proposed recently by Brezinski and Redivo-Zaglia can diverge. More precisely, we show that for every polynomial P there exists a power series S, with…

This work extends the Mond-Pecaric method to functions with multiple operators as arguments by providing arbitrarily close approximations of the original functions. Instead of using linear functions to establish lower and upper bounds for…

We introduce the concept of inexact first-order oracle of degree q for a possibly nonconvex and nonsmooth function, which naturally appears in the context of approximate gradient, weak level of smoothness and other situations. Our…

In this paper, we describe two novel changes to the Baskakov-Durrmeyer operators that improve their approximation performance. These improvements are especially designed to produce higher rates of convergence, with orders of one or two.…