Sparse grid quadrature on products of spheres (Q891778)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparse grid quadrature on products of spheres |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse grid quadrature on products of spheres |
scientific article |
Statements
Sparse grid quadrature on products of spheres (English)
0 references
17 November 2015
0 references
Denoting the unit sphere in \(\mathbb R^3\) by \(\mathbb S^2\), the paper is devoted to the development and investigation of algorithms for the approximate computation of integrals over \((\mathbb S^2)^k\) with (typically large) \(k \in \mathbb N\). The integrand functions are assumed to be contained in a weighted tensor product of reproducible kernel Hilbert spaces over this domain. In contrast to the frequently considered quasi-Monte Carlo methods, the authors construct formulas with arbitrary weights and use the additional flexibility obtained in this way to optimize the convergence behaviour. Specifically, a dimension adaptive method is developed and shown to be optimal. Numerical examples illustrate the theoretical results.
0 references
reproducing kernel Hilbert spaces
0 references
quadrature
0 references
tractability
0 references
sparse grids
0 references
knapsack problems
0 references
spherical designs
0 references
weighted tensor products
0 references
algorithm
0 references
numerical example
0 references
0 references
0.9035379886627196
0 references
0.8506742715835571
0 references
0.8506742715835571
0 references
0.8099693655967712
0 references
0.8099693655967712
0 references