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

Title: A keff Search Capability in MC21

Abstract

The MC21 Monte Carlo code is required to permit an individual geometric component or groups of components to be tagged as ''movable'' within some permissible range. Typical examples of such movable components would be control devices such as translating rods or rotating drums. Given this geometric information, a target multiplication factor (k{sub eff}), and a convergence criterion, MC21 will iterate on movable component positions and return a final position that reflects a k{sub eff} close to the target value. An initial version of this capability is demonstrated through modifications to MC21 that sets the geometry data structures for the movable components, calls the main Fortran-95 solver to compute k{sub eff}, and converges on the final position. This approach uses an adaptive batching algorithm that continually increases the accuracy of each successive MC21 k{sub eff} result as the movable geometry approaches the converged position.

Authors:
Publication Date:
Research Org.:
Knolls Atomic Power Laboratory (KAPL), Niskayuna, NY
Sponsoring Org.:
USDOE
OSTI Identifier:
903082
Report Number(s):
LM-06K143
TRN: US200720%%71
DOE Contract Number:  
DE-AC12-00SN39357
Resource Type:
Conference
Resource Relation:
Conference: Joint International Topical Meeting on Mathematics and Computation and Supercomputing in Nuclear Applications, Monterey, CA, April 15 - 19, 2007
Country of Publication:
United States
Language:
English
Subject:
42 ENGINEERING; ACCURACY; ALGORITHMS; CONVERGENCE; GEOMETRY; MODIFICATIONS; MULTIPLICATION FACTORS; TARGETS

Citation Formats

Morrow RE, Trumbull TH, Donovan TJ, Sutton TM. A keff Search Capability in MC21. United States: N. p., 2007. Web.
Morrow RE, Trumbull TH, Donovan TJ, Sutton TM. A keff Search Capability in MC21. United States.
Morrow RE, Trumbull TH, Donovan TJ, Sutton TM. Tue . "A keff Search Capability in MC21". United States. doi:. https://www.osti.gov/servlets/purl/903082.
@article{osti_903082,
title = {A keff Search Capability in MC21},
author = {Morrow RE, Trumbull TH, Donovan TJ, Sutton TM},
abstractNote = {The MC21 Monte Carlo code is required to permit an individual geometric component or groups of components to be tagged as ''movable'' within some permissible range. Typical examples of such movable components would be control devices such as translating rods or rotating drums. Given this geometric information, a target multiplication factor (k{sub eff}), and a convergence criterion, MC21 will iterate on movable component positions and return a final position that reflects a k{sub eff} close to the target value. An initial version of this capability is demonstrated through modifications to MC21 that sets the geometry data structures for the movable components, calls the main Fortran-95 solver to compute k{sub eff}, and converges on the final position. This approach uses an adaptive batching algorithm that continually increases the accuracy of each successive MC21 k{sub eff} result as the movable geometry approaches the converged position.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Jan 09 00:00:00 EST 2007},
month = {Tue Jan 09 00:00:00 EST 2007}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: