Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “I CODES”

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

What, why and when to go virtual: An international analysis of early adopters of virtual building energy codes inspections

To meet greenhouse gas reduction targets, several countries are pursuing more ambitious policies in their buildings and construction sectors, such as introducing zero net energy/carbon building codes. Countries often report not having enough qualified staff for performing building energy code inspections and many are exploring faster, easier, and more reliable methods to check the compliance of buildings with their codes. Building inspections are a critical element for ensuring code compliance and they have traditionally been performed in person. However, in-person inspections can be labor and travel intensive, costly, and prone to human error. In this paper, the authors explore how virtual inspections, particularly in light of the recent COVID-19 pandemic, have impacted processes for building code compliance checks in jurisdictions and communities around the world. Here, the authors collected data on four key parameters (time and financial savings, scope of inspections, changing practices and technological innovation, and benefits to consumers) from six jurisdictions and communities in five countries (Australia, Canada, Singapore, United Arab Emirates, and the United States) to analyze the impacts of virtual inspections on code compliance checks. The analysis found the greatest value from virtual inspections in geographically dispersed regions and for cities experiencing rapid building construction. The study also explored emerging technologies that are being piloted for virtual inspections. Although many of these technologies hold promise, more resources and capacity are needed to make them viable for use in building energy code inspections.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2024

MCNP ® Code Version 6.3.1 Theory & User Manual

This document acts as a repository of knowledge for the Monte Carlo N-Particle (MCNP) transport computer code. It is maintained alongside the source code and attempts to introduce new users and re-familiarize experienced users with the theory and practices of using the MCNP code for the wide range of particle transport analyses that it is appropriate for. The latest version of the MCNP code, version 6.3.1, provides the Monte Carlo particle transport community with the latest feature developments and bug fixes in the MCNP code. The MCNP code version 6.0 and later is also known as the MCNP6 code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Perspective on “code qualifying” new graphite grades for use in advanced nuclear reactors*

The American Society of Mechanical Engineers (ASME) publishes the Boiler and Pressure Vessel (BPV) Code, which include guidance for the safe development, construction, and operation of boilers and pressure vessels. ASME BPV Code Section III “Rules for Construction of Nuclear Facility Components” Division 5 focuses on “High Temperature Reactors”. Subsection HH, subpart A lists the different materials properties that are to be measured and how those properties change due to different environmental conditions (oxidation and irradiation damage) for a graphite to be accepted for use in a high temperature reactor core (i.e., “Code Qualified”). Currently there are no nuclear graphite grades that are “Code Qualified” (i.e., a reactor designer can select a graphite grade and build their reactor without any additional testing), which is due in part to development of new graphite grades in the last 20 years and the lack of comprehensive programs needed to produce the data for the code cases. This perspective is going to discuss the requirements, as called out in the ASME BPV Code, that are necessary to “code qualify” a nuclear graphite grade but will primarily focus on the practical and technical challenges associated with irradiation-induced property changes and how to address these to assist with getting graphite ready for use in advanced nuclear reactors. These same technical challenges can be expected to arise for other materials being developed for advanced reactor concepts.

advanced nuclear reactors↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Code validation of SAM using natural-circulation experimental data from the compact integral effects test (CIET) facility

The primary objective of this study is to validate the system analysis code, SAM, using experimental data from the Compact Integral Effects Test (CIET) experimental loop. SAM is a modern system analysis code being developed at Argonne National Laboratory for safety analysis of designs for advanced non-light water reactors (non-LWRs), such as sodium-cooled fast reactors, high-temperature gas-cooled reactors, and fluoride salt-cooled high-temperature reactors (FHRs). To support SAM code development for the wide range of non-LWR applications, it is of paramount importance to validate the code against experiments highly relevant to these reactor concepts. Additionally, the CIET facility, which was designed to reproduce the thermal-hydraulics response of FHRs under both forced- and natural-circulation conditions, has been identified and selected as one of the benchmark test facilities for SAM code validation. In this study, two sets of available CIET tests were selected for SAM code validation purposes, namely, power step change transient tests and steady-state natural-circulation tests. For all selected tests, SAM-predicted results show very good agreement with experimental data. The successful validation of SAM against these selected CIET experiments demonstrates that the computer code is well suited for thermal-hydraulics analysis of FHR designs.

42 ENGINEERING↗
DOE OSTI2023

Holographic codes from hyperinvariant tensor networks

Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensional bulk geometry is associated with the code’s logical degrees of freedom. Previous discrete holographic codes based on tensor networks have reproduced the general code properties expected from continuum AdS/CFT, such as complementary recovery. However, the boundary states of such tensor networks typically do not exhibit the expected correlation functions of CFT boundary states. In this work, we show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states. Furthermore, these codes exhibit a state-dependent breakdown of complementary recovery as expected from AdS/CFT under small quantum gravity corrections.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The MCNP ® 6 code: A decade of progress

After several years of effort involved in merging the Los Alamos National Laboratory MCNP5 and MCNPX codes, in 2013 the first production release of version 6 of the Monte Carlo N-Particle ® , or MCNP ® , code MCNP6.1 was distributed publicly. Since then, three significant releases have been issued: MCNP6.1.1beta in 2014, MCNP6.2 in 2018, and MCNP6.3 in 2023. While each release always contains new features, code enhancements, and bug fixes, each version has had a different primary focus, ranging from improved calculational efficiency to new powerful utilities and tools, to software modernization of the code base. With all that has been learned over the first decade of the MCNP6 code, continuous progress is being made toward a modernized, general-purpose Monte Carlo radiation transport code that remains a trusted resource for the global community of practitioners. This paper describes these first 10+ years of the MCNP6 code and its continually improving data libraries, and gives some insight into how the next decade is expected to unfold.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

A particle-in-cell code comparison for ion acceleration: EPOCH, LSP, and WarpX

There are now more Particle-in-Cell (PIC) codes than ever before that researchers use to simulate intense laser-plasma interactions. To date, there have been relatively few direct comparisons of these codes in the literature, especially for relativistic intensity lasers interacting with thin overdense targets. To address this we perform a code comparison of three PIC codes: EPOCH, LSP, and WarpX for the problem of laser-driven ion acceleration in a 2D(3v) geometry for a 10 20 W cm -2 intensity laser. We examine the plasma density, ion energy spectra, and laser-plasma coupling of the three codes and find strong agreement. We also run the same simulation 20 times with different random seeds to explore statistical fluctuations of the outputs. We then compare the execution times and memory usage of the codes (without “tuning” to improve performance) using between 1 and 48 processors on one node. We provide input files to encourage larger and more frequent code comparisons in this field.

36 MATERIALS SCIENCE↗
DOE OSTI2023

$κ$monty: a Monte Carlo Compton scattering code including non-thermal electrons

Low-luminosity active galactic nuclei are strong sources of X-ray emission produced by Compton scattering originating from the accretion flows surrounding their supermassive black holes. The shape and energy of the resulting spectrum depend on the shape of the underlying electron distribution function (DF). In this work, we present an extended version of the GRMONTY code, called ΚMONTY. The GRMONTY code previously only included a thermal Maxwell–Jütner electron DF. We extend the GRMONTY code with non-thermal electron DFs, namely the κ and power-law DFs, implement Cartesian Kerr–Schild coordinates, accelerate the code with MPI, and couple the code to the non-uniform adaptive mesh refinement grid data from the general relativistic magnetohydrodynamics code BHAC. For the Compton scattering process, we derive two sampling kernels for both DFs. Finally, we present a series of code tests to verify the accuracy of our schemes. The implementation of non-thermal DFs opens the possibility of studying the effect of non-thermal emission on previously developed black hole accretion models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Achievable Rates for Concatenated Square Gottesman-Kitaev-Preskill Codes

