Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Physics - Plasma physics , Mathematics and Computing, Physics”

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 307 records · Page 17

Implementation of Triply Periodic Minimal Surfaces (TPMS) as surface objects in OpenMC

Triply Periodic Minimal Surfaces (TPMS) represent a promising geometry for future fuel designs due to their significant surface-to-volume ratio, which facilitates efficient cooling of nuclear fuel, a crucial factor for safety and efficiency. Demonstrating the remarkable capabilities of TPMS fuel requires initial modeling and simulation. This paper presents an implementation of TPMS in the Monte Carlo code OpenMC, enabling reactor physics modeling of TPMS. Here, the primary advantages over traditional methods using CAD files include reduced memory requirements for computations and high-fidelity implementation. This implementation has been tested against CAD files loaded in Serpent2, yielding promising results with low biases in the $k_{\textrm{eff}}$, comparable to biases in the material balance sheet. The implementation presented in this work will be used in future reactor physics computations related to new reactor designs involving TPMS-based fuels.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Characterization and thermometry of dissipatively stabilized steady states

In this work we study the properties of dissipatively stabilized steady states of noisy quantum algorithms, exploring the extent to which they can be well approximated as thermal distributions, and proposing methods to extract the effective temperature T. We study an algorithm called the relaxational quantum eigensolver (RQE), which is one of a family of algorithms that attempt to find ground states and balance error in noisy quantum devices. In RQE, we weakly couple a second register of auxiliary ‘shadow’ qubits to the primary system in Trotterized evolution, thus engineering an approximate zero-temperature bath by periodically resetting the auxiliary qubits during the algorithm’s runtime. Balancing the infinite temperature bath of random gate error, RQE returns states with an average energy equal to a constant fraction of the ground state. We probe the steady states of this algorithm for a range of base error rates, using several methods for estimating both T and deviations from thermal behavior. In particular, we both confirm that the steady states of these systems are often well-approximated by thermal distributions, and show that the same resources used for cooling can be adopted for thermometry, yielding a fairly reliable measure of the temperature. These methods could be readily implemented in near-term quantum hardware, and for stabilizing and probing Hamiltonians where simulating approximate thermal states is hard for classical computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling Predictive Scale-Bridging Simulations through Active Learning (Institutional Computing Annual Report (Project w21_alscalebridging)) [Slides]

The goal of this project was to develop, demonstrate, and provide a new capability to achieve greater physical fidelity in large-scale simulations, rather than the usual brute-force increases in the number of mesh elements or particles. Transport in nanoporous media, critical to hydrocarbon extraction from tight shale formations, is affected by molecular-level interactions. Several coarse-scale Lattice Boltzmann model (LBM) parameters cannot be directly computed, so instead we calibrate them to molecular dynamics (MD) simulations, by building emulators that mimic MD and LBM behavior and then training an upscaler. The resulting machine learning (ML)-based scale-bridging framework is up to 7 orders of magnitude faster than direct MD.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Perspective on Sustainable Computational Chemistry Software Development and Integration

The power of quantum chemistry to predict the ground and excited state properties of complex chemical systems has driven the development of computational quantum chemistry software, integrating advances in theory, applied mathematics, and computer science. The emergence of new computational paradigms associated with exascale technologies also poses significant challenges that require a flexible forward strategy to take full advantage of existing and forthcoming computational resources. In this context, the sustainability and interoperability of computational chemistry software development are among the most pressing issues. In this perspective, we discuss software infrastructure needs and investments with an eye to fully utilize exascale resources and provide unique computational tools for next-generation science problems and scientific discoveries.

36 MATERIALS SCIENCE↗

IBM Open Science Price - SWAP Gate Challenge

On November 30, 2020, IBM announced an open science price competition aimed at improving the fidelity of a SWAP gate on their 7 qubit Quantum system named ”Casablanca”. The details of the SWAP gate problem was outlined in a Jupyter notebook, which utilizes the IBM developed open source package Qiskit. The participants were allowed to work in teams with up to five people and restricted to only use open source software in solving the problem. Their results were due on April 16, 2021. Our approach to solving the SWAP gate challenge is based on the quantum optimal control techniques implemented in our open source packages Juqbox.jl and Quandary. The results from the optimal control approach is only as good as the accuracy in the description of the quantum system dynamics, characterized by a Hamiltonian model that was provided by IBM. Based on the calibrated control pulses IBM provide for the standard gate set, we developed a reverse engineering approach to calibrate our computational model. Techniques were developed to translate between Qiskit’s pulse representation and the B-spline formulation used in Juqbox and Quandary. The fidelity of the optimized pulse sequences were estimated using Qiskit’s randomized bench marking techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SDA: a symbolic differential algebra package in C++

Truncated Power Series Algebra (TPSA), or Differential Algebra (DA), is a well-established tool in accelerator physics, commonly used for generating high-order maps of dynamic systems, as well as in symplectic tracking, normal form analysis, verified integration, optimization, and fast multipole methods. This package is the first to perform symbolic DA computations, enabling traceability of initial condition contributions and runtime reduction for repeated DA calculations, potentially expanding DA’s applications.

97 MATHEMATICS AND COMPUTING↗

Physics in the Machine: Integrating Physical Knowledge in Autonomous Phase-Mapping

Application of artificial intelligence (AI), and more specifically machine learning, to the physical sciences has expanded significantly over the past decades. In particular, science-informed AI, also known as scientific AI or inductive bias AI, has grown from a focus on data analysis to now controlling experiment design, simulation, execution and analysis in closed-loop autonomous systems. The CAMEO (closed-loop autonomous materials exploration and optimization) algorithm employs scientific AI to address two tasks: learning a material system’s composition-structure relationship and identifying materials compositions with optimal functional properties. By integrating these, accelerated materials screening across compositional phase diagrams was demonstrated, resulting in the discovery of a best-in-class phase change memory material. Key to this success is the ability to guide subsequent measurements to maximize knowledge of the composition-structure relationship, or phase map. In this work we investigate the benefits of incorporating varying levels of prior physical knowledge into CAMEO’s autonomous phase-mapping. This includes the use of ab-initio phase boundary data from the AFLOW repositories, which has been shown to optimize CAMEO’s search when used as a prior.

97 MATHEMATICS AND COMPUTING↗

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving deep learning performance for predicting large-scale geological ${{CO}_{2}}$ sequestration modeling through feature coarsening

Physics-based reservoir simulation for fluid flow in porous media is a numerical simulation method to predict the temporal-spatial patterns of state variables (e.g. pressure p) in porous media, and usually requires prohibitively high computational expense due to its non-linearity and the large number of degrees of freedom (DoF). This work describes a deep learning (DL) workflow to predict the pressure evolution as fluid flows in large-scale 3-dimensional(3D) heterogeneous porous media. In particular, we develop an efficient feature coarsening technique to extract the most representative information and perform the training and prediction of DL at the coarse scale, and further recover the resolution at the fine scale by spatial interpolation. We validate the DL approach to predict pressure field against physics-based simulation data for a field-scale 3D geologic CO 2 sequestration reservoir model. We evaluate the impact of feature coarsening on DL performance, and observe that the feature coarsening not only decreases the training time by >74% and reduces the memory consumption by >75%, but also maintains temporal error 0.63% on average. Besides, the DL workflow provides predictive efficiency with 1406 times speedup compared to physics-based numerical simulation. The key findings from this research significantly improve the training and prediction efficiency of deep learning model to deal with large-scale heterogeneous reservoir models, and thus it can also be further applied to accelerate workflows of history matching and reservoir optimization for close-loop reservoir management.

58 GEOSCIENCES↗

DUNE Data Management: Network Visualization Monitoring Software

Fermilab’s fagship Deep Underground Neutrino Experiment (DUNE) seeks to better understand the nature of neutrinos within the context of Leptogenesis, neutrino oscillations, multi-messenger Astronomy, and other scientifc phenomena. The experiment will send a beam of neutrinos from the Fermilab site in Illinois to the Sanford Underground Neutrino Facility (SURF) in South Dakota, generating petabytes of scientifc data. Given the high volume of data expected when measurements begin at the end of the decade, DUNE computing and the data management group must carefully monitor data transfers across the 15 remote storage sites and, more generally, the 36 global DUNE computing sites. This report will describe both the frontend and backend data monitoring software designed to analyze and visualize these data transfers. Specifc emphasis will be placed on the software’s setup, usage, and methods for future implementations. The full software code can be found under the DUNE/data-mgmt-testing GitHub repository.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Generalized Bayesian Framework for Evaluation of Integral Benchmark Experiments

A recently published generalized Bayesian optimization framework has provided a way to retract any or all of the three common assumptions underlying the conventional Generalized Linear Least Squares (GLLS) optimization method based on the concepts introduced in reference two. These assumptions are: 1. Perfection: The model used for data evaluation and the prior probability distribution function (PDF) of generalized* data are perfect; 2. Normality: The prior and posterior PDF are normal; and 3. Linearity: The model is linear. In this work we outline how the framework in 1 could be directly adopted for improved evaluation of nuclear criticality integral benchmark experiments (IBEs) by: 1. Removing the first assumption alone by utilizing the concept of imperfections introduced in 1 to enable evaluation in the presence of discrepancies between the data and model or of missing covariance information by a GLLS method that will be seen as a generalization of the conventional GLLS method employed by the TSURFER code, and by 2. Removing the remaining two assumptions by implement- ing a Markov Chain Monte Carlo method for computation of the posterior PDF in the SAMPLER code, where TSURFER and SAMPLER are the uncertainty quantification (UQ) codes for IBEs in the SCALE code system based on the GLLS, and the stochastic method, respectively.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Readout rebalancing for near-term quantum computers

