Related papers: Generic Approximation of functions by their pad\'{…
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…
A broader definition of generalized truncations of graphs is introduced followed by an exploration of some standard concepts and parameters with regard to generalized truncations.
First we establish some generic universalities for Pad\'{e} approximants in the closure $X^\infty(\OO)$ in $A^\infty(\OO)$ of all rational functions with poles off $\oO$, the closure taken in $\C$ of the domain $\OO\subset\C$.\ Next we give…
Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on 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…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
We study the convergence of type I Hermite-Pad\'e approximation for a class of meromorphic functions obtained by adding a vector of rational functions with real coefficients to a Nikishin system of functions.
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
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…
We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…
It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…
Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…
We develop an approximation theory in Hilbert spaces that generalizes the classical theory of approximation by entire functions of exponential type. The results advance harmonic analysis on manifolds and graphs, thus facilitating data…
Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…
This article develops an approximate proximal approach for the generalized method of lines. The present results are extensions and applications of previous ones which have been published since 2011, in books and articles such as [3,4,5,6].…
Approximation theory of entire functions has been used to demonstrate the construction of a map on $\mathbb{C}\times\mathbb{R}$ having wandering domains. We also present suitable modification to this construction that helps in obtaining…
We establish that a generalized H\"{o}lder continuous function on an $(m-2)$-Ahlfors regular compact set in $\mathbb{R}^m$ can be approximated by solutions of an elliptic equation, with the rate of approximation determined by the continuity…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…