Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms.”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,657 records · Page 92

Physics and Algorithm Enhancements for a Validated MCNP/X Monte Carlo Simulation Tool, Phase VII

Currently the US lacks an end-to-end (i.e., source-to-detector) radiation transport simulation code with predictive capability for the broad range of DHS nuclear material detection applications. For example, gaps in the physics, along with inadequate analysis algorithms, make it difficult for Monte Carlo simulations to provide a comprehensive evaluation, design, and optimization of proposed interrogation systems. With the development and implementation of several key physics and algorithm enhancements, along with needed improvements in evaluated data and benchmark measurements, the MCNP/X Monte Carlo codes will provide designers, operators, and systems analysts with a validated tool for developing state-of-the-art active and passive detection systems. This project is currently in its seventh year (Phase VII). This presentation will review thirty enhancements that have been implemented in MCNPX over the last 3 years and were included in the 2011 release of version 2.7.0. These improvements include 12 physics enhancements, 4 source enhancements, 8 tally enhancements, and 6 other enhancements. Examples and results will be provided for each of these features. The presentation will also discuss the eight enhancements that will be migrated into MCNP6 over the upcoming year.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Weighted SVD algorithm for close-orbit correction and 10 Hz feedback in RHIC

Measurements of the beam position along an accelerator are typically treated equally using standard SVD-based orbit correction algorithms so distributing the residual errors, modulo the local beta function, equally at the measurement locations. However, sometimes a more stable orbit at select locations is desirable. In this paper, we introduce an algorithm for weighting the beam position measurements to achieve a more stable local orbit. The results of its application to close-orbit correction and 10 Hz orbit feedback are presented.

43 PARTICLE ACCELERATORS↗

Efficient GPU implementation for Particle in Cell algorithm

Particle in cell method is widely used method in the plasma physics to study the trajectories of charged particles under electromagnetic fields. The PIC algorithm is computationally intensive and its time requirements are proportional to the number of charged particles involved in the simulation. The focus of the paper is to parallelize the PIC algorithm on Graphics Processing Unit (GPU). We present several performance tradeoffs related to the small shared memory and atomic operations on the GPU to achieve high performance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

MODEL AND ALGORITHM EVALUATION FOR THE HYBRID UF6 CONTAINER INSPECTION SYSTEM

ABSTRACT Pacific Northwest National Laboratory (PNNL) is developing an automated UF6 cylinder verification station concept based on the combined collection of traditional enrichment-meter (186 keV photons from U-235) data and non-traditional, neutron-induced, high-energy gamma-signatures (3-8.5 MeV) with an array of collimated, medium-resolution scintillators. Previous (2010) work at PNNL demonstrated proof-of-principle that this hybrid method yields accurate, full-volume assay of the cylinder enrichment, reduces systematic errors when compared to several other enrichment assay methods, and provides simplified instrumentation and algorithms suitable for long-term unattended operations. We used Monte Carlo modeling with MCNP5 to support system design (e.g., number and configuration of detector arrays, and design of iron/poly collimators for enhanced (n,γ) conversion) and enrichment algorithm development. We developed a first-generation modeling framework in 2010. These tools have since been expanded, refined and benchmarked against field measurements with a prototype system of a 30B cylinder population (0.2 to 4.95 weight % U-235). The MCNP5 model decomposes the radiation transport problem into a linear superposition of “basis spectra” representing contributions from the different uranium isotopes and gamma-ray generation mechanisms (e.g. neutron capture). This scheme accommodates fast generation of “virtual assay signatures” for arbitrary enrichment, material age, and fill variations. Ongoing (FY-2011) refinements to the physics model include accounting for generation of bremsstrahlung photons, arising primarily from the beta decay of Pa-234m, a U-238 daughter. We are using the refined model to optimize collimator design for the hybrid method. The traditional assay method benefits from a high degree of collimation (to isolate each detector’s field-of-view) and relatively small detector area, while the non-traditional method benefits from a wide field-of-view, i.e. less collimation and larger detectors. We implement the enrichment-meter method by applying a square-wave digital filter to a raw spectrum and extracting the 186-keV peak area directly from the convolute spectrum. Ongoing enhancements to this approach include mitigating a systematic peak-area measurement deficit arising from curvature in the spectrum continuum shape. An optimized system prototype based on model results is utilized in a new set of 2011 field measurements, and model and measurement enrichment assay uncertainties are compared.

