Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Coded computing”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Development of a Single-Phase, Transient, Subchannel Code, within the MOOSE Multi-Physics Computational Framework

Subchannel codes have been widely used for thermal-hydraulics analyses in nuclear reactors. This paper details the development of a novel subchannel code within the Idaho National Laboratory’s (INL) Multi-physics Object Oriented Simulation Environment (MOOSE). MOOSE is a parallel computational framework targeted at the solution of systems of coupled, nonlinear partial differential equations, that often arise in the simulation of nuclear processes. As such, it includes codes/modules able to solve the multiple linear and nonlinear physics that describe a nuclear reactor, under normal operation conditions or accidents. This includes thermal-hydraulics, fuel performance, and neutronics codes, between others. A MOOSE-based subchannel code is a new addition to the fleet of INL-developed codes, based on the MOOSE framework. In this work, we present the derivation of the subchannel equations for a single-phase fluid, we proceed with the description of the algorithm that is used to solve these equations and describe how this algorithm was implemented within MOOSE. We also present how this code can be coupled to the BISON fuel performance code. Next, we verify the friction model and the turbulent mixing model. We calibrate the turbulent modeling parameters for momentum mixing and enthalpy mixing, C T , β. We validate the code using experimental results and last demonstrate the coupling capabilities using a simple example.

42 ENGINEERING↗
DOE OSTI2020

Local Truncation Error-Informed Code Verification

The method of manufactured solutions (MMS) has become increasingly popular in conducting code verification studies on predictive codes, such as nuclear power system codes and computational fluid dynamic codes. The reason for the popularity of this approach is that it can be used when an analytical solution is not available. Using MMS, code developers are able to verify that their code is free of coding errors that impact the observed order of accuracy. While MMS is still an excellent tool for code verification, it does not identify coding errors that are of the same order as the numerical method. This paper presents a method that combines MMS with modified equation analysis (MEA), which calculates the local truncation error (LTE) to identify coding error up to and including the order of the numerical method. This method is referred to as modified equation analysis methd of manufactured solutions (MEAMMS). MEAMMS is then applied to a custom-built code, which solves the shallow water equations, to test the performance of the code verification method. MEAMMS is able to detect all coding errors that impact the implementation of the numerical scheme. To show how MEAMMS is different than MMS, they are both applied to the same first-order numerical method test problem with a first-order coding error. When there are first-order coding errors, only MEAMMS is able to identify them. Finally, this shows that MEAMMS is able to identify a larger set of coding errors while still being able to identify the coding errors MMS is able to identify.

42 ENGINEERING↗
DOE OSTI2021

High Performance Approximate Computing

This code repository contains the implementation of the "High-Performance Approximate Computing" (HPAC) toolkit. The toolkit allows you to approximate your own C/C++. The developer uses "pragma's" to annotate code regions as approximate. The compiler extensions lower these pragmas to either compiletime approximate techniques or runtime approximation techniques. At execution time, the implemented runtime system decides which annotated regions it should approximate. HPAC also provides a set of script utilities. The utilities perform a grid search within approximation parameters and performance. The user can analyze the raw data to identify optimal approximation techniques for the application.

Parasyris, Konstantinos↗
DOE OSTI2022

Improving Schrödinger Equation Implementations with Gray Code for Adiabatic Quantum Computers

We reformulate the continuous-space Schrödinger equation in terms of spin Hamiltonians. For the kinetic energy operator, the critical concept facilitating the reduction in model complexity is the idea of position encoding. A binary encoding of position produces a spin-1/2 Heisenberg-like model and yields exponential improvement in space complexity when compared to classical computing. Encoding with a binary reflected Gray code (BRGC), and a Hamming-distance-2 Gray code (H2GC) reduces the model complexity down to the 𝑋⁢𝑍 and transverse Ising model, respectively. For 𝐴 qubits BRGC yields 2 𝐴 positions and is reduced to its 2-local form with O⁡(𝐴) ancillary qubits. H2GC yields 2 𝐴/2+1 positions with O⁡(𝐴 2 ) three-local penalty terms. We also identify the bijective mapping between diagonal unitaries and the Walsh series, producing the mapping of any real potential to a series of 𝑘 -local Ising models through the fast Walsh transform. Finally, in a finite volume, we provide some numerical evidence to support the claim that the total time needed for adiabatic evolution is protected by the infrared cutoff of the system. As a result, initial state preparation from a free-field wave function to an interacting system is expected to exhibit polynomial time complexity with volume and constant scaling with respect to lattice discretization for all encodings. For H2GC, if the evolution starts with the transverse Hamiltonian due to hardware restrictions, then penalties are dynamically introduced such that the low-lying spectrum reproduces the energy levels of the Laplacian. The adiabatic evolution of the penalty Hamiltonian is therefore sensitive to the ultraviolet scale. It is expected to exhibit polynomial time complexity with lattice discretization, or exponential time complexity with respect to the number of qubits given a fixed volume.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Leveraging 3D CAD and Virtual Reality in Design of the Calcine Disposition Project - 20512

Fluor Idaho's Calcine Disposition Project (CDP) is leveraging the power of three-dimensional (3D) visualization, light detection and ranging (Lidar), and virtual reality to improve designs and worker safety. With the use of computer-aided design (CAD) modeling software, the CDP has created 3D models of the facility and systems to aid in the design, development, and operation of its retrieval and transfer system. This by itself is nothing new and has been done in industry for years. The CDP project however is taking this a few steps farther with the use of Lidar and virtual reality software. The CRP is tasked with removing a radioactive granular material from stainless steel bins located in concrete vaults that were constructed in the late 1950's and early 1960's. While construction drawings are available, it is not certain that the drawings are as-built or how accurate they truly are. Part of the project requires precise placement of equipment on to bins around multiple pipe, electrical lines, and bin stiffeners. Relying solely on the existing drawings and models created from these drawings is highly risky and prone to failure. The first step to determine the precise location and orientation of all obstructions in the vault the project will use a Lidar system to scan the vault structure and precisely locate all vault and bin components. Once this information is obtained, the data will be integrated into the CAD model. The model will then be verified, and a true as-built model developed. Precise component location, size, and orientation will be used for final design and placement of retrieval components. The second step will be to take the verified 3D model and scan data and import it into virtual reality software creating a virtual world. While some work on the project requires all work to be completed remotely due to high radiation fields, some areas have low enough radiation levels that personnel can enter and perform work. With the use of a virtual reality headset, operators and technicians will be able to enter our virtual world and become familiar with the surroundings and perform work prior to ever entering the radiation environment. This training is expected to pay dividends by improving worker efficiency, reducing errors, and improving confidence that the work can be performed as expected. It will play a key aspect in as low as reasonably achievable (ALARA) principles. An additional aspect in using the Lidar scans and virtual environment, is that it will give engineers and managers an opportunity to revisit the facility, especially radiation areas, at any time to obtain design information and measurements that may be costly or impossible to obtain once the facility transitions into radiation operations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2025

Comparing quantum annealing and spiking neuromorphic computing for sampling binary sparse coding QUBO problems

We consider the problem of computing a sparse binary representation of an image. Given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an L 2 loss on the reconstruction error, and an L 0 loss on the binary vector enforcing sparsity. First, we solve the sparse representation QUBOs by solving them both on a D-Wave quantum annealer with Pegasus chip connectivity, as well as on the Intel Loihi 2 spiking neuromorphic processor using a stochastic Non-equilibrium Boltzmann Machine (NEBM). Second, using Quantum Evolution Monte Carlo with Reverse Annealing and iterated warm starting on Loihi 2 to evolve the solution quality from the respective machines. We demonstrate that both quantum annealing and neuromorphic computing are suitable for solving binary sparse coding QUBOs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Edge ICRF simulations in 3D geometry: From MHD equilibrium to coupling determination

We present in this work a consistent numerical scheme that allows the computation of 3D magnetic fields a nd 3D density profiles and their usage in ion cyclotron range of frequencies (ICRF) coupling simulations. We first utilize the PARVMEC code to compute the 3D free-boundary plasma equilibrium in the ideal magnetohydrodynamic (MHD) approximation. Since the PARVMEC solution is only defined within the last closed flux surface (LCFS), the magnetic field domain is extended to the scrape-off layer (SOL) via the BMW code, which computes a divergence-free magnetic field solution arising from the external conductors’ vacuum field a nd t he PARVMEC flux surface currents. This magnetic reconstruction is then used in the EMC3-EIRENE transport code in order to compute 3D density profiles. In the last step, the RAPLICASOL code is utilized to compute the ICRF antenna S-matrices resulting from the 3D density profiles. We exemplify this scheme for the ASDEX Upgrade tokamak. A new implementation of a curved model for the ASDEX Upgrade ICRF 2-strap antenna in RAPLICASOL allows simulations in realistic geometry, without any coordinate transformations.

Lopez, Graham↗
DOE OSTI2023

sf-23-021 SONICC (SCALE-DEPENDENT OMEGA FOR NEUTRINO INITIAL CONDITION CODES)

SONICC computes density and velocity transfer functions for use in the initial conditions of massive neutrino cosmological simulations. The transfer functions are backscaled using a scale-dependent growth function that produces self-consistent evolution for all three matter species (cold dark matter, baryons, massive neutrinos) in the Newtonian forward model of cosmological simulations.

EMBERSON, JEFFREYD↗
DOE OSTI2024

DASSH-F: Subchannel Based Thermal Analysis

The DASSH thermal analysis code is designed to rapidly allow a reactor design engineer to obtain flow rates requirements that satisfy peak temperature constraints in the domain. The advantage of using DASSH over a hand calculation is that it has a more rigorous treatment of the pin power distribution and coolant heat transfer within an assembly and between assemblies. The advantage of using DASSH over a conventional 3D subchannel code or a computational fluid dynamics code (CFD) is that it can obtain the desired solution in a matter of minutes in serial with minor computer memory needs. The DASSH methodology is virtually identical to SUPERENERGY-2 with additional functionalities taken from follow on work to SUPERENERGY-2 done at ANL in the 1980s. DASSH today is an integral component of the Argonne Fast Reactor analysis suite for reactor design work. DASSH obtains the power distribution from a coupled neutron-gamma heating calculation in GAMSOR (including DIF3D) at each time point of a companion fuel cycle analysis calculation with REBUS. The domain in DASSH assumes a hexagonal grid typical for fast reactors with much of the geometry information taken from the DIF3D model. DASSH assumes the assemblies that are loaded into each grid position are ducted to control the coolant flow. Considerable detail is given on the subchannel formulation of DASSH in this document. Much of the formulation and design of the code builds upon research done by previous authors with little new investigation. Thus the decisions made in developing the subchannel model used in DASSH have their origins over 50 years ago. Much of the heat transfer methodology in DASSH is built upon correlations for both the coolant mixing and heat transfer coefficients for pins and ducts. DASSH is thus not a rigorous treatment of a given problem, but a rapid assessment of the temperature field that has known limitations with respect to an experimental measurement or CFD calculation. The DASSH input and output are detailed along with usage of the software. The DASSH output provides tables of evaluated material properties and key coolant and pin temperature results. DASSH can create Python scripts that generate domain summary pictures. DASSH can also generate assembly temperature maps and VTK output files which allow the DASSH solution to be visualized. As the primary purpose of the DASSH software is to compute the coolant and fuel pin temperature distribution for a given model of a reactor, much of the output focus is giving the user quick summary tables needed to assess the performance of a given orifice flow specification. The present version of DASSH has a crude orifice search capability and an efficient orifice flow search capability. The flow search tries to meet user specified constraints for 1) peak 2-sigma clad midwall temperature, 2) peak coolant temperature, and 3) desired bulk outlet temperature. There are many development shortcomings in DASSH detailed in this document, but this version is functional for modern analysis needs. This document serves as the manual for the Fortran based DASSH software that was developed to replace the Python version of DASSH developed as part of the VTR program.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

DASSH-F: Subchannel Based Thermal Analysis

