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 条
  • [41] The maximal section algorithm in the Monte Carlo method
    G. A. Mikhailov
    T. A. Averina
    Doklady Mathematics, 2009, 80 : 671 - 673
  • [44] 3D random packing algorithm of ellipsoidal particles based on the Monte Carlo method
    Chen, Changhong
    Bai, Songlin
    Huang, Ying
    Lam, Lik
    Yao, Yao
    Keer, Leon M.
    MAGAZINE OF CONCRETE RESEARCH, 2021, 73 (07) : 343 - 355
  • [45] Implicit Monte Carlo diffusion - An acceleration method for Monte Carlo time-dependent radiative transfer simulations
    Gentile, NA
    JOURNAL OF COMPUTATIONAL PHYSICS, 2001, 172 (02) : 543 - 571
  • [47] NEW MONTE-CARLO METHOD FOR THE SELF-AVOIDING WALK
    BERRETTI, A
    SOKAL, AD
    JOURNAL OF STATISTICAL PHYSICS, 1985, 40 (3-4) : 483 - 531
  • [48] Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
    Hu, Hao
    Chen, Xiaosong
    Deng, Youjin
    FRONTIERS OF PHYSICS, 2017, 12 (01)
  • [49] Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk
    Hao Hu
    Xiaosong Chen
    Youjin Deng
    Frontiers of Physics, 2017, 12
  • [50] On the Value of derivative evaluations and random walk suppression in Markov Chain Monte Carlo algorithms
    Gustafson, P
    MacNab, YC
    Wen, SJ
    STATISTICS AND COMPUTING, 2004, 14 (01) : 23 - 38