期刊论文详细信息
JOURNAL OF COMPUTATIONAL PHYSICS 卷:431
Hybrid Monte Carlo estimators for multilayer transport problems
Article
Zhao, Shuang1  Spanier, Jerome2 
[1] Univ Calif Irvine, Comp Sci Dept, Irvine, CA USA
[2] Univ Calif Irvine, Beckman Laser Inst, Irvine, CA 92717 USA
关键词: Light transport;    Monte Carlo;    Next-event estimation;   
DOI  :  10.1016/j.jcp.2021.110117
来源: Elsevier
PDF
【 摘 要 】

This paper introduces a new family of hybrid estimators aimed at controlling the efficiency of Monte Carlo computations in particle transport problems. In this context, efficiency is usually measured by the figure of merit (FOM) given by the inverse product of the estimator variance Var[xi] and the run time T : FOM := (Var[xi] T)(-1). Previously, we developed a new family of transport-constrained unbiased radiance estimators (T-CURE) that generalize the conventional collision and track length estimators [1] and provide 1-2 orders of magnitude additional variance reduction. However, these gains in variance reduction are partly offset by increases in overhead time [2], lowering their computational efficiency. Here we show that combining T-CURE estimation with conventional terminal estimation within each individual biography can moderate the efficiency of the resulting hybrid estimator without introducing bias in the computation. This is achieved by treating only the refractive interface crossings with the extended next event estimator, and all others by standard terminal estimators. This is because when there are indexmismatched interfaces between the collision location and the detector, the T-CURE computation rapidly becomes intractable due to the large number of refractions and reflections that can arise. We illustrate the gains in efficiency by comparing our hybrid strategy with more conventional estimation methods in a series of multi-layer numerical examples. (C) 2021 Published by Elsevier Inc.

【 授权许可】

Free   

【 预 览 】
附件列表
Files Size Format View
10_1016_j_jcp_2021_110117.pdf 1157KB PDF download
  文献评价指标  
  下载次数:2次 浏览次数:0次