Optimal Algorithms for Numerical Integration: Recent Results and Open Problems

07/13/2023
by   Erich Novak, et al.
0

We present recent results on optimal algorithms for numerical integration and several open problems. The paper has six parts: 1. Introduction 2. Lower Bounds 3. Universality 4. General Domains 5. iid Information 6. Concluding Remarks

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2019

Lower Bounds for the Happy Coloring Problems

In this paper, we study the Maximum Happy Vertices and the Maximum Happy...
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
08/16/2019

Algorithms and Complexity for Functions on General Domains

Error bounds and complexity bounds in numerical analysis and information...
research
04/03/2019

Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration

In recent years, several branch-and-bound (BnB) algorithms have been pro...
research
11/26/2019

Error-estimate-based Adaptive Integration For Immersed Isogeometric Analysis

The Finite Cell Method (FCM) together with Isogeometric analysis (IGA) h...
research
03/28/2022

27 Open Problems in Kolmogorov Complexity

The paper proposes open problems in classical Kolmogorov complexity. Eac...
research
11/26/2019

Preserving the accuracy of numerical methods discretizing anisotropic elliptic problems

In this paper we study the loss of precision of numerical methods discre...

Please sign up or login with your details

Forgot password? Click here to reset