An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

doi:10.1016/j.jcp.2009.02.013

An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

2009-06-01

34

OA

AI

DOI：10.1016/j.jcp.2009.02.013

原文链接

查看原文

摘要

En 中文

A previously described algorithm [T.A. Brunner, T.J. Urbatsch, T.M. Evans, N.A. Gentile, Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo, journal of Computational Physics 212 (2) (2006) 527-539] for doing domain decomposed particle Monte Carlo calculations in the context of thermal radiation transport has been improved. It has been extended to support cases where the number of particles in a time step are unknown at the beginning of the time step. This situation arises when various physical processes, such as neutron transport, can generate additional particles during the time step, or when particle splitting is used for variance reduction. Additionally, several race conditions that existed in the previous algorithm and could cause code hangs have been fixed. This new algorithm is believed to be robust against all race conditions. The parallel scalability of the new algorithm remains excellent. (C) 2009 Elsevier Inc. All rights reserved.

Keyword:

Monte Carlo methods

Parallel computation

Radiative transfer

Neutron transport

An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

摘要

AI总结

期刊

机构

引用论文