The rate of convergence of sparse grid quadrature on the torus
We examine sparse grid quadrature on Korobov spaces; that is, weighted tensor product reproducing kernel Hilbert spaces on the torus. We describe a dimension adaptive quadrature algorithm based on an algorithm of Hegland [ANZIAM J., 44(E):C335, 2003], and also formulate a version of Wasilkowski and Wozniakowski's weighted tensor product algorithm [J. Complexity, 15(3):402, 1999]. We claim that our algorithm is generally lower in cost than Wasilkowski and Wozniakowski's algorithm, and therefore...[Show more]
|Collections||ANU Research Publications|
|01_Hegland_The_rate_of_convergence_of_2011.pdf||513.7 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.