#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2008

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jan Baldeaux, Josef Dick, Gunther Leobacher, Dirk Nuyens, Friedrich Pillichshammer
- Numerical Algorithms
- 2011

We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve the near optimal order of convergence. The main problem addressed in this paper is to find an efficient way of… (More)

- Jan Baldeaux, Josef Dick, Julia Greslehner, Friedrich Pillichshammer
- J. Complexity
- 2011

Higher order polynomial lattice point sets are special types of digital higher order nets which are known to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Recently it has been shown that higher order polynomial lattice point sets of “good” quality must exist.… (More)

- Josef Dick, Jan Baldeaux
- 2009

Generalized digital nets and sequences have been introduced for the numerical integration of smooth functions using quasi-Monte Carlo rules. In this paper we study geometrical properties of such nets and sequences. The definition of these nets and sequences does not depend on linear algebra over finite fields, it only requires that the point set or sequence… (More)

- Jan Baldeaux, Michael Gnewuch
- SIAM J. Numerical Analysis
- 2014

- Jan Baldeaux, Josef Dick, Friedrich Pillichshammer
- Discrete Mathematics
- 2011

- Jan Baldeaux, Josef Dick
- Numerische Mathematik
- 2011

Generalized nets and sequences are used in quasi-Monte Carlo rules for the approximation of high dimensional integrals over the unit cube. Hence one wants to have generalized nets and sequences of high quality. In this paper we introduce a duality theory for generalized nets whose construction is not necessarily based on linear algebra over finite fields.… (More)

In this paper, we present an unbiased Monte Carlo estimator for lookback options in jumpdiffusion models. Lookback options are difficult to price in jump-diffusion models, as their pay-off depends on the maximum of the share price over a particular time interval. In general, closed form solutions for prices of lookback options are not available but even… (More)

Recently, generalized digital nets were introduced and shown to achieve almost optimal convergence rates when used in a quasi-Monte Carlo algorithm to approximate high-dimensional integrals over the unit cube. Since their inception, one method of constructing generalized digital nets from classical digital nets has been known. However, the desirable… (More)

- Jan Baldeaux, Josef Dick, Peter Kritzer
- J. Complexity
- 2009

In this paper we study an approximation algorithm which firstly approximates certain Walsh coefficients of the function under consideration and consequently uses a Walsh polynomial to approximate the function. A similar approach has previously been used for approximating periodic functions, using lattice rules (and Fourier polynomials), and for… (More)