The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure-loss channels, which establishes theoretical foundations for its optimality. However, such optimal rates are only known to be achieved at a discrete set of noise strengths with the current self-dual symplectic lattice construction. In this work, we develop a new coding strategy using concatenated continuous variable-discrete variable encodings to go beyond past results and establish GKP’s optimal rate over all noise strengths. In particular, for displacement noise, the rate is obtained through a constructive approach by concatenating GKP codes with a quantum polar code and analog decoding. For a pure-loss channel, we prove the existence of capacity-achieving GKP codes through a random coding approach. These results highlight the capability of concatenation-based GKP codes and provides new methods for constructing good GKP lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Performance and Achievable Rates of the Gottesman-Kitaev-Preskill Code for Pure-Loss and Amplification Channels

Quantum error-correction codes protect information from realistic noisy channels and lie at the heart of quantum computation and communication tasks. Understanding the optimal performance and other information-theoretic properties, such as the achievable rates, of a given code is crucial, as these factors determine the fundamental limits imposed by the encoding in conjunction with the noise channel. Here, we use the transpose channel to analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill (GKP) code under pure loss and pure amplification. We present rigorous connections between GKP code’s near-optimal performance and its dual lattice geometry and average input energy. With no energy constraint, we show that when |𝜏/(1−𝜏)| is an integer, specific families of GKP codes simultaneously achieve the loss and amplification capacity. 𝜏 is the transmissivity (gain) for loss (amplification). Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.

