Friedrich Pillichshammer

Friedrich Pillichshammer

Auto-generated profile, based on publicly available information

Friedrich Pillichshammer

Institute for Financial Mathematics and Applied Number Theory Johannes Kepler University Linz Altenbergerstraße 69 4040 Linz Austria

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2010
Verified
Book
Closed access
JDJosef Dick
Josef Dick
FPFriedrich Pillichshammer
Friedrich Pillichshammer
Indispensable for students, invaluable for researchers, this comprehensive treatment of contemporary quasi–Monte Carlo methods, digital nets and sequences, and discrepancy theory starts from scratch with detailed explanations of the basic concepts and then advances to current methods used in research. As deterministic versions of the Monte Carlo method, quasi–Monte Carlo rules have increased in popularity, with many fruitful applications in mathematical practice. These rules require nodes with good uniform distribution properties, and digital nets and sequences in the sense of Niederreiter are known to be excellent candidates. Besides the classical theory, the book contains chapters on reproducing kernel Hilbert spaces and weighted integration, duality theory for digital nets, polynomial lattice rules, the newest constructions by Niederreiter and Xing and many more. The authors present an accessible introduction to the subject based mainly on material taught in undergraduate courses with numerous examples, exercises and illustrations.


1 April 2005 in Journal of Complexity
Verified
Journal Article
Closed access
JDJosef Dick
Josef Dick
FPFriedrich Pillichshammer
Friedrich Pillichshammer

21 May 2013 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
JDJosef Dick
Josef Dick
DNDirk Nuyens
Dirk Nuyens
FPFriedrich Pillichshammer
Friedrich Pillichshammer

3 September 2011 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
JBJan Baldeaux
Jan Baldeaux
JDJosef Dick
Josef Dick
GLGunther Leobacher
Gunther Leobacher
DNDirk Nuyens
Dirk Nuyens
FPFriedrich Pillichshammer
Friedrich Pillichshammer

5 May 2005 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
JDJ. Dick
J. Dick
FKF. Kuo
F. Kuo
FPF. Pillichshammer
F. Pillichshammer
ISI. Sloan
I. Sloan
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights. We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules. We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.