Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “scalable representations”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗
DOE OSTI2022

graphenv: a Python library for reinforcement learning on graph search spaces

Many important and challenging problems in combinatorial optimization (CO) can be expressed as graph search problems, in which graph vertices represent full or partial solutions and edges represent decisions that connect them. Graph structure not only introduces strong relational inductive biases for learning (Battaglia et al., 2018) - in this context, by providing a way to explicitly model the value of transitioning (along edges) between one search state (vertex) and the next - but lends itself to problems both with and without clearly defined algebraic structure. For example, classic CO problems on graphs such as the Traveling Salesman Problem (TSP) can be expressed as either pure graph search or integer programs. Other problems, however, such as molecular optimization, do no have concise algebraic formulations and yet are readily implemented as a graph search (V. et al., 2022; Zhou et al., 2019). Such "model-free" problems constitute a large fraction of modern reinforcement learning (RL) research owing to the fact that it is often much easier to write a forward simulation that expresses all of the state transitions and rewards, than to write down the precise mathematical expression of the full optimization problem. In the case of molecular optimization, for example, one can use domain knowledge alongside existing software libraries to model the effect of adding a single bond or atom to an existing but incomplete molecule, and let the RL algorithm build a model of how good a given decision is by "experiencing" the simulated environment many times through. In contrast, a model-based mathematical formulation that fully expresses all the chemical and physical constraints is intractable. In recent years, RL has emerged as an effective paradigm for optimizing searches over graphs and led to state-of-the-art heuristics for games like Go and chess, as well as for classical CO problems such as the TSP. This combination of graph search and RL, while powerful, requires non-trivial software to execute, especially when combining advanced state representations such as Graph Neural Networks (GNN) with scalable RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

On the Stochastic Stability of Deep Markov Models

Deep Markov models (DMM) are generative models which are scalable and expressive generalization of Markov models for representation, learning, and inference problems. DMMs using deep neural networks to parametrize the transition of Markov probability distributions have recently been shown to provide more expressiveness in modeling sequential data and dynamical system responses. However, the fundamental stochastic stability guarantees of such models have not been thoroughly investigated. In this paper, we present a rigorous analytical method to prove the necessary and sufficient conditions of DMM's stochastic stability. This task is achieved by spectral analysis of the efficiently computed Jacobians of probabilistic maps modeled by deep neural networks. We make theoretical connections between the eigenvalues of neural network's weights and the different activation function types used on the stability and overall dynamic behavior of DMMs with Gaussian distributions. We empirically substantiate our theoretical results on stochastic stability and eigenvalue spectra via several numerical experiments. Formal stability guarantees of DMMs can substantially improve their robustness and trustworthiness, necessary for reliable use in safety-critical real-world applications.

Drgona, Jan↗
DOE OSTI2021

On the Stochastic Stability of Deep Markov Models

Deep Markov models (DMM) are generative models which are scalable and expressive generalization of Markov models for representation, learning, and inference problems. However, the fundamental stochastic stability guarantees of such models have not been thoroughly investigated. In this paper, we present a novel stability analysis method and provide sufficient conditions of DMM's stochastic stability. The proposed stability analysis is based on the contraction of probabilistic maps modeled by deep neural networks. We make connections between the spectral properties of neural network's weights and different types of used activation function on the stability and overall dynamic behavior of DMMs with Gaussian distributions. Based on the theory, we propose a few practical methods for designing constrained DMMs with guaranteed stability. We empirically substantiate our theoretical results via intuitive numerical experiments using the proposed stability constraints.

Drgona, Jan↗
DOE OSTI2026

GPU-Accelerated Analytic Simulation of Sparse Ionization Signal Formation in Pixelated Projection Detector

This paper presents a GPU-accelerated simulation package, TRED, for next-generation neutrino detectors with pixelated charge readout, leveraging community-driven software ecosystems to ensure adaptability and extensibility. We introduce two generic contributions: (i) an effective-charge representation based on Gaussian quadrature rules, in which the linear- interpolation factors for the field response inside each voxel are absorbed into the effective charge, and (ii) a sparse, block- binned tensor representation that enables efficient FFT-based computation of induced signals on readout electrodes for sparsely activated detector volumes. The former captures structure inside a voxel without dense sampling, while the latter achieves low memory usage and scalable runtime, as demonstrated in bench- mark studies. The underlying data representation is applicable to large-scale detectors and to other computational problems involving sparse activity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Development of an integrated platform for hardware-in-the-loop evaluation of microgrids prior to site commissioning

