Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration

作者：Josef Dick, Domingo Gómez‐Pérez, Friedrich Pillichshammer, Arne Winterhof · 发表于：Proceedings of the American Mathematical Society · 年份：2016 · DOI：10.1090/proc/13490 · 被引用次数：7 · 研究领域：Mathematical Approximation and Integration、Cryptography and Residue Arithmetic、Analytic Number Theory Research

We study high-dimensional numerical integration in the worst-case setting. The subject of tractability is concerned with the dependence of the worst-case integration error on the dimension. Roughly speaking, an integration problem is tractable if the worst-case error does not grow exponentially fast with the dimension. Many classical problems are known to be intractable. However, sometimes tractability can be shown. Often such proofs are based on randomly selected integration nodes. Of course, in applications, true random numbers are not available and hence one mimics them with pseudorandom number generators. This motivates us to propose the use of pseudorandom vectors as underlying integration nodes in order to achieve tractability. In particular, we consider digital inverse vectors and present two examples of problems, the weighted star discrepancy and integration of Hölder continuous, absolute convergent Fourier and cosine series, where the proposed method is successful.