Lower bounds for piecewise polynomial approximations of oscillatory functions

11/09/2022
by   Jeffrey Galkowski, et al.
0

We prove sharp lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2018

On the Interrelation between Dependence Coefficients of Extreme Value Copulas

For extreme value copulas with a known upper tail dependence coefficient...
research
08/01/2023

Sharp Taylor Polynomial Enclosures in One Dimension

It is often useful to have polynomial upper or lower bounds on a one-dim...
research
10/08/2019

Sharp uniform lower bounds for the Schur product theorem

By a result of Schur [J. Reine Angew. Math. 1911], the entrywise product...
research
06/24/2019

Sensitivity Analysis and Generalized Chaos Expansions. Lower Bounds for Sobol indices

The so-called polynomial chaos expansion is widely used in computer expe...
research
10/06/2021

Computational lower bounds of the Maxwell eigenvalues

A method to compute guaranteed lower bounds to the eigenvalues of the Ma...
research
11/07/2018

How Many Subpopulations is Too Many? Exponential Lower Bounds for Inferring Population Histories

Reconstruction of population histories is a central problem in populatio...
research
02/24/2021

On the Minimal Error of Empirical Risk Minimization

We study the minimal error of the Empirical Risk Minimization (ERM) proc...

Please sign up or login with your details

Forgot password? Click here to reset