We study the logarithmic error of numerical methods for the integration of monotone or unimodal positive functions. We compare adaptive and nonadaptive methods in the worst case setting. It turns out that adaption significantly helps for the class of unimodal functions, but it does not help for the class of monotone functions. We do not assume any smoothness properties of the integrands and obtain numerical methods that are reliable even for discontinuous integrands. Numerical examples show that our method is very competitive in the case of nonsmooth and/or peak functions.
[1]
H. Woxniakowski.
Information-Based Complexity
,
1988
.
[2]
J. Kiefer,et al.
Sequential minimax search for a maximum
,
1953
.
[3]
Henryk Wozniakowski,et al.
Information-based complexity
,
1987,
Nature.
[4]
J. Kiefer.
Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
,
1957
.
[5]
E. Novak.
Quadrature formulas for monotone functions
,
1992
.
[6]
Erich Novak,et al.
On the Power of Adaption
,
1996,
J. Complex..