Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “memory spaces”

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

Accelerating structural dynamics simulations with localised phenomena through matrix compression and projection‐based model order reduction

In this work, a novel approach is introduced for accelerating the solution of structural dynamics problems in the presence of localised phenomena, such as cracks. For this category of problems, conventional projection-based Model Order Reduction (MOR) methods are either limited with respect to the range of system configurations that can be represented or require frequent solutions of the Full Order Model (FOM) to update the low-dimensional spaces, in which solutions are represented. In the proposed approach, low-dimensional spaces, constructed for the healthy structure, are enriched with appropriately selected columns of the flexibility matrix of the system. It can be shown that these spaces contain the solution to the original problem for the static case, while their dimension is much smaller. In order to allow their online construction for arbitrary localised features, the full flexibility matrix of the system should be available. To this end, a hierarchical representation is used for the matrices involved, allowing to compute the flexibility matrix efficiently and with reduced memory requirements. The resulting method offers significant speedups, without sacrificing the flexibility and accuracy of the full order model. The performance and limitations of the approach are studied through a series of examples in structural dynamics.

fracture mechanics↗

Fast emulation of quantum three-body scattering

Here, we develop a class of emulators for solving quantum three-body scattering problems. They are based on combining the variational method for scattering observables and the recently proposed eigenvector continuation concept. The emulators are first trained by the exact scattering solutions of the governing Hamiltonian at a small number of points in its parameter space, and then employed to make interpolations and extrapolations in that space. Through a schematic nuclear-physics model with finite-range two and three-body interactions, we demonstrate the emulators to be extremely accurate and efficient. The computing time for emulation is on the scale of milliseconds (on a laptop), with relative errors ranging from 10 –13 to 10 –4 depending on the case. The emulators also require little memory. We argue that these emulators can be generalized to even more challenging scattering problems. Furthermore, this general strategy may be applicable for building the same type of emulators in other fields, wherever variational methods can be developed for evaluating physical models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Approaches for the Simulation of Coupled Processes in Evolving Fractured Porous Media Enabled by Exascale Computing

Models have historically represented fractured porous media with continuum descriptions that characterize the media using bulk parameters. The impact of small-scale features is not captured in these models, although they may be controlling the performance of subsurface applications. Pore-scale models can simulate processes in small-scale features by representing the pore space geometry explicitly but are computationally expensive for large domains. The alternative multiscale approach entails the combination of pore-scale and continuum-scale descriptions in a single framework. We use Chombo-Crunch, a computational capability that discretizes complex geometries with an adaptive, embedded boundary method to contrast these two approaches. Chombo-Crunch takes advantage of recent computational performance and memory bandwidth improvements resulting from the emergence of exascale computing resources. These combined improvements enable the efficient simulation of reactive transport in fractured media with a high degree of fidelity and the ability to capture the control small-scale processes exert on the overall medium evolution.

42 ENGINEERING↗

Noisy Approach to Intrinsically Mixed-State Topological Order

We propose a general framework for studying two-dimensional (2D) topologically ordered states subject to local correlated errors and show that the resulting mixed state can display (imTO)—topological order that is not expected to occur in the ground state of 2D local gapped Hamiltonians. Specifically, we show that decoherence, previously interpreted as anyon condensation in a doubled Hilbert space, is more naturally phrased as, and provides a physical mechanism for, “gauging out” anyons in the original Hilbert space. We find that gauging out anyons generically results in imTO, with the decohered mixed state strongly symmetric under certain anomalous 1-form symmetries. This framework lays bare a striking connection between the decohered density matrix and , which can appear as anomalous surface states of three-dimensional topological orders. Through a series of examples, we show that the decohered state can display a classical memory, encode logical qubits (i.e., exhibit a quantum memory), and even host chiral or nonmodular topological order. We argue that a partial classification of imTO is given in terms of nonmodular braided-fusion categories. Published by the American Physical Society 2025

Sohal, Ramanjit (ORCID:0000000292975715)↗

Surrogate models for development of unconventional shale reservoirs by an integrated numerical approach of hydraulic fracturing, flow and geomechanics, and machine learning

We develop well-completion surrogate models by taking an integrated workflow of hydraulic fracturing, flow, geomechanics, and machine learning simulation. There are three steps in the proposed workflow. First, history-matching processes are conducted with the field data including pumping and production data for characterization. Second, full-physics simulation is performed with various parameters of the field development (e.g., cluster spacing, clusters per stage, pumping rates and times, amount of proppant, and well spacing) to generate multiple simulation results by changing the parameters of the completion design with well-known hydraulic fracturing, reservoir, geomechanics simulators to calculate fracture geometry, reservoir depressurization, induced stress changes. The workflow is demonstrated over a field in the Southern Midland Basin. Here, we take two completion scenarios: a single well case followed by a multi-well case. Finally, a Long Short-Term Memory (LSTM) machine learning algorithm is employed to create surrogate models that can replicate the full-physics simulation results. Furthermore, results show that the trained models applied in the single well and multi-well cases for a particular geological system can provide good accuracy close to those provided by full-physics simulations. Specifically, the site-specific surrogate models can predict fracture parameters (length, height, and surface area) and cumulative production accurately with computational efficiency, suggesting our proposed workflow can be used as a pragmatic tool for expediting the well completion optimization process.

Geomechanics↗

A Fast Algorithm for Scanning Transmission Electron Microscopy Imaging and 4D-STEM Diffraction Simulations

Scanning transmission electron microscopy (STEM) is an extremely versatile method for studying materials on the atomic scale. Many STEM experiments are supported or validated with electron scattering simulations. However, using the conventional multislice algorithm to perform these simulations can require extremely large calculation times, particularly for experiments with millions of probe positions as each probe position must be simulated independently. Recently, the plane-wave reciprocal-space interpolated scattering matrix (PRISM) algorithm was developed to reduce calculation times for large STEM simulations. Here, we introduce a new method for STEM simulation: partitioning of the STEM probe into “beamlets,” given by a natural neighbor interpolation of the parent beams. This idea is compatible with PRISM simulations and can lead to even larger improvements in simulation time, as well requiring significantly less computer random access memory (RAM). We have performed various simulations to demonstrate the advantages and disadvantages of partitioned PRISM STEM simulations. We find that this new algorithm is particularly useful for 4D-STEM simulations of large fields of view. We also provide a reference implementation of the multislice, PRISM, and partitioned PRISM algorithms.

97 MATHEMATICS AND COMPUTING↗

Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning

Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.

Krajewski, Adam M. (ORCID:0000000222660099)↗

Using Likwid and Byfl to Benchmark Hardware Performance

This paper outlines a benchmarking study conducted during my internship at LANL, focusing on CPU (Computer Processing Unit) and program performance assessment. The primary goal was to gather memory access data using three methods across five polybench kernels The data gathered would then be used to compare and contrast to one another and calculate operational intensity for performance comparisons. Benchmarking tools like Byfl and Likwid were employed, with Byfl offering hardware-independent data through LLVM compiler communication and Likwid directly interacting with computer hardware. The study considered various benchmarking factors, including optimization levels, Big O notation ((n)), CPU diversity and specific kernel equations. Big O notation was utilized to simplify code complexity, with detailed breakdwons of operations and memory components for each polybench application. Specific O(n) equations enabled nuanced kernel compariosns, facilitating the identification of performance variations. CPU efficiency assessments were conducted using Likwid tests on two CPUs. The central focus on code optimization aimed at achieving higher speeds and reduced memory usage through streamlined code. Future work propsoes creating a roofline model, synthesizing benchmarking data into a comprehensive data graph to assist in optimizing code and improving hardware performance. The potential impact on the laboratory or national mission was underscored, emphasizing the importance of optimizing applications and hardware to conserve resources and accelerate program execution. The specific relevance to LANL’s operations in math-intensive fields such as Nuclear Fission, Space Exploration, and Nanotechnology highlights the necessity of efficient benchmarking for resource conservation and proram speed. Overall, this study contributes to the understanding of CPU and program performance, providing insights for future optimization efforts in a laboratory setting

97 MATHEMATICS AND COMPUTING↗

Physical Modeling and Design of a Nonvolatile Optically Gated High‐Power Diamond Transistor

In this work, we present the theory and modeling framework of a diamond optically gated junction field‐effect transistor (DOGFET). The device utilizes nitrogen substitutional centers in type‐1b diamond to optically modulate a p‐ boron doped diamond channel. Using sub‐gap lasers with intensities as low as 100 W/cm 2 , electrons are optically excited from substitutional nitrogen sites to the conduction band of the diamond substrate, thus enabling the optical gate to exercise control on modulating the space‐charge region at the junction and therefore the channel conductivity. We show that the device can deliver a current of 7 μA/μm, or equivalently 1750 A/cm 2 , while switching at a frequency greater than 100 kHz, in a form factor of 5 μm 2 . The breakdown voltage is found to be greater than 1850 V, with a breakdown field strength of ~13 MV/cm. Moreover, the device supports nonvolatile operation with a “memory effect” enabling single transistor state retention. The presented simulation framework provides a physically grounded insight into the limits and opportunities of optoelectronic diamond systems.

Engineering - Electronic and electrical engineerin↗

Optimized Quantum Phase Estimation for Simulating Electronic States in Various Energy Regimes

While quantum algorithms for simulation exhibit better asymptotic scaling than their classical counterparts, they currently cannot be implemented on real-world devices. Instead, chemists and computer scientists rely on costly classical simulations of these quantum algorithms. In particular, the quantum phase estimation (QPE) algorithm is among several approaches that have attracted much attention in recent years for its genuine quantum character. However, it is memory-intensive to simulate and intractable for moderate system sizes. Herein, this paper discusses the performance and applicability of QPESIM, a new simulation of the QPE algorithm designed to take advantage of modest computational resources. In particular, we demonstrate the versatility of QPESIM in simulating various electronic states by examining the ground and core-level states of H 2 O. For these states, we also discuss the effect of the active-space size on the quality of the calculated energies. For the high-energy core-level states, we demonstrate that new QPE simulations for active spaces defined by 15 active orbitals significantly reduce the errors in core-level excitation energies compared to earlier QPE simulations using smaller active spaces.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Demonstration of MOOSE-based Griffin reactor physics, code for heterogeneous lead-cooled fast reactor analysis

The MOOSE-based reactor physics code Griffin was assessed on a heterogeneous pin-resolved model of a prototype lead-cooled fast reactor assembly. This model was developed in preparation for future use in MOOSE-based multiphysics calculations for computing hot channel factors. Heterogeneous multigroup cross sections were prepared using the fast reactor multi-group cross section processing code MC{sup 2}-3 using a two-step method. Griffin simulations were performed using the DFEM-SN solver on 576 cores on Argonne's LCRC cluster. Diffusion-based acceleration methods were applied (NDA and CMFD). Reference solutions were generated with continuous energy MCNP and the hybrid MOC/finite element solver PROTEUS-MOC for code-to-code comparison. Space-angle convergence studies were conducted to observe convergence in k-eigenvalue and axial pin power distributions. The fully resolved Griffin calculation was within 68 pcm of the MCNP eigenvalue and exhibited max 1.2% relative error in the axial pin power distribution. Griffin produced nearly identical results to PROTEUS-MOC when using the same 9-group multigroup cross-section set. Griffin demonstrated favorable scaling in wall-clock time and memory usage when using diffusion-based acceleration methods. Griffin is capable of simulating the pin-resolved heterogeneous LFR assembly with good accuracy and performance, and is suitable for future use in coupled high-fidelity hot channel factor simulations. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Using Parameter Sweep in WaterTAP to Analyze New Water Treatment Technologies

We describe a powerful and generalized parameter sweep tool in this report that was originally developed to analyze the performance of existing and novel water treatment models being developed in WaterTAP. Since WaterTAP is built upon IDAES and Pyomo, the parameter sweep tool can be used to systematically explore and debug the behavior of most Pyomo and IDAES numerical models. In order to enable meaningful analyses, the parameter sweep tool has been designed with the following features: 1) Model flexibility: The parameter sweep tool does not enforce any restrictions on the types of models that can be used with it. As long as a Pyomo model can be solved and the parameter is active and mutable, the tool only needs functions that describe how to run the model, the sweep parameters, and the output quantities of interest. 2) Flexible sampling: The parameter sweep tool has inbuilt functions to generate samples from a random distribution or a multidimensional Euclidean space. Furthermore, the users have to ability to supply samples generated from a tool of their choice. 3) Multiple sweep types: A user can choose from one of 3 types of parameter sweeps depending on their needs. 4) Detailed outputs: Outputs generated by the parameter sweep tool can be stored in detailed H5 file or user-friendly CSV files for post processing. 5) Parallel computing: The parameter sweep supports shared and distributed memory parallel computing to enable the use of high performance computers (HPC) for large-scale analyses. 6) Modular: The parameter sweep tool is self-contained and can easily be integrated within an outer-loop analysis or as desired by the user. 7) Ease of use: The tool is well documented and a simple sweep can be easily executed by following the online documentation in a few lines of code. We demonstrate the use of the parameter sweep tool on a simple water treatment system from the WaterTAP repository and show its parallel scaling performance on an Apple laptop and NREL's Eagle HPC. The parameter sweep tool is actively being used with models currently being developed within WaterTAP and we expect its use to grow beyond it to other IDAES and Pyomo models.

97 MATHEMATICS AND COMPUTING↗

Colossal Strain Tuning of Ferroelectric Transitions in KNbO 3 Thin Films