MODEL AND ALGORITHM EVALUATION FOR THE HYBRID UF6 ↗

Particle Communication and Domain Neighbor Coupling: Scalable Domain Decomposed Algorithms for Monte Carlo Particle Transport

In order to run Monte Carlo particle transport calculations on new supercomputers with hundreds of thousands or millions of processors, care must be taken to implement scalable algorithms. This means that the algorithms must continue to perform well as the processor count increases. In this paper, we examine the scalability of:(1) globally resolving the particle locations on the correct processor, (2) deciding that particle streaming communication has finished, and (3) efficiently coupling neighbor domains together with different replication levels. We have run domain decomposed Monte Carlo particle transport on up to 2 21 = 2,097,152 MPI processes on the IBM BG/Q Sequoia supercomputer and observed scalable results that agree with our theoretical predictions. These calculations were carefully constructed to have the same amount of work on every processor, i.e. the calculation is already load balanced. We also examine load imbalanced calculations where each domain’s replication level is proportional to its particle workload. In this case we show how to efficiently couple together adjacent domains to maintain within workgroup load balance and minimize memory usage.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together with pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Multi-Function AAA Algorithm Applied to Frequency-Dependent Line Modeling: Preprint

We present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages respect to the popular Vector Fitting (VF) algorithm using examples of approximations of admittance matrices discussed in a very recent paper and by the creators of VF. We show that not only MIAAA outperforms VF in terms of achieving better accuracy using a smaller number of poles, but also has no numerical issues to achieve convergence. In contrast to VF, MIAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles.

97 MATHEMATICS AND COMPUTING↗

List-Mode source injection algorithm for detectors with arbitrary pose and trajectory

environments, introducing actual sources is usually neither feasible nor economical. It is more practical to move the detector (whether airborne, vehicle-borne, or human-portable) through the test environment and then later artificially superimpose either measured or simulated source signatures on the recorded background data. We present a source injection (SI) algorithm that inserts source events into list-mode background data. It is designed to accommodate cases where “injection data” are available only at a limited set of locations. Stochastic methods are employed both to select source events from a measured dataset containing both source and background events, and to scale the number of selected events to match the field conditions of detector-source distance, air attenuation, acquisition duration, and the relative strength of the measured and injected sources. The algorithm is deployed as part of the Airborne Radiation Enhanced-sensor System (ARES) Advanced Technology Demonstration, and is applied to field data obtained using the ARES detector system. For this helicopter-borne detection system, we describe a practical ground-based measurement scheme for acquiring data for later injection. These data are then injected into background data acquired during flight, where arbitrary detector poses and trajectories are possible. Similar flight paths are traversed with and without actual 137Cs and 60Co sources present. SI is applied to the source-absent datasets, and the results are compared to the source-present datasets. SI output is found to be consistent with measured activity within the estimated uncertainties in GPS position and source strength.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Algorithm development and verification of UASCM for multi-dimension and multi-group neutron kinetics model

The Universal Algorithm of Stiffness Confinement Method (UASCM) for neutron kinetics model of multi-dimensional and multi-group transport equations or diffusion equations has been developed. The numerical experiments based on transport theory code MGSNM and diffusion theory code MGNEM have demonstrated that the algorithm has sufficient accuracy and stability. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Core loading pattern optimization of thorium fueled heavy water breeder reactor using genetic algorithm

In this work genetic algorithm was proposed to solve fuel loading pattern optimization problem in thorium fueled heavy water reactor. The objective function of optimization was to maximize the conversion ratio and minimize power peaking factor. Those objectives were simultaneously optimized using non-dominated Pareto-based population ranking optimal method. Members of non-dominated population were assigned selection probabilities based on their rankings in a manner similar to Baker's single criterion ranking selection procedure. A selected non-dominated member was bred through simple mutation or one-point crossover process to produce a new member. The genetic algorithm program was developed in FORTRAN 90 while neutronic calculation and analysis was done by COREBN code, a module of core burn-up calculation for SRAC. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Algorithms for thermal and mechanical contact in nuclear fuel performance analysis

