{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T06:53:30Z","timestamp":1770188010613,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,9,3]],"date-time":"2011-09-03T00:00:00Z","timestamp":1315008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11075-011-9497-y","type":"journal-article","created":{"date-parts":[[2011,9,6]],"date-time":"2011-09-06T13:07:41Z","timestamp":1315314461000},"page":"403-431","source":"Crossref","is-referenced-by-count":45,"title":["Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules"],"prefix":"10.1007","volume":"59","author":[{"given":"Jan","family":"Baldeaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Dick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunther","family":"Leobacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Nuyens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Pillichshammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,3]]},"reference":[{"issue":"3","key":"9497_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00365-009-9074-y","volume":"30","author":"J Baldeaux","year":"2009","unstructured":"Baldeaux, J., Dick, J.: QMC rules of arbitrary high order: reproducing kernel Hilbert space approach. Constr. Approx. 30(3), 495\u2013527 (2009)","journal-title":"Constr. Approx."},{"issue":"3\u20134","key":"9497_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.jco.2010.06.002","volume":"27","author":"J Baldeaux","year":"2011","unstructured":"Baldeaux, J., Dick, J., Greslehner, J., Pillichshammer, F.: Construction algorithms for higher order polynomial lattice rules. J. Complex. 27(3\u20134), 281\u2013299 (2011)","journal-title":"J. Complex."},{"issue":"3","key":"9497_CR3","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1214\/11-AOS880","volume":"39","author":"J Dick","year":"2011","unstructured":"Dick, J.: Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands. Ann. Stat. 39(3), 1372\u20131398 (2011)","journal-title":"Ann. Stat."},{"key":"9497_CR4","doi-asserted-by":"crossref","first-page":"2141","DOI":"10.1137\/060658916","volume":"45","author":"J Dick","year":"2007","unstructured":"Dick, J.: Explicit constructions of quasi-Monte Carlo rules for the numerical integration of high dimensional periodic functions. SIAM J. Numer. Anal. 45, 2141\u20132176 (2007)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9497_CR5","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1137\/060666639","volume":"46","author":"J Dick","year":"2008","unstructured":"Dick, J.: Walsh spaces containing smooth functions and quasi-Monte Carlo rules of arbitrary high order. SIAM J. Numer. Anal. 46(3), 1519\u20131553 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"9497_CR6","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1017\/S0004972709000392","volume":"80","author":"J Dick","year":"2009","unstructured":"Dick, J.: The decay of the Walsh coefficients of smooth functions. Bull. Aust. Math. Soc. 80, 430\u2013453 (2009)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"4\u20136","key":"9497_CR7","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/j.jco.2006.12.003","volume":"23","author":"J Dick","year":"2007","unstructured":"Dick, J., Kritzer, P., Pillichshammer, F., Schmid, W.C.: On the existence of higher order polynomial lattices based on a generalized figure of merit. J. Complex. 23(4\u20136), 581\u2013593 (2007)","journal-title":"J. Complex."},{"issue":"252","key":"9497_CR8","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1090\/S0025-5718-05-01742-4","volume":"74","author":"J Dick","year":"2005","unstructured":"Dick, J., Kuo, F.Y., Pillichshammer, F., Sloan, I.H.: Construction algorithms for polynomial lattice rules for multivariate integration. Math. Comput. 74(252), 1895\u20131921 (2005)","journal-title":"Math. Comput."},{"issue":"2","key":"9497_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.jco.2004.07.003","volume":"21","author":"J Dick","year":"2005","unstructured":"Dick, J., Pillichshammer, F.: Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces. J. Complex. 21(2), 149\u2013195 (2005)","journal-title":"J. Complex."},{"issue":"4\u20136","key":"9497_CR10","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.jco.2007.02.001","volume":"23","author":"J Dick","year":"2007","unstructured":"Dick, J., Pillichshammer, F.: Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules. J. Complex. 23(4\u20136), 436\u2013453 (2007)","journal-title":"J. Complex."},{"key":"9497_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511761188","volume-title":"Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration","author":"J Dick","year":"2010","unstructured":"Dick, J., Pillichshammer, F.: Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge (2010)"},{"key":"9497_CR12","first-page":"1207","volume":"124","author":"NM Korobov","year":"1959","unstructured":"Korobov, N.M.: The approximate computation of multiple integrals\/approximate evaluation of repeated integrals. Dokl. Akad. Nauk SSSR 124, 1207\u20131210 (1959) in Russian","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9497_CR13","unstructured":"Korobov, N.M.: Number-Theoretic Methods in Approximate Analysis. Goz. Izdat. Fiz.-Math (1963) in Russian"},{"issue":"6","key":"9497_CR14","doi-asserted-by":"crossref","first-page":"2239","DOI":"10.1137\/S0036142994264705","volume":"33","author":"G Larcher","year":"1996","unstructured":"Larcher, G., Lauss, A., Niederreiter, H., Schmid, W.C.: Optimal polynomials for (t, m, s)-nets and numerical integration of multivariate Walsh series. SIAM J. Numer. Anal. 33(6), 2239\u20132253 (1996)","journal-title":"SIAM J. Numer. Anal."},{"key":"9497_CR15","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods, no.\u00a063. Regional Conference Series in Applied Mathematics. SIAM (1992)","DOI":"10.1137\/1.9781611970081"},{"key":"9497_CR16","doi-asserted-by":"crossref","unstructured":"Novak, E., Wo\u017aniakowski, H.: Tractability of Multivariate Problems\u2014vol. I: Linear Information. EMS Tracts in Mathematics, vol.\u00a06. European Mathematical Society Publishing House (2008)","DOI":"10.4171\/026"},{"key":"9497_CR17","doi-asserted-by":"crossref","unstructured":"Novak, E., Wo\u017aniakowski, H.: Tractability of Multivariate Problems\u2014vol. II: Standard Information for Functionals. EMS Tracts in Mathematics, vol. 12. European Mathematical Society Publishing House (2010)","DOI":"10.4171\/084"},{"key":"9497_CR18","doi-asserted-by":"crossref","unstructured":"Nussbaumer, H.J.: Fast Fourier Transform and Convolution Algorithms, 2nd edn. Springer-Verlag (1982)","DOI":"10.1007\/978-3-642-81897-4"},{"key":"9497_CR19","unstructured":"Nuyens, D.: Fast construction of good lattice rules. Ph.D. Thesis, Dept. of Computer Science, K. U. Leuven (2007)"},{"issue":"254","key":"9497_CR20","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1090\/S0025-5718-06-01785-6","volume":"75","author":"D Nuyens","year":"2006","unstructured":"Nuyens, D., Cools, R.: Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces. Math. Comput. 75(254), 903\u2013920 (2006)","journal-title":"Math. Comput."},{"key":"9497_CR21","unstructured":"Nuyens, D., Cools, R.: Fast component-by-component construction, a reprise for different kernels. In: Niederreiter, H., Talay, D. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 371\u2013385. Springer-Verlag (2006)"},{"issue":"5","key":"9497_CR22","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1137\/S0036142994277468","volume":"34","author":"AB Owen","year":"1997","unstructured":"Owen, A.B.: Monte Carlo variance of scrambled net quadrature. SIAM J. Numer. Anal. 34(5), 1884\u20131910 (1997)","journal-title":"SIAM J. Numer. Anal."},{"key":"9497_CR23","doi-asserted-by":"crossref","unstructured":"Pirsic, G.: A software implementation of Niederreiter\u2013Xing sequences. In: Fang, K.T., Hickernell, F.J., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000, pp.\u00a0434\u2013445. Springer-Verlag (2002)","DOI":"10.1007\/978-3-642-56046-0_30"},{"key":"9497_CR24","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/978-3-642-59657-5_30","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods 1998","author":"WC Schmid","year":"2000","unstructured":"Schmid, W.C.: Improvements and extensions of the \u201cSalzburg Tables\u201d by using irreducible polynomials. In: Niederreiter, H., Spanier, J. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 1998, pp. 436\u2013447. Springer, Berlin (2000)"},{"issue":"237","key":"9497_CR25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/S0025-5718-01-01342-4","volume":"71","author":"IH Sloan","year":"2002","unstructured":"Sloan, I.H., Reztsov, A.V.: Component-by-component construction of good lattice rules. Math. Comput. 71(237), 263\u2013273 (2002)","journal-title":"Math. Comput."},{"issue":"1","key":"9497_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcom.1997.0463","volume":"14","author":"IH Sloan","year":"1998","unstructured":"Sloan, I.H., Wo\u017aniakowski, H.: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J. Complex. 14(1), 1\u201333 (1998)","journal-title":"J. Complex."},{"issue":"124","key":"9497_CR27","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1090\/S0025-5718-1973-0327722-7","volume":"27","author":"W Stahnke","year":"1973","unstructured":"Stahnke, W.: Primitive binary polynomials. Math. Comput. 27(124), 977\u2013980 (1973)","journal-title":"Math. Comput."},{"key":"9497_CR28","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0041-5553(63)90033-8","volume":"3","author":"IF \u0160arygin","year":"1965","unstructured":"\u0160arygin, I.F.: Lower bounds for the error of quadrature formulas on classes of functions. USSR Comput. Math. Math. Phys. 3, 489\u2013497 (1965); Translation from Russian Zh. Vychisl. Mat. Mat. Fiz. 3, 370\u2013376 (1963)","journal-title":"USSR Comput. Math. Math. Phys."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9497-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9497-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9497-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T21:02:09Z","timestamp":1560546129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9497-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,3]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9497"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9497-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,3]]}}}