English
Related papers

Related papers: Approximation schemes satisfying Shapiro's Theorem

200 papers

The standard theory of stochastic approximation (SA) is extended to the case when the constraint set is a Riemannian manifold. Specifically, the standard ODE method for analyzing SA schemes is extended to iterations constrained to stay on a…

Optimization and Control · Mathematics 2017-11-30 Suhail M. Shah

We develop a unified framework for nonlinear subdivision schemes on complete metric spaces (CMS). We begin with CMS preliminaries and formalize refinement in CMS, retaining key structural properties, such as locality. We prove a convergence…

Numerical Analysis · Mathematics 2025-09-11 Nira Dyn , Nir Sharon

The problem of the approximation of convolutions by accompanying laws in the scheme of series satisfying the infinitesimality condition is considered. It is shown that the quality of approximation depends essentially on the choice of…

Probability · Mathematics 2022-08-04 A. Yu. Zaitsev

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…

Classical Analysis and ODEs · Mathematics 2007-05-23 Allan Pinkus

Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…

Algebraic Topology · Mathematics 2016-02-01 Jonathan Jaquette , Miroslav Kramár

Let $k$ be a number field and $X$ a smooth integral affine variety equipped with a morphism $f : X \to A^1_k$ to the affine line. Assume that all fibres of $f$ are split, for instance that they are geometrically integral. Assume that the…

Number Theory · Mathematics 2013-07-17 Jean-Louis Colliot-Thélène , David Harari

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

This paper studies the bounded approximation property (BAP) in quasi Banach spaces. In the first part of the paper we show that the kernel of any surjective operator $\ell_p\to X$ has the BAP when $X$ has it and $0<p\leq 1$, which is an…

Functional Analysis · Mathematics 2018-08-10 Félix Cabello Sánchez , Jesús M. F. Castillo , Yolanda Moreno

Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…

Data Structures and Algorithms · Computer Science 2020-10-28 Karl Bringmann , Vasileios Nakos

We construct a nonseparable Banach space $\mathcal X$ (actually, of density continuum) such that any uncountable subset $\mathcal Y$ of the unit sphere of $\mathcal X$ contains uncountably many points distant by less than $1$ (in fact, by…

Functional Analysis · Mathematics 2021-06-09 Piotr Koszmider

We study two types of approximations of Lipschitz maps with derivatives of maximal slopes on Banach spaces. First, we characterize the Radon-Nikod\'ym property in terms of strongly norm attaining Lipschitz maps and maximal derivative…

Functional Analysis · Mathematics 2024-10-23 Geunsu Choi

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…

Functional Analysis · Mathematics 2018-07-10 A. Gomilko , S. Kosowicz , Yu. Tomilov

The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes $a_1,..., a_n$ in $(0,1]$. Using uniform sampling, which selects a random element from the input list each time, we develop a…

Computational Complexity · Computer Science 2011-02-25 Richard Beigel , Bin Fu

There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a $(1+\epsilon)$-approximation solution for every $\epsilon > 0$, but the running time…

Data Structures and Algorithms · Computer Science 2021-07-30 Sebastian Berndt , Max A. Deppert , Klaus Jansen , Lars Rohwedder

Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…

General Mathematics · Mathematics 2015-02-24 M. Abo-Elhamayel

In his article "Arithmetic Fujita Approximations", Huayi Chen introduces the notion of an approximable graded algebra and asks if any such algebra is a subalgebra of the graded section ring of a big line bundle on an algebraic variety. We…

Algebraic Geometry · Mathematics 2017-03-07 Catriona Maclean

Given a set $F$ of $n$ positive functions over a ground set $X$, we consider the problem of computing $x^*$ that minimizes the expression $\sum_{f\in F}f(x)$, over $x\in X$. A typical application is \emph{shape fitting}, where we wish to…

Machine Learning · Computer Science 2016-05-31 Dan Feldman , Michael Langberg

A primitive multiple scheme is a complex Cohen-Macaulay scheme $Y$ such that the associated reduced scheme $X=Y_{red}$ is smooth, irreducible, and that $Y$ can be locally embedded in a smooth variety of dimension $\dim(X)+1$. If $n$ is the…

Algebraic Geometry · Mathematics 2023-06-29 Jean--Marc Drézet

Based on the superconvergent approximation at some point (depending on the fractional order $\alpha$, but not belonging to the mesh points) for Gr\"{u}nwald discretization to fractional derivative, we develop a series of high order…

Numerical Analysis · Mathematics 2015-07-30 Lijing Zhao , Weihua Deng

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Complex Variables · Mathematics 2012-07-24 Anton Baranov , Harald Woracek