English
Related papers

Related papers: A survey on the Weierstrass approximation theorem

200 papers

Given an o-minimal structure expanding the field of reals, we show a piecewise Weierstrass preparation theorem and a piecewise Weierstrass division theorem for definable holomorphic functions. In the semialgebraic setting and for the…

Complex Variables · Mathematics 2016-10-13 Tobias Kaiser

On any metric space, I provide an intrinsic characterization of those complex-valued functions which are uniform limits of Lipschitz functions. There are applications to function theory on complete Riemannian manifolds and, in particular,…

Functional Analysis · Mathematics 2021-05-18 L. A. Coburn

We introduce so-called functional input neural networks defined on a possibly infinite dimensional weighted space with values also in a possibly infinite dimensional output space. To this end, we use an additive family to map the input…

Machine Learning · Statistics 2025-12-03 Christa Cuchiero , Philipp Schmocker , Josef Teichmann

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Machine Learning · Computer Science 2026-02-04 Andrey Krylov , Maksim Penkin

Using results from theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction…

Complex Variables · Mathematics 2023-06-27 Daniel Alpay , Tirthankar Bhattacharyya , Abhay Jindal , Poornendu Kumar

In this paper we introduce appropriate associated function to the sequence $M_p=p^{\t p^{\s}}$, $p\in \N$, $\t>0$, $\s>1$, and derive its sharp asymptotic estimates in terms of the Lambert $W$ function. These estimates are used to prove a…

Functional Analysis · Mathematics 2019-01-04 Stevan Pilipović , Nenad Teofanov , Filip Tomić

Adapted pairs and Weierstrass sections are central to the invariant theory associated to the action of an algebraic Lie algebra a on a finite dimensional vector space X. In this a need not be a semisimple Lie algebra. Here their general…

Representation Theory · Mathematics 2015-03-10 Florence Fauquant-Millet , Anthony Joseph

We use weighted polynomial approximation to prove the existence of a compact set K with non-empty interior and a function f is dense in the space A(K) of all continuous functions on K that are holomorphic in the interior of K, endowed with…

Complex Variables · Mathematics 2025-06-26 Stéphane Charpentier , Konstantinos Maronikolakis

Kyurkchiev and Andreev (1985) constructed an infinite sequence of Weierstrass-type iterative methods for approximating all zeros of a polynomial simultaneously. The first member of this sequence of iterative methods is the famous method of…

Numerical Analysis · Mathematics 2015-08-21 Petko D. Proinov , Maria T. Vasileva

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

Numerical Analysis · Mathematics 2007-10-02 Garret Sobczyk

We investigate properties of holomorphic extensions in the one-variable case of Whitney's Approximation Theorem on intervals. Improving a result of Gauthier-Kienzle, we construct tangentially approximating functions which extend…

Complex Variables · Mathematics 2025-08-28 Matthias Aschenbrenner

We introduce a concept of a quasi proximate order which is a generalization of a proximate order and allows us to study efficiently analytic functions whose order and lower order of growth are different. We prove an existence theorem of a…

Complex Variables · Mathematics 2020-07-17 Igor Chyzhykov , Petro Filevych , Jouni Rättyä

Many practical problems need the output of a machine learning model to satisfy a set of constraints, $K$. Nevertheless, there is no known guarantee that classical neural network architectures can exactly encode constraints while…

Machine Learning · Computer Science 2022-02-10 Anastasis Kratsios , Behnoosh Zamanlooy , Tianlin Liu , Ivan Dokmanić

Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…

Number Theory · Mathematics 2022-02-25 Dmitry Kleinbock , Anurag Rao

In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…

Chaotic Dynamics · Physics 2014-08-20 Marius-F. Danca

We prove Schlichting's theorem for approximate subgroups: if $\mathcal{X}$ is a uniform family of commensurable approximate subgroups in some ambient group, then there exists an invariant approximate subgroup commensurable with…

Group Theory · Mathematics 2020-07-21 Tingxiang Zou

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

Classical Analysis and ODEs · Mathematics 2013-04-03 Alexander Olevskii , Alexander Ulanovskii

Approximation of entire functions by their pad\'e approximants has been examined in the past. It is true that generically such an approximation holds. However, examining this problem from another viewpoint, we obtain stronger generic…

Complex Variables · Mathematics 2011-05-17 G. Fournodavlos

We give a general version of Bryc's theorem valid on any topological space and with any algebra $\mathcal{A}$ of real-valued continuous functions separating the points, or any well-separating class. In absence of exponential tightness, and…

Probability · Mathematics 2015-12-04 Henri Comman

1-Lipschitz neural networks are fundamental for generative modelling, inverse problems, and robust classifiers. In this paper, we focus on 1-Lipschitz residual networks (ResNets) based on explicit Euler steps of negative gradient flows and…

Machine Learning · Computer Science 2025-10-14 Davide Murari , Takashi Furuya , Carola-Bibiane Schönlieb