Strong tractability for multivariate integration in a subspace of the Wiener algebra

06/02/2023
by   Takashi Goda, et al.
0

Building upon recent work by the author, we prove that multivariate integration in the following subspace of the Wiener algebra over [0,1)^d is strongly polynomially tractable: F_d:={ f∈ C([0,1)^d) | f:=∑_k∈ℤ^d|f̂(k)|max(width(supp(k)),min_j∈supp(k)log |k_j|)<∞}, with f̂(k) being the k-th Fourier coefficient of f, supp(k):={j∈{1,…,d}| k_j≠ 0}, and width: 2^{1,…,d}→{1,…,d} being defined by width(u):=max_j∈ uj-min_j∈ uj+1, for non-empty subset u⊆{1,…,d} and width(∅):=1. Strong polynomial tractability is achieved by an explicit quasi-Monte Carlo rule using a multiset union of Korobov's p-sets. We also show that, if we replace width(supp(k)) with 1 for all k∈ℤ^d in the above definition of norm, multivariate integration is polynomially tractable but not strongly polynomially tractable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2022

Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series

In this note, we prove that the following function space with absolutely...
research
10/16/2017

Commutator width in the first Grigorchuk group

Let G be the first Grigorchuk group. We show that the commutator width o...
research
05/18/2022

Monoidal Width: Capturing Rank Width

Monoidal width was recently introduced by the authors as a measure of th...
research
02/06/2022

Pre-integration via Active Subspaces

Pre-integration is an extension of conditional Monte Carlo to quasi-Mont...
research
10/12/2021

A SAT Approach to Twin-Width

The graph invariant twin-width was recently introduced by Bonnet, Kim, T...
research
03/02/2023

Compressed QMC volume and surface integration on union of balls

We discuss an algorithm for Tchakaloff-like compression of Quasi-MonteCa...

Please sign up or login with your details

Forgot password? Click here to reset