Numerical integration without smoothness assumption

03/30/2020
by   Vladimir Temlyakov, et al.
0

We consider numerical integration in classes, for which we do not impose any smoothness assumptions. We illustrate how nonlinear approximation, in particular greedy approximation, allows us to guarantee some rate of decay of errors of numerical integration even in such a general setting with no smoothness assumptions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/10/2023

Sparse-grid sampling recovery and numerical integration of functions having mixed smoothness

We give a short survey of recent results on sparse-grid linear algorithm...
research
08/19/2022

Numerical weighted integration of functions having mixed smoothness

We investigate the approximation of weighted integrals over ℝ^d for inte...
research
09/15/2022

The power of random information for numerical approximation and integration

This thesis investigates the quality of randomly collected data by emplo...
research
03/01/2015

Constructive sparse trigonometric approximation for functions with small mixed smoothness

The paper gives a constructive method, based on greedy algorithms, that ...
research
02/10/2022

Sharp L_p-error estimates for sampling operators

We study approximation properties of linear sampling operators in the sp...
research
09/22/2018

Chebyshev approximation and the global geometry of sloppy models

Sloppy models are complex nonlinear models with outcomes that are signif...
research
06/24/2022

On Donoho's Log-Exp Subdivision Scheme: Choice of Retraction and Time-Symmetry

In recent years a number of different approaches for adapting linear sub...

Please sign up or login with your details

Forgot password? Click here to reset