The power of random information for numerical approximation and integration

09/15/2022
by   Mathias Sonnleitner, et al.
0

This thesis investigates the quality of randomly collected data by employing a framework built on information-based complexity, a field related to the numerical analysis of abstract problems. The quality or power of gathered information is measured by its radius which is the uniform error obtainable by the best possible algorithm using it. The main aim is to present progress towards understanding the power of random information for approximation and integration problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2023

Optimal Algorithms for Numerical Integration: Recent Results and Open Problems

We present recent results on optimal algorithms for numerical integratio...
research
03/30/2020

Numerical integration without smoothness assumption

We consider numerical integration in classes, for which we do not impose...
research
05/24/2023

Deep Ritz Method with Adaptive Quadrature for Linear Elasticity

In this paper, we study the deep Ritz method for solving the linear elas...
research
06/23/2023

Randomized Complexity of Parametric Integration and the Role of Adaption I. Finite Dimensional Case

We study the randomized n-th minimal errors (and hence the complexity) o...
research
04/05/2023

Chebyshev approximation of exponential data

In this paper we present an algorithm to fit data via exponentials when ...
research
09/29/2021

Random sections of ℓ_p-ellipsoids, optimal recovery and Gelfand numbers of diagonal operators

We study the circumradius of a random section of an ℓ_p-ellipsoid, 0<p≤∞...
research
06/23/2023

Randomized Complexity of Parametric Integration and the Role of Adaption II. Sobolev Spaces

We study the complexity of randomized computation of integrals depending...

Please sign up or login with your details

Forgot password? Click here to reset