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

Resonant amplification of enzymatic chemical oscillations by oscillating flow

Using theory and simulation, we analyzed the resonant amplification of chemical oscillations that occur due to externally imposed oscillatory fluid flows. The chemical reactions are promoted by two enzyme-coated patches located sequentially on the inner surface of a pipe that transports the enclosed chemical solution. In the case of diffusion-limited systems, the period of oscillations in chemical reaction networks is determined by the rate of the chemical transport, which is diffusive in nature and, therefore, can be effectively accelerated by the imposed fluid flows. In this work, we first identify the natural frequencies of the chemical oscillations in the unperturbed reaction–diffusion system and, then, use the frequencies as a forcing input to drive the system to resonance. We demonstrate that flow-induced resonance can be used to amplify the amplitude of the chemical oscillations and to synchronize their frequency to the external forcing. In particular, we show that even 10% perturbations in the flow velocities can double the amplitude of the resulting chemical oscillations. Particularly, effective control can be achieved for the two-step chemical reactions where during the first half-period, the fluid flow accelerates the chemical flux toward the second catalytic patch, while during the second half-period, the flow amplifies the flux to the first patch. The results can provide design rules for regulating the dynamics of coupled reaction–diffusion processes and can facilitate the development of chemical reaction networks that act as chemical clocks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

MCNP ® Code Version 6.3.0 Verification & Validation Testing

This report describes the verification and validation testing performed on MCNP ® code version 6.3.0. The purpose of this report is to act as a compendium of test suite descriptions and results. Accordingly the document is divided into two parts. Part I (this part) describes each test suite in the following sections. Part II provides the results of testing each suite and comparisons to experimental and/or alternative computational results, as appropriate.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Reducing the complexity of finite-temperature auxiliary-field quantum Monte Carlo

The auxiliary-field quantum Monte Carlo (AFMC) method is a powerful and widely used technique for ground-state and finite-temperature simulations of quantum many-body systems. Here we introduce several algorithmic improvements for finite-temperature AFMC calculations of dilute fermionic systems that reduce the computational complexity of most parts of the algorithm. This is principally achieved by reducing the number of single-particle states that contribute at each configuration of the auxiliary fields to a number that is of the order of the number of fermions. Our methods are applicable for both the canonical and grand-canonical ensembles. We demonstrate the reduced computational complexity of the methods for the homogeneous unitary Fermi gas.

67.85.Lm↗
DOE OSTI2022

Python Group Additivity (pGrAdd) software for estimating species thermochemical properties

ncreasingly complex chemistry models require thermochemical data for many species often estimated from costly first-principles DFT computations. Here we introduce the Python Group Additivity software (pGrAdd) that implements comprehensive group additivity in a simple, modular, lightweight Python package that is extensible and easy to implement. It includes 6 group additivity databases for gas species and Pt(111) adsorbates allowing users to immediately compute thermochemical properties for a wide range of molecules and build new databases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Anti-$\mathscr{PT}$-symmetric qubit: Decoherence and entanglement entropy

We investigate the dynamics of a general two-level based anti-parity-time (anti-$\mathscr{PT}$)-symmetric qubit and study its decoherence as well as entanglement entropy properties. We compare our findings with that of the corresponding parity-time ($\mathscr{PT}$)-symmetric and Hermitian qubits. To begin, we consider the time-dependent Dyson map to find the exact analytical dynamics for a general non-Hermitian qubit system weakly coupled with a thermal bath for pure dephasing, before specializing it to the case of a general anti-$\mathscr{PT}$-symmetric qubit. Basing the comparison under the same coupling strength or increasing the non-Hermiticity, we observe that the decoherence function and entanglement entropy of the anti-$\mathscr{PT}$-symmetric qubit decays and grows more slowly, respectively, compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. Similarly, the corresponding variance and area of Fisher information are much higher compared to the $\mathscr{PT}$-symmetric and Hermitian qubits. These results demonstrate that anti-$\mathscr{PT}$-symmetric qubits may be better suited for quantum computing and quantum information processing applications than conventional Hermitian or even $\mathscr{PT}$-symmetric qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗
DOE OSTI2020

Analytic Modeling of a Deep Shielding Problem

Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than \building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

(U) Calculating First-Order Sensitivities to Material Density and Composition in Fixed-Source Problems Using the MCNP6 Perturbation Capability

The Taylor series (differential operator) perturbation method, as implemented in the PERT capability in MCNP6 (Ref. 1), can be used for first-order sensitivity analyses in fixed-source problems.2 Sensitivities of a response with respect to material and nuclide densities can be used for efficient first-order uncertainty quantification. This report discusses how to compute sensitivities of material densities and compositions in order to propagate uncertainties using the standard uncertainty propagation formula.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Thermalization in the one-dimensional Salerno model lattice

