Related papers: Approximation of analytic functions with prescribe…
We describe a procedure based on the iteration of an initial function by an appropriated operator, acting on continuous functions, in order to get a fixed point. This fixed point will be a calibrated subaction for the doubling map on the…
This paper studies and bounds the effects of approximating loss functions and credal sets on choice functions, under very weak assumptions. In particular, the credal set is assumed to be neither convex nor closed. The main result is that…
In this paper we will deal with problems in approximation theory of bounded analytic functions on the unit disc and their boundary behavior on the unit circle. We will attempt to unify two known such theorems to create a stronger theorem.…
In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…
Let $A$ be a square complex matrix; $z_1$, ..., $z_{N}\in\mathbb C$ be arbitrary (possibly repetitive) points of interpolation; $f$ be an analytic function defined on a neighborhood of the convex hull of the union of the spectrum…
We present an analytic approximation model for non-rigid point set registration, grounded in the multivariate Taylor expansion of vector-valued functions. By exploiting the algebraic structure of Taylor expansions, we construct a structured…
It has been known in potential theory that, for some kernels matrices corresponding to well-separated point sets, fast analytical low-rank approximation can be achieved via the use of proxy points. This proxy point method gives a…
In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
Given a bounded open subset $\Omega$ and closed subsets $A,B$ of $\mathbb{R}^k$, we discuss when an estimate $u(x)\le g(dist(x,A\cup B))$, $x\in\Omega\setminus(A\cup B)$, for a function $u$ subharmonic on $\Omega\setminus B$, implies that…
We study ROUND-UFP and ROUND-SAP, two generalizations of the classical BIN PACKING problem that correspond to the unsplittable flow problem on a path (UFP) and the storage allocation problem (SAP), respectively. We are given a path with…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
In this paper we establish a result on subextension of $m$-subharmonic functions in the class $\mathcal{F}_m(\Omega,f)$ without changing the hessian measures. As application, we approximate a $m$-subharmonic function with given boudary…
The squeezing problem on $\mathbb{C}$ can be stated as follows. Suppose that $\Omega$ is a multiply connected domain in the unit disk $\mathbb{D}$ containing the origin $z=0$. How far can the boundary of $\Omega$ be pushed from the origin…
This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to compact subsets of the real line, we develop good approximations of F, which can be computed efficiently.
Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, f \in\mathcal{A}(\bar{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…