Multivariate integration over with exponential rate of convergence

In this paper we analyze the approximation of multivariate integrals over the Euclidean space for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with different mesh sizes in each direction to sample the function,...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2017-05, Vol.315, p.327-342
Main Authors: Nguyen, Dong TP, Nuyens, Dirk
Format: Article
Language:English
Subjects:
Anisotropy
Convergence
Discretization
Function space
Lattices
Mathematical analysis
Mathematical models
Truncation errors
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we analyze the approximation of multivariate integrals over the Euclidean space for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with different mesh sizes in each direction to sample the function, and then truncate it. In our analysis, the mesh sizes and the truncated domain are chosen by optimally balancing the truncation error and the discretization error. This paper derives results in comparable function space settings, extended to , as which were recently obtained in the unit cube by Dick, Larcher, Pillichshammer and Woniakowski, see Dick et al. (2011). They showed that both lattice rules and regular grids, with different mesh sizes in each direction, attain exponential rates, hence motivating us to analyze only cubature formula based on regular meshes. We further also amend the analysis of older publications, e.g., Sloan and Osborn (1987) and Sugihara (1987), using lattice rules on by taking the truncation error into account and extending them to take the anisotropy of the function space into account.
ISSN:0377-0427
DOI:10.1016/j.cam.2016.11.016