The transfer of heat and force from UO{sub 2} pellets to the cladding is an essential element in typical nuclear fuel performance modeling. Traditionally, this has been accomplished in a one-dimensional fashion, with a slice of fuel interacting with a slice of cladding. In this manner, the location at which the transfer occurs is set a priori. While straightforward, this limits the applicability and accuracy of the model. We propose finite element algorithms for the transfer of heat and force where the location for the transfer is not predetermined. This enables analysis of individual fuel pellets with large sliding between the fuel and the cladding. The simplest of these approaches is a node on face constraint. Heat and force are transferred from a node on the fuel to the cladding face opposite. Another option is a transfer based on quadrature point locations, which is applied here to the transfer of heat. The final algorithm outlined here is the so-called mortar method, with applicability to heat and force transfer. The mortar method promises to be a highly accurate approach which may be used for a transfer of other quantities and in other contexts, such as heat from cladding to a CFD mesh of the coolant. This paper reviews these approaches, discusses their strengths and weaknesses, and presents results from each on simplified nuclear fuel performance models. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem

Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)

97 MATHEMATICS AND COMPUTING↗

Maximum Likelihood Expectation-Maximization Algorithms Applied to Localization and Identification of Radioactive Sources with Recent Coded Mask Gamma Cameras

In this work, we tested Maximum likelihood expectation-maximization (MLEM) algorithms optimized for gamma imaging applications on two recent coded mask gamma cameras. We respectively took advantage of the characteristics of the GAMPIX and Caliste HD-based gamma cameras: noise reduction thanks to mask/anti-mask procedure but limited energy resolution for GAMPIX, high energy resolution for Caliste HD. One of our short-term perspectives is the test of MAPEM algorithms integrating specific prior values for the data to reconstruct adapted to the gamma imaging topic. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Improving performance of two-group interfacial area transport equation models using genetic algorithms and high resolution experimental data

In the two-fluid transport model, the coupling of mass, momentum and energy transfer between phases is highly dependent on interfacial area transfer terms. Several research efforts in the past have been focused on the development of an interfacial area transport equation model (IATE), in order to eliminate the drawbacks of static flow regime maps currently used in best-estimate thermal-hydraulic system codes. The IATE attempts to model the dynamics that are involved in two phase flows by accounting for the different interaction mechanisms affecting bubble transport in the flow. In general, current IATE models perform poorly in high void fraction flow regimes. As both models depend on closure relations that require empirically determined coefficients, a genetic algorithm is implemented to study their optimization. The preliminary study indicates that improvements are achievable by application of the genetic algorithm. Optimization of coefficients for an entire set of high-resolution wire mesh sensor (WMS) data provided a single set of optimal coefficients. The application of WMS-optimized coefficients to external tests improved IATE performance for similar hydraulic diameters and provided a neutral change in performance for significantly smaller/larger hydraulic diameters. This is a crucial outcome as an optimized set of coefficients that provide significant improvement for a subset of experimental data - is shown to benefit performance in external data for which the coefficients are not specifically optimized. (authors)

42 ENGINEERING↗

Pin-by-Pin Core Calculation with an NEM-Based Two-Level Hybrid CMFD Algorithm

