Lower Bounds for the Error of Quadrature Formulas for Hilbert Spaces

04/01/2020
by   Aicke Hinrichs, et al.
0

We prove lower bounds for the worst case error of quadrature formulas that use given sample points X_n = { x_1, ... , x_n }. We are mainly interested in optimal point sets X_n, but also prove lower bounds that hold for most randomly selected sets. As a tool, we use a recent result (and extensions thereof) of Vybíral on the positive semi-definiteness of certain matrices related to the product theorem of Schur. The new technique also works for spaces of analytic functions where known methods based on decomposable kernels cannot be applied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2023

New lower bounds for the integration of periodic functions

We study the integration problem on Hilbert spaces of (multivariate) per...
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
08/26/2021

Lower bounds for integration and recovery in L_2

Function values are, in some sense, "almost as good" as general linear i...
research
11/14/2022

Low-depth arithmetic circuit lower bounds via shifted partials

We prove super-polynomial lower bounds for low-depth arithmetic circuits...
research
10/13/2021

Where are the logs?

The commonly quoted error rates for QMC integration with an infinite low...
research
11/08/2022

Multiple Packing: Lower Bounds via Error Exponents

We derive lower bounds on the maximal rates for multiple packings in hig...
research
09/15/2017

The Orthogonal Vectors Conjecture for Branching Programs and Formulas

In the Orthogonal Vectors (OV) problem, we wish to determine if there is...

Please sign up or login with your details

Forgot password? Click here to reset