Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensor”

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

Shear strain alters the structure and migration mechanism of self-interstitial atoms in copper

Here, we use atomistic modeling to show that externally applied shear strain causes the lowest energy self-interstitial atom (SIA) structure in copper (Cu) to change from a <100>-type dumbbell to a <110>-type dumbbell. Concurrently, SIA migration switches from the 3-D random walk characteristic of <100>-type dumbbells to a 1-D mechanism analogous to that of crowdion SIAs. Furthermore, the relative energies of these two dumbbell structures as a function of strain are well predicted using elastic dipole tensors computed at zero strain, indicating that examination of these tensors may be used to assess the likelihood of strain-induced SIA structure transitions in other materials. Changes in lowest energy SIA structures and associated migration mechanisms stand to impact predictions of SIA behavior in irradiated solids.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Geometrically necessary dislocation fingerprints of dislocation loop absorption at grain boundaries

Here we present a numerical methodology to compute the Nye-tensor fingerprints of dislocation loop absorption at grain boundaries (GBs) for comparison with TEM observations of irradiated polycrystals. Our approach links atomistic simulations of self-interstitial atom (SIA) prismatic loops gliding toward and interacting with GBs in body-centered cubic iron with experimentally extracted geometrically necessary dislocation (GND) maps to facilitate the interpretation of damage processes. The Nye-tensor analysis is strongly mesh-size dependent—corresponding to resolution-dependent TEM observations. The method computes GND fingerprints from discretized dislocation line segments extracted from molecular dynamics simulations of dislocation loops being absorbed at a GB. Specifically, we perform MD simulation of prismatic loops of two diameters and monitor the three stages of the absorption process: loop glide, the partial, and full absorption of the loops at a [1 0 0] symmetric tilt GB. These methods provide a framework for future investigations of the nature of defect absorption by grain boundaries under irradiation conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Physics-constrained superresolution diffusion for six-dimensional phase space diagnostics

Adaptive physics-constrained superresolution diffusion is developed for noninvasive virtual diagnostics of the six-dimensional (6D) phase space density of charged particle beams. An adaptive variational autoencoder embeds initial beam condition images and scalar measurements to a low-dimensional latent space from which a 32 6 pixel 6D tensor representation of the beam's 6D phase space density is generated. Projecting from a 6D tensor generates physically consistent two-dimensional projections. Physics-guided superresolution diffusion transforms low-resolution images of the 6D density to high resolution 256 × 256 pixel images. Unsupervised adaptive latent space tuning enables tracking of time-varying beams without knowledge of time-varying initial conditions. The method is demonstrated with experimental data and multiparticle simulations at the HiRES UED. The general approach is applicable to a wide range of complex dynamic systems evolving in high-dimensional phase space. The method is shown to be robust to distribution shift without retraining. Published by the American Physical Society 2025

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Quantum magic and computational complexity in the neutrino sector

We consider the quantum magic in systems of dense neutrinos undergoing coherent flavor transformations, relevant for supernova and neutron-star binary mergers. Mapping the three-flavor-neutrino system to qutrits, the evolution of quantum magic is explored in the single scattering angle limit for a selection of initial tensor-product pure states for 𝑁 𝜈 ≤ 8 neutrinos. For |𝜈𝑒⟩ ⊗𝑁𝜈 initial states, the magic, as measured by the 𝛼 = 2 stabilizer Renyi entropy ℳ 2 , is found to decrease with radial distance from the neutrino sphere, reaching a value that lies below the maximum for tensor-product qutrit states. Further, the asymptotic magic per neutrino, ℳ 2 /𝑁 𝜈 , decreases with increasing 𝑁 𝜈 . In contrast, the magic evolving from states containing all three flavors reaches values only possible with entanglement, with the asymptotic ℳ 2 /𝑁 𝜈 increasing with 𝑁 𝜈 . These results highlight the connection between the complexity in simulating quantum physical systems and the parameters of the Standard Model.

computational complexity↗
DOE OSTI2025

Kinetic study of strong shock waves in fully ionized plasmas