In the near future, systematic pin-by-pin core calculations are expected to provide a high level of accuracy. These are being developed in pursuit of high-fidelity tools for analyzing the reactor configurations. One such tool that has recently gained significant attention is the pin-by-pin core calculation via local-global iteration using nonlinear acceleration scheme, such as the One-Node CMFD (Coarse-Mesh Finite Difference) nonlinear algorithm. The One-Node CMFD method uses two correction factors to preserve the interface current, in contrast to the one correction term employed by conventional nonlinear iterative methods such as that proposed by Kord. S. Smith. These correction factors are updated with surface flux and net current which are obtained from a high order local problem. With two correction factors, One-Node CMFD can reduce computing time of local FMFD (Fine-Mesh Finite Difference) as it nonlinearly couples the CMFD and FMFD methods in global-local iterations. Nonetheless, very small mesh size is still required and it consequently requires long computing time for high accuracy. As such, a more flexible approach is needed to address this challenge. This paper presents one such possible approach named the hCMFD (Hybrid CMFD) method. In this method, One-Node CMFD is used to solve the global problem, while Two-Node NEM (Nodal Expansion Method) CMFD replaces FMFD as the solver for the local problem. In this paper, two kinds of CMFD methods has been simultaneously implemented for a global-local nonlinear iteration in order to do pin-by-pin heterogeneous reactor calculations. The global problem is solved by a one-node CMFD which uses two correction factors, while the local fixed-source problem is solved by the conventional two-node NEM CMFD which use one correction factor on a surface. From solution of the global eigenvalue problem, incoming partial current is obtained and it is used as boundary condition of the local fixed-source problems. It has been shown that over 99% of the whole calculations can be done in parallel with the new CMFD method for 2-D problems and the algorithm can be easily parallelized by using the OpenMP parallel scheme. The hCMFD method will enable an efficient pin-by-pin reactor analysis since a very efficient parallel calculation is possible with the hCMFD method. In future works, the hCMFD method will be extended to three-dimensional reactor problem. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Improved Variable-Transformation Algorithm for the Hexagonal Variational Nodal Method

Hexagonal Variational Nodal Method (VNM) has been widely employed in fast reactor core calculation codes. It provides the weak form solution of the second order transport equation. It employs a direct three-dimensional expansion instead of the transverse integration technique, with the singular term caused by transverse integration over the hexagonal nodal avoided. However, as the increasing Pn expansion order in angle, the number of moments increases dramatically, which significantly increases the requirements in both memory and computational time. As a consequence, Yang proposed the Variable-Transformation Algorithm. It firstly used the reverse Cuthill-McKee (RCMK) reordering method to transform the response matrices into block-diagonal. Then, for the unreducible matrices, orthogonal transformation was applied, after which the matrices were sparse enough to be reduced by using the RCMK reordering once more. In this summary, based on a newly developed hexagonal VNM code NECP-VioletHex, the Variable Transformation Algorithm was investigated and improved by adopting more constraints to the basis functions to further take advantage of the symmetric properties of the hexagonal-z nodes. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ROM-based Subset Selection Algorithm for Efficient Surrogate Modeling

This summary discusses a new methodology to support the construction of surrogate models for computationally expensive models with many input parameters and output responses. In realistic engineering calculations, such as thermal-hydraulics simulation, the cost of the simulation is typically expensive, especially when detailed models are employed to describe system behavior, thereby justifying the need for surrogate models. The cost of surrogate model construction is typically a function of the number of model parameters and the degree of model nonlinearity. For sufficiently complex models, the cost of constructing the surrogate model could be by itself overwhelmingly expensive, thereby diminishing its value. One key requirement of surrogate model construction is the ability to preselect the best parametric form to describe the model behavior over the expected range of parameter variations. This summary presents a new algorithm to help select the best approximation out of a template of functions using recent advances in reduced order modeling (ROM) techniques. The idea of selecting functions out of a template is typically referred to as subset selection in the statistical and applied mathematics community. Different from existing subset selection algorithms, we rely on ROM to help identify the most influential functions for the surrogate model. Previous work has shown that ROM can help reduce the effective dimensionality of the parameter space, which can help reduce the cost of surrogate model construction. In this summary, we adopt a different philosophy, where the fitting functions are treated as pseudo parameters and ROM is applied on the pseudo parameter space, with the result now being a ranked list of the pseudo parameters along with their contribution to the quality of the surrogate model fit. This approach allows the analyst to discard all terms that have negligible impact on the quantity of interest. A relap5 model is employed to demonstrate the application of the proposed methodology. (authors)

42 ENGINEERING↗

Electron transport algorithms in the Integrated Tiger Series (ITS) codes - 25576

We describe the three electron-transport algorithms that have been implemented in the ITS Monte Carlo codes. While the underlying cross-section data is similar, each uses a fundamentally unique method, which at a high level are best characterized as condensed history, multigroup, and single scatter. Through a set of comparisons with experimental data and some comparisons of purely numerical results, we discuss various attributes of each of the algorithms and show some of the defects that can affect results. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