{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:20:58Z","timestamp":1769264458545,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030983185","type":"print"},{"value":"9783030983192","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98319-2_3","type":"book-chapter","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T07:03:13Z","timestamp":1653030193000},"page":"51-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Tool for Custom Construction of QMC and RQMC Point Sets"],"prefix":"10.1007","author":[{"given":"Pierre","family":"L\u2019Ecuyer","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Marion","sequence":"additional","affiliation":[]},{"given":"Maxime","family":"Godin","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Puchhammer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Baldeaux, J., Dick, J., Greslehner, J., Pillichshammer, F.: Construction algorithms for higher order polynomial lattice rules. J. Complex. 27, 281\u2013299 (2011)","DOI":"10.1016\/j.jco.2010.06.002"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Baldeaux, J., Dick, J., Leobacher, G., Nuyens, D., Pillichshammer, F.: Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules. Numer. Algorithms 59(3), 403\u2013431 (2012)","DOI":"10.1007\/s11075-011-9497-y"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Dick, J.: Explicit constructions of Quasi-Monte Carlo rules for the numerical integration of high-dimensional periodic functions. SIAM J. Numer. Anal. 45(5), 2141\u20132176 (2007)","DOI":"10.1137\/060658916"},{"key":"3_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1137\/060666639"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dick, J., Kuo, F.Y., Pillichshammer, F., Sloan, I.H.: Construction algorithms for polynomial lattice rules for multivariate integration. Math. Comput. 74(248), 1895\u20131921 (2005)","DOI":"10.1090\/S0025-5718-05-01742-4"},{"key":"3_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1016\/j.jco.2004.07.003"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dick, J., Pillichshammer, F.: Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules. J. Complex. 23, 436\u2013453 (2007)","DOI":"10.1016\/j.jco.2007.02.001"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Dick, J., Pillichshammer, F.: Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge, U.K. (2010)","DOI":"10.1017\/CBO9780511761188"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Dick, J., Sloan, I.H., Wang, X., Wo\u017aniakowski, H.: Good lattice rules in weighted Korobov spaces with general weights. Numerische Mathematik 103, 63\u201397 (2006)","DOI":"10.1007\/s00211-005-0674-6"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Efron, B., Stein, C.: The jackknife estimator of variance. Ann. Stat. 9, 586\u2013596 (1981)","DOI":"10.1214\/aos\/1176345462"},{"key":"3_CR11","unstructured":"Genz, A.: Testing multidimensional integration routines. In: Proceedings of the International Conference on Tools, Methods and Languages for Scientific and Engineering Computation, pp. 81\u201394. Elsevier North-Holland (1984)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Kuo, F., Sloan, I.: Hiding the weights-CBC black box algorithms with a guaranteed error bound. Math. Comput. Simul. 143, 202\u2013214 (2018)","DOI":"10.1016\/j.matcom.2016.06.005"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Goda, T.: Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces. J. Comput. Appl. Math. 285, 279\u2013294 (2015)","DOI":"10.1016\/j.cam.2015.02.041"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Goda, T., Dick, J.: Construction of interlaced scrambled polynomial lattice rules of arbitrary high order. Found. Comput. Math. 15, 1245\u20131278 (2019)","DOI":"10.1007\/s10208-014-9226-8"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Goda, T., Suzuki, K.: Recent Advances in Higher Order Quasi-Monte Carlo Methods, pp. 69\u2013102. De Gruyter (2019)","DOI":"10.1515\/9783110652581-004"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Goda, T., Suzuki, K., Yoshiki, T.: An explicit construction of optimal order Quasi-Monte Carlo rules for smooth integrands. SIAM J. Numer. Anal. 54, 2664\u20132683 (2016)","DOI":"10.1137\/16M1060807"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Goda, T., Suzuki, K., Yoshiki, T.: Optimal order Quasi-Monte Carlo integration in weighted Sobolev spaces of arbitrary smoothness. SIAM J. Numer. Anal. 37, 505\u2013518 (2017)","DOI":"10.1093\/imanum\/drw011"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Goda, T., Suzuki, K., Yoshiki, T.: Optimal order quadrature error bounds for infinite-dimensional higher-order digital sequences. Found. Comput. Math. 18, 433\u2013458 (2018)","DOI":"10.1007\/s10208-017-9345-0"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Hickernell, F.J.: A generalized discrepancy and quadrature error bound. Math. Comput. 67(221), 299\u2013322 (1998)","DOI":"10.1090\/S0025-5718-98-00894-1"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Hickernell, F.J.: Lattice rules: How well do they measure up? In: Hellekalek, P., Larcher, G. (eds.) Random and Quasi-Random Point Sets. Lecture Notes in Statistics, vol. 138, pp. 109\u2013166. Springer, New York (1998)","DOI":"10.1007\/978-1-4612-1702-2_3"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Hickernell, F.J.: Obtaining $${O(N^{-2+\\epsilon })}$$ convergence for lattice quadrature rules. In: Fang, K.T., Hickernell, F.J., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2000, pp. 274\u2013289. Springer, Berlin (2002)","DOI":"10.1007\/978-3-642-56046-0_18"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Hickernell, F.J., Hong, H.S., L\u2019Ecuyer, P., Lemieux, C.: Extensible lattice sequences for Quasi-Monte Carlo quadrature. SIAM J. Sci. Comput. 22(3), 1117\u20131138 (2001)","DOI":"10.1137\/S1064827599356638"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Hickernell, F.J., Yue, R.X.: The mean square discrepancy of scrambled $$(t, s)$$-sequences. SIAM J. Numer. Anal. textbf38(4), 1089\u20131112 (2001)","DOI":"10.1137\/S0036142999358019"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Hong, H.S., Hickernell, F.H.: Algorithm 823: implementing scrambled digital sequences. ACM Trans. Math. Softw. 29, 95\u2013109 (2003)","DOI":"10.1145\/779359.779360"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Joe, S., Kuo, F.Y.: Constructing Sobol sequences with better two-dimensional projections. SIAM J. Sci. Comput. 30(5), 2635\u20132654 (2008)","DOI":"10.1137\/070709359"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P.: Polynomial integration lattices. In: Niederreiter, H. (ed.) Monte Carlo and Quasi-Monte Carlo Methods 2002, pp. 73\u201398. Springer, Berlin (2004)","DOI":"10.1007\/978-3-642-18743-8_4"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P.: Quasi-Monte Carlo methods with applications in finance. Financ. Stoch. 13(3), 307\u2013349 (2009)","DOI":"10.1007\/s00780-009-0095-y"},{"key":"3_CR28","unstructured":"L\u2019Ecuyer, P.: SSJ: Stochastic Simulation in Java (2016). http:\/\/simul.iro.umontreal.ca\/ssj\/. Accessed 9 Aug 2021"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Buist, E.: Simulation in Java with SSJ. In: Proceedings of the 2005 Winter Simulation Conference, pp. 611\u2013620. IEEE Press, Piscataway, NJ (2005)","DOI":"10.1109\/WSC.2005.1574301"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Lemieux, C.: Variance reduction via lattice rules. Manag. Sci. 46(9), 1214\u20131235 (2000)","DOI":"10.1287\/mnsc.46.9.1214.12231"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Lemieux, C.: Recent advances in randomized Quasi-Monte Carlo methods. In: Dror, M., L\u2019Ecuyer, P., Szidarovszky, F. (eds.) Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications, pp. 419\u2013474. Kluwer Academic, Boston (2002)","DOI":"10.1007\/0-306-48102-2_20"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Munger, D.: Constructing adapted lattice rules using problem-dependent criteria. In: Proceedings of the 2012 Winter Simulation Conference, pp. 373\u2013384. IEEE Press (2012)","DOI":"10.1109\/WSC.2012.6465291"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Munger, D.: On figures of merit for randomly-shifted lattice rules. In: Wo\u017aniakowski, H., Plaskota, L. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2010, pp. 133\u2013159. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-27440-4_6"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Munger, D.: Algorithm 958: Lattice builder: a general software tool for constructing rank-1 lattice rules. ACM Trans. Math. Softw. 42(2), Article 15 (2016)","DOI":"10.1145\/2754929"},{"key":"3_CR35","unstructured":"Lemieux, C., Cieslak, M., Luttmer, K.: RandQMC User\u2019s Guide: A Package for Randomized Quasi-Monte Carlo Methods in C (2004). Software user\u2019s guide, available at http:\/\/www.math.uwaterloo.ca\/~clemieux\/randqmc.html"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Lemieux, C., L\u2019Ecuyer, P.: Randomized polynomial lattice rules for multivariate integration and simulation. SIAM J. Sci. Comput. 24(5), 1768\u20131789 (2003)","DOI":"10.1137\/S1064827501393782"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Marion, P., Godin, M., L\u2019Ecuyer, P.: An algorithm to compute the $$t$$-value of a digital net and of its projections. J. Comput. Appl. Math. 371(June), 112669 (2020)","DOI":"10.1016\/j.cam.2019.112669"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Matous\u011bk, J.: On the $$L_2$$-discrepancy for anchored boxes. J. Complex. 14, 527\u2013556 (1998)","DOI":"10.1006\/jcom.1998.0489"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Low-discrepancy point sets obtained by digital constructions over finite fields. Czechoslovak Math. J. 42, 143\u2013166 (1992)","DOI":"10.21136\/CMJ.1992.128322"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Random number generation and Quasi-Monte Carlo methods. In: SIAM CBMS-NSF Regional Conference Series in Mathematics, vol. 63. SIAM (1992)","DOI":"10.1137\/1.9781611970081"},{"key":"3_CR41","unstructured":"Nuyens, D.: Fast component-by-component constructions (2012). http:\/\/people.cs.kuleuven.be\/~dirk.nuyens\/fast-cbc\/, http:\/\/people.cs.kuleuven.be\/~dirk.nuyens\/fast-cbc\/"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Nuyens, D.: The construction of good lattice rules and polynomial lattice rules. In: Kritzer, P., Niederreiter, H., Pillichshammer, F., Winterhof, A. (eds.) Uniform Distribution and Quasi-Monte Carlo Methods: Discrepancy, Integration and Applications, pp. 223\u2013255. De Gruyter (2014)","DOI":"10.1515\/9783110317930.223"},{"key":"3_CR43","unstructured":"Nuyens, D.: The Magic Point Shop (2020). https:\/\/people.cs.kuleuven.be\/~dirk.nuyens\/qmc-generators\/"},{"key":"3_CR44","doi-asserted-by":"crossref","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, 903\u2013920 (2006)","DOI":"10.1090\/S0025-5718-06-01785-6"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Monte Carlo variance of scrambled equidistribution quadrature. SIAM J. Numer. Anal. 34(5), 1884\u20131910 (1997)","DOI":"10.1137\/S0036142994277468"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Scrambled net variance for integrals of smooth functions. Ann. Stat. 25(4), 1541\u20131562 (1997)","DOI":"10.1214\/aos\/1031594731"},{"key":"3_CR47","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Latin supercube sampling for very high-dimensional simulations. ACM Trans. Model. Comput. Simul. 8(1), 71\u2013102 (1998)","DOI":"10.1145\/272991.273010"},{"key":"3_CR48","doi-asserted-by":"crossref","unstructured":"Owen, A.B.: Variance with alternative scramblings of digital nets. ACM Trans. Model. Comput. Simul. 13(4), 363\u2013378 (2003)","DOI":"10.1145\/945511.945518"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Sinescu, V., L\u2019Ecuyer, P.: Variance bounds and existence results for randomly shifted lattice rules. J. Comput. Appl. Math. 236, 3296\u20133307 (2012)","DOI":"10.1016\/j.cam.2012.02.034"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Sloan, I.H., Joe, S.: Lattice Methods for Multiple Integration. Clarendon Press, Oxford (1994)","DOI":"10.1093\/oso\/9780198534723.001.0001"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Sloan, I.H., Rezstov, A.: Component-by-component construction of good lattice rules. Math. Comput. 71, 262\u2013273 (2002)","DOI":"10.1090\/S0025-5718-01-01342-4"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Sobol\u2019, I.M.: The distribution of points in a cube and the approximate evaluation of integrals. U.S.S.R. Comput. Math. and Math. Phys. 7(4), 86\u2013112 (1967)","DOI":"10.1016\/0041-5553(67)90144-9"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Sobol, I.M., Asotsky, D.I.: One more experiment on estimating high-dimensional integrals by quasi-Monte Carlo methods. Math. Comput. Simul. 62(3\u20136), 255\u2013263 (2003)","DOI":"10.1016\/S0378-4754(02)00228-8"},{"key":"3_CR54","doi-asserted-by":"crossref","unstructured":"Yue, R.X., Hickernell, F.J.: The discrepancy and gain coefficients of scrambled digital nets. J. Complex. 18(1), 135\u2013151 (2002). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0885064X01906302","DOI":"10.1006\/jcom.2001.0630"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Monte Carlo and Quasi-Monte Carlo Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98319-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T16:19:10Z","timestamp":1727281150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98319-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030983185","9783030983192"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98319-2_3","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"value":"2194-1009","type":"print"},{"value":"2194-1017","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCQMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcqmc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mcqmc20.web.ox.ac.uk\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}