Pages that link to "Item:Q1025147"
From MaRDI portal
The following pages link to An efficient, robust, domain-decomposition algorithm for particle Monte Carlo (Q1025147):
Displaying 12 items.
- Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations (Q347945) (← links)
- Data decomposition of Monte Carlo particle transport simulations via tally servers (Q348002) (← links)
- Analysis of communication costs for domain decomposed Monte Carlo methods in nuclear reactor analysis (Q417840) (← links)
- Implementation, capabilities, and benchmarking of shift, a massively parallel Monte Carlo radiation transport code (Q729462) (← links)
- Spectral convergence of the generalized polynomial chaos reduced model obtained from the uncertain linear Boltzmann equation (Q1998074) (← links)
- Multigroup-like MC resolution of generalised polynomial chaos reduced models of the uncertain linear Boltzmann equation (+discussion on hybrid intrusive/non-intrusive uncertainty propagation) (Q2112538) (← links)
- Efficient uncertain \(k_{\mathrm{eff}}\) computations with the Monte Carlo resolution of generalised polynomial chaos based reduced models (Q2133777) (← links)
- A gPC-intrusive Monte-Carlo scheme for the resolution of the uncertain linear Boltzmann equation (Q2214670) (← links)
- Comparison of four parallel algorithms for domain decomposed implicit Monte Carlo (Q2581683) (← links)
- Four Decades of Implicit Monte Carlo (Q5068031) (← links)
- Domain decomposition models for parallel Monte Carlo transport. (Q5934279) (← links)
- An effective particle tracing scheme on structured/unstructured grids in hybrid finite volume/PDF Monte Carlo methods (Q5953229) (← links)
