Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

Efficient lattice assessment for LCG and GLP parameter searches


Authors: Karl Entacher, Thomas Schell and Andreas Uhl
Journal: Math. Comp. 71 (2002), 1231-1242
MSC (2000): Primary 11Y40, 11-04; Secondary 11K45, 68W40
Published electronically: December 21, 2001
MathSciNet review: 1898753
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi-Monte Carlo node sets. The classical measure for such parameter searches is the spectral test which is based on a calculation of the shortest nonzero vector in a lattice. Instead of the shortest vector we apply an approximation given by the LLL algorithm for lattice basis reduction. We empirically demonstrate the speed-up and the quality loss obtained by the LLL reduction, and we present important applications for parameter selections.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11Y40, 11-04, 11K45, 68W40

Retrieve articles in all journals with MSC (2000): 11Y40, 11-04, 11K45, 68W40


Additional Information

Karl Entacher
Affiliation: School of Telecommunications Engineering, University of Applied Sciences and Technologies, Schillerstr. 30, A-5020 Salzburg, Austria
Email: Karl.Entacher@fh-sbg.ac.at

Thomas Schell
Affiliation: Department of Scientific Computing, Salzburg University, Hellbrunnerstr. 34, A-5020 Salzburg, Austria

Andreas Uhl
Affiliation: Department of Scientific Computing, Salzburg University, Hellbrunnerstr. 34, A-5020 Salzburg, Austria

DOI: http://dx.doi.org/10.1090/S0025-5718-01-01415-6
PII: S 0025-5718(01)01415-6
Keywords: Monte Carlo and quasi--Monte Carlo methods, lattice rules, good lattice points, random number generation, lattice basis reduction, LLL algorithm, Fincke-Pohst algorithm, spectral test
Received by editor(s): September 15, 2000
Published electronically: December 21, 2001
Additional Notes: The first author was supported by the Austrian Science Fund (FWF), pro. no. S8303-MAT, the second author by the FWF pro. no. P13732-MAT
Article copyright: © Copyright 2001 American Mathematical Society



Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia