Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A review of imputation strategies for isobaric labeling-based shotgun proteomics

The throughput efficiency and increased depth of coverage provided by isobaric-labeled proteomics measurements have led to increased usage of these techniques. However, the structure of missing data is uniquely different than unlabeled studies. In this review, we compare the efficacy of nine imputation methods on a CPTAC proteomics iTRAQ dataset. Imputation methods were evaluated with regard to accuracy, variability, statistical hypothesis test inference and run time over datasets consisting of varying number of iTRAQ plexes and percentages of missing data. In general, expectation maximization and random forest imputation methods yielded the best performances, and constant-based methods performed poorly consistently across all dataset sizes and percentages of missing values. For datasets with small sample sizes and higher percentages of missing data, results indicate that statistical inference with no imputation may be preferable. Based on the findings in this review, there are core imputation methods that perform higher for isobaric-labeled proteomics data, but great care and consideration as to whether imputation should be used should be given for datasets comprised of a small number of samples, as well as to factors such as computational time and reproducibility of imputation values.

Bramer, Lisa M.↗
NASA NTRS2023

Development of a Computational Fluid Dynamics Model for a High-Speed Centrifugal Compressor

Computational fluid dynamics (CFD) has become widely used in the design and analysis of turbomachinery components such as centrifugal compressors. However, CFD is only a limited representation of experimental cases and struggles to model complex flows or can lack small model details to increase computation speed. To make advancements in compressor technology, designers need tools like CFD that can help them predict flow behavior in new designs. The High Efficiency Centrifugal Compressor (HECC) was designed by United Technologies Research Center (UTRC) for NASA to investigate the difficulties behind improving centrifugal compressor technology and to provide an open case to the turbomachinery research community. CFD analysis was completed by UTRC to aid in the design process. The pre-test study significantly overpredicted the compressor’s performance, and while post-test analysis was more representative, its results have yet to be publicly available. CFD technology has also since improved in recent years. In this study, a high-fidelity computational model for the vaneless configuration of HECC operating at its design point was developed and compared to an equivalent experimental case. This model incorporated GPU versions of mesh generation and solver codes from AeroDynamic Solutions, Inc. The development of such a model is significant since there has yet to be a published numerical simulation of HECC’s vaneless configuration. Additionally, the use of GPU codes decreases computation times for the model, which has allowed for the inclusion of impeller blade fillets. Initial results showed a general overprediction of compressor performance by the model. Predictions were more accurate for the impeller compared to predictions for the full compressor stage. Spanwise analyses showed that the model tended to follow flow behavior patterns exhibited in the experiment. Beyond this study, this model will be iterated upon and experimentally validated to further examine HECC performance.

centrifugal compressor↗
NASA NTRS1983

Efficient solution of the Euler and Navier-Stokes equations with a vectorized multiple-grid algorithm

A multiple-grid algorithm for use in efficiently obtaining steady solutions to the Euler and Navier-Stokes equations is presented. The convergence of the explicit MacCormack algorithm on a fine grid is accelerated by propagating transients from the domain using a sequence of successively coarser grids. Both the fine and coarse grid schemes are readily vectorizable. The combination of multiple-gridding and vectorization results in substantially reduced computational times for the numerical solution of a wide range of flow problems. Results are presented for subsonic, transonic, and supersonic inviscid flows and for subsonic attached and separated laminar viscous flows. Work reduction factors over a scalar, single-grid algorithm range as high as 76.8.

Navier Stokes simulation↗
NASA NTRSDate not supplied

Adding GPU Support to the Markov Chain Monte Carlo Code Catmip