Readout errors are a significant source of noise for near-term intermediate-scale quantum computers. Mismeasuring a qubit as |1) when it should be |0) occurs much less often than mismeasuring a qubit as |0) when it should have been |1). We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the |1) state is minimized. Classical postprocessing can undo the effect of the X gates so that the expectation value of any observable is unchanged. This protocol is designed to have no effect when readout errors are symmetric. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit and computer dependent and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of 2 in some cases) when states with many qubits in the excited state have high probability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating transients with NekRS: GPU overlapping domain implementation and multi-rate timestepping

The simulation of nuclear transients using Computational Fluid Dynamics (CFD) presents significant computational challenges due to the inherent complexity and the wide separation in temporal scales between various flow physical phenomena. These disparities lead to high computational costs, often making the simulation of transients impractical without advanced techniques. Consequently, multiple research initiatives are being pursued by the NEAMS thermal-hydraulic area, some driven by academic institutions and some by national laboratories. Overall, they are exploring novel methods to make transient simulations more feasible and efficient. This report delves into recent advancements within the CFD code NekRS, specifically those achieved in Fiscal Year 2024 under the CONNECT effort, aimed at improving the performance and feasibility of transient simulations. The first major advancement involves the porting of NekRS to Aurora, one of the Department of Energy’s (DOE) most powerful supercomputers. Additionally, the report discusses the implementation of an overlapping domain capability within NekRS. This novel GPU-accelerated capability allows different spatial regions of the domain to be solved independently, enhancing the code’s efficiency, particularly when running large-scale simulations in complex domains. The scalability of this approach is demonstrated, highlighting its potential to transform how transients are approached in CFD simulations. Lastly, the report focuses on how this overlapping domain capability specifically accelerates transient simulations through multi-rate timestepping. By decoupling different regions and facilitating faster computations, this method offers a promising pathway to making nuclear transient simulations more computationally feasible, addressing one of the critical bottlenecks in the field. Together, these advancements represent a significant leap forward in transient simulation technology, bringing closer the possibility of handling highly complex nuclear scenarios with greater efficiency and accuracy.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Signatures of a liquid–liquid transition in an ab initio deep neural network model for water

Significance Water is central across much of the physical and biological sciences and exhibits physical properties that are qualitatively distinct from those of most other liquids. Understanding the microscopic basis of water’s peculiar properties remains an active area of research. One intriguing hypothesis is that liquid water can separate into metastable high- and low-density liquid phases at low temperatures and high pressures, and the existence of this liquid–liquid transition could explain many of water’s anomalous properties. We used state-of-the-art approaches in computational quantum chemistry, statistical mechanics, and machine learning and obtained evidence consistent with a liquid–liquid transition, supporting the argument for the existence of this phenomenon in real water.

36 MATERIALS SCIENCE↗

2019 LDRD Annual Report

This summary report provides an overview of all LDRD projects at Argonne that concluded in Fiscal Year 2019. Many projects are funded for multiple years, the initial fiscal year for each project is indicated by the first four digits of the LDRD project number. Focus areas were: Advanced Computing; Biological and Environmental Science Capability Development; Hard X-ray Sciences; Manufacturing Science and Engineering; Materials and Chemistry; National and Global Security; Photon Sciences; Securing Energy and Critical Resources; and, The Universe as Our Laboratory (ULab).

36 MATERIALS SCIENCE↗

Dominant balance-based adaptive mesh refinement for incompressible fluid flows

This work introduces a novel adaptive mesh refinement (AMR) method that utilizes dominant balance analysis (DBA) for efficient and accurate grid adaptation in computational fluid dynamics (CFD) simulations. The proposed method leverages a Gaussian mixture model (GMM) to classify grid cells into active and passive regions based on the dominant physical interactions within the equation space. By modeling truncation error probabilistically from discretized terms, the method identifies regions of high interaction where numerical accuracy is most sensitive to resolution. Unlike traditional AMR strategies, this approach does not rely on heuristic-based sensors or user-defined thresholds, providing a fully automated and problem-independent framework for AMR. Applied to the incompressible Navier-Stokes equations for steady and unsteady flow past a cylinder, the DBA-based AMR method achieves comparable accuracy to high-resolution grids while reducing computational costs by up to 70 %. The validation highlights the method’s effectiveness in capturing complex flow features while minimizing grid cells, directing computational resources toward regions with the most critical dynamics. This modular and scalable strategy is adaptable to a wide range of applications, presenting a promising tool for efficient high-fidelity simulations in CFD and other multiphysics domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simple and efficient algorithms for training machine learning potentials to force data

Machine learning models, trained on data from ab initio quantum simulations, are yielding molecular dynamics potentials with unprecedented accuracy. One limiting factor is the quantity of available training data, which can be expensive to obtain. A quantum simulation often provides all atomic forces, in addition to the total energy of the system. These forces provide much more information than the energy alone. It may appear that training a model to this large quantity of force data would introduce significant computational costs. Actually, training to all available force data should only be a few times more expensive than training to energies alone. Here, we present a new algorithm for efficient force training, and benchmark its accuracy by training to forces from real-world datasets for organic chemistry and bulk aluminum.

74 ATOMIC AND MOLECULAR PHYSICS↗