An improved random walk algorithm for the implicit Monte Carlo method

被引:8
|
作者
Keady, Kendra P. [1 ]
Cleveland, Mathew A. [1 ]
机构
[1] Los Alamos Natl Lab, CCS 2,POB 1663, Los Alamos, NM 87545 USA
关键词
Implicit Monte Carlo; Random walk; Hybrid methods; NONLINEAR RADIATION TRANSPORT; TIME;
D O I
10.1016/j.jcp.2016.09.056
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this work, we introduce a modified Implicit Monte Carlo (IMC) Random Walk (RW) algorithm, which increases simulation efficiency for multigroup radiative transfer problems with strongly frequency-dependent opacities. To date, the RW method has only been implemented in "fully-gray" form; that is, the multigroup IMC opacities are group-collapsed over the full frequency domain of the problem to obtain a gray diffusion problem for RW. This formulation works well for problems with large spatial cells and/or opacities that are weakly dependent on frequency; however, the efficiency of the RW method degrades when the spatial cells are thin or the opacities are a strong function of frequency. To address this inefficiency, we introduce a RW frequency group cutoff in each spatial cell, which divides the frequency domain into optically thick and optically thin components. Inthe modified algorithm, opacities for the RW diffusion problem are obtained by group-collapsing IMC opacities below the frequency group cutoff. Particles with frequencies above the cutoff are transported via standard IMC, while particles below the cutoff are eligible for RW. This greatly increases the total number of RW steps taken per IMC time-step, which in turn improves the efficiency of the simulation. We refer to this new method as Partially-Gray Random Walk (PGRW). We present numerical results for several multigroup radiative transfer problems, which show that the PGRW method is significantly more efficient than standard RW for several problems of interest. In general, PGRW decreases runtimes by a factor of similar to 2-4 compared to standard RW, and a factor of similar to 3-6 compared to standard IMC. While PGRW is slower than frequency-dependent Discrete Diffusion Monte Carlo (DDMC), it is also easier to adapt to unstructured meshes and can be used in spatial cells where DDMC is not applicable. This suggests that it may be optimal to employ both DDMC and PGRW in a single simulation. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:160 / 176
页数:17
相关论文
共 50 条
  • [31] Corrected implicit Monte Carlo
    Cleveland, M. A.
    Wollaber, A. B.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2018, 359 : 20 - 44
  • [32] Iterative Implicit Monte Carlo
    Gentile, N. A.
    Yee, Ben C.
    JOURNAL OF COMPUTATIONAL AND THEORETICAL TRANSPORT, 2016, 45 (1-2) : 71 - 98
  • [33] AN IMPROVED HYBRID MONTE-CARLO METHOD
    MACKENZIE, PB
    PHYSICS LETTERS B, 1989, 226 (3-4) : 369 - 371
  • [34] EVALUATION OF THE BOLTZMANN DENSITY-MATRIX WITH COUPLING TERM BY MONTE-CARLO RANDOM-WALK METHOD
    BAO, JD
    ZHUO, YZ
    WU, XZ
    COMMUNICATIONS IN THEORETICAL PHYSICS, 1992, 18 (04) : 471 - 474
  • [35] A New Monte Carlo Algorithm for Linear Algebraic Systems Based on the "Walk on Equations" Algorithm
    Todorov, Venelin
    Ikonomov, Nikolay
    Dimov, Ivan
    Georgieva, Rayna
    PROCEEDINGS OF THE 2018 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2018, : 257 - 260
  • [36] Applicability of the condensed-random-walk Monte Carlo method at low energies in high-Z materials
    Berger, MJ
    RADIATION PHYSICS AND CHEMISTRY, 1998, 53 (03): : 191 - 203
  • [37] A random walk on spheres based kinetic Monte Carlo method for simulation of the fluctuation-limited bimolecular reactions
    Sabelfeld, Karl K.
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2018, 143 : 46 - 56
  • [38] An Essentially Implicit Monte Carlo Method for Radiative Transfer Equations
    Shi, Yi
    Li, Shuanggui
    Yong, Heng
    Song, Peng
    JOURNAL OF COMPUTATIONAL AND THEORETICAL TRANSPORT, 2019, 48 (05) : 180 - 199
  • [39] A PARALLEL ALGORITHM FOR RANDOM-WALK CONSTRUCTION WITH APPLICATION TO THE MONTE-CARLO SOLUTION OF PARTIAL-DIFFERENTIAL EQUATIONS
    YOUSSEF, A
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (03) : 355 - 360
  • [40] The maximal section algorithm in the Monte Carlo method
    Mikhailov, G. A.
    Averina, T. A.
    DOKLADY MATHEMATICS, 2009, 80 (02) : 671 - 673