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 with a composite number of points based on the product weighted star discrepancy

      Joe, Stephen; Sinescu, Vasile
      Thumbnail
      Files
      Good Lattice Rules with a Composite.pdf
      143.8Kb
      DOI
       10.1007/978-3-540-74496-2_39
      Link
       www.springerlink.com
      Find in your library  
      Citation
      Export citation
      Sinescu, V. & Joe, S.(2008). Good lattice rules with a composite number of points based on the product weighted star discrepancy. In H. Niederreiter & D. Talay (Eds), Monte Carlo and Quasi-Monte Carlo Methods 2006(pp. 645-658). Berlin, Germany: Springer.
      Permanent Research Commons link: https://hdl.handle.net/10289/2004
      Abstract
      Rank-1 lattice rules based on a weighted star discrepancy with weights of a product form have been previously constructed under the assumption that the number of points is prime. Here, we extend these results to the non-prime case. We show that if the weights are summable, there exist lattice rules whose weighted star discrepancy is O(n−1+δ), for any δ > 0, with the implied constant independent of the dimension and the number of lattice points, but dependent on δ and the weights. Then we show that the generating vector of such a rule can be constructed using a component-by-component (CBC) technique. The cost of the CBC construction is analysed in the final part of the paper.
      Date
      2008
      Type
      Chapter in Book
      Publisher
      Springer Berlin Heidelberg
      Rights
      This is an author’s version of article published in the book: Monte Carlo and Quasi-Monte Carlo Methods 2006.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      62
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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