The DASSH thermal analysis code is designed to rapidly allow a reactor design engineer to obtain flow rates requirements that satisfy peak temperature constraints in the domain. The advantage of using DASSH over a hand calculation is that it has a more rigorous treatment of the pin power distribution and coolant heat transfer within an assembly and between assemblies. The advantage of using DASSH over a conventional 3D subchannel code or a computational fluid dynamics code (CFD) is that it can obtain the desired solution in a matter of minutes in serial with minor computer memory needs. The DASSH methodology for pin lattice models is virtually identical to SUPERENERGY-2 with additional functionalities taken from follow on work to SUPERENERGY-2 done at ANL in the 1980s. DASSH today is an integral component of the Argonne Fast Reactor analysis suite for reactor design work. DASSH obtains the power distribution from a coupled neutron-gamma heating calculation in GAMSOR (including DIF3D) at each time point of a companion fuel cycle analysis calculation with REBUS. The domain in DASSH assumes a hexagonal grid typical for fast reactors with much of the geometry information taken from the DIF3D model. DASSH assumes the assemblies that are loaded into each grid position are ducted to control the coolant flow. The user can alternatively provide their own geometry and power profile instead of inheriting it from DIF3D. Considerable detail is given on the subchannel formulation of DASSH in this document. Much of the formulation and design of the code builds upon research done by previous authors with little new investigation. Thus the decisions made in developing the subchannel model used in DASSH have their origins over 50 years ago. Much of the heat transfer methodology in DASSH is built upon correlations for both the coolant mixing and heat transfer coefficients for pins and ducts. DASSH is thus not a rigorous treatment of a given problem, but a rapid assessment of the temperature field that has known limitations with respect to an experimental measurement or CFD calculation. The DASSH input and output are detailed along with usage of the software. The DASSH output provides tables of evaluated material properties and key coolant and pin temperature results. DASSH can create Python scripts that generate domain summary pictures. DASSH can also generate assembly temperature maps and VTK output files which allow the DASSH solution to be visualized. As the primary purpose of the DASSH software is to compute the coolant and fuel pin temperature distribution for a given model of a reactor, much of the output focus is giving the user quick summary tables needed to assess the performance of a given orifice flow specification. The present version of DASSH has a crude orifice search capability and a sufficient orifice flow search capability. The flow search tries to meet user specified constraints for 1) peak 2-sigma clad temperature, 2) peak coolant temperature, and 3) desired bulk outlet temperature. This document serves as the manual for the Fortran based DASSH software that was developed to replace the Python version of DASSH developed as part of the VTR program.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Multi-cycle reload analysis of a long cycle gas-cooled fast modular reactor

There is currently significant interest in deploying HALEU-fueled fast reactors, including the General Atomics (GA) Fast Modular Reactor (FMR). Such reactors can achieve very long fuel cycles, but with multi-batch loading will take decades to reach equilibrium. This motivates design and analysis of both the initial core and multi-cycle reload, which is typically performed using fast-running, deterministic fast reactor codes such as the Argonne Reactor Computation (ARC) codes. In this paper, multicycle reload of the GA FMR is analyzed using the ARC codes. The GA FMR utilizes 19.75 % enriched fuel in a 16 year cycle with a three-batch strategy, with twice-burned fuel placed on the core periphery. The GA FMR has a softened neutron spectrum due to reflecting elements in the core, so the neutronic solution is first benchmarked against the OpenMC Monte Carlo code. Discrepancy on k eff is 400–600 pcm, likely due to the softened neutron spectrum, heterogeneous fuel assembly design and central reflector. However, the rms discrepancy on the assembly power distribution is only 0.6 %, despite the presence of the central reflector. A reload strategy is devised for the first three cycles of such a reactor, ultimately spanning the first 45–48 years of its operation. The fresh core uses 19.75 %, 19.25 % and 16.75 % enriched fuel in place of fresh, once-burned and twice-burned and is then subsequently refueled with only 19.75 % enriched fuel. The cycle length is varied over 3 cycles of operation to balance fuel utilization and reactor availability, specifically with use of an extended 18-year Cycle 1, followed by a shortened 11-year Cycle 2. Cycle 3 is close to the target 16-year length. Finally, placing twice burned assemblies next to the GA FMR central reflector can reduce power peaking by 3 %, at the expense of slightly reducing the cycle length.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Improving ideal MHD equilibrium accuracy with physics-informed neural networks

