Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing”

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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Learning nonlinear operators in latent spaces for real-time predictions of complex dynamics in physical systems

Abstract Predicting complex dynamics in physical applications governed by partial differential equations in real-time is nearly impossible with traditional numerical simulations due to high computational cost. Neural operators offer a solution by approximating mappings between infinite-dimensional Banach spaces, yet their performance degrades with system size and complexity. We propose an approach for learning neural operators in latent spaces, facilitating real-time predictions for highly nonlinear and multiscale systems on high-dimensional domains. Our method utilizes the deep operator network architecture on a low-dimensional latent space to efficiently approximate underlying operators. Demonstrations on material fracture, fluid flow prediction, and climate modeling highlight superior prediction accuracy and computational efficiency compared to existing methods. Notably, our approach enables approximating large-scale atmospheric flows with millions of degrees, enhancing weather and climate forecasts. Here we show that the proposed approach enables real-time predictions that can facilitate decision-making for a wide range of applications in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Solving the Bernstein-Vazirani problem using Majorana-based topological quantum algorithms

Executing quantum algorithms using Majorana zero modes—a major milestone for the field of topological quantum computing—requires a platform that can be scaled to large quantum registers, can be controlled in real time and space, and a braiding protocol that uses the unique properties of these exotic particles. Here, we demonstrate the first successful simulation of a Majorana-based, fault-tolerant quantum algorithm to solve the Bernstein-Vazirani problem in two-dimensional magnet-superconductor hybrid structures from initialization to read-out of the final many-body state. Utilizing the Majorana zero modes’ topological properties, we introduce an optimized braiding protocol for the algorithm and a scalable architecture for its implementation with an arbitrary number of qubits. We visualize the algorithm protocol in real time and space by computing the non-equilibrium density of states, which is proportional to the time-dependent differential conductance, and the non-equilibrium charge density, which assigns a unique signature to each final state of the algorithm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Nonlinear Optimal Control of Electron Dynamics Within Hartree-Fock Theory

Consider the problem of determining the optimal applied electric field to drive a molecule from an initial state to a desired target state. For even moderately sized molecules, solving this problem directly using the exact equations of motion—the time-dependent Schrödinger equation (TDSE)—is numerically intractable. Here, we present a solution of this problem within time-dependent Hartree-Fock (TDHF) theory, a mean field approximation of the TDSE. Optimality is defined in terms of minimizing the total control effort while maximizing the overlap between desired and achieved target states. We frame this problem as an optimization problem constrained by the nonlinear TDHF equations; we solve it using trust region optimization with gradients computed via a custom-built adjoint state method. For three molecular systems, we show that with very small neural network parametrizations of the control, our method yields solutions that achieve desired targets within acceptable constraints and tolerances.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Impacts of Biomass Feedstock Pre-Processing on Heat and Mass Transfer During Pyrolysis Using X-Ray Computed Tomography and Multiscale Modeling

Knowledge of the transport properties of biomass particles such as porosity, tortuosity, and permeability is paramount for high-fidelity modeling of biomass pyrolysis due to the heat and mass transfer limitations imposed by particle microstructure. X-ray computed tomography (XCT) is a non-destructive imaging method that enables full 3D reconstructions of the biomass particle microstructure with high resolution, permitting direct calculation of porosity, tortuosity, and permeability from real particle geometries. In this study, XCT imaging revealed the 3D microstructures of particles and chars from pyrolytic conversion of cylindrically cut or milled/pelletized loblolly pine samples. The porosity, tortuosity, and permeability were calculated directly from the XCT geometries via open-source microstructural analysis tool MATBOX+TauFactor (https://github.com/NREL/MATBOX_Microstructure_analysis_toolbox) and computational fluid dynamics (CFD) simulations using our solver, Mesoflow (https://github.com/NREL/mesoflow). These properties were used in a reactor scale model developed in COMSOL of the single particle reactor at NREL to investigate the impact of feedstock pre-processing on biomass conversion during pyrolysis with rigorous experimental validation.

biomass↗
DOE OSTI2024

Celestial soft currents at one-loop and their OPEs

Conformally soft operators and their associated soft theorems on the celestial sphere encode the low energy behaviour of bulk scattering amplitudes. They lead to an infinite dimensional symmetry algebra of the celestial CFT at tree-level. In this paper, focusing our attention to Yang-Mills theory, we introduce new operators in the boundary celestial CFT in order to extend the definition of conformally soft currents to include one-loop effects. We then compute their OPEs with other operators in the theory. We also examine new subtleties that arise in defining OPEs of two conformally soft operators. We elucidate the connection between the new operators and loop corrected soft theorems in the bulk. Finally, we conclude by demonstrating how these operators fit into the framework of a logarithmic CFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

From Design to Device: Challenges and Opportunities in Computational Discovery of p -Type Transparent Conductors

A high-performance p -type transparent conductor (TC) does not yet exist but could lead to advances in a wide range of optoelectronic applications and enable new architectures for, e.g., next-generation photovoltaic (PV) devices. High-throughput computational material screenings have been a promising approach to filter databases and identify new p -type TC candidates and some of these predictions have been experimentally validated. However, most of these predicted candidates do not have experimentally achieved properties on par with n -type TCs used in solar cells and therefore have not yet been used in commercial devices. Thus, there is still a significant divide between transforming predictions into results that are actually achievable in the laboratory and an even greater lag in scaling predicted materials into functional devices. In this perspective, we outline some of the major disconnects in this materials discovery process—from scaling computational predictions into synthesizable crystals and thin films in the laboratory to scaling laboratory-grown films into real-world solar devices—and share insights to inform future strategies for TC discovery and design. Published by the American Physical Society 2024

14 SOLAR ENERGY↗
DOE OSTI2024

Spike-and-Slab Shrinkage Priors for Structurally Sparse Bayesian Neural Networks

Network complexity and computational efficiency have become increasingly significant aspects of deep learning. Sparse deep learning addresses these challenges by recovering a sparse representation of the underlying target function by reducing heavily overparameterized deep neural networks. Specifically, deep neural architectures compressed via structured sparsity (e.g., node sparsity) provide low-latency inference, higher data throughput, and reduced energy consumption. In this article, we explore two well-established shrinkage techniques, Lasso and Horseshoe, for model compression in Bayesian neural networks (BNNs). To this end, we propose structurally sparse BNNs, which systematically prune excessive nodes with the following: 1) spike-and-slab group Lasso (SS-GL) and 2) SS group Horseshoe (SS-GHS) priors, and develop computationally tractable variational inference, including continuous relaxation of Bernoulli variables. We establish the contraction rates of the variational posterior of our proposed models as a function of the network topology, layerwise node cardinalities, and bounds on the network weights. Furthermore, we empirically demonstrate the competitive performance of our models compared with the baseline models in prediction accuracy, model compression, and inference latency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Educational Consortium for Energy-related Data Science & Computation in Building Engineering Programs

