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.

      Component-by-component construction of good intermediate-rank lattice rules

      Kuo, Frances Y.; Joe, Stephen
      Thumbnail
      Files
      component-by-component.pdf
      238.0Kb
      DOI
       10.1137/S0036142902407162
      Link
       siamdl.aip.org
      Find in your library  
      Citation
      Export citation
      Kuo, F.Y. & Joe, S.(2003). Component-by-component construction of good intermediate-rank lattice rules. SIAM Journal of Numerical Analysis, 41(4), 1465-1486.
      Permanent Research Commons link: https://hdl.handle.net/10289/1740
      Abstract
      It is known that the generating vector of a rank-1 lattice rule can be constructed component-by-component to achieve strong tractability error bounds in both weighted Korobov spaces and weighted Sobolev spaces. Since the weights for these spaces are nonincreasing, the first few variables are in a sense more important than the rest. We thus propose to copy the points of a rank-1 lattice rule a number of times in the first few dimensions to yield an intermediate-rank lattice rule. We show that the generating vector (and in weighted Sobolev spaces, the shift also) of an intermediate-rank lattice rule can also be constructed component-by-component to achieve strong tractability error bounds. In certain circumstances, these bounds are better than the corresponding bounds for rank-1 lattice rules.
      Date
      2003
      Type
      Journal Article
      Publisher
      Society for Industrial and Applied Mathematics
      Rights
      This is an author’s version of an article published in the journal: SIAM Journal of Numerical Analysis. © 2003 Society for Industrial and Applied Mathematics. Used with permission.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      86
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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