{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:46:41Z","timestamp":1776358001509,"version":"3.51.2"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T00:00:00Z","timestamp":1738713600000},"content-version":"vor","delay-in-days":4,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210103092"],"award-info":[{"award-number":["DP210103092"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP220101811"],"award-info":[{"award-number":["DP220101811"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["F5509- N26"],"award-info":[{"award-number":["F5509- N26"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Johannes Kepler University Linz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We study numerical integration over bounded regions in <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {R}^s$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>s<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$s \\ge 1$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>s<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, with respect to some probability measure. We replace random sampling with quasi-Monte Carlo methods, where the underlying point set is derived from deterministic constructions which aim to fill the space more evenly than random points. Ordinarily, such quasi-Monte Carlo point sets are designed for the uniform measure, and the theory only works for product measures when a coordinate-wise transformation is applied. Going beyond this setting, we first consider the case where the target density is a mixture distribution where each term in the mixture comes from a product distribution. Next, we consider target densities which can be approximated with such mixture distributions. In order to be able to use an approximation of the target density, we require the approximation to be a sum of coordinate-wise products and that the approximation is positive everywhere (so that they can be re-scaled to probability density functions). We use tensor product hat function approximations for this purpose here, since a hat function approximation of a positive function is itself positive. We also study more complex algorithms, where we first approximate the target density with a general Gaussian mixture distribution and approximate this mixture distribution with an adaptive hat function approximation on rotated intervals. The Gaussian mixture approximation allows us (at least to some degree) to locate the essential parts of the target density, whereas the adaptive hat function approximation allows us to approximate the finer structure of the target density. We prove convergence rates for each of the integration techniques based on quasi-Monte Carlo sampling for integrands with bounded partial mixed derivatives. The employed algorithms are based on digital (<jats:italic>t<\/jats:italic>,\u00a0<jats:italic>s<\/jats:italic>)-sequences over the finite field <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {F}_2$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and an inversion method. Numerical examples illustrate the performance of the algorithms for some target densities and integrands.<\/jats:p>","DOI":"10.1007\/s10444-025-10223-1","type":"journal-article","created":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T09:49:23Z","timestamp":1738748963000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quasi-Monte Carlo methods for mixture distributions and approximated distributions via piecewise linear interpolation"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4840-8545","authenticated-orcid":false,"given":"Tiangang","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0142-6022","authenticated-orcid":false,"given":"Josef","family":"Dick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6952-9218","authenticated-orcid":false,"given":"Friedrich","family":"Pillichshammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"issue":"4","key":"10223_CR1","first-page":"990","volume":"48","author":"C Aistleitner","year":"2012","unstructured":"Aistleitner, C., Brauchart, J.S., Dick, J.: Point sets on the sphere $$\\mathbb{S} ^2$$ with small spherical cap discrepancy. Discrete Comput. Geom. 48(4), 990\u20131024 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10223_CR2","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1137\/140960463","volume":"53","author":"K Basu","year":"2015","unstructured":"Basu, K., Owen, A.B.: Low discrepancy constructions in the triangle. SIAM J. Numer. Anal. 53(2), 743\u2013761 (2015)","journal-title":"SIAM J. Numer. Anal."},{"key":"10223_CR3","doi-asserted-by":"crossref","unstructured":"de Boor, C.: A practical guide to splines. Number 27 in Applied Mathematical Sciences Series. Springer-Verlag, New York (1978)","DOI":"10.1007\/978-1-4612-6333-3"},{"key":"10223_CR4","unstructured":"Chen, W.Y.,\u00a0Mackey, L.,\u00a0Gorham, J.,\u00a0Briol, F.-X.,\u00a0Oates, C.: Stein Points. In: Proc. 35th Int. Conf. Mach. Learn. 80, 844\u2013853 (2018)"},{"key":"10223_CR5","doi-asserted-by":"crossref","unstructured":"Dempster, A.P.,\u00a0Laird, N.M.,\u00a0Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Series B Stat. 39, 1\u201322 (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"10223_CR6","doi-asserted-by":"crossref","unstructured":"Dick, J.,\u00a0Kritzer, P.,\u00a0Pillichshammer, F.: Lattice Rules \u2013 Numerical integration, approximation, and discrepancy. With an Appendix by Adrian Ebert. Springer Series in Computational Mathematics, 58. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-09951-9"},{"key":"10223_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1017\/S0962492913000044","volume":"22","author":"J Dick","year":"2013","unstructured":"Dick, J., Kuo, F.Y., Sloan, I.H.: High-dimensional integration: the quasi-Monte Carlo way. Acta Numer. 22, 133\u2013288 (2013)","journal-title":"Acta Numer."},{"key":"10223_CR8","doi-asserted-by":"publisher","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":"10223_CR9","doi-asserted-by":"crossref","unstructured":"Dick, J.,\u00a0Pillichshammer, F.: Weighted integration over a hyperrectangle based on digital nets and sequences. J. Comput. Appl. Math. 393 (2021), paper ref. 113509, 25 pp","DOI":"10.1016\/j.cam.2021.113509"},{"key":"10223_CR10","doi-asserted-by":"crossref","unstructured":"Dick, J.,\u00a0Pillichshammer, F.: Quasi-Monte Carlo integration over $$\\mathbb{R}^{s}$$ based on digital nets. Submitted for publication. J. Comput. Appl. Math. 462 (2025), Paper No. 116451","DOI":"10.1016\/j.cam.2024.116451"},{"issue":"3","key":"10223_CR11","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s11222-019-09910-z","volume":"30","author":"S Dolgov","year":"2020","unstructured":"Dolgov, S., Anaya-Izquierdo, K., Fox, C., Scheichl, R.: Approximation and sampling of multivariate probability distributions in the tensor train decomposition. Statistics and Computing 30(3), 603\u2013625 (2020)","journal-title":"Statistics and Computing"},{"issue":"2","key":"10223_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.4064\/aa117-2-2","volume":"117","author":"H Faure","year":"2005","unstructured":"Faure, H.: Discrepancy and diaphony of digital $$(0,1)$$-sequences in prime base. Acta Arith. 117(2), 125\u2013148 (2005)","journal-title":"Acta Arith."},{"key":"10223_CR13","unstructured":"Genz, A.: Testing multidimensional integration routines, Proc. of International Conference on Tools, Methods and Languages for Scientific and Engineering Computation (1984)"},{"issue":"4B","key":"10223_CR14","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.3150\/16-BEJ834","volume":"23","author":"M Gerber","year":"2017","unstructured":"Gerber, M., Chopin, N.: Convergence of sequential quasi-Monte Carlo smoothing algorithms. Bernoulli 23(4B), 2951\u20132987 (2017)","journal-title":"Bernoulli"},{"issue":"3","key":"10223_CR15","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1111\/rssb.12104","volume":"77","author":"M Gerber","year":"2015","unstructured":"Gerber, M., Chopin, N.: Sequential quasi Monte Carlo. J. R. Stat. Soc. Ser. B. Stat. Methodol. 77(3), 509\u2013579 (2015)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"issue":"1","key":"10223_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.jmaa.2017.04.051","volume":"454","author":"T Goda","year":"2017","unstructured":"Goda, T., Suzuki, K., Yoshiki, T.: Quasi-Monte Carlo integration for twice differentiable functions over a triangle. J. Math. Anal. Appl. 454(1), 361\u2013384 (2017)","journal-title":"J. Math. Anal. Appl."},{"key":"10223_CR17","unstructured":"Gorham, J.,\u00a0Mackey, L.: Measuring sample quality with Stein\u2019s method. In: Advances in Neural Information Processing Systems, 28, 2015, pp. 226\u2013234, Curran Associates, Inc"},{"key":"10223_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05946-3","volume-title":"Automatic nonuniform random variate generation","author":"W Hoermann","year":"2004","unstructured":"Hoermann, W., Leydold, J., Derflinger, G.: Automatic nonuniform random variate generation. Springer Series in Statistics and Computing. Springer, Berlin (2004)"},{"key":"10223_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0378-3758(90)90122-B","volume":"26","author":"M Johnson","year":"1990","unstructured":"Johnson, M., Moore, L., Ylvisaker, D.: Minimax and maximin distance designs. Journal of Statistical Planning and Inference 26, 131\u2013148 (1990)","journal-title":"Journal of Statistical Planning and Inference"},{"issue":"2","key":"10223_CR20","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11009-007-9045-3","volume":"10","author":"FY Kuo","year":"2008","unstructured":"Kuo, F.Y., Dunsmuir, W.T.M., Sloan, I.H., Wand, M.P., Womersley, R.S.: Quasi-Monte Carlo for highly structured generalised response models. Methodol. Comput. Appl. Probab. 10(2), 239\u2013275 (2008)","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"6","key":"10223_CR21","doi-asserted-by":"publisher","first-page":"3351","DOI":"10.1137\/110845537","volume":"50","author":"FY Kuo","year":"2012","unstructured":"Kuo, F.Y., Schwab, Ch., Sloan, I.H.: Quasi-Monte Carlo finite element methods for a class of elliptic partial differential equations with random coefficients. SIAM J. Numer. Anal. 50(6), 3351\u20133374 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"10223_CR22","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1287\/opre.1080.0556","volume":"56","author":"P L\u2019Ecuyer","year":"2008","unstructured":"L\u2019Ecuyer, P., L\u00e9cot, C., Tuffin, B.: A randomized quasi-Monte Carlo simulation method for Markov chains. Operations Research 56(4), 958\u2013975 (2008)","journal-title":"Operations Research"},{"key":"10223_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.matcom.2016.07.010","volume":"143","author":"P L\u2019Ecuyer","year":"2018","unstructured":"L\u2019Ecuyer, P., Munger, D., L\u00e9cot, Ch., Tuffin, B.: Sorting methods and convergence rates for Array-RQMC: some empirical comparisons. Math. Comput. Simulation 143, 191\u2013201 (2018)","journal-title":"Math. Comput. Simulation"},{"key":"10223_CR24","volume-title":"Monte Carlo and quasi-Monte Carlo sampling","author":"Ch Lemieux","year":"2009","unstructured":"Lemieux, Ch.: Monte Carlo and quasi-Monte Carlo sampling. Springer Series in Statistics. Springer, New York (2009)"},{"key":"10223_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03425-6","volume-title":"Introduction to quasi-Monte Carlo integration and applications","author":"G Leobacher","year":"2014","unstructured":"Leobacher, G., Pillichshammer, F.: Introduction to quasi-Monte Carlo integration and applications. Compact Textbooks in Mathematics. Birkh\u00e4user\/Springer, Cham (2014)"},{"key":"10223_CR26","volume-title":"Monte Carlo strategies in scientific computing","author":"JS Liu","year":"2008","unstructured":"Liu, J.S.: Monte Carlo strategies in scientific computing. Springer Science & Business Media, Berlin (2008)"},{"issue":"6A","key":"10223_CR27","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1214\/17-AOS1629","volume":"46","author":"S Mak","year":"2018","unstructured":"Mak, S., Joseph, V.R.: Support points. Ann. Stat. 46(6A), 2562\u20132592 (2018)","journal-title":"Ann. Stat."},{"key":"10223_CR28","doi-asserted-by":"crossref","unstructured":"Marzouk, Y.,\u00a0Moselhy, T.,\u00a0Parno, M.,\u00a0Spantini, A.: Sampling via measure transport: an introduction. In: Handbook of Uncertainty Quantification. Vol. 1, 2, 3, pp.\u00a0785\u2013825, Springer, Cham, 2017","DOI":"10.1007\/978-3-319-12385-1_23"},{"issue":"4","key":"10223_CR29","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.jco.2014.02.004","volume":"30","author":"JA Nichols","year":"2014","unstructured":"Nichols, J.A., Kuo, F.Y.: Fast CBC construction of randomly shifted lattice rules achieving $$\\cal{O} (n^{-1+\\delta })$$ convergence for unbounded integrands over $$\\mathbb{R} ^{s}$$ in weighted spaces with POD weights. J. Complexity 30(4), 444\u2013468 (2014)","journal-title":"J. Complexity"},{"issue":"4","key":"10223_CR30","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01294651","volume":"104","author":"H Niederreiter","year":"1987","unstructured":"Niederreiter, H.: Point sets and sequences with small discrepancy. Monatsh. Math. 104(4), 273\u2013337 (1987)","journal-title":"Monatsh. Math."},{"key":"10223_CR31","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Random number generation and quasi-Monte Carlo methods. No. 63 in CBMS-NSF Series in Applied Mathematics. SIAM, Philadelphia (1992)","DOI":"10.1137\/1.9781611970081"},{"key":"10223_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo statistical methods","author":"CP Robert","year":"2004","unstructured":"Robert, C.P., Casella, G.: Monte Carlo statistical methods. Springer Texts Statist. Springer-Verlag, New York (2004)"},{"key":"10223_CR33","doi-asserted-by":"crossref","unstructured":"Schretter, C.,\u00a0He, Z.,\u00a0Gerber, M.,\u00a0Chopin, N.,\u00a0Niederreiter, H.: Van der Corput and golden ratio sequences along the Hilbert space-filling curve. In: Monte Carlo and Quasi-Monte Carlo Methods, pp.\u00a0531\u2013544, Springer Proc. Math. Stat., 163, Springer, Cham (2016)","DOI":"10.1007\/978-3-319-33507-0_28"},{"issue":"6","key":"10223_CR34","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.1073\/pnas.0607208104","volume":"106","author":"SA Sisson","year":"2007","unstructured":"Sisson, S.A., Fan, Y., Tanaka, M.M.: Sequential Monte Carlo without likelihoods. Proc. Natl. Acad. Sci. 106(6), 1760\u20131765 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10223_CR35","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1214\/aos\/1176346060","volume":"11","author":"CFJ Wu","year":"1983","unstructured":"Wu, C.F.J.: On the convergence properties of the EM algorithm. Ann. Stat. 11, 95\u2013103 (1983)","journal-title":"Ann. Stat."},{"key":"10223_CR36","doi-asserted-by":"publisher","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. Complexity 14, 1\u201333 (1998)","journal-title":"J. Complexity"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10223-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-025-10223-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-025-10223-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T10:24:38Z","timestamp":1740392678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-025-10223-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10223"],"URL":"https:\/\/doi.org\/10.1007\/s10444-025-10223-1","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"28 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}