In geophysics, we are confronted with many under-determined inverse problems. For example, all of our observations of earthquakes are made at the Earth’s surface. So, when we try to infer how slip during an earthquake evolves in space and time, we find that there are many potential slip histories that are consistent with our limited observations and our understanding of earthquake physics. One way to approach these problems is with Bayesian analysis which allows us to infer the ensemble of all potential slip models that satisfy the observations and our prior knowledge of earthquake physics. In Bayesian analysis, our prior knowledge is known as the prior probability density function or prior PDF, the fit to the data is known as the data likelihood, and the target PDF that satisfies both the prior PDF and data likelihood is known as the posterior PDF. However, simulating the posterior PDF typically requires using Markov Chain Monte Carlo (MCMC) to draw tens of billions of random realizations of earthquake slip models, which may not be computationally feasible. To make this and similar geophysical inversions computationally tractable, we developed the Cascading Adaptive Transitional Metropolis In Parallel (CATMIP) algorithm. CATMIP is an efficient parallel Markov Chain Monte Carlo (MCMC) sampler that is used for model fitting and uncertainty quantification in geophysics. Example use cases are earthquake rupture modeling, determining mineral composition on Mars, reconstructing the history of ocean salinity, and historical earthquake relocation. CATMIP employs many parallel instances of the Metropolis algorithm for sampling in a transitioning framework. Transitioning is a process in which a set of random samples at equilibrium with a known probability density function (PDF) are used as seeds for the Markov chains to sample successive target PDFs that incrementally move the distribution from the starting seeds to the final desired PDF that describes the relative plausibility of potential values for the model parameters. The algorithm is implemented as a Master-Worker model employing MPI for communication. The worker processes are loosely coupled with global parameters periodically optimized by the master process. This provides a very high amount of parallelism with little communication between updates. During the presentation we will discuss the history of the algorithm and elaborate the earthquake rupture modeling use case for the CATMIP package. Our first step toward GPU optimization was to optimize the code for the CPU. CPU profiling revealed that most of the compute time is spent in calls to level 2 BLAS routines and calls to GSL random number generators. We revised the algorithm to employ level 3 BLAS routines instead. In our presentation we will describe how this was accomplished. Adding GPU support to CATMIP consisted mostly of replacing the calls to GSL with calls to GPU vendor-provided library routines. A small number of loops were directly implemented in CUDA. In the presentation will provide implementation details. Finally, we will discuss methods for profiling and opportunities for further optimizing GPU execution. By creating a code with the flexibility to run on either a CPU or GPU architecture, CATMIP can be used on systems ranging from large CPU-based HPC environments to single servers with GPU acceleration and everything in between.

HECC↗
DOE OSTI2025

Particle hit clustering and identification using point set transformers in liquid argon time projection chambers

Liquid argon time projection chambers are often used in neutrino physics and dark-matter searches because of their high spatial resolution. The images generated by these detectors are extremely sparse, as the energy values detected by most of the detector are equal to 0, meaning that despite their high resolution, most of the detector is unused in a particular interaction. Instead of representing all of the empty detections, the interaction is usually stored as a sparse matrix, a list of detection locations paired with their energy values. Traditional machine learning methods that have been applied to particle reconstruction such as convolutional neural networks (CNNs), however, cannot operate over data stored in this way and therefore must have the matrix fully instantiated as a dense matrix. Operating on dense matrices requires a lot of memory and computation time, in contrast to directly operating on the sparse matrix. We propose a machine learning model using a point set neural network that operates over a sparse matrix, greatly improving both processing speed and accuracy over methods that instantiate the dense matrix, as well as over other methods that operate over sparse matrices. Compared to competing state-of-the-art methods, our method improves classification performance by 14%, segmentation performance by more than 22%, while taking 80% less time and using 66% less memory. Compared to state-of-the-art CNN methods, our method improves classification performance by more than 86%, segmentation performance by more than 71%, while reducing runtime by 91% and reducing memory usage by 61%.

calibration and fitting methods↗
DOE OSTI2020

Fast and Accurate Core Analysis by the Full-Immersion Pressure-Pulse Decay: Part 1—Theory

