Gunther Leobacher

dblp:57/3415 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
1since 2021 · last 2023
0000-0002-7837-784XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 first-author · 1 since 2021
YearPublicationVenuePosition
2023 Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness
abstract
In this paper we consider integration and L2-approximation for functions over Rs from weighted Hermite spaces. The first part of the paper is devoted to a comparison of several weighted Hermite spaces that appear in literature, which is interesting on its own. Then we study tractability of the integration and L2-approximation problem for the introduced Hermite spaces, which describes the growth rate of the information complexity when the error threshold ε tends to 0 and the problem dimension s grows to infinity. Our main results are characterizations of tractability in terms of the involved weights, which model the importance of the successive coordinate directions for functions from the weighted Hermite spaces.
Gunther Leobacher, Friedrich Pillichshammer, Adrian Ebert
J. Complex.1
2015 Integration in Hermite spaces of analytic functions
Christian Irrgeher, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer
J. Complex.3
2015 High-dimensional integration on Rd, weighted Hermite spaces, and orthogonal transforms
Christian Irrgeher, Gunther Leobacher
J. Complex.2
2012 Fast orthogonal transforms and generation of Brownian paths
abstract
We present a number of fast constructions of discrete Brownian paths that can be used as alternatives to principal component analysis and Brownian bridge for stratified Monte Carlo and quasi-Monte Carlo. By fast we mean that a path of length [Formula: see text] can be generated in [Formula: see text] floating point operations. We highlight some of the connections between the different constructions and we provide some numerical examples.
Gunther Leobacher
J. Complex.1
2003 On the tractability of the Brownian Bridge algorithm
Gerhard Larcher, Gunther Leobacher, Klaus Scheicher
J. Complex.2
2003 Bounds for the weighted Lp discrepancy and tractability of integration
Gunther Leobacher, Friedrich Pillichshammer
J. Complex.1