Zheng, Guo [Univ. of Chicago, IL (United States)] ↗
DOE OSTI2026

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Furthermore, our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Kobayashi, Ryohei [Institute for Advanced Study, P↗
DOE OSTI2025

Perturbative Stability and Error-Correction Thresholds of Quantum Codes

Topologically ordered phases are stable to local perturbations, and topological quantum error-correcting codes enjoy thresholds to local errors. We connect the two notions of stability by constructing classical statistical mechanics models for decoding general Calderbank-Shor-Steane codes and classical linear codes. Our construction encodes correction success probabilities under uncorrelated bit-flip and phase-flip errors, and simultaneously describes a generalized ℤ 2 lattice-gauge theory with quenched disorder. We observe that the clean limit of the latter is precisely the discretized imaginary-time path integral of the corresponding quantum code Hamiltonian when the errors are turned into a perturbative 𝑋 or 𝑍 magnetic field. Motivated by error-correction considerations, we define general order parameters for all such generalized ℤ 2 lattice-gauge theories, and show that they are generally lower bounded by success probabilities of error correction. For CSS codes satisfying the low-density parity-check condition and with a sufficiently large code distance, we prove the existence of a low-temperature ordered phase of the corresponding lattice-gauge theories, particularly for those lacking Euclidean spatial locality and/or when there is a nonzero code rate. We further argue that these results provide evidence for stable phases in the corresponding perturbed quantum Hamiltonians, obtained in the limit of continuous imaginary time. To do so, we distinguish space- and timelike defects in the lattice-gauge theory. A high free-energy cost of spacelike defects corresponds to a successful “memory experiment” and suppresses the energy splitting among the ground states, while a high free-energy cost of timelike defects corresponds to a successful “stability experiment” and points to a nonzero gap to local excitations.

quantum error correction↗
DOE OSTI2021

Machine Learning-enabled Scalable Performance Prediction of Scientific Codes

Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

ChatMPI: LLM-Driven MPI Code Generation for HPC Workloads

The Message Passing Interface (MPI) standard plays a crucial role in enabling scientific applications for parallel computing and is an essential component in high-performance computing (HPC). However, implementing MPI code manually—especially applying a proper domain decomposition and communication pattern—is a challenging and error-prone task. We present ChatMPI, an AI assistant for MPI parallelization of sequential C codes. In our analysis, we focus on testing six essential HPC workloads, which are based on Basic Linear Algebra Subprograms levels 1, 2, and 3 as well as sparse, stencil, and iterative operations. We analyze the process of creating ChatMPI by using the ChatHPC library. This lightweight large language model (LLM)–based infrastructure enables HPC experts to efficiently create and supervise trustworthy AI capabilities for critical HPC software tasks. We study the data required for training (fine-tuning) ChatMPI to generate parallel codes that not only use MPI syntax correctly but also apply HPC techniques to reduce memory communication and maximize performance by using proper work decomposition. With a relatively small training dataset composed of a few dozen prompts and fewer than 15 minutes of fine-tuning on one node equipped with two NVIDIA H100 GPUs, ChatMPI elevates trustworthiness for MPI code generation of current LLMs (e.g., Code Llama, ChatGPT-4o and ChatGPT 5). Additionally, we evaluate the performance of the MPI codes generated by ChatMPI in comparison with the ones generated by ChatGPT-4o and ChatGPT-5. The codes generated by ChatMPI provide up to a 4 × boost in performance by using better problem decomposition, communication patterns, and HPC techniques (e.g., communication avoiding).

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗
DOE OSTI2020

SCALE Lattice Physics Code Assessments of Accident Tolerant Fuel

This report highlights accident-tolerant fuel (ATF) code assessment activities performed under Project NRCHQ- 60-17-T-0017, Lattice Physics Enhancements and Assessment. ATF covers a broad range of advanced fuel and clad designs for light water reactors (LWRs) to enhance performance under several accident conditions. Several ATF concepts are anticipated to be deployed as lead test rods (LTRs) or lead test assemblies (LTAs) within the next five years. The purpose of this work is to assess the predictive capabilities of NRC neutronics codes that underpin various licensing calculations. ATF designs use different fuel and clad materials compared to standard UO 2 fuel and zirconium-alloy claddings (hereafter UO 2 -Zry). These new materials and geometrical designs need to be assessed to quantify the impact of nuclear data uncertainties on quantities of interest (QOIs) in licensing calculations and the impact of modeling approximations which may be valid for UO 2 -Zry but not for ATF. This report outlines a systematic approach for ATF neutronics code assessment which includes sensitivity and uncertainty (S/U) analysis of nuclear data, identification of experimental benchmark and gaps for code validation, investigation of modeling approximations, and code-to-code comparisons of calculated QOIs against high-fidelity reference continuous energy (CE) Monte Carlo (MC) calculations. This report focuses on the assessment of the SCALE/Polaris lattice physics code for reactor safety analysis. Polaris lattice physics calculations generate few group (FG) cross sections for PARCS full-core calculations. (Full-core analysis, spent fuel analysis, and severe accident analysis will be performed in future work.) The selected ATF concepts for this report include Cr 2 O 3 and Al 2 O 3 -Cr 2 O 3 -doped UO 2 fuel, U 3 Si 2 fuel, FeCrAl cladding, SiC cladding, and Cr-coated cladding.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

(U) Radiation Hydrodynamics in the Ristra Project’s Symphony code: Initial release

One of the recent focuses in the next-generation code (NGC/Ristra)project at LANL is to develop a cell-centered Lagrangian radiation-hydrodynamics code under FleCSI framework. The FleCSI frame-work provides a unified data and execution model in order to insulate production code development from the uncertainty of evolving runtimeand architectures. We have developed the code, Symphony, which in-corporates the hydrodynamics code, FleCSALE, and the radiation transport code, Puno.This memo is intended to describe the coupling of radiation and hydrodynamics within the Ristra Project’s code Symphony.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

MCNP ® Code Version 6.3.0 Theory & User Manual

This document acts as a repository of knowledge for the Monte Carlo N-Particle (MCNP) transport computer code. It is maintained alongside the source code and attempts to introduce new users and re-familiarize experienced users with the theory and practices of using the MCNP code for the wide range of particle transport analyses that it is appropriate for. The latest version of the MCNP code, version 6.3.0, provides the Monte Carlo particle transport community with the latest feature developments and bug fixes in the MCNP code. The MCNP code version 6.0 and later is also known as the MCNP6 code.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