Fully symmetric kernel quadrature

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Date
2018
Major/Subject
Mcode
Degree programme
Language
en
Pages
24
A697-A720
Series
SIAM Journal on Scientific Computing, Volume 40, issue 2
Abstract
Kernel quadratures and other kernel-based approximation methods typically suffer from prohibitive cubic time and quadratic space complexity in the number of function evaluations. The problem arises because a system of linear equations needs to be solved. In this article we show that the weights of a kernel quadrature rule can be computed efficiently and exactly for up to tens of millions of nodes if the kernel, integration domain, and measure are fully symmetric and the node set is a union of fully symmetric sets. This is based on the observations that in such a setting there are only as many distinct weights as there are fully symmetric sets and that these weights can be solved from a linear system of equations constructed out of row sums of certain submatrices of the full kernel matrix. We present several numerical examples that show feasibility, both for a large number of nodes and in high dimensions, of the developed fully symmetric kernel quadrature rules. Most prominent of the fully symmetric kernel quadrature rules we propose are those that use sparse grids.
Description
Keywords
numerical integration, kernel quadrature, Bayesian quadrature, reproducing kernel, Hilbert spaces, fully symmetric sets, sparse grids
Other note
Citation
Karvonen , T & Särkkä , S 2018 , ' Fully symmetric kernel quadrature ' , SIAM Journal on Scientific Computing , vol. 40 , no. 2 , pp. A697-A720 . https://doi.org/10.1137/17M1121779