This paper presents an integrated hardware-in-the-loop (HIL) platform for testing the operation and control of a real-world microgrid system prior to site commissioning. The proposed testing approach shows the value of setting up an integrated HIL platform to test multiple hardware devices (including the system-level controller, device controllers, and field devices). A test bed developed for the Borrego Springs community microgrid is used as an example to demonstrate the feasibility of the integrated platform. Comprehensive tests are carried out using the Borrego Springs test bed to validate the platform, meet the test objectives, and gain valuable insight prior to site commissioning. The selected test scenarios, initial conditions, events, test metrics, etc., are similar to those defined in IEEE P2030.8. The test objectives are to evaluate the microgrid controller and the operation of the microgrid. The HIL platform presented in this paper shows good value for microgrid testing in terms of its flexibility and scalability for testing various microgrids; its accuracy in its representation of the field; the comprehensiveness of the testing capability; and the efficiency of testing, which can reduce risks prior to field deployment.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Scalable Implementation of Mean-Field and Correlation Methods Based on Lie-Algebraic Similarity Transformation of Spin Hamiltonians in the Jordan–Wigner Representation

Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to Fermions via the Jordan−Wigner transformation (JW). The Hartree−Fock method is straightforward in the Fermionic domain and may provide a reasonable approximation to the ground state. Correlation with respect to the Fermionic mean field can be recovered based on Lie-algebraic similarity transformation (LAST) with two-body correlators. Specifically, a unitary LAST variant eliminates the dependence on site ordering, while a nonunitary LAST yields size-extensive correlation energies. Whereas the first recent demonstration of such methods was restricted to small spin systems, we present efficient implementations using analytical gradients for the optimization with respect to the mean-field reference and the LAST parameters, thereby enabling the treatment of larger clusters, including systems with local spins s > $\frac{1}{2}$.

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

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗
DOE OSTI2026

A scalable framework for efficient coupling of thermal and microstructural simulations in additive manufacturing

Predicting microstructure evolution in metal additive manufacturing (AM) is important for process optimization, but spatiotemporal scale disparities between thermal transport and microstructure evolution create significant challenges for efficient data transfer between simulation codes. To address this, we present Stork, a scalable framework for coupling thermal and microstructural simulations. Stork uses a sparse data representation to identify and store active solidification sub-volumes, enabling highly parallel quad-linear interpolation from coarse thermal grids to fine microstructure grids without large intermediate storage. We demonstrate the framework by coupling the semi-analytic heat transfer code 3DThesis with the time-parallel cellular automata code Toucan. This approach achieves over two orders of magnitude reduction in data generation time and file size compared to prior workflows. Numerical studies show that quad-linear interpolation preserves grain morphology and crystallographic texture in laser powder bed fusion (LPBF) simulations for coarsening ratios up to 16. Overall, Stork provides a scalable pathway for high-throughput, component-scale AM simulations on modern high-performance computing systems.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Phoenix: A Scalable Streaming Hypergraph Analysis Framework

We present Phoenix, a scalable hypergraph analytics framework for data analytics and knowledge discovery that was implemented on the leadership class computing platforms at Oak Ridge National Laboratory (ORNL). Our software framework comprises a distributed implementation of a streaming server architecture which acts as a gateway for various hypergraph generators/external sources to connect. Phoenix has the capability to utilize diverse hypergraph generators, including HyGen, a very large-scale hypergraph generator developed by ORNL. Phoenix incorporates specific algorithms for efficient data representation by exploiting hidden structures of the hypergraphs. Our experimental results demonstrate Phoenix’s scalable and stable performance on massively parallel computing platforms. Phoenix’s superior performance is due to the merging of high-performance computing with data analytic.

Kurte, Kuldeep↗
DOE OSTI2023

A Level Set Model for Structured Mesh Representation of Fibrous Preforms used in Composites Manufacturing

Here, a model for implicit representation of fibrous and woven preforms used for composites manufacturing is described. The method is based on a level set function defined on a structured mesh to implicitly capture the complex fiber and weave geometries. Since most software packages used to model woven preforms are based on unstructured mesh, a numerical model for transforming a discretized surface to a structured mesh representation and vice-a-versa is presented. Specific emphasis is on scalable computation of a level set function for large and complex 3D woven structures from a triangulated surface of the smallest unit (yarn). The model is applied to capture a periodic 3D layered 5-harness satin (5HS) weave geometry on a structured mesh. Geometric transformations needed to efficiently compute the level set function for the 3D structure on a high resolution mesh are described. Effects of mesh resolution on the geometric features such as number of resolved fibers, effective fiber size, and the surface area to volume ratio of the iso-surface are analyzed. Using the distance property of the level set function, an approach to evaluate the structure function resulting from transient evolving topology representing densification due to matrix phase depositions is also presented. The approach captures transition of the geometric characteristic from fiber governed at early stages of densification to yarn governed at the terminal stage.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Learning local equivariant representations for large-scale atomistic dynamics

Abstract A simultaneously accurate and computationally efficient parametrization of the potential energy surface of molecules and materials is a long-standing goal in the natural sciences. While atom-centered message passing neural networks (MPNNs) have shown remarkable accuracy, their information propagation has limited the accessible length-scales. Local methods, conversely, scale to large simulations but have suffered from inferior accuracy. This work introduces Allegro, a strictly local equivariant deep neural network interatomic potential architecture that simultaneously exhibits excellent accuracy and scalability. Allegro represents a many-body potential using iterated tensor products of learned equivariant representations without atom-centered message passing. Allegro obtains improvements over state-of-the-art methods on QM9 and revMD17. A single tensor product layer outperforms existing deep MPNNs and transformers on QM9. Furthermore, Allegro displays remarkable generalization to out-of-distribution data. Molecular simulations using Allegro recover structural and kinetic properties of an amorphous electrolyte in excellent agreement with ab-initio simulations. Finally, we demonstrate parallelization with a simulation of 100 million atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Data for Impact of Vertical and Seasonal Variation in Leaf Traits on Simulating Soybean Canopy Photosynthesis via 1D and 3D Modeling

Accurate modeling of photosynthesis is crucial for predicting crop productivity and quantifying the carbon cycle in agroecosystems. Leaf traits are essential inputs for modeling canopy photosynthesis. Yet, many existing models still use fixed plant functional type (PTF)-based values to parameterize leaf traits under a big-leaf or two-big-leaf assumption, neglecting their vertical profiles and seasonal changes. This simplification may introduce significant uncertainties in estimating gross primary productivity (GPP). In this study, we simulated soybean GPP and tested the effects of vertical and seasonal variation in three key leaf photosynthetic traits: the maximum carboxylation rate at 25 °C (Vcmax25), leaf chlorophyll content (LCC), and leaf mass per area (LMA) in the 1D-SCOPE and 3D-Helios models. Weekly field measurements were conducted during the growing season of 2024 to support the simulation. We designed ten leaf trait parameterization schemes by incorporating different combinations of vertical profiles and seasonal changes, while assuming homogeneous canopy architecture in both models. Our results revealed that Vcmax25 vertical and seasonal variation had the strongest influence on simulated GPP in both 1D and 3D models, while LCC and LMA effects were minimal. Particularly, the scheme with an empirically parameterized Vcmax25 profile achieved comparable performance to the scheme with the measured Vcmax25 profile. Both 1D-SCOPE and 3D-Helios accurately modeled GPP (SCOPE: R2 = 0.87, Bias = 0.55 µmol m⁻² s⁻¹; Helios: R2 = 0.9, Bias = 0.22 µmol m⁻² s⁻¹) under the most complex scheme, and their responses to vertical and seasonal variation in leaf traits were consistent, demonstrating the robustness of our findings. Based on our findings, we propose a scalable framework for parameterizing leaf traits to improve GPP simulations. This study contributes to improving the representation of leaf trait dynamics in canopy-level photosynthesis models, potentially enhancing our ability to predict crop productivity and understand agroecosystem carbon dynamics.

Photosynthesis↗
DOE OSTI2023

Moment Representation of Regularized Lattice Boltzmann Methods on NVIDIA and AMD GPUs

The lattice Boltzmann method is a highly scalable Navier-Stokes solver that has been applied to flow problems in a wide array of domains. However, the method is bandwidth-bound on modern GPU accelerators and has a large memory footprint. In this paper, we present new 2D and 3D GPU implementations of two different regularized lattice Boltzmann methods, which are not only able to achieve an acceleration of ∼ 1.4 × w.r.t. reference lattice Boltzmann implementations but also reduce the memory requirements by up to 35% and 47% in 2D and 3D simulations respectively. These new approaches are evaluated on NVIDIA and AMD GPU architectures.

Valero Lara, Pedro↗
NASA NTRS2006

Model-Based Self-Tuning Multiscale Method for Combustion Control

A multi-scale representation of the combustor dynamics was used to create a self-tuning, scalable controller to suppress multiple instability modes in a liquid-fueled aero engine-derived combustor operating at engine-like conditions. Its self-tuning features designed to handle the uncertainties in the combustor dynamics and time-delays are essential for control performance and robustness. The controller was implemented to modulate a high-frequency fuel valve with feedback from dynamic pressure sensors. This scalable algorithm suppressed pressure oscillations of different instability modes by as much as 90 percent without the peak-splitting effect. The self-tuning logic guided the adjustment of controller parameters and converged quickly toward phase-lock for optimal suppression of the instabilities. The forced-response characteristics of the control model compare well with those of the test rig on both the frequency-domain and the time-domain.

Le, Dzu, K.↗
NASA NTRS2016

Model Based Mission Assurance in a Model Based Systems Engineering (MBSE) Framework: State-of-the-Art Assessment

This report explores the current state of the art of Safety and Mission Assurance (S&MA) in projects that have shifted towards Model Based Systems Engineering (MBSE). Its goal is to provide insight into how NASA’s Office of Safety and Mission Assurance (OSMA) should respond to this shift. In MBSE, systems engineering information is organized and represented in models: rigorous computer-based representations, which collectively make many activities easier to perform, less error prone, and scalable. S&MA practices must shift accordingly. The “Objective Structure Hierarchies” recently developed by OSMA provide the framework for understanding this shift. Although the objectives themselves will remain constant, S&MA practices (activities, processes, tools) to achieve them are subject to change. This report presents insights derived from literature studies and interviews. The literature studies gleaned assurance implications from reports of space-related applications of MBSE. The interviews with knowledgeable S&MA and MBSE personnel discovered concerns and ideas for how assurance may adapt. Preliminary findings and observations are presented on the state of practice of S&MA with respect to MBSE, how it is already changing, and how it is likely to change further. Finally, recommendations are provided on how to foster the evolution of S&MA to best fit with MBSE.

Aerospace engineering↗
DOE OSTI2022

Scalable Simulation of Pressure Gradient-Driven Transport of Rarefied Gases in Complex Permeable Media Using Lattice Boltzmann Method

Accurate representations of slip and transitional flow regimes present a challenge in the simulation of rarefied gas flow in confined systems with complex geometries. In these regimes, continuum-based formulations may not capture the physics correctly. This work considers a regularized multi-relaxation time lattice Boltzmann (LB) method with mixed Maxwellian diffusive and halfway bounce-back wall boundary treatments to capture flow at high Kn. The simulation results are validated against atomistic simulation results from the literature. We examine the convergence behavior of LB for confined systems as a function of inlet and outlet treatments, complexity of the geometry, and magnitude of pressure gradient and show that convergence is sensitive to all three. The inlet and outlet boundary treatments considered in this work include periodic, pressure, and a generalized periodic boundary condition. Compared to periodic and pressure treatments, simulations of complex domains using a generalized boundary treatment conserve mass but require more iterations to converge. Convergence behavior in complex domains improves at higher magnitudes of pressure gradient across the computational domain, and lowering the porosity deteriorates the convergence behavior for complex domains.

42 ENGINEERING↗
NASA NTRS1994

Practical Planning in COLLAGE

COLLAGE is a domain-independent planner that differs from traditional planners in two key ways: (1) it uses a diverse and extendible set of (it action-based) plan constructions methods; and (2) it utilizes a technique called (it localization) to partition the planning problem into smaller (and potentially interacting) sub problems. In this paper, we describe these features and how they are exploited in two different real-world planning domains. The first domain, building construction planning, has served as a framework for us to investigate how localization can improve scalability. The second domain, data analysis planning, benefits from COLLAGE's unique plan construction and representation methods. In addition, we describe extensions that were necessary to tackle these real-world problems.

Lansky, Amy L.↗