English
Related papers

Related papers: On the convergence of Chebyshev--Pad\'e approximat…

200 papers

We prove that almost every level set of a Sobolev function in a planar domain consists of points, Jordan curves, or homeomorphic copies of an interval. For monotone Sobolev functions in the plane we have the stronger conclusion that almost…

Classical Analysis and ODEs · Mathematics 2020-10-30 Dimitrios Ntalampekos

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

Computational Complexity · Computer Science 2014-03-25 Mark Bun , Justin Thaler

We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…

Numerical Analysis · Mathematics 2018-03-20 Philipp Grohs , Hanne Hardering , Oliver Sander , Markus Sprecher

In this work we consider the problem of estimating function-on-scalar regression models when the functions are observed over multi-dimensional or manifold domains and with potentially multivariate output. We establish the minimax rates of…

Statistics Theory · Mathematics 2019-02-21 Matthew Reimherr , Bharath Sriperumbudur , Hyun Bin Kang

For a real-valued measurable function $f$ and a nonnegative, nondecreasing function $\phi$, we first obtain a Chebyshev type inequality which provides an upper bound for $\displaystyle \phi(\lambda_{1}) \mu(\{x \in \Omega : f(x) \geq…

Functional Analysis · Mathematics 2022-09-14 M. Ashraf Bhat , G. Sankara Raju Kosuru

This work is concerned with the formulation of a general framework for the analysis of meshfree approximation schemes and with the convergence analysis of the Local Maximum-Entropy (LME) scheme as a particular example. We provide conditions…

Numerical Analysis · Mathematics 2011-08-01 Agustin Bompadre , Bernd Schmidt , Michael Ortiz

We study the approximation of measurable functions on the hypercube by functions arising from affine neural networks. Our main achievement is an approximation of any measurable function $f \colon W_n \to [-1,1]$ up to a prescribed precision…

Machine Learning · Computer Science 2019-01-30 Andreas Thom

This paper is concerned with the regularity of solutions to linear and nonlinear evolution equations extending our findings in [22] to domains of polyhedral type. In particular, we study the smoothness in the specific scale…

Analysis of PDEs · Mathematics 2021-05-28 Stephan Dahlke , Cornelia Schneider

For trigonometric series and series of Chebyshev polynomials, we defined trigonometric Hermite-Pad\'e and Hermite-Jacobi approximations, linear and nonlinear Hermite-Chebyshev approximations. We established criterion of the existence and…

Classical Analysis and ODEs · Mathematics 2025-07-22 A. P. Starovoitov , I. V. Kruglikov , T. M. Osnach

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

General Mathematics · Mathematics 2020-10-21 Yu-Lin Chou

The paper deals with finite element approximations of elliptic Dirichlet boundary control problems posed on two-dimensional polygonal domains. Error estimates are derived for the approximation of the control and the state variables. Special…

Numerical Analysis · Mathematics 2019-01-28 Thomas Apel , Mariano Mateos , Johannes Pfefferer , Arnd Rösch

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Algebraic Geometry · Mathematics 2007-05-23 J. Maurice Rojas

We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…

Discrete Mathematics · Computer Science 2024-01-04 Miguel Romero , Marcin Wrochna , Stanislav Živný

We consider the problem of domain approximation in finite element methods for Maxwell equations on curved domains, i.e., when affine or polynomial meshes fail to exactly cover the domain of interest. In such cases, one is forced to…

Numerical Analysis · Mathematics 2022-01-05 Rubén Aylwin , Carlos Jerez-Hanckes

We present a numerical framework to approximate the $\mu$-domain in the planar Skorokhod embedding problem (PSEP), recently appeared in \cite{gross2019}. Our approach investigates the continuity and convergence properties of the solutions…

Probability · Mathematics 2025-05-01 Mrabet Becher , Maher Boudabra , Fathi Haggui

We completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and…

Discrete Mathematics · Computer Science 2018-03-20 Claudio Qureshi , Daniel Panario

We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…

Complex Variables · Mathematics 2017-05-19 Timothy Ferguson

In this paper we investigate the regularity properties of weighted Bergman projections for smoothly bounded pseudo-convex domains of finite type in $\mathbb{C}^{n}$. The main result is obtained for weights equal to a non negative rational…

Complex Variables · Mathematics 2013-05-24 Philippe Charpentier , Yves Dupain , Modi Mounkaila

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

Functional Analysis · Mathematics 2023-11-29 Yuri Malykhin , Konstantin Ryutin