Strong coupling between polarization ( P ) and strain (ɛ) in ferroelectric complex oxides offers unique opportunities to dramatically tune their properties. Here colossal strain tuning of ferroelectricity in epitaxial KNbO 3 thin films grown by sub‐oxide molecular beam epitaxy is demonstrated. While bulk KNbO 3 exhibits three ferroelectric transitions and a Curie temperature ( T c ) of ≈676 K, phase‐field modeling predicts that a biaxial strain of as little as −0.6% pushes its T c > 975 K, its decomposition temperature in air, and for −1.4% strain, to T c > 1325 K, its melting point. Furthermore, a strain of −1.5% can stabilize a single phase throughout the entire temperature range of its stability. A combination of temperature‐dependent second harmonic generation measurements, synchrotron‐based X‐ray reciprocal space mapping, ferroelectric measurements, and transmission electron microscopy reveal a single tetragonal phase from 10 K to 975 K, an enhancement of ≈46% in the tetragonal phase remanent polarization ( P r ), and a ≈200% enhancement in its optical second harmonic generation coefficients over bulk values. These properties in a lead‐free system, but with properties comparable or superior to lead‐based systems, make it an attractive candidate for applications ranging from high‐temperature ferroelectric memory to cryogenic temperature quantum computing.

36 MATERIALS SCIENCE↗

DEDUPKV: A Space-Efficient and High-Performance Key-Value Store via Fine-Grained Deduplication

Log-Structured Merge Tree (LSM-tree) based key-value stores excel in write-intensive environments but suffer from data duplication, consuming up to 49% of storage space in LSM-tree-based key-value store deployments. Traditional solutions like compression and coarse-grained file system-level deduplication introduce overhead or have limited effectiveness. In this study, we propose DedupKV, a fine-grained deduplication framework tailored for LSM-tree, maximizing data reduction efficiency while minimizing write stalls and read overheads. DedupKV features three key innovations: (1) FLUSH-integrated inline deduplication, which removes duplicates during memory-to-storage writes; (2) WAL file-based offline deduplication, repurposing write-ahead logs to avoid double writes; and (3) elastic execution, dynamically balancing inline and offline deduplication based on memory pressure and workload intensity. Additionally, dynamic granularity management reduces deduplication metadata overhead. We implemented these four ideas in RocksDB for the first time and conducted experiments in a Linux environment. Our evaluation shows that WAL file-based offline deduplication and DedupKV outperform BlobDB by 33% and 23%, respectively, in write-heavy workloads, while reducing write amplification by 1.2 ×, 2 ×, and 1.6 × for real KV datasets.

Jamil, Safdar [Sogang University]↗

Cooling and Timing Tests of the ATLAS Fast TracKer VME Boards

The Fast TracKer (FTK) is an ATLAS trigger upgrade built for full-event, low-latency, high-rate tracking. The FTK core, made of 9U VME boards, performs the most demanding computational task. The associative memory board (AMB) serial link processor and the auxiliary card (AUX), plugged on the front and back sides of the same VME slot, constitute the processing unit (PU), which finds tracks using hits from eight layers of the inner detector. The PU works in pipeline with the second stage board (SSB), which finds 12-layer tracks by adding extra hits to the identified tracks. In the designed configuration, 16 PUs and four SSBs are installed in a VME crate. The high power consumption of the AMB, AUX, and SSB (respectively, of about 250, 70, and 160 W per board) required the development of a custom cooling system. Even though the expected power consumption for each VME crate of the FTK system is high compared with a common VME setup, the 8 FTK core crates will use ≈60 kW, which is just a fraction of the power and the space needed for a CPU farm performing the same task. We report on the integration of 32 PUs and eight SSBs inside the FTK system, on the infrastructures needed to run and cool them, and on the tests performed to verify the system processing rate and the temperature stability at a safe value.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Variational data augmentation for a learning-based granular predictive model of power outages

As the trend in climate change continues, extreme weather events are expected to occur with increasing frequency and severity and pose a significant threat to the electric power infrastructure. Regardless of the efforts a utility puts towards hardening the grid, storm-induced damage to the utility assets such as cables and distributed energy resources (DERs) that are particularly vulnerable to such events is unavoidable. Access to a highly granular, in space and time, outage forecasting tool with long lead times (i.e., days ahead) will enhance the efficiency of service restoration efforts. Here, in this study, we propose to develop and implement a multi-model framework as an operational tool based on a granular and multi-day outage forecasting model using operational numerical weather prediction model forecasts and detailed component outage information. An innovative two-layered recurrent neural network, i.e., a long-short-term-memory (LSTM)-based variational autoencoder (VAE) framework and a sliding window are used to address the uneven distribution of different types of weather events and make better use of the time-series data. Case studies are performed to demonstrate the performance of the new framework.

54 ENVIRONMENTAL SCIENCES↗