Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Good lattice rules based on the general weighted star discrepancy

      Sinescu, Vasile; Joe, Stephen
      Thumbnail
      Files
      Good lattice rules.pdf
      231.3Kb
      DOI
       10.1090/S0025-5718-06-01943-0
      Link
       www.ams.org
      Find in your library  
      Citation
      Export citation
      Sinescu, V. & Joe, S. (2007). Good lattice rules based on the general weighted star discrepancy. Mathematics of Computation, 76(258), 989-1004.
      Permanent Research Commons link: https://hdl.handle.net/10289/1364
      Abstract
      We study the problem of constructing rank- lattice rules which have good bounds on the ``weighted star discrepancy''. Here the non-negative weights are general weights rather than the product weights considered in most earlier works. In order to show the existence of such good lattice rules, we use an averaging argument, and a similar argument is used later to prove that these lattice rules may be obtained using a component-by-component (CBC) construction of the generating vector. Under appropriate conditions on the weights, these lattice rules satisfy strong tractability bounds on the weighted star discrepancy. Particular classes of weights known as ``order-dependent'' and ``finite-order'' weights are then considered and we show that the cost of the construction can be very much reduced for these two classes of weights.
      Date
      2007-04
      Type
      Journal Article
      Publisher
      American Mathematical Society
      Rights
      This article has been published on the journal: Mathematics of Computation. ©Copyright 2006, American Mathematical Society.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      61
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement