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

DOI10.1016/J.JCP.2009.02.013MaRDI QIDQ1025147zbMATH OpenOpenAlexFDO

Authors Thomas A. Brunner, Patrick S. Brantley

Publication date 18 June 2009

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://www.osti.gov/biblio/1267007

zbMATH Keywords

Monte Carlo methodsparallel computationradiative transferneutron transport

Mathematics Subject Classification ID

Waves and radiation in optics and electromagnetic theory (78A40) Nuclear reactor theory; neutron transport (82D75) Software, source code, etc. for problems pertaining to classical thermodynamics (80-04)

Recommendations

• Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo
• Domain decomposition models for parallel Monte Carlo transport.
• Efficient, automated Monte Carlo methods for radiation transport
• Data decomposition of Monte Carlo particle transport simulations via tally servers
• Obtaining identical results on varying numbers of processors in domain decomposed particle Monte Carlo simulations

Cites work

• scientific article; zbMATH DE number 3956394 (Why is no real title available?)
• An implicit Monte Carlo scheme for calculating time and frequency dependent nonlinear radiation transport
• Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo
• Obtaining identical results on varying numbers of processors in domain decomposed particle Monte Carlo simulations

Cited in

(14)

• Implementation, capabilities, and benchmarking of shift, a massively parallel Monte Carlo radiation transport code
• scientific article; zbMATH DE number 1390102 (Why is no real title available?)
• Data decomposition of Monte Carlo particle transport simulations via tally servers
• Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations
• Four Decades of Implicit Monte Carlo
• Multigroup-like MC resolution of generalised polynomial chaos reduced models of the uncertain linear Boltzmann equation (+discussion on hybrid intrusive/non-intrusive uncertainty propagation)
• Obtaining identical results on varying numbers of processors in domain decomposed particle Monte Carlo simulations
• Efficient uncertain \(k_{\mathrm{eff}}\) computations with the Monte Carlo resolution of generalised polynomial chaos based reduced models
• Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo
• An effective particle tracing scheme on structured/unstructured grids in hybrid finite volume/PDF Monte Carlo methods
• A gPC-intrusive Monte-Carlo scheme for the resolution of the uncertain linear Boltzmann equation
• Domain decomposition models for parallel Monte Carlo transport.
• Analysis of communication costs for domain decomposed Monte Carlo methods in nuclear reactor analysis
• Spectral convergence of the generalized polynomial chaos reduced model obtained from the uncertain linear Boltzmann equation

This page was built for publication: An efficient, robust, domain-decomposition algorithm for particle Monte Carlo

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025147)