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.
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
{"_id":"eQgJuuidArCAnmh9G","bibbaseid":"baldeaux-dick-leobacher-nuyens-pillichshammer-efficientcalculationoftheworstcaseerrorandfastcomponentbycomponentconstructionofhigherorderpolynomiallatticerules-2012","authorIDs":[],"author_short":["Baldeaux, J.","Dick, J.","Leobacher, G.","Nuyens, D.","Pillichshammer, F."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-04-25T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Baldeaux"],"firstnames":["Jan"],"suffixes":[]},{"propositions":[],"lastnames":["Dick"],"firstnames":["Josef"],"suffixes":[]},{"propositions":[],"lastnames":["Leobacher"],"firstnames":["Gunther"],"suffixes":[]},{"propositions":[],"lastnames":["Nuyens"],"firstnames":["Dirk"],"suffixes":[]},{"propositions":[],"lastnames":["Pillichshammer"],"firstnames":["Friedrich"],"suffixes":[]}],"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","bibtex":"@article{journals/na/BaldeauxDLNP12,\n added-at = {2020-04-25T00:00:00.000+0200},\n author = {Baldeaux, Jan and Dick, Josef and Leobacher, Gunther and Nuyens, Dirk and Pillichshammer, Friedrich},\n biburl = {https://www.bibsonomy.org/bibtex/22adbba54483c57271abf1d95ee672380/dblp},\n ee = {https://doi.org/10.1007/s11075-011-9497-y},\n interhash = {c05c6c746afc455c2ba4c5cfdd900243},\n intrahash = {2adbba54483c57271abf1d95ee672380},\n journal = {Numer. Algorithms},\n keywords = {dblp},\n number = 3,\n pages = {403-431},\n timestamp = {2020-04-28T12:12:21.000+0200},\n title = {Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules.},\n url = {http://dblp.uni-trier.de/db/journals/na/na59.html#BaldeauxDLNP12},\n volume = 59,\n year = 2012\n}\n\n","author_short":["Baldeaux, J.","Dick, J.","Leobacher, G.","Nuyens, D.","Pillichshammer, F."],"key":"journals/na/BaldeauxDLNP12","id":"journals/na/BaldeauxDLNP12","bibbaseid":"baldeaux-dick-leobacher-nuyens-pillichshammer-efficientcalculationoftheworstcaseerrorandfastcomponentbycomponentconstructionofhigherorderpolynomiallatticerules-2012","role":"author","urls":{"Link":"https://doi.org/10.1007/s11075-011-9497-y","Paper":"http://dblp.uni-trier.de/db/journals/na/na59.html#BaldeauxDLNP12"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Gunther?items=1000","creationDate":"2020-11-19T14:18:48.649Z","downloads":0,"keywords":["dblp"],"search_terms":["efficient","calculation","worst","case","error","fast","component","component","construction","higher","order","polynomial","lattice","rules","baldeaux","dick","leobacher","nuyens","pillichshammer"],"title":"Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules.","year":2012,"dataSources":["vx3tQbZepny2tNB7k"]}