Sub-optimality of Gauss–Hermite quadrature and optimality of trapezoidal rule for functions with finite smoothness

02/23/2022
by   Yoshihito Kazashi, et al.
0

A sub-optimality of Gauss–Hermite quadrature and an optimality of the trapezoidal rule are proved in the weighted Sobolev spaces of square integrable functions of order α, where the optimality is in the sense of worst-case error. For Gauss–Hermite quadrature, we obtain the matching lower and upper bounds, which turns out to be merely of the order n^-α/2 with n function evaluations, although the optimal rate for the best possible linear quadrature is known to be n^-α. Our proof on the lower bound exploits the structure of the Gauss–Hermite nodes; the bound is independent of the quadrature weights, and changing the Gauss–Hermite weights cannot improve the rate n^-α/2. In contrast, we show that a suitably truncated trapezoidal rule achieves the optimal rate up to a logarithmic factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2022

Randomizing the trapezoidal rule gives the optimal RMSE rate in Gaussian Sobolev spaces

Randomized quadratures for integrating functions in Sobolev spaces of or...
research
01/10/2018

Optimal functional supervised classification with separation condition

We consider the binary supervised classification problem with the Gaussi...
research
05/26/2023

Accelerating Value Iteration with Anchoring

Value Iteration (VI) is foundational to the theory and practice of moder...
research
11/19/2019

Optimal Complexity and Certification of Bregman First-Order Methods

We provide a lower bound showing that the O(1/k) convergence rate of the...
research
04/20/2023

Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration

We show that a very simple randomised algorithm for numerical integratio...
research
11/12/2018

The doctrinal paradox: ROC analysis in a probabilistic framework

The doctrinal paradox is analysed from a probabilistic point of view ass...
research
08/06/2023

A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with 0 < α≤ 1/2

In previous work (Kuo, Nuyens, Wilkes, 2023), we showed that a lattice r...

Please sign up or login with your details

Forgot password? Click here to reset