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

DOI10.1016/j.jcp.2009.02.013zbMath1165.80300OpenAlexW2035706669MaRDI QIDQ1025147

Patrick S. Brantley, Thomas A. Brunner

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

parallel computationMonte Carlo methodsradiative transferneutron transport

Mathematics Subject Classification ID

Related Items (9)

Efficient uncertain \(k_{\mathrm{eff}}\) computations with the Monte Carlo resolution of generalised polynomial chaos based reduced models ⋮ Four Decades of Implicit Monte Carlo ⋮ Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations ⋮ Data decomposition of Monte Carlo particle transport simulations via tally servers ⋮ Analysis of communication costs for domain decomposed Monte Carlo methods in nuclear reactor analysis ⋮ A gPC-intrusive Monte-Carlo scheme for the resolution of the uncertain linear Boltzmann equation ⋮ Spectral convergence of the generalized polynomial chaos reduced model obtained from the uncertain linear Boltzmann equation ⋮ Implementation, capabilities, and benchmarking of shift, a massively parallel Monte Carlo radiation transport code ⋮ Multigroup-like MC resolution of generalised polynomial chaos reduced models of the uncertain linear Boltzmann equation (+discussion on hybrid intrusive/non-intrusive uncertainty propagation)

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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