Related papers: On a general approach to some problems of approxim…

We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs executed before a common due date. By preprocessing and constructing an auxiliary…

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

In this paper, we first obtain a generalized integral identity for twice local differentiable functions. Then, using functions whose second derivatives in absolute value at certain powers are generalized s convex in the second sense, we…

This work introduces the use of the Koopman operator theory to generate approximate analytical solutions for the zonal harmonics problem of a satellite orbiting a non-spherical celestial body. Particularly, the solution proposed directly…

We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…

Modelling real world systems frequently requires the solution of systems of nonlinear equations. A number of approaches have been suggested and developed for this computational problem. However, it is also possible to attempt solutions…

We set up, at the abstract Hilbert space setting, the general question on when an inverse linear problem induced by an operator of Friedrichs type admits solutions belonging to (the closure of) the Krylov subspace associated to such…

In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…

In this paper an asymmetrical operator of generalised translation is introduced, the generalised modulus of smoothness is defined by its means and the direct and inverse theorems in approximation theory are proved for that modulus. ----- V…

We present Korovkin approximation theorems that incorporate summability methods. These result allows us to obtain a unified treatment of several previous results, focusing on the underlying structure and the properties that a summability…

We present a general framework for studying regularized estimators; such estimators are pervasive in estimation problems wherein "plug-in" type estimators are either ill-defined or ill-behaved. Within this framework, we derive, under…

We present methods for approximating the mapping that defines the invariant manifold for two systems exhibiting generalized synchronization. If the equations of motion are known then an analytic approximation to the mapping can be found. If…

Partially observable Markov decision processes (POMDPs) are a natural model for planning problems where effects of actions are nondeterministic and the state of the world is not completely observable. It is difficult to solve POMDPs…

Approximation theory is a substantial field of mathematical analysis that emerged in the 19th century and has been developed by mathematicians across the globe ever since. Its importance has increased over time, as it provides solutions to…

We study the convergence of these operators in a weighted space of functions on a positive semi-axis and estimate the approximation by using a new type of weighted modulus of continuity and error estimation.

One of the basic principles of Approximation Theory is that the quality of approximations increase with the smoothness of the function to be approximated. Functions that are smooth in certain subdomains will have good approximations in…

This paper presents a universal numerical scheme tailored for tackling linear integral, integro-differential, and both initial and boundary value problems of ordinary differential equations. The numerical scheme is readily adapted for…

The ostrowski inequality expresses bounds on the deviation of a function from its integral mean. The aim of this paper is to establish a new inequality using weight function which generalizes the inequalities of Dragomir, Wang and Cerone…

Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the…