The Salerno model constitutes an intriguing interpolation between the integrable Ablowitz-Ladik (AL) model and the more standard (nonintegrable) discrete nonlinear Schrödinger (DNLS) one. The competition of local on-site nonlinearity and nonlinear dispersion governs the thermalization of this model. Here, we investigate the statistical mechanics of the Salerno one-dimensional lattice model in the nonintegrable case and illustrate the thermalization in the Gibbs regime. As the parameter interpolating between the two limits (from DNLS toward AL) is varied, the region in the space of initial energy and norm densities leading to thermalization expands. The thermalization in the non-Gibbs regime heavily depends on the finite system size; we explore this feature via direct numerical computations for different parametric regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Modeling, Performance Assessment, and Nodal Data Analysis of TRISO-Fueled Systems with Shift

This technical report documents several enhancements to the Shift Monte Carlo (MC) code under the US Department of Energy (DOE) Nuclear Energy Advanced Modeling and Simulation (NEAMS) program in fiscal year (FY) 2022. Performance enhancements were added to Shift specifically for tristructural isotropic (TRISO)–fueled reactor systems and guided based on performance analysis in FY 2021. For the pebble performance model developed in previous studies, the runtime improved by ~ 91× compared to the original model and ~ 2× compared to the user-optimized model. Compared to Serpent, Shift is ~ 3× slower if Serpent delta-tracking is enabled but ~ 2× faster when delta-tracking is disabled. The multigroup cross section generation was improved through simplifying tally input definitions, porting several post-processing tally operations from Python scripts into the Shift code base, and accounting for production reactions in the scattering multiplicity. Progress was also made on two emerging capabilities: (1) the development of Titan (a Shift reactor physics user interface) and (2) initial investigation into path-length tallies for computing multigroup scattering matrices.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Quantum algorithmic measurement

There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics: determining whether a system’s Hamiltonian is time-independent or time-dependent, and determining the symmetry class of the dynamics of the system. We study abstractions of these problems and show for both cases that if the experimentalist can use her experimental samples coherently (in both space and time), a provable exponential speedup is achieved compared to the standard situation in which each experimental sample is accessed separately. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Physics-Reinforced Machine Learning Algorithms for Multiscale Closure Model Discovery

The central objective of this project was to address the challenge of modeling and simulating complex multiscale turbulence phenomena by leveraging physics-guided machine learning (PGML) and hybrid modeling approaches. By integrating physics-based methods with data-driven models, the research focused on achieving robust and scalable solutions for geophysical turbulence, enhancing numerical weather prediction and climate research tools. The project resulted in significant advancements in computational modeling paradigms, predictive tools for reduced-order modeling, and innovative algorithms for fluid dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Generating MCNP Input Files for Unstructured Mesh Geometries

The Los Alamos National Laboratory’s (LANL) Monte Carlo N-Particle (MCNP)1 transport code version 6.3 (also known as MCNP6.3) has the capability for tracking particles on unstructured mesh (UM) geometry models embedded into constructive solid geometry (CSG) cells. This feature has been developed for performing calculations of complex geometry models because manually creating CSG models is time-consuming and error-prone as the complexities of geometries increase. A UM geometry model is a collection of finite elements representing a solid geometry. The first step of the MCNP UM calculation is using other software packages to create a finite element mesh representation of a solid 3D geometry because the MCNP code cannot be used to generate a UM model. Computer-aided design (CAD) software is typically used to create a solid geometry model, which is later imported into mesh generation software to create a UM model. Some mesh generation software packages may also be used to create solid geometries and thus CAD files are not needed. The MCNP UM feature was originally designed for models generated by the Abaqus/CAE software suite. The MCNP code version 6.0 and later can process UM models formatted as Abaqus input files. Starting with a 6.3 version, the MCNP code can process HDF5 mesh input files. We only focus on the UM models formatted as Abaqus input files in this report since currently no external software can be used to generate HDF5 mesh input files for MCNP UM calculations. The MCNP code version 6.3 can be used to convert the Abaqus mesh input files into the HDF5 mesh input files, but this option is typically used by the MCNP code development team to test the HDF5 mesh input file feature. Several software packages (such as Abaqus, Attila4MC, or Cubit) can be used to create the Abaqus input files for MCNP UM calculations. An MCNP UM calculation using an Abaqus model requires two input file types: MCNP and Abaqus input files. The Abaqus input files needed for MCNP UM calcu lations must have the correct Abaqus syntax and meet the additional requirements by the MCNP code. The MCNP code can process only Abaqus input files that make use of part and assembly definitions, where elements in each part must be grouped into one or more element sets (i.e., elset) using *Elset keyword lines with specified naming formats. The MCNP and Abaqus input files required for MCNP UM simulations must be related; pseudo-cells in an MCNP input file must be constructed from mesh model data from an Abaqus input file. For large complex UM models, it is tedious to manually create MCNP UM input files. The um pre op (unstructured mesh pre operations) program with the -m option can be used to create a skeleton MCNP input file from an Abaqus input file [6]. Since the um pre op program was written in Fortran and was not written for optimized performance, this program is a deprecated feature in the MCNP code version 6.3 and may be removed in the next release of the code. To improve calculation flow of multiphysics calculations, a Python3 code called write mcnp um input has been developed to generate an MCNP input file instead of using the um_pre_op -m option. This Python code was initially released to the public in 2020. We have updated this Python code for MCNP6.3 and it was used to generate the MCNP input files used to verify the MCNP6.3 code. The write_mcnp_um_input code is included with the MCNP6.3 code package which will be released to the public through the Radiation Safety Information Computational Center (RSICC) at Oak Ridge National Laboratory. This report is a revision of LA-UR-20-27139 report.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A method for generating moving, orthogonal, area preserving polygonal meshes

A new method for generating locally orthogonal polygonal meshes from a set of generator points is presented in which polygon areas are a constraint. The area constraint property is particularly useful for particle methods where moving polygons track a discrete portion of material. Because Voronoi polygon meshes have some very attractive mathematical and numerical properties for numerical computation, a generalization of Voronoi polygon meshes was formulated that enforces a polygon area constraint. Area constrained moving polygonal meshes allow one to develop hybrid particle-mesh numerical methods that display some of the most attractive features of each approach. It is shown that this mesh construction method can continuously reconnect a moving, unstructured polygonal mesh in a pseudo-Lagrangian fashion without change in cell area/volume, and the method's ability to simulate various physical scenarios is shown. Overall, the advantages are identified for incompressible fluid flow calculations, with demonstration cases that include material discontinuities of all three phases of matter and large density jumps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Force Reconstruction Using the Inverse of the Mode-Shape Matrix [Book Chapter]

A new technique for force reconstruction is developed. To estimate the externally applied force, this technique sums the weight-scaled acceleration signals, and is referred to as the Sum of Weighted Accelerations Technique (SWAT). To obtain the scalar weights the inverse of the mode shape matrix is used. Application of this technique is illustrated with both numerical calculations using a mass-spring model and experimental data from a structure impacting a rigid barrier.

055001 -- Nuclear Fuels-- Safeguards, Inspection, ↗
DOE OSTI2022

Introduction to an MCGIDI Mini-App and Performance Comparisons with XSBench

In high-performance Monte Carlo (MC) radiation transport codes, cross section lookups often account for the majority of computational expens. In response to this observation, a number of nuclear data mini-apps have been developed to profile and optimize the lookup process. A review of these mini-apps can be found in Ref. In contrast to a fully fledged MC code, nuclear data mini-apps do not feature particle tracking; instead, the cross section lookup process is considered in isolation, a simplification that allows for easier implementation and evaluation of various lookup schemes and techniques. GIDI+, as described on its public repository1, is ...a collection of C++ libraries for accessing evaluated and processed nuclear data stored in the Generalized Nuclear Database Structure (GNDS). In addition to reading GNDS files, GIDI+ has functions to sum and collapse multi-group data as needed by deterministic transport codes, and to sample GNDS data as needed by Monte Carlo transport codes. Certain modes of Mercury, a LLNL-developed MC radiation transport code, utilize GIDI+ for cross section lookups. Specifically, Mercury uses the MCGIDI library contained within GIDI+ to perform lookups on GPUs. A mini-app exercising MCGIDI’s cross section lookup capabilities would prove useful for optimization, which in turn could improve the performance of client codes such as Mercury. Such a mini-app could also be used to assess the performance of MCGIDI compared to other nuclear data mini-apps. In this document, we introduce a nuclear data mini-app built with the MCGIDI library. The MCGIDI mini-app (MCGIDI-MA) was developed to closely resemble the methodology present in XSBench, a nuclear data mini-app developed at Argonne National Laboratory. The remainder of this section provides an overview on XSBench. Section 2 describes MCGIDI-MA and its usage. Section 3 contains performance results of MCGIDI-MA on LLNL’s Lassen and Quartz compute platforms, as well as comparisons to XSBench performance where appropriate. In Section 4, we present a summary of our findings.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