<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">27530</article-id><article-id pub-id-type="doi">10.22363/2658-4670-2021-29-3-260-270</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Статьи</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Shifted Sobol points and multigrid Monte Carlo simulation</article-title><trans-title-group xml:lang="ru"><trans-title>Сдвинутые точки Соболя и многосеточный расчёт методом Монте-Карло</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0918-9263</contrib-id><name-alternatives><name xml:lang="en"><surname>Belov</surname><given-names>Aleksandr A.</given-names></name><name xml:lang="ru"><surname>Белов</surname><given-names>А. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Candidate of Physical and Mathematical Sciences, Assistant professor of Department of Applied Probability and Informatics of Peoples’ Friendship University of Russia (RUDN University); Researcher of Faculty of Physics, M.V. Lomonosov Moscow State University</p></bio><email>aa.belov@physics.msu.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5466-1221</contrib-id><name-alternatives><name xml:lang="en"><surname>Tintul</surname><given-names>Maxim A.</given-names></name><name xml:lang="ru"><surname>Тинтул</surname><given-names>М. А.</given-names></name></name-alternatives><bio xml:lang="en"><p>Master’s degree student of Faculty of Physics</p></bio><email>maksim.tintul@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">M.V. Lomonosov Moscow State University</institution></aff><aff><institution xml:lang="ru">Московский государственный университет им. М.В. Ломоносова</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2021-09-30" publication-format="electronic"><day>30</day><month>09</month><year>2021</year></pub-date><volume>29</volume><issue>3</issue><issue-title xml:lang="en">VOL 29, NO3 (2021)</issue-title><issue-title xml:lang="ru">ТОМ 29, №3 (2021)</issue-title><fpage>260</fpage><lpage>270</lpage><history><date date-type="received" iso-8601-date="2021-09-30"><day>30</day><month>09</month><year>2021</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2021, Belov A.A., Tintul M.A.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2021, Белов А.А., Тинтул М.А.</copyright-statement><copyright-year>2021</copyright-year><copyright-holder xml:lang="en">Belov A.A., Tintul M.A.</copyright-holder><copyright-holder xml:lang="ru">Белов А.А., Тинтул М.А.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/27530">https://journals.rudn.ru/miph/article/view/27530</self-uri><abstract xml:lang="en"><p style="text-align: justify;">Multidimensional integrals arise in many problems of physics. For example, moments of the distribution function in the problems of transport of various particles (photons, neutrons, etc.) are 6-dimensional integrals. When calculating the coefficients of electrical conductivity and thermal conductivity, scattering integrals arise, the dimension of which is equal to 12. There are also problems with a significantly large number of variables. The Monte Carlo method is the most effective method for calculating integrals of such a high multiplicity. However, the efficiency of this method strongly depends on the choice of a sequence that simulates a set of random numbers. A large number of pseudo-random number generators are described in the literature. Their quality is checked using a battery of formal tests. However, the simplest visual analysis shows that passing such tests does not guarantee good uniformity of these sequences. The magic Sobol points are the most effective for calculating multidimensional integrals. In this paper, an improvement of these sequences is proposed: the shifted magic Sobol points that provide better uniformity of points distribution in a multidimensional cube. This significantly increases the cubature accuracy. A significant difficulty of the Monte Carlo method is a posteriori confirmation of the actual accuracy. In this paper, we propose a multigrid algorithm that allows one to find the grid value of the integral simultaneously with a statistically reliable accuracy estimate. Previously, such estimates were unknown. Calculations of representative test integrals with a high actual dimension up to 16 are carried out. The multidimensional Weierstrass function, which has no derivative at any point, is chosen as the integrand function. These calculations convincingly show the advantages of the proposed methods.</p></abstract><trans-abstract xml:lang="ru"><p style="text-align: justify;">Многомерные интегралы возникают во многих задачах физики. Например, моменты функции распределения в задачах переноса различных частиц (фотонов, нейтронов и др.) являются 6-мерными интегралами. При расчёте коэффициентов электропроводности и теплопроводности возникают интегралы рассеяния, размерность которых равна 12. Возникают задачи и с существенно большим числом переменных. Для вычисления интегралов столь высокой кратности наиболее эффективен метод Монте-Карло. Однако работоспособность этого метода сильно зависит от выбора последовательности, имитирующей набор случайных чисел. В литературе описано большое количество генераторов псевдослучайных чисел. Их качество проверяется с помощью батарей формальных тестов. Однако простейший визуальный анализ показывает, что прохождение таких тестов не гарантирует хорошей равномерности этих последовательностей. Для вычисления многомерных интегралов наиболее эффективны магические точки Соболя. В данной работе предложено усовершенствование этих последовательностей - смещённые магические точки Соболя, обеспечивающие большую равномерность распределения точек в многомерном кубе. Это ощутимо повышает точность кубатур. Существенной трудностью методов Монте-Карло является апостериорное подтверждение фактической точности. В данной работе предложен многосеточный алгоритм, позволяющий найти сеточное значение интеграла одновременно со статистически достоверной оценкой его точности. Ранее такие оценки были неизвестны. Проведены расчёты представительных тестовых интегралов с высокой фактической размерностью до 16. В качестве подынтегральной функции выбрана многомерная функция Вейерштрасса, не имеющая производной ни в одной точке. Эти расчёты убедительно показывают преимущества предложенных методов.</p></trans-abstract><kwd-group xml:lang="en"><kwd>multidimensional integral</kwd><kwd>Monte Carlo method</kwd><kwd>Sobol points</kwd><kwd>multigrid calculation</kwd><kwd>a posteriori error estimates</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>многомерный интеграл</kwd><kwd>метод Монте-Карло</kwd><kwd>точки Соболя</kwd><kwd>многосеточный расчет</kwd><kwd>апостериорные оценки точности</kwd></kwd-group><funding-group><funding-statement xml:lang="en">This work was supported by grant MK-3630.2021.1.1.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>I. M. Sobol, Numerical Monte-Carlo methods [Chislennyye metody MonteKarlo]. Moscow: Nauka, 1973, In Russian.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>D. E. Knuth, The art of computer programming, 3rd ed. Reading, Massachusetts: Addison-Wesley, 1997, vol. 2.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>G. S. Fishman, Monte Carlo: concepts, algorithms and applications. Berlin: Springer, 1996. DOI: 10.1007/978-1-4757-2553-7.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>M. Matsumoto and T. Nishimura, “Mersenne twister: a 623dimensionally equidistributed uniform pseudo-random number generator,” ACM Transactions on Modeling and Computer Simulation (TOMACS), vol. 8, no. 1, pp. 3-30, 1998. DOI: 10.1145/272991.272995.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>T. Nishimura, “Tables of 64-bit Mersenne twisters,” ACM Transactions on Modeling and Computer Simulation, vol. 10, no. 4, pp. 348-357, 2000. DOI: 10.1145/369534.369540.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>“Mersenne Twister Home Page.” (2021), [Online]. Available: http:// www.math.sci.hiroshima-u.ac.jp/m-mat/MT/emt.html.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>S. K. Park and K. W. Miller, “Random number generators: good ones are hard to find,” Communications of the ACM, vol. 31, no. 10, pp. 1192-1201, 1998. DOI: 10.1145/63039.63042.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>M. Mascagni and A. Srinivasan, “Parameterizing parallel multiplicative Lagged-Fibonacci generators,” Parallel Computing, vol. 30, pp. 899-916, 2004. DOI: 10.1016/j.parco.2004.06.001.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>P. L’Ecuyer, “Good parameter sets for combined multiple recursive random number generators,” Operations Research, vol. 47, no. 1, pp. 159-164, 1999. DOI: 10.1287/opre.47.1.159.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>J. K. Salmon, M. A. Moraes, R. O. Dror, and D. E. Shaw, “Parallel random numbers: as easy as 1, 2, 3,” 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), pp. 1-12, 2011. DOI: 10.1145/2063384.2063405.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>G. Marsaglia and W. W. Tsang, “The ziggurat method for generating random variables,” Journal of Statistical Software, vol. 5, pp. 1-7, 2000. DOI: 10.18637/jss.v005.i08.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>G. Marsaglia and A. Zaman, “A new class of random number generators,” Annals of Applied Probability, vol. 1, no. 3, pp. 462-480, 1991. DOI: 10.1214/aoap/1177005878.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>B. A. Wichmann and I. D. Hill, “An efficient and portable pseudorandom number generator,” Applied Statistics, vol. 31, no. 2, pp. 188-190, 1982. DOI: 10.2307/2347988.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>E. A. Tsvetkov, “Empirical tests for statistical properties of some pseudorandom number generators,” Mathematical Models and Computer Simulations, vol. 3, pp. 697-705, 2011. DOI: 10.1134/S207004821106010X.</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>“The Marsaglia Random Number CDROM including the Diehard Battery of Tests of Randomness.” (2021), [Online]. Available: http:// ftpmirror.your.org/pub/misc/diehard/.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>P. L’Ecuyer and R. Simard, “TestU01: A C library for empirical testing of random number generators,” ACM Transactions on Mathematical Software (TOMS), vol. 33, no. 4, pp. 1-40, 2007. DOI: 10.1145/1268776.1268777.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>L. E. Bassham, A. L. Rukhin, J. Soto, J. R. Nechvatal, M. E. Smid, S. D. Leigh, M. Levenson, M. Vangel, N. A. Heckert, and D. L. Banks, “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” National Institute of Standards and Technology, NIST Special Publication, Gaithersburg, MD, Tech. Rep., 2010.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>A. A. Belov, N. N. Kalitkin, and M. A. Tintul, “Visual verification of pseudo-random number generators [Vizual’naya verifikatsiya generatorov psevdosluchaynykh chisel],” Keldysh IAM Preprints, Moscow, Tech. Rep. 137, 2019, In Russian. DOI: 10.20948/prepr-2019-137.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>A. A. Belov, N. N. Kalitkin, and M. A. Tintul, “Unreliability of pseudorandom number generators,” Computational Mathematics and Mathematical Physics, vol. 60, no. 11, pp. 1747-1753, 2020. DOI: 10.1134/S0965542520110044.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>I. M. Sobol, “Uniformly distributed sequences with additional uniformity properties,” USSR Computational Mathematics and Mathematical Physics, vol. 16, no. 5, pp. 236-242, 1976. DOI: 10.1016/0041-5553(76)90154-3.</mixed-citation></ref></ref-list></back></article>