Summary Core-scale measurements are considered the ground truth that oil and gas or electric utility companies use to predict the migration of fluids such as oil, natural gas, carbon dioxide, or brine deep underground during their extraction or injection operations. To provide a greater understanding of petrophysical properties of low-permeability geologic formations such as shales and tight gas sandstones, this study introduces a novel core-analysis procedure. The technique follows conventional pressure-pulse-decay permeametry, where the pressure in an inlet chamber adjacent to a cylindrical core plug undergoes a rapid pressurization, the system is shut in, and the pressure reaches a new equilibrium. However, unlike a standard unidirectional pressure-pulse decay, the full-immersion pressure-pulse decay (Hannon 2019) applies a pressure disturbance to the entire outer surface area of the sample. This article covers the numerical simulator designed to model flow through an anisotropic porous sample in this scenario. The model assumes distinct but uniform permeabilities along the radial and axial directions of the cylindrical plug sample. When extracting a plug vertically (or perpendicular to bedding), the permeability along the radial direction associates with the horizontal permeability (i.e., parallel to bedding), whereas in the axial direction, flow occurs perpendicular to bedding (a vertical permeability). Investigations of these model outputs demonstrate an approximately 20-fold decrease in time to complete a full-immersion experiment compared with conventional pressure-pulse decay. Furthermore, the pressure-decay curves resulting from the full-immersion method have slightly different shapes than those resulting from other unidimensional transient methods. These differences begin to demonstrate that, under achievable experimental conditions, the analysis of pressure data from one full-immersion test could enable the simultaneous estimation of the apparent permeabilities parallel and perpendicular to bedding of a cylindrical sample in addition to its porosity. A follow-up article finalizes the proof of this capability with a parameter-estimation procedure and presents experimental verification through a proof-of-concept study. Described in greater detail in that article, the parameter estimator requires multiple forward simulations to analyze the data, which behooves minimizing the compute time for each simulation. By using an alternating direction implicit time-marching scheme and a structured but variably spaced grid, the numerical simulator built for this purpose provides a forward model output with suitable accuracy in approximately 0.5 seconds.

Energy & Fuels↗
DOE OSTI2024

Unlocking the unfolded structure of ubiquitin: Combining time-resolved x-ray solution scattering and molecular dynamics to generate unfolded ensembles

The unfolding dynamics of ubiquitin were studied using a combination of x-ray solution scattering (XSS) and molecular dynamics (MD) simulations. The kinetic analysis of the XSS ubiquitin signals showed that the protein unfolds through a two-state process, independent of the presence of destabilizing salts. In order to characterize the ensemble of unfolded states in atomic detail, the experimental XSS results were used as a constraint in the MD simulations through the incorporation of x-ray scattering derived potential to drive the folded ubiquitin structure toward sampling unfolded states consistent with the XSS signals. We detail how biased MD simulations provide insight into unfolded states that are otherwise difficult to resolve and underscore how experimental XSS data can be combined with MD to efficiently sample structures away from the native state. Our results indicate that ubiquitin samples unfolded in states with a high degree of loss in secondary structure yet without a collapse to a molten globule or fully solvated extended chain. Finally, we propose how using biased-MD can significantly decrease the computational time and resources required to sample experimentally relevant nonequilibrium states.

Chemistry↗
DOE OSTI2020

Source Discretization Near Curvilinear Mesh Refinements in One Dimeions (Summer Internship Final Report)

Lawrence Livermore National Lab developed the seismic wave code SW4 for earthquake simulations, and has recently added the ability to specify mesh-refinement interfaces in the curvilinear mesh. The primary purpose of this is to allow for high resolution near the surface, with relatively fewer total points in the mesh leading to shorter computation time. Presently, the code does not allow for point-source forcing terms (commonly used in seismic simulations) to be located near these curvilinear mesh refinement interfaces. The goal of this internship was to investigate the discretization of point-source forcing terms in the seismic wave equation when the sources are located near the interfaces between two curvilinear meshes. Ultimately this will be incorporated into SW4 to allow for more realistic simulations to be carried out in this faster implementation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Turbine Vane External Heat Transfer. Volume 2. Numerical Solutions of the Navier-stokes Equations for Two- and Three-dimensional Turbine Cascades with Heat Transfer

The application of the time-dependent ensemble-averaged Navier-Stokes equations to transonic turbine cascade flow fields was examined. In particular, efforts focused on an assessment of the procedure in conjunction with a suitable turbulence model to calculate steady turbine flow fields using an O-type coordinate system. Three cascade configurations were considered. Comparisons were made between the predicted and measured surface pressures and heat transfer distributions wherever available. In general, the pressure predictions were in good agreement with the data. Heat transfer calculations also showed good agreement when an empirical transition model was used. However, further work in the development of laminar-turbulent transitional models is indicated. The calculations showed most of the known features associated with turbine cascade flow fields. These results indicate the ability of the Navier-Stokes analysis to predict, in reasonable amounts of computation time, the surface pressure distribution, heat transfer rates, and viscous flow development for turbine cascades operating at realistic conditions.

Yang, R. J.↗
DOE OSTI2021

An initial exploration of Bayesian model calibration for estimating the composition of rocks and soils on Mars

The Mars Curiosity rover carries an instrument, ChemCam, designed to measure the composition of surface rocks and soil using laser-induced breakdown spectroscopy (LIBS). The measured spectra from this instrument must be analyzed to identify the component elements in the target sample, as well as their relative proportions. This process, which we call disaggregation, is complicated by so-called matrix effects, which describe nonlinear changes in the relative heights of emission lines as an unknown function of composition due to atomic interactions within the LIBS plasma. In this work, we explore the use of the plasma physics code ATOMIC, developed at Los Alamos National Laboratory, for the disaggregation task. ATOMIC has recently been used to model LIBS spectra and can robustly reproduce matrix effects from first principles. The ability of ATOMIC to predict LIBS spectra presents an exciting opportunity to perform disaggregation in a manner not yet tried in the LIBS community, namely via Bayesian model calibration. However, using it directly to solve our inverse problem is computationally intractable due to the large parameter space and the computation time required to produce a single output. Therefore, we also explore the use of emulators as a fast solution for this analysis. We discuss a proof of concept Gaussian process emulator for disaggregating two-element compounds of sodium and copper. The training and test datasets were simulated with ATOMIC using a Latin hypercube design. After testing the performance of the emulator, we successfully recover the composition of 25 test spectra with Bayesian model calibration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗
DOE OSTI2022

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (control-lable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗
NASA NTRS2020

The AERONET Version 3 Aerosol Retrieval Algorithm, Associated Uncertainties and Comparisons to Version 2

The Aerosol Robotic Network (AERONET) Version 3 (V3) aerosol retrieval algorithm is described, which is based on the Version 2 (V2) algorithm with numerous updates. Comparisons of V3 aerosol retrievals to those of V2 are presented, along with a new approach to estimate uncertainties in many of the retrieved aerosol parameters. Changes in the V3 aerosol retrieval algorithm include (1) a new polarized radiative transfer code (RTC), which replaced the scalar RTC of V2, (2) detailed characterization of gas absorption by adding NO2 and H2O to specify total gas absorption in the atmospheric column, specification of vertical profiles of all the atmospheric species, (3) new bidirectional reflectance distribution function (BRDF) parameters for land sites adopted from the MODIS BRDF/Albedo product, (4) a new version of the extraterrestrial solar flux spectrum, and (5) a new temperature correction procedure of both direct Sun and sky radiance measurements. The potential effect of each change in V3 on single scattering albedo (SSA) retrievals was analyzed. The operational almucantar retrievals of V2 versus V3 were compared for four AERONET sites: GSFC, Mezaira, Mongu, and Kanpur. Analysis showed very good agreement in retrieved parameters of the size distributions. Comparisons of SSA retrievals for dust aerosols (Mezaira) showed a good agreement in 440 nm SSA, while for longer wavelengths V3 SSAs are systematically higher than those of V2, with the largest mean difference at 675 nm due to cumulative effects of both extraterrestrial solar flux and BRDF changes. For non-dust aerosols, the largest SSA deviation is at 675 nm due to differences in extraterrestrial solar flux spectrums used in each version. Further, the SSA 675 nm mean differences are very different for weakly (GSFC) and strongly (Mongu) absorbing aerosols, which is explained by the lower sensitivity to a bias in aerosol scattering optical depth by less absorbing aerosols. A new hybrid (HYB) sky radiance measurement scan is introduced and discussed. The HYB combines features of scans in two different planes to maximize the range of scattering angles and achieve scan symmetry, thereby allowing for cloud screening and spatial averaging, which is an advantage over the principal plane scan that lacks robust symmetry. We show that due to an extended range of scattering angles, HYB SSA retrievals for dust aerosols exhibit smaller variability with solar zenith angles (SZAs) than those of almucantar (ALM), which allows extension of HYB SSA retrievals to SZAs less than 50∘ to as small as 25∘. The comparison of SSA retrievals from closely time-matched HYB and ALM scans in the 50 to 75∘ SZA range showed good agreement with the differences below ∼0.005. We also present an approach to estimate retrieval uncertainties which utilizes the variability in retrieved parameters generated by perturbing both measurements and auxiliary input parameters as a proxy for retrieval uncertainty. The perturbations in measurements and auxiliary inputs are assumed as estimated biases in aerosol optical depth (AOD), radiometric calibration of sky radiances combined with solar spectral irradiance, and surface reflectance. For each set of Level 2 Sun/sky radiometer observations, 27 inputs corresponding to 27 combinations of biases were produced and separately inverted to generate the following statistics of the inversion results: average, standard deviation, minimum and maximum values. From these statistics, standard deviation (labeled U27) is used as a proxy for estimated uncertainty, and a lookup table (LUT) approach was implemented to reduce the computational time. The U27 climatological LUT was generated from the entire AERONET almucantar (1993–2018) and hybrid (2014–2018) scan databases by binning U27s in AOD (440 nm), Angström exponent (AE, 440–870 nm), and SSA (440, 675, 870, 1020 nm). Using this LUT approach, the uncertainty estimates U27 for each individual V3 Level 2 retrieval can be obtained by interpolation using the corresponding measured and inverted combination of AOD, AE, and SSA.

Aliaksandr Siniuk↗
NASA NTRS2006

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗
DOE OSTI2025

Demonstration of Monte Carlo Reference Equilibrium Core Solutions for Pebble Bed Reactors Using Shift in kugelpy

This report describes how to produce reference solutions for the equilibrium core search of pebble bed reactors using the pyrates Python library. The pyrates library uses the kugelpy methodology to perform running-in calculations to reach an equilibrium core. This approach relies on full-core Monte Carlo neutron transport calculations and the shifting of fuel pebble inventory through the reactor to simulate pebble movement in the core from one step to the next of a running-in scenario. In addition to the use of Serpent for the Monte Carlo neutron transport calculations, as part of this work, updates for the use of the Shift Monte Carlo code were integrated into the official pyrates GitHub repository. Comparisons of running-in simulations for a generic pebble bed reactor produced by using pyrates with Serpent and Shift are shown. Although consistent trends are shown between the use of the two Monte Carlo codes, the limiting factor in either calculation is the computation time due to the need to perform several hundred full-core neutron transport calculations before an equilibrium core is reached.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Demonstration of Monte Carlo Reference Equilibrium Core Solutions for Pebble Bed Reactors Using Shift in kugelpy

This report describes how to produce reference solutions for the equilibrium core search of pebble bed reactors using the pyrates Python library. The pyrates library uses the kugelpy methodology to perform running-in calculations to reach an equilibrium core. This approach relies on full-core Monte Carlo neutron transport calculations and the shifting of fuel pebble inventory through the reactor to simulate pebble movement in the core from one step to the next of a running-in scenario. In addition to the use of Serpent for the Monte Carlo neutron transport calculations, as part of this work, updates for the use of the Shift Monte Carlo code were integrated into the official pyrates GitHub repository. Comparisons of running-in simulations for a generic pebble bed reactor produced by using pyrates with Serpent and Shift are shown. Although consistent trends are shown between the use of the two Monte Carlo codes, the limiting factor in either calculation is the computation time due to the need to perform several hundred full-core neutron transport calculations before an equilibrium core is reached.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