English
Related papers

Related papers: Polynomial approximation of piecewise analytic fun…

200 papers

We consider a hierarchy of upper approximations for the minimization of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$ proposed recently by Lasserre (arXiv:1907.097784, 2019). This hierarchy relies on using the push-forward…

Optimization and Control · Mathematics 2020-12-04 Lucas Slot , Monique Laurent

We consider approximations of a continuous function on a countable normed Fr\'{e}chet space by analytic and $*$-analytic. Also we found a criterium of the existence of an extension of a continuous function from a dense subspace of a…

Functional Analysis · Mathematics 2015-05-01 M. A. Mytrofanov , A. V. Ravsky

We study quasi-Monte Carlo (QMC) integration over the multi-dimensional unit cube in several weighted function spaces with different smoothness classes. We consider approximating the integral of a function by the median of several integral…

Numerical Analysis · Mathematics 2024-02-20 Takashi Goda , Kosuke Suzuki , Makoto Matsumoto

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.

Complex Variables · Mathematics 2020-10-05 Marcin Bilski , Peter Scheiblechner

A soft-max function has two main efficiency measures: (1) approximation - which corresponds to how well it approximates the maximum function, (2) smoothness - which shows how sensitive it is to changes of its input. Our goal is to identify…

Machine Learning · Computer Science 2026-01-01 Alessandro Epasto , Mohammad Mahdian , Vahab Mirrokni , Manolis Zampetakis

By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…

Algebraic Geometry · Mathematics 2015-10-16 Qile Chen , Yi Zhu

This paper presents some results on a well-known problem in Algebraic Signal Sampling and in other areas of applied mathematics: reconstruction of piecewise-smooth functions from their integral measurements (like moments, Fourier…

Classical Analysis and ODEs · Mathematics 2009-01-30 Dima Batenkov , Niv Sarig , Yosef Yomdin

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

Numerical Analysis · Mathematics 2023-11-08 Ben Adcock , Simone Brugiapaglia , Nick Dexter , Sebastian Moraga

This paper is concerned with the study of a class of nonsmooth cost functions subject to a quasi-linear PDE in Lipschitz domains in dimension two. We derive the Eulerian semi-derivative of the cost function by employing the averaged adjoint…

Optimization and Control · Mathematics 2016-04-05 Kevin Sturm

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2016-02-17 Yurii Kolomoitsev , Tetiana Lomako , Jürgen Prestin

Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…

Optimization and Control · Mathematics 2015-05-13 Didier Henrion , Jean Bernard Lasserre , Carlo Savorgnan

This paper proves that the approximation of pointwise derivatives of order $s$ of functions in Sobolev space $W_2^m(\R^d)$ by linear combinations of function values cannot have a convergence rate better than $m-s-d/2$, no matter how many…

Numerical Analysis · Mathematics 2016-11-16 Oleg Davydov , Robert Schaback

A maximal $\varepsilon$-near perfect matching is a maximal matching which covers at least $(1-\varepsilon)|V(G)|$ vertices. In this paper, we study the number of maximal near perfect matchings in generalized quasirandom and dense graphs. We…

Combinatorics · Mathematics 2019-02-07 Yifan Jing , Akbar Rafiey

We show that strong approximate lattices in higher-rank semi-simple algebraic groups are arithmetic.

Group Theory · Mathematics 2023-04-26 Simon Machado

Since its introduction to computational geometry by Alt and Godau in 1992, the Fr\'echet distance has been a mainstay of algorithmic research on curve similarity computations. The focus of the research has been on comparing polygonal…

Computational Geometry · Computer Science 2024-01-09 Jacobus Conradi , Anne Driemel , Benedikt Kolbe

In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…

Complex Variables · Mathematics 2020-06-04 Sotiris Armeniakos , Giorgos Kotsovolis , Vassili Nestoridis

Some results on the approximation of functions from the Sobolev spaces on metric graphs by step functions are obtained. The estimates are uniform with respect to all graphs of a given finite length, and the constant factors in the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Michael Solomyak

Let F be a class of functions with the uniqueness property: if a function f in F vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a quantitative version of this property, e.g. a…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alexander Borichev , Fedor Nazarov , Mikhail Sodin

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

Optimization and Control · Mathematics 2025-08-22 Thabo Samakhoana , Benjamin Grimmer