The project spearheaded by Pennsylvania State University aims to address the growing need for integrating energy-focused computation and data science into building engineering education. As the demand for energy-efficient building designs and operations increases, the educational sector must adapt to equip future engineers with the necessary skills. This initiative responds to this need by developing a consortium that unites multiple institutions to enhance curriculum development, dataset curation, and resource sharing, thereby ensuring students are well-prepared for the evolving energy sector. The primary goal of the project is to establish a consortium that will develop and disseminate educational materials and training programs focused on energy-related data science and computation. Key accomplishments include the creation of a beta website for resource sharing, the development of training programs and standalone modules, and the curation of datasets accessible to the public. This effort will culminate in a curriculum that incorporates advanced modeling technologies and data science skills into building engineering programs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

TRUST Sensors in Environments: Thermocouples (SE-TC) Report Release FY24

The objective of the Delivery Environments (DE) Testbeds to Reduce Uncertainty in Simulations and Tests (TRUST) project is to quantify and help increase confidence in specific areas of computational and experimental capabilities that are applicable to the development, on-target assessment, and qualification of current and future delivery environments. More complete quantification of confidence in experimental and computational capabilities and the sufficient increase of confidence in those capabilities is critical to improving weapons engineering design, qualification, and assessment efforts that are critical to the current and future stockpile. This work uses and provides feedback on analysis tools and experimental results databases for efficient and responsive engineering which are currently under development.

42 ENGINEERING↗
DOE OSTI2025

Shape Anisotropy-Dependent Leaking in Magnetic Neurons for Bio-Mimetic Neuromorphic Computing

Spiking neural networks seek to emulate biological computation through interconnected artificial neuron and synapse devices. Spintronic neurons can leverage magnetization physics to mimic biological neuron functions, such as integration tied to magnetic domain wall (DW) propagation in a patterned nanotrack and firing tied to the resistance change of a magnetic tunnel junction (MTJ), captured in the domain wall-magnetic tunnel junction (DW-MTJ) device. Leaking, relaxation of a neuron when it is not under stimulation, is also predicted to be implemented based on DW drift as a DW relaxes to a low energy position, but it has not been well explored or demonstrated in device prototypes. Here, in this work, we study DW-MTJ artificial neurons capable of leaky integrate-and-fire (LIF) behavior and demonstrate geometry-dependent leaking dynamics that results in repeatable, tunable LIF operation. Studying the behavior of five different device designs, we show tuning the geometry, stimulating fields and currents, and location of electrical contacts results in a wide range of neuron behavior. Additionally, implementation of an asymmetric notch allows for nonlinear pinning which increased expressivity without sacrificing leaking. The measured behavior is implemented in a simulated spiking neural network that outperforms a 1D model of continuous DW motion and approaches the performance of an ideal LIF activation function. The results show that the analog LIF capability of DW-MTJ neurons combines many desirable neuron functions into a single device, which can result in varied forms of multifunctional neuromorphic computing.

42 ENGINEERING↗
DOE OSTI2025

Resilient information and inference networks under mixed-trust sensing

With ubiquitous digitization, sensing, and computational intelligence deployed in increasingly more and broader domains, including critical infrastructure, potentially misleading and destabilizing effects of multimodal anomalies and adversarial behavior are growing in importance. Here, we develop randomized and reinforcement learning-based strategies for strategically recruiting and utilizing deployed (and, thus, vulnerable and potentially faulty and/or compromised) nodes from information and inference networks, while defending against adversaries that attempt to misguide assessments of inferred variables. Recognizing that, besides communication and other costs, sampling from any observable node can either provide true data or dangerously expose our inference to misinformation (without being easily distinguishable what actually happens), the proposed strategies proceed by progressively recruiting nodes and cautiously scaling their information contribution based on assumed, or, in our reinforcement learning approach, intelligently weighed trustworthiness, with the learning approach also considering network-wide, threat-inclusive risk/value tradeoffs. While avoiding the hardware, communication, analytical and computational burden of explicit redundancy, the proposed defensive schemes enable on-the-fly assessments of underlying processes, and system-wide situational awareness with demonstrable resilience against adversarial activities.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Fundamental Algorithmic Research for Quantum Computing (FAR‐QC) (Final report)

This document is the final technical report for the "Fundamental Algorithmic Research for Quantum Computing" (FAR-QC) project at Dartmouth College (PI: J. Whitfield, co-PI: L. Viola). It details the project's primary scientific accomplishments from 2019 to 2025, focusing on advances in quantum simulation algorithms, resource-efficient fermionic encodings, bosonic topology, and optimization methods for near-term quantum devices. The report also summarizes project impacts, including software development (Quiqbox.jl), workforce training, and a complete list of resulting publications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

ExaCA v2.0: A versatile, scalable, and performance portable cellular automata application for additive manufacturing solidification

The previously established ExaCA software for performance portable alloy grain structure simulation has been updated to better represent the solidification behavior during complex alloy processing conditions, such as those encountered during metal additive manufacturing (AM), and for improved performance and scalability. Here, an extension to the time–temperature history input data format and the core ExaCA algorithm to include an arbitrary number of melting and solidification events yielded improved prediction of texture for various melt pool geometries, expanding the range of AM-relevant conditions that can be accurately simulated. Improved heat transport process simulation coupling, including the creation of large raster datasets from single track time–temperature history data and in-memory coupling with the new, performance portable finite difference code Finch, were also demonstrated in example studies on the effect of multilayer AM microstructure predictions on hatch spacing and cell size, respectively. Additional new features are detailed and demonstrated, including the ability to perform simulations using various interfacial response function forms, execute simulations on state-of-the-art hardware, improved usability through post-processing versatility, and improved strong and weak scaling performance. The performance, physics, and versatility improvements demonstrated here will further enable large-scale studies on AM process–microstructure relationships that were not previously possible. Furthermore, the usability improvements and ability to run coupled AM process–microstructure simulations using the Finch-ExaCA workflow will facilitate broader use of this open-source software by the computational materials community.

36 MATERIALS SCIENCE↗
DOE OSTI2026

A stress-based fracture model for reacting metal ejecta

The evolution of reacting metal ejecta continues to be a topic of interest at the forefront of metals in reactive and extreme environments. Ejecta are small particles formed when the surface of a metal undergoes Richtmyer–Meshkov instability from a strong shock. Experiments have shown that in the case where ejecta are in ambient conditions that induce a reaction, the ejecta behave irregularly. The ejecta temperature rises and then plateaus, and the acceleration profile shows unexpected jumps. These variations are assumed to be related to the exothermic heat release and particle mass loss caused by the reaction. To explain this phenomenon, efforts to model this in simulations have increased. While current models can capture many of these physical processes, they currently assign a constant reaction shell thickness with little physical reasoning. This work remedies this problem by assigning a dynamic physically informed shell thickness to the reacting particles, using solid analysis. The shell thickness of the particles impacts the rate of change of reacted mass in the system, as well as the rate at which the particles react. The model is based on a simple stress–strain relationship and gives a dynamic assignment for when the reacting particle should begin to fracture. We compare our model to the previous computational and simulation data to analyze the effects of different model parameters.

42 ENGINEERING↗
DOE OSTI2024

Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation

We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis. To compile logical circuits into lattice surgery operations, we build upon the open-source Lattice Surgery Compiler. The revised compiler operates in two stages: the first translates logical gates into an abstract, layout-independent instruction set; the second compiles these into local lattice surgery instructions that are allocated to hardware tiles according to a specified resource layout. The second stage retains logical parallelism while avoiding resource contention in the fault-tolerant layer, aiding realism. Additionally, users can specify dedicated tiles at which magic states are replenished, enabling resource costs from the logical computation to be considered independently from magic state distillation and storage. We demonstrate the applicability of our pipeline to large practical quantum circuits by providing resource estimates for the ground state estimation of molecules. Finally, we find that variable magic state consumption rates in real circuits can cause the resource costs of magic state storage to dominate unless production is varied to suit.

97 MATHEMATICS AND COMPUTING↗