Greedy algorithms in numerical integration
Vladimir Temlyakov  1@  
1 : University of South Carolina  (USC)  -  Site web
1523 Greene str., Columbia SC 29208 -  États-Unis

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.

Personnes connectées : 3 Vie privée