We present a novel approach to compute three-dimensional magnetohydrodynamic equilibria with isotropic pressure profiles and nested surfaces by parametrizing Fourier modes with artificial neural networks (NNs). The full nonlinear global force residual of single equilibria across the volume in real space is then minimized with first order optimizers and compared to equilibria computed by conventional solvers. Already, we observe competitive computational cost to arrive at the same minimum residuals computable with existing codes. With increased computational cost, lower minima of the residual are computable with the NNs than with any other tested solver, establishing a new lower bound for the force residual. We use minimally complex NNs, and we expect significant improvements for solving not only single equilibria with NNs, but also for creating NN models valid over continuous distributions of equilibria.

ideal magnetohydrodynamics↗
DOE OSTI2021

flash -light on the ring : hydrodynamic simulations of expanding supernova shells near supermassive black holes

ABSTRACT The way supermassive black holes (SMBHs) in Galactic Centres (GCs) accumulate their mass is not completely determined. At large scales, it is governed by galactic encounters, mass inflows connected to spirals arms and bars, or due to expanding shells from supernova (SN) explosions in the central parts of galaxies. The investigation of the latter process requires an extensive set of gas dynamical simulations to explore the multidimensional parameter space needed to frame the phenomenon. The aims of this paper are to extend our investigation of the importance of SNe for inducing accretion on to an SMBH and carry out a comparison between the fully hydrodynamic code flash and the much less computationally intensive code ring, which uses the thin shell approximation. We simulate 3D expanding shells in a gravitational potential similar to that of the GC with a variety of homogeneous and turbulent environments. In homogeneous media, we find convincing agreement between flash and ring in the shapes of shells and their equivalent radii throughout their whole evolution until they become subsonic. In highly inhomogeneous, turbulent media, there is also a good agreement of shapes and sizes of shells, and of the times of their first contact with the central 1-pc sphere, where we assume that they join the accretion flow. The comparison supports the proposition that an SN occurring at a galactocentric distance of 5 pc typically drives 1–3 M⊙ into the central 1 pc around the GC.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

CARDINAL

Cardinal is a code that automates the workflow for iteratively solving neutral particle transport via the OpenMC code and computational fluid dynamics via the NekRS code within the Multiphysics Object Oriented Simulation Environment (MOOSE), a finite element framework for solving general partial differential equations. Cardinal establishes a mapping between the Monte Carlo geometry representation used in OpenMC and the spectral element mesh used in NekRS to other physics applications built upon the MOOSE framework, allowing high-resolution particle transport and fluid dynamics physics feedback to the MOOSE application ecosystem. Heat generation rates as solved by OpenMC are used as heat sources in MOOSE, while the temperature and density fields from NekRS are used as conjugate heat transfer boundary conditions and/or source fields in MOOSE. OpenMC, Nek5000, and MOOSE are open source, community-developed simulation codes.

NOVAK, APRILJEAN RODGERS↗
DOE OSTI2021

A survey of software implementations used by application codes in the Exascale Computing Project

The US Department of Energy Office of Science and the National Nuclear Security Administration initiated the Exascale Computing Project (ECP) in 2016 to prepare mission-relevant applications and scientific software for the delivery of the exascale computers starting in 2023. The ECP currently supports 24 efforts directed at specific applications and six supporting co-design projects. These 24 application projects contain 62 application codes that are implemented in three high-level languages—C, C++, and Fortran—and use 22 combinations of graphical processing unit programming models. The most common implementation language is C++, which is used in 53 different application codes. The most common programming models across ECP applications are CUDA and Kokkos, which are employed in 15 and 14 applications, respectively. This article provides a survey of the programming languages and models used in the ECP applications codebase that will be used to achieve performance on the future exascale hardware platforms.

97 MATHEMATICS AND COMPUTING↗