Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational framework”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

An integrated computational materials engineering framework to analyze the failure behaviors of carbon fiber reinforced polymer composites for lightweight vehicle applications

A bottom-up multi-scale modeling approach is used to develop an Integrated Computational Materials Engineering (ICME) framework for carbon fiber reinforced polymer (CFRP) composites, which has the potential to reduce development to deployment lead time for structural applications in lightweight vehicles. In this work, we develop and integrate computational models comprising of four size scales to fully describe and characterize three types of CFRP composites. In detail, the properties of the interphase region are determined by an analytical gradient model and molecular dynamics analysis at the nano-scale, which is then incorporated into micro-scale unidirectional (UD) representative volume element (RVE) models to characterize the failure strengths and envelopes of UD CFRP composites. Then, the results are leveraged to propose an elasto-plastic-damage constitutive law for UD composites to study the fiber tows of woven composites as well as the chips of sheet molding compound (SMC) composites. Subsequently, the failure mechanisms and failure strengths of woven and SMC composites are predicted by the meso-scale RVE models. Finally, building upon the models and results from lower scales, we show that a homogenized macro-scale model can capture the mechanical performance of a hat-section-shaped part under four-point bending. Along with the model integration, we will also demonstrate that the computational results are in good agreement with experiments conducted at different scales. The present work illustrates the potential and significance of integrated multi-scale computational modeling tools that can virtually evaluate the performance of CFRP composites and provide design guidance for CFRP composites used in structural applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

FIRE: A Failure-Adaptive RL Framework for Edge Computing Migrations

In edge computing, users' service profiles are migrated between edge servers due to user mobility. Reinforcement Learning (RL) frameworks have been proposed to do so, often trained on simulated data. However, existing RL frameworks overlook occasional server failures, which although rare, impact latency-sensitive applications like AR/VR and real- time obstacle detection. These rare failures, being not adequately represented in historical training data, pose a challenge for data-driven RL algorithms. We introduce FIRE, a framework that adapts to rare events by training a RL policy in an edge computing digital twin environment. We propose FIRE-ImRE, an importance sampling-based Q-learning algorithm, which samples rare events proportionally to their impact on the value function. FIRE considers delay, migration, failure, and backup placement costs across individual and shared service profiles. We prove FIRE-ImRE's boundedness and convergence to optimality. Next, we introduce novel deep Q-learning (FIRE-ImDQL) and actor critic (FIRE-ImACRE) versions of our algorithm to enhance scalability. Here, we extend our framework to accommodate users with varying risk tolerances of rare failure events. Through trace-driven experiments, we show that FIRE reduces edge computing costs compared to vanilla RL and the greedy baseline in the event of failures.

Edge computing↗
DOE OSTI2024

An open-source framework for balancing computational speed and fidelity in production cost models

Studies of bulk power system operations need to incorporate uncertainty and sensitivity analyses, especially around exposure to weather and climate variability and extremes, but this remains a computational modeling challenge. Commercial production cost models (PCMs) have shorter runtimes, but also important limitations (opacity, license restrictions) that do not fully support stochastic simulation. Open-source PCMs represent a potential solution. They allow for multiple, simultaneous runs in high-performance computing environments and offer flexibility in model parameterization. Yet, developers must balance computational speed (i.e. runtime) with model fidelity (i.e. accuracy). In this paper, we present Grid Operations (GO), a framework for instantiating open-source, scale-adaptive PCMs. GO allows users to search across parameter spaces to identify model versions that appropriately balance computational speed and fidelity based on experimental needs and resource limits. Results provide generalizable insights on how to navigate the fidelity and computational speed tradeoff through parameter selection. We show that models with coarser network topologies can accurately mimic market operations, sometimes better than higher-resolution models. It is thus possible to conduct large simulation experiments that characterize operational risks related to climate and weather extremes while maintaining sufficient model accuracy.

42 ENGINEERING↗
DOE OSTI2026

Analog and symbolic computation through the Koopman framework

We develop a Koopman operator framework for studying the computational structure of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ‘Koopman halting problem’ that is recursively enumerable in general. For symbolic systems, such as those defined on Cantor space, this operator formulation captures reachability between clopen sets, while for equicontinuous systems we prove that the Koopman halting problem is decidable. Our framework demonstrates that absorbing (halting) states in coarse-grained finite automata correspond to Koopman eigenfunctions with eigenvalue one, while cycles in the transition graph impose spectral constraints associated with periodic dynamics. These results provide a unifying perspective on computation in symbolic and analog systems, showing how computational universality is reflected in operator spectra, invariant subspaces, and algebraic structures. Beyond symbolic dynamics, this operator-theoretic lens opens pathways to analyze the computational properties of a broader class of dynamical systems, including polynomial and analog models, and suggests that computational hardness may admit dynamical signatures in terms of Koopman spectral structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Multinucleon structure and dynamics via quantum computing

We propose a framework for computing the structure and dynamics for second-quantized many-nucleon Hamiltonians on quantum computers. We develop an oracle-based Hamiltonian input model that computes the many-nucleon states and nonzero Hamiltonian matrix elements of the many-nucleon system. With our Fock-state based input model, we show how to implement the sparse matrix simulation algorithms to calculate the dynamics of the second-quantized many-nucleon Hamiltonian. Based on the dynamics simulation methods, we also present the methodology for structure calculations of the many-nucleon system. In this work, we provide an explicit circuit design of our input model of the second-quantized Hamiltonian within a direct encoding scheme that maps the occupation of each available single-particle state in the many-nucleon state to the state of specific qubit in a quantum register. Here, we analyze our method and provide the asymptotic cost in computing resources for structure and dynamics calculations of many-nucleon systems. For pedagogical purposes, we demonstrate our input model with two model problems in restricted model spaces.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Tiling Framework for Heterogeneous Computing of Matrix based Tiled Algorithms

Tiling matrix operations can improve the load balancing and performance of applications on heterogeneous computing resources. Writing a tile-based algorithm for each operation with a traditional, hand-tuned tiling approach that uses for loops in C/C++ is cumbersome and error prone. Moreover, it must enable and support the heterogeneous memory management of data objects and also explore architecture-supported, native, tiled-data transfer APIs instead of copying the tiled data to continuous memory before the data transfer. The tiling framework provides a tiled data structure for heterogeneous memory mapping and parameterization to a heterogeneous task specification API. We have integrated our tiled framework into MatRIS (Math kernels library using IRIS). IRIS is a heterogeneous run-time framework with a heterogeneous programming model, memory model, and task execution model. Experiments reveal that the tiled framework for BLAS operations has improved the programmability of tiled BLAS and improved performance by ~20% when compared against the traditional method that copies the data to continuous memory locations for heterogeneous computing.

Miniskar, Narasinga Rao↗
DOE OSTI2020

A volumetric framework for quantum computer benchmarks

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth d and width w are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which d and w are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes — ( w , d ) pairs — to test suites C ( w , d ) . A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C , a specific list of circuits { C 1 … C N } that must all be run, or a large set of possible circuits equipped with a distribution P r ( C ) . The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have ``passed'' a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the d vs w trade-off for the processor being benchmarked.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Robust Parallel Distributed State Estimation for Large Scale Distribution Systems

The growing need and interest in real-time monitoring of large distribution networks motivated by the rapid population of renewable sources, EVs and etc. demand a computationally efficient state estimation framework. Furthermore, this paper presents an improved computational framework for implementing a robust state estimator using a multi-core processor. The main contribution of the paper is the proposed computational framework along with two partitioning strategies which enable fast and robust state estimation for large scale radial and/or meshed distribution systems. Formulation of the proposed method and its implementation are described in detail. Performance of the estimator is tested by simulations first using a small 84-bus radial distribution system. Then the method’s scalability is demonstrated by simulations on two very large scale distribution networks one configured radially and the other meshed each containing over 12,500 buses.

42 ENGINEERING↗
DOE OSTI2026

Reimagining metal-organic framework discovery: Integrating experiment, computation, and artificial intelligence

The traditional development of novel metal–organic frameworks (MOFs) is often hindered by challenges such as synthetic accessibility and time- and resource-intensive experimentation. High-throughput, automated experimental and computational techniques have enabled rapid chemical space exploration and theoretical MOF design. When combined with artificial intelligence (AI), these methods can be used to lead autonomous laboratories to new frontiers for MOF discovery, where these materials can be designed for a specific application, efficiently synthesized, characterized, and evaluated. Here, this perspective highlights the role of AI in advancing automated MOF synthesis and characterization, computational MOF design and screening, and the integration of these approaches within autonomous workflows to ultimately enable the MOF laboratories of the future.

Gaidimas, Madeleine A. [Northwestern University, E↗
DOE OSTI2025

Inclusive open charm photoproduction in ultraperipheral collisions at the LHC with in the generalized photon-nucleus fixed-order next-to-leading logarithm framework

We compute the inclusive 𝐷 0 production cross section in ultraperipheral Pb-Pb collisions at the LHC as a function of the 𝐷 0 transverse momentum and rapidity. These calculations are carried out within the new generalized photon-nucleus FONLL (G⁡𝛾⁢A−FONLL) framework, which can predict photonuclear cross sections for charm and beauty hadrons in electron-proton, electron-nucleus, and ultraperipheral heavy-ion collisions. The framework relies on fixed-order next-to-leading logarithm (FONLL) to model heavy-quark production in photonuclear collisions and employs a photon-flux reweighting procedure to describe the production cross sections in ultraperipheral heavy-ion collisions. The G⁡𝛾⁢A calculations are first validated against the photoproduction cross sections of 𝐷* in electron-proton collisions at HERA. The predictions for the 𝐷 0 production cross section in ultraperipheral Pb-Pb collisions at the LHC are then presented and compared to the first experimental results obtained by CMS at $\sqrt{s_{NN}}$ = 5.36 ⁢TeV. The predictions are benchmarked against different choices of nuclear parton distribution functions, fragmentation functions, and renormalization and factorization scales.

Parton distribution functions↗
DOE OSTI2024

Direct quarkonium production in DIS from a joint CGC and NRQCD framework

We compute the differential cross section for direct quarkonium production in high-energy electron-nucleus collisions at small 𝑥. Our computation is performed within the nonrelativistic QCD factorization formalism that separates the calculation into short distance coefficients and long distance matrix elements that depend on the color and spin of the state. We obtain the short distance coefficients of the production of the heavy quark pair within the framework of the color glass condensate effective field theory, which resums coherent multiple interactions of the heavy quark pair with the nucleus to all orders. Our results are expressed as the convolution of perturbatively calculable functions with multipoint lightlike Wilson line correlators. In the correlation limit, we establish the correspondence between our color glass condensate formulation with calculations employing the transverse momentum dependent (TMD) framework. We extend this correspondence by resumming kinematic power corrections within the improved TMD framework, which interpolates between the TMD formalism and 𝑘 ⊥ -factorization formalism. We present a detailed numerical analysis, focusing on 𝐽/𝜓 production in the kinematics accessible at the future Electron-Ion Collider, highlighting the importance of genuine higher-order saturation contributions when the electron collides with a large nucleus. Our results are also valid in the photoproduction limit where we expect the largest contribution from genuine higher-order saturation contributions which could be accessed in ultraperipheral collisions of relativistic heavy ions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

An Efficient Storage-Driven Machine Learning Model for Performance in the Era of Multimodal Scientific Data

Scientific workflows are increasingly relying on machine learning (ML), simulation, and hybrid techniques to predict, understand, and optimize the behavior of complex experiments. High-performance computing has greatly improved researchers’ ability to acquire diverse data modalities in these workflows. Recent studies suggest that the performance of machine learning models can be improved by integrating data from various sources. Unfortunately, these workloads pose unprecedent pressure on the network storage to meet the demands associated with accessing these multimodal data. To mitigate the impact of intensive IO, we propose a solution that utilizes a multi-tier High-Performance Computing (HPC) distributed storage and data processing framework, placing computation where the data resides for better performance. By adopting this project, the scientific community will gain new opportunities to explore multimodal storage-driven possibilities, integrating multiple scientific data sources with advanced streaming frameworks. Additionally, our framework effectively utilizes computing resources and bridges the gaps identified by HPC experts. Our proposed approach tackles scalability and persistence challenges by leveraging native persistency, which has posed difficulties in traditional approaches. Furthermore, we seek to enhance fault-tolerance and load-balance of computations by leveraging real-time streaming in diverse scientific computing environments, thereby propelling advanced scientific computing research into the next generation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Regional-scale fault-to-structure earthquake simulations with the EQSIM framework: Workflow maturation and computational performance on GPU-accelerated exascale platforms

Continuous advancements in scientific and engineering understanding of earthquake phenomena, combined with the associated development of representative physics-based models, is providing a foundation for high-performance, fault-to-structure earthquake simulations. However, regional-scale applications of high-performance models have been challenged by the computational requirements at the resolutions required for engineering risk assessments. The EarthQuake SIMulation (EQSIM) framework, a software application development under the US Department of Energy (DOE) Exascale Computing Project, is focused on overcoming the existing computational barriers and enabling routine regional-scale simulations at resolutions relevant to a breadth of engineered systems. This multidisciplinary software development—drawing upon expertise in geophysics, engineering, applied math and computer science—is preparing the advanced computational workflow necessary to fully exploit the DOE’s exaflop computer platforms coming online in the 2023 to 2024 timeframe. Achievement of the computational performance required for high-resolution regional models containing upward of hundreds of billions to trillions of model grid points requires numerical efficiency in every phase of a regional simulation. This includes run time start-up and regional model generation, effective distribution of the computational workload across thousands of computer nodes, efficient coupling of regional geophysics and local engineering models, and application-tailored highly efficient transfer, storage, and interrogation of very large volumes of simulation data. This article summarizes the most recent advancements and refinements incorporated in the workflow design for the EQSIM integrated fault-to-structure framework, which are based on extensive numerical testing across multiple graphics processing unit (GPU)-accelerated platforms, and demonstrates the computational performance achieved on the world’s first exaflop computer platform through representative regional-scale earthquake simulations for the San Francisco Bay Area in California, USA.

58 GEOSCIENCES↗
DOE OSTI2021

PandAna: A Python Analysis Framework for Scalable High Performance Computing in High Energy Physics

Modern experiments in high energy physics analyze millions of events recorded in particle detectors to select the events of interest and make measurements of physics parameters. These data can often be stored as tabular data in files with detector information and reconstructed quantities. Current techniques for event selection in these files lack the scalability needed for high performance computing environments. We describe our work to develop a high energy physics analysis framework suitable for high performance computing. This new framework utilizes modern tools for reading files and implicit data parallelism. Framework users analyze tabular data using standard, easy-to-use data analysis techniques in Python while the framework handles the file manipulations and parallelism without the user needing advanced experience in parallel programming. In future versions, we hope to provide a framework that can be utilized on a personal computer or a high performance computing cluster with little change to the user code.

Groh, Micah↗