Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules. Baldeaux, J., Dick, J., Leobacher, G., Nuyens, D., & Pillichshammer, F. Numer. Algorithms, 59(3):403-431, 2012.
Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules. [link]Link  Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules. [link]Paper  bibtex   
@article{journals/na/BaldeauxDLNP12,
  added-at = {2020-04-25T00:00:00.000+0200},
  author = {Baldeaux, Jan and Dick, Josef and Leobacher, Gunther and Nuyens, Dirk and Pillichshammer, Friedrich},
  biburl = {https://www.bibsonomy.org/bibtex/22adbba54483c57271abf1d95ee672380/dblp},
  ee = {https://doi.org/10.1007/s11075-011-9497-y},
  interhash = {c05c6c746afc455c2ba4c5cfdd900243},
  intrahash = {2adbba54483c57271abf1d95ee672380},
  journal = {Numer. Algorithms},
  keywords = {dblp},
  number = 3,
  pages = {403-431},
  timestamp = {2020-04-28T12:12:21.000+0200},
  title = {Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules.},
  url = {http://dblp.uni-trier.de/db/journals/na/na59.html#BaldeauxDLNP12},
  volume = 59,
  year = 2012
}

Downloads: 0