New developments in the construction of lattice rules: applications of lattice rules to high-dimensional integration problems from mathematical finance.

Download files
Access & Terms of Use
open access
Copyright: Waterhouse, Benjamin James
Abstract
There are many problems in mathematical finance which require the evaluation of a multivariate integral. Since these problems typically involve the discretisation of a continuous random variable, the dimension of the integrand can be in the thousands, tens of thousands or even more. For such problems the Monte Carlo method has been a powerful and popular technique. This is largely related to the fact that the performance of the method is independent of the number of dimensions. Traditional quasi-Monte Carlo techniques are typically not independent of the dimension and as such have not been suitable for high-dimensional problems. However, recent work has developed new types of quasi-Monte Carlo point sets which can be used in practically limitless dimension. Among these types of point sets are Sobol' sequences, Faure sequences, Niederreiter-Xing sequences, digital nets and lattice rules. In this thesis, we will concentrate on results concerning lattice rules. The typical setting for analysis of these new quasi-Monte Carlo point sets is the worst-case error in a weighted function space. There has been much work on constructing point sets with small worst-case errors in the weighted Korobov and Sobolev spaces. However, many of the integrands which arise in the area of mathematical finance do not lie in either of these spaces. One common problem is that the integrands are unbounded on the boundaries of the unit cube. In this thesis we construct function spaces which admit such integrands and present algorithms to construct lattice rules where the worst-case error in this new function space is small. Lattice rules differ from other quasi-Monte Carlo techniques in that the points can not be used sequentially. That is, the entire lattice is needed to keep the worst-case error small. It has been shown that there exist generating vectors for lattice rules which are good for many different numbers of points. This is a desirable property for a practitioner, as it allows them to keep increasing the number of points until some error criterion is met. In this thesis, we will develop fast algorithms to construct such generating vectors. Finally, we apply a similar technique to show how a particular type of generating vector known as the Korobov form can be made extensible in dimension.
Persistent link to this record
Link to Publisher Version
Additional Link
Author(s)
Waterhouse, Benjamin James
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2007
Resource Type
Thesis
Degree Type
PhD Doctorate
UNSW Faculty
Files
download whole.pdf 960.32 KB Adobe Portable Document Format
Related dataset(s)