skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Iterative Implicit Monte Carlo

Authors:
;
Publication Date:
Research Org.:
Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1177248
Report Number(s):
LLNL-JRNL-660982
DOE Contract Number:
DE-AC52-07NA27344
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal of Computational and Theoretical Transport, vol. 43, na, August 14, 2014, pp. 1-32
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; 73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Citation Formats

Gentile, N, and Yee, B. Iterative Implicit Monte Carlo. United States: N. p., 2014. Web.
Gentile, N, & Yee, B. Iterative Implicit Monte Carlo. United States.
Gentile, N, and Yee, B. 2014. "Iterative Implicit Monte Carlo". United States. doi:. https://www.osti.gov/servlets/purl/1177248.
@article{osti_1177248,
title = {Iterative Implicit Monte Carlo},
author = {Gentile, N and Yee, B},
abstractNote = {},
doi = {},
journal = {Journal of Computational and Theoretical Transport, vol. 43, na, August 14, 2014, pp. 1-32},
number = ,
volume = ,
place = {United States},
year = 2014,
month = 8
}
  • Here, we consider hybrid deterministic-stochastic iterative algorithms for the solution of large, sparse linear systems. Starting from a convergent splitting of the coefficient matrix, we analyze various types of Monte Carlo acceleration schemes applied to the original preconditioned Richardson (stationary) iteration. We expect that these methods will have considerable potential for resiliency to faults when implemented on massively parallel machines. We also establish sufficient conditions for the convergence of the hybrid schemes, and we investigate different types of preconditioners including sparse approximate inverses. Numerical experiments on linear systems arising from the discretization of partial differential equations are presented.
  • A new {open_quotes}implicit{close_quotes} Monte Carlo (IMC) method has been developed to simulate ionization and recombination processes of impurity ions in divertor plasmas. The IMC method takes into account many ionization and recombination processes during a time step {Delta}t. The time step is not limited by a condition, {Delta}t {much_lt} {tau}{sub min} ({tau}{sub min}; the minimum characteristic time of atomic processes), which is forced to be adopted in conventional Monte Carlo methods. We incorporate this method into a one-dimensional impurity transport model. In this transport calculation, impurity ions are followed with the time step about 10 times larger than that usedmore » in conventional methods. The average charge state of impurities, (Z), and the radiative cooling rate, L(T{sub e}), are calculated at the electron temperature T{sub e} in divertor plasmas. These results are compared with those obtained from the simple noncoronal model. 10 refs., 7 figs.« less
  • We consider two existing asynchronous parallel algorithms for Implicit Monte Carlo (IMC) thermal radiation transport on spatially decomposed meshes. The two algorithms are from the production codes KULL from Lawrence Livermore National Laboratory and Milagro from Los Alamos National Laboratory. Both algorithms were considered and analyzed in an implementation of the KULL IMC package in ALEGRA, a Sandia National Laboratory high energy density physics code. Improvements were made to both algorithms. The improved Milagro algorithm performed the best by scaling nearly perfectly out to 244 processors.