Fully kinetic simulations are used in this work to study strong shock waves in fully ionized plasmas for charge state 𝑍 ranging from 1 to 18. The ion stress tensor amplitude agrees well with classical predictions within the compression layer; however, its spatial structure is noticeably shaped by nonlocal transport effects. The electron stress tensor remains significantly smaller than that of the ions for all values of 𝑍 considered. Ion overheating in the compression layer is observed to scale approximately linearly with 𝑍. Both findings diverge from hydrodynamic models based on classical electron stress formulations. In conclusion, the electrons exhibit strong nonlocal behavior in the compression layer, with Knudsen numbers approaching unity for 𝑍 ≥ 6.

Physics - Plasma physics↗
DOE OSTI2025

Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics

We study real-time operator evolution using sparse Pauli dynamics, a recently developed method for simulating expectation values of quantum circuits. On the examples of energy and charge diffusion in one-dimensional (1D) spin chains and sudden quench dynamics in the 2D transverse-field Ising model, it is shown that this approach can compete with state-of-the-art tensor network methods. We further demonstrate the flexibility of the approach by studying quench dynamics in the 3D transverse-field Ising model that is highly challenging for tensor network methods. For the simulation of expectation value dynamics starting in a computational basis state, we introduce an extension of sparse Pauli dynamics that truncates the growing sum of Pauli operators by discarding terms with a large number of X and Y matrices. This is validated by our 2D and 3D simulations. Finally, we argue that sparse Pauli dynamics is not only capable of converging challenging observables to high accuracy, but can also serve as a reliable approximate approach even when given only limited computational resources. Published by the American Physical Society 2025

Begušić, Tomislav (ORCID:0000000279424134)↗
DOE OSTI2025

Simulating large one-dimensional neutral-atom quantum systems

While abstract models of quantum computation assume a closed system of two-level states, practical quantum devices inevitably couple to the environment in some way, creating sources of noise. Understanding the tolerance to noise of specific quantum algorithms run on specific devices is important for determining the feasibility of quantum computing in the current noisy intermediate-scale quantum era. Of particular interest is understanding the noise sensitivity of these devices as more qubits are added to the system. Classical simulations are a useful tool to understand the effects of this noise, but direct classical simulations of open quantum systems are burdened by an exponentially growing cost in the number of qubits and a large local Hilbert space dimension. For onedimensional, shallow circuits, using tensor networks can replace this exponential cost with a linear one and simulate far wider systems than what would normally be available. In this paper, we describe a tensor network simulation of a neutral atom quantum system under the presence of noise, while introducing a purity-preserving truncation technique that compromises between the simplicity of the matrix product state and the positivity of the matrix product density operator. We apply this simulation to a near-optimized iteration of the quantum approximate optimization algorithm on a transverse field Ising model in order to investigate the influence of large system sizes on the performance of the algorithm. We find that while circuits with a large number of qubits fail more often under noise that depletes the qubit population, their outputs on a successful measurement are just as robust under Rydberg atom dissipation or qubit dephasing as smaller systems. However, such circuits might not perform as well under coherent multiqubit errors such as Rydberg atom crosstalk. We also find that the optimized parameters are especially robust to noise, suggesting that a noisier quantum system can be used to find the optimal parameters before switching to a cleaner system for measurements of observables.

Allen, James↗
DOE OSTI2022

Refinements for Bragg coherent X-ray diffraction imaging: electron backscatter diffraction alignment and strain field computation

Bragg coherent X-ray diffraction imaging (BCDI) allows the 3D measurement of lattice strain along the scattering vector for specific microcrystals. If at least three linearly independent reflections are measured, the 3D variation of the full lattice strain tensor within the microcrystal can be recovered. However, this requires knowledge of the crystal orientation, which is typically attained via estimates based on crystal geometry or synchrotron microbeam Laue diffraction measurements. Presented here is an alternative method to determine the crystal orientation for BCDI measurements using electron backscatter diffraction (EBSD) to align Fe–Ni and Co–Fe alloy microcrystals on three different substrates. The orientation matrix is calculated from EBSD Euler angles and compared with the orientation determined using microbeam Laue diffraction. The average angular mismatch between the orientation matrices is less than ∼6°, which is reasonable for the search for Bragg reflections. The use of an orientation matrix derived from EBSD is demonstrated to align and measure five reflections for a single Fe–Ni microcrystal via multi-reflection BCDI. Using this data set, a refined strain field computation based on the gradient of the complex exponential of the phase is developed. This approach is shown to increase accuracy, especially in the presence of dislocations. The results demonstrate the feasibility of using EBSD to pre-align BCDI samples and the application of more efficient approaches to determine the full lattice strain tensor with greater accuracy.

42 ENGINEERING↗
DOE OSTI2023

Residual strain orientation in rolled titanium determined with synchrotron X-ray Laue microdiffraction

Previously, synchrotron X-ray Laue microdiffraction has been used to measure the magnitudes of residual strain in materials. Recently the method was advanced to determine the orientation of the strain ellipsoid and applied to naturally deformed quartzites; however, the deformation history of these quartzites is ambiguous due to their natural origin. Here, in this study, synchrotron X-ray Laue microdiffraction (µXRD) is used to measure the residual strain for the first time in a sample with known stress history, rolled titanium. A deviatoric strain tensor is calculated from each Laue diffraction image collected with two µXRD scans of a rolled titanium sheet in different sample orientations. The principal strain axes are calculated using an eigen decomposition of the deviatoric strain tensors. The results show that the principal axis of compression is aligned with the normal direction of the titanium sheet, and the principal axis of extension is aligned with the rolling direction. Pole figures are used to represent the 3D distribution of residual strain axes.

36 MATERIALS SCIENCE↗
DOE OSTI2023

A General Spatiotemporal Imputation Framework for Missing Sensor Data

Many applications from precision agriculture, environmental monitoring and transportation networks rely on data collected across space and time over a large geographic area. Missing data poses a significant challenge for any data-driven inference and control tasks. Data imputation or the estimation of missing data can help fill these gaps by utilizing inherent spatial relationships and temporal patterns. A variety of spatiotemporal imputation models have been developed to address missing data in spatiotemporal datasets. However, these classical methods rely on the assumption that the underlying data follows a smooth trend and fail to provide accurate estimates when there is a large number of missing points in the data. Even though there are machine learning driven tensor completion approaches such as convolutional neural network based tensor completion (CoSTCo) that capture the non-linear relationships in the dataset, the transductive nature makes the algorithm less scalable. Thus, existing approaches for estimating the missing information do not effectively capture all dimensions of the spatiotemporal data structure, resulting in erroneous predictions and poor performance. The main contributions of this paper are: (1) We propose a novel inductive framework (G-LSTM) for missing data imputation that integrates a graph neural network with LSTMs to effectively capture both spatial and temporal dependencies. (2) Experimental results on a traffic dataset demonstrate that the proposed GNN integrated with an LSTM framework achieves improved imputation and maintains steady performance even when there are extreme missing conditions in comparison with the state-of-the-art imputation framework (i.e, CoSTCo). (3) The simulation results on a traffic network show up to 69% reduction in mean absolute error and 61% reduction in root mean square error when compared to CoSTCo.

Tharzeen, Aabila↗
DOE OSTI2024

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗
DOE OSTI2022

Towards Precision-Aware Fault Tolerance Approaches for Mixed-Precision Applications

Graphics Processing Units (GPUs), the dominantly adopted accelerators in HPC systems, are susceptible to transient hardware fault. New generation of GPUs feature mixed-precision architectures such as NVIDIA Tensor Cores to accelerate matrix multiplications. While being widely adapted, how would they behave under transient hardware faults remain unclear. In this study, we conduct a large-scale fault injection experiments on GEMM kernels implemented with different floating-point data types on the V100 and A100 Tensor Cores, and show distinct error resilience characteristics for the GEMMS with different formats. In the future, we plan to explore this space by building precision-aware floating-point fault tolerance techniques for applications such as DNNs that exercise low-precision computations.

Fang, Bo↗
DOE OSTI2026

Interpretable Models for Workflow Differentiation in High-Performance Scientific Networks

Scientific workflows in high-performance networks spawn hundreds of interdependent flows that must be managed collectively—yet existing network classifiers treat each flow in isolation, leading to fragmented QoS decisions and missed interflow patterns. We present a novel traffic classification solution that operates at the workflow level, distinguishing entire filetransfer operations from streaming analytics by capturing how concurrent flows interact and burst together. We introduce a workflow identification window (WIW) that ingests raw packet headers from parallel flows into unified tensors, preserving the spatial-temporal patterns that differentiate scientific workflows. This approach achieves 98.7% accuracy using CNN, LSTM, and hybrid architectures, while maintaining 84% accuracy on production traffic collected a week later—demonstrating robustness to temporal drift. By integrating SHAP and GradCAM explainability, we reveal that early-packet timing patterns and cross-flow correlations drive classification decisions, providing operators with interpretable insights. Our system enables coherent workflow-level QoS enforcement and dynamic bandwidth allocation in scientific networks, eliminating manual per-flow configuration while maintaining classification latency at millisecond level.

Giannakou, Anna [LBL, Berkeley]↗
DOE OSTI2021

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗
DOE OSTI2024

Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance

A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schrödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function–operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.

Science & Technology - Other Topics↗
DOE OSTI2020

The nature and origins of decametre-scale porosity in Ordovician carbonate rocks, Halahatang oilfield, Tarim Basin, China

At >7 km depths in the Tarim Basin, hydrocarbon reservoirs in Ordovician rocks of the Yijianfang Formation contain large cavities ( c . 10 m or more), vugs, fractures and porous fault rocks. Although some Yijianfang Formation outcrops contain shallow (formed near surface) palaeokarst features, cores from the Halahatang oilfield lack penetrative palaeokarst evidence. Outcrop palaeokarst cavities and opening-mode fractures are mostly mineral filled but some show evidence of secondary dissolution and fault rocks are locally highly ( c . 30%) porous. Cores contain textural evidence of repeated formation of dissolution cavities and subsequent filling by cement. Calcite isotopic analyses indicate depths between c . 220 and 2000 m. Correlation of core and image logs shows abundant cement-filled vugs associated with decametre-scale fractured zones with open cavities that host hydrocarbons. A Sm–Nd isochron age of 400 ± 37 Ma for fracture-filling fluorite indicates that cavities in core formed and were partially cemented prior to the Carboniferous, predating Permian oil emplacement. Repeated creation and filling of vugs, timing constraints and the association of vugs with large cavities suggest dissolution related to fractures and faults. In the current high-strain-rate regime, corroborated by velocity gradient tensor analysis of global positioning system (GPS) data, rapid horizontal extension could promote connection of porous and/or solution-enlarged fault rock, fractures and cavities. Supplementary material: Stable isotopic analyses and the velocity gradient tensor and principal direction and magnitude calculation are available at https://doi.org/10.6084/m9.figshare.c.4946046 Thematic collection: This article is part of the The Geology of Fractured Reservoirs collection available at: https://www.lyellcollection.org/cc/the-geology-of-fractured-reservoirs

Geology↗
DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Bringing Trimmed Serendipity Methods to Computational Practice in Firedrake

We present an implementation of the trimmed serendipity finite element family, using the open-source finite element package Firedrake. The new elements can be used seamlessly within the software suite for problems requiring H 1 , H (curl), or H (div)-conforming elements on meshes of squares or cubes. To test how well trimmed serendipity elements perform in comparison to traditional tensor product elements, we perform a sequence of numerical experiments including the primal Poisson, mixed Poisson, and Maxwell cavity eigenvalue problems. Overall, we find that the trimmed serendipity elements converge, as expected, at the same rate as the respective tensor product elements, while being able to offer significant savings in the time or memory required to solve certain problems.

97 MATHEMATICS AND COMPUTING↗