Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing frameworks”

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 487 records · Page 27

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗

Accelerating Thermochemical Equilibrium Calculations for Nuclear Reactor Applications

Thermochemical properties play a key role in modeling and simulation of several key phenomena in nuclear reactors. There has been an increasing interest in incorporating CALPHAD-based formulations in multiphysics simulations including for Molten Salt Reactors where knowledge of phase evolution of the salt and the chemical potentials of various elements are of utmost importance in source term analyses and redox control. However, the size of such simulations is often limited by the high computational cost of full thermodynamic equilibrium calculations. This work discusses the current efforts aimed at accelerating thermochemical equilibrium calculations for multiphysics simulations performed using the open-source finite element / finite volume code Multiphysics Object Oriented Simulation Environment (MOOSE) [1]. While several methods have been proposed for accelerating phase equilibrium calculations [2], most focus on relatively small systems and often rely on a- priori knowledge of the state-space of the system. Nuclear materials, however, are often multi-component systems owing to the evolution of composition under irradiation and an approach based on a-priori mapping of phase diagram is often not enough. This work is aimed at demonstrating an on-the-fly surrogate modeling framework that uses active learning to reduce the number of full equilibrium calculations that must be performed. By combining with efficient coupling approaches, the surrogate framework helps in reducing the computational cost of thermodynamic equilibrium informed multiphysics simulations of nuclear materials. The performance is benchmarked against full coupling with the thermochemistry library Thermochimica [3]. This work uses a machine learning based approach for constructing surrogate models to predict the stable phases in a multicomponent system. The surrogates were constructed using neural networks and Gaussian process classification. In this work, we compare the relative performance of the two methods. We also demonstrate the use of caching previous calculations by interpolating the values from nearest neighbors. References [1] Lindsay, A.D., et al. "2.0 – MOOSE: Enabling massively parallel multiphysics simulation", SoftwareX, 20 (2022): 101202. [2] Roos, W.A. and Zietsman J.H. "Accelerating complex chemical equilibrium calculations – A Review", Calphad, 77 (2022): 102380. [3] Piro, M.H.A., et al. "The thermochemistry library Thermochimica", Computational Materials Science, 67 (2013): 266-272.

36 MATERIALS SCIENCE↗

Efficient near-field ptychography reconstruction using the Hessian operator

X-ray ptychography is a powerful and robust coherent imaging method providing access to the complex object and probe (illumination). Ptychography reconstruction is typically performed using first-order methods due to their computational efficiency. Higher-order methods, while potentially more accurate, are often prohibitively expensive in terms of computation. In this study, we present a mathematical framework for reconstruction using second-order information derived from an efficient computation of the bilinear Hessian and Hessian operator. The formulation is provided for Gaussian-based models, enabling the simultaneous reconstruction of the object, probe, and object positions. Synthetic data tests, along with experimental near-field ptychography data processing, demonstrate a ten-fold reduction in computation time compared to first-order methods. The derived formulas for computing the Hessians, along with the strategies for incorporating them into optimization schemes, are well-structured and easily adaptable to various ptychography problem formulations.

Carlsson, Marcus [Lund Univ. (Sweden)] (ORCID:0000↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering

The term "Grid" refers to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. The vision for NASN's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks that will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: The scientist / design engineer whose primary interest is problem solving (e.g., determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user if the tool designer: The computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. This paper describes the current state of IPG (the operational testbed), the set of capabilities being put into place for the operational prototype IPG, as well as some of the longer term R&D tasks.

Johnston, William E.↗

Ion-Electron Coupling-Driven Redox Behavior in Metal–Organic Frameworks

Redox-active metal–organic frameworks (MOFs) have long been proposed as electronic transport platforms, yet the microscopic origin of their conductivity remains debated. A theoretical demonstration reveals charge transport in a Zn(pyrazole–naphthalene diimide (NDI)) MOF arising not from delocalized band-like states but from redox hopping between discrete linker sites. Using ab initio molecular dynamics simulations combined with electronic structure analysis, we established a direct link among electron injection, structural reorganization, and transport. Electron accumulation proceeds sequentially and site-selectively from imide and carbonyl groups of the NDI core progressively involving pyrazole N atoms at higher reduction states, through a hierarchy of redox-active sites. In contrast, Zn nodes remain essentially redox-inactive, which confirms their structural role. Density-of-states analysis corroborates a transport regime dominated by linker-centered states with evolving p-character upon reduction, resulting in dynamically reconfigured conduction networks. Real-time trajectories reveal anisotropic linker-to-linker electron transfer modulated by counterion coordination. This cooperative ion–electron regime emerges from potential energy surface collapse into a single low-barrier transition (ΔG ‡ ≈ 45 meV), where ionic and electronic motions evolve adiabatically on the same free-energy landscape. Elucidating redox conductivity in Zn(pyrazole–NDI) MOFs provides a theoretical framework for use in neuromorphic computing and related technologies.

Charge transfer↗

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗

Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral-atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault-tolerant quantum computation in systems with loss error detection.

atoms↗

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗

A multi‐variable framework for selecting WRF physics configurations at convection‐permitting scales: An Amazon wet‐season case study

Tropical convection over rainforests modulates atmospheric circulation and the energy and hydrological cycles across multiple scales. However, the scarcity of observations still limits our understanding of these processes. Although numerical models are utilized to investigate atmospheric physical processes, their performance depends on the choice of parameterizations and grid resolution. Here, in this work, we introduce and apply a multi‐variable, multi‐physics framework to evaluate and rank the Advanced Research Weather Research and Forecasting (WRF–ARW) configurations at 1‐km resolution over the central Amazon during the wet season. A 48‐member ensemble combines three land‐surface models (LSMs), four planetary boundary layer (PBL), and four microphysics (MP) schemes. Model performance for seven convection‐related near‐surface and boundary‐layer variables is assessed using Taylor diagrams and the Taylor skill score (TSS), analysis of variance (ANOVA)‐based sensitivity metrics, and non‐parametric rank tests. We then construct a combined, weighted TSS to identify configurations that are comparatively robust across variables. Results showed that most configurations reproduce near‐surface temperature, sensible and latent heat fluxes, and boundary‐layer height reasonably well, whereas humidity and rainfall remain challenging. LSM choice has the strongest impact on the surface fluxes and a secondary influence on near‐surface temperature and humidity, PBL schemes dominate boundary‐layer height, and MP schemes exert the largest control on rainfall. No single configuration is optimal for all variables, but the combination of Noah (LSM), Yonsei University (PBL), and Morrison (MP) emerges as the most robust configuration for this case, with the WRF single‐moment six‐class scheme (WSM6) providing a competitive, computationally cheaper MP alternative. The framework is general and can be applied to other regions, seasons, and convective regimes.

Amazon rainforest↗

Modeling holes and voids in three dimensions using a single element within the Extended Finite Element framework

This paper introduces a highly efficient computational approach using the extended finite element method to model three-dimensional mechanics of holes and voids. The defect is encapsulated within a single element with a tailored exponential enrichment function that captures the behavior near the discontinuity boundary and can account for the pressure acting on the void’s surface through an equivalent nodal force vector. The method’s results were compared against analytical solutions and conventional finite element method results for problems involving single and multiple holes. The comparison demonstrated that the method provides accurate stress concentration estimates while adhering to computational constraints.

Adnan Shahriar↗

Modeling and simulation of multiphase flows

This presentation provides an overview of the National Energy Technology Laboratory’s (NETL) multiphase computational fluid dynamics codes. The highly successful Multiphase Flows with Interphase eXchanges (MFIX) suite has been used to model a wide range of applications including post-combustion carbon capture, bioreactor optimization, and bio-FCC regeneration. MFIX-Exa, a state-of-the-art CFD code, developed under DOE’s Exascale Computing Project, is built on the AMReX software framework (https://amrex-codes.github.io/) and is designed to leverage modern accelerator-based compute architectures. This presentation further reviews the underlying physical models of both MFIX and MFIX-Exa and contrasts their similarities and differences. Examples of past and present CFD simulations will illustrate how scientific computing at NETL is being used not only for scientific exploration but also for design, optimization and scale-up of multiphase flow devices.

Musser, Jordan [NETL]↗

A method for designing blended wing-body configurations for low wave drag

A procedure for tailoring a blended wing-body configuration to reduce its computed wave drag is described. The method utilizes an iterative algorithm within the framework of first-order linear theory. Four computed examples are included. In each case, the zero-lift wave drag was reduced without an increase in the drag due to lift.

Barger, Raymond L.↗

An Analysis of Failure Handling in Chameleon, A Framework for Supporting Cost-Effective Fault Tolerant Services

The desire for low-cost reliable computing is increasing. Most current fault tolerant computing solutions are not very flexible, i.e., they cannot adapt to reliability requirements of newly emerging applications in business, commerce, and manufacturing. It is important that users have a flexible, reliable platform to support both critical and noncritical applications. Chameleon, under development at the Center for Reliable and High-Performance Computing at the University of Illinois, is a software framework. for supporting cost-effective adaptable networked fault tolerant service. This thesis details a simulation of fault injection, detection, and recovery in Chameleon. The simulation was written in C++ using the DEPEND simulation library. The results obtained from the simulation included the amount of overhead incurred by the fault detection and recovery mechanisms supported by Chameleon. In addition, information about fault scenarios from which Chameleon cannot recover was gained. The results of the simulation showed that both critical and noncritical applications can be executed in the Chameleon environment with a fairly small amount of overhead. No single point of failure from which Chameleon could not recover was found. Chameleon was also found to be capable of recovering from several multiple failure scenarios.

Haakensen, Erik Edward↗

Gradient-informed Hamiltonian Monte Carlo for multicomponent CALPHAD model optimization and uncertainty quantification

CALPHAD model parameter optimization is inherently challenging due to non-smooth objective functions, high-dimensional parameter spaces, and the need for uncertainty quantification (UQ). Traditional weighted nonlinear least squares approaches are computationally efficient but local, whereas black-box global optimizers and ensemble Markov Chain Monte Carlo (MCMC) methods provide broader exploration at substantial computational cost. The objective of this work is to combine the global exploration capability of gradient-informed Hamiltonian Monte Carlo – specifically the No-U-Turn Sampler (NUTS) – with local deterministic refinement using BFGS to efficiently optimize multicomponent CALPHAD models with minimal manual intervention. Analytic gradients are computed via the Jansson derivative framework. The methodology is demonstrated on the Cr—Fe binary system and extended to the Cr—Fe—Ni ternary system with 32 degrees of freedom. For Cr—Fe, NUTS achieves comparable or superior optimality relative to ensemble MCMC while requiring over an order-of-magnitude fewer likelihood evaluations. Parameter uncertainties are quantified through NUTS sampling and propagated to thermodynamic observables using local expansion, demonstrating a novel modular approach that combines binary and ternary parameter subsets without requiring global relaxation. These results establish gradient-informed exploration as a scalable strategy for multicomponent CALPHAD optimization and provide a practical route towards efficient higher-order database development with quantified uncertainty.

36 MATERIALS SCIENCE↗

A comprehensive numerical investigation on spray models for Direct-Injection Spark-Ignition engines

Gasoline direct-injection spark-ignition (DISI) engines generate a large portion of their unburned hydrocarbon (UHC) and soot emissions during the cold-start phase. A predictive computational fluid dynamics (CFD) modeling framework can be used to understand the physical processes that characterize fuel spray evolution and fuel-film formation at cold start conditions, which can help to reduce engine-out particulate emissions. This study systematically evaluated spray submodels and developed a set of simulation best practices for physical-numerical submodels with the goal of enabling accurate simulations of liquid spray behavior in a DISI engine. Three comprehensive experimental datasets containing free-spray projected liquid volume (PLV), liquid volume fraction (LVF), and near-field X-ray radiography data were used to validate the simulation results and evaluate the spray submodels. Systematic analysis delved into injected parcel distribution, droplet collision, spray breakup, and evaporation via a detailed assessment of the relevant spray submodels. Moreover, the effects of turbulence models and the initial turbulent flow properties on the liquid spray evolution were examined. Based on extensive calibration efforts, a set of simulation best practices for the free spray was developed and validated against the PLV/LVF data. Simulation results indicated that the uniform distribution for parcel initialization, coupled with appropriate droplet collision submodels, provides an improved spray morphology compared to the cluster distribution. The findings also underscored the importance of calibrating the Kelvin-Helmholtz Rayleigh-Taylor (KH-RT) breakup model constants and droplet heat transfer coefficient scaling factor to achieve favorable agreement regarding measured liquid penetration and spray widths. In conclusion, this study marks a substantial stride towards accurately predicting fuel film evolution and soot formation within DISI engine performance.

ECN Spray G↗

Mechanistic Insights into the Electrochemical Oxidation of 5-Hydroxymethylfurfural on a Thin-Film Ni Anode

The electrochemical oxidation of alcohols is being explored as a favorable substitute for the oxygen evolution reaction owing to its capability to generate high-value products and lower overpotentials. Herein, we present a systematic investigation into the electrochemical oxidation of 5-hydroxymethylfurfural (HMF), a model biomass platform chemical, on a thin-film nickel catalyst, aiming to investigate the underlying reaction mechanism and shed light on the role of the catalyst’s microenvironment and phase on activity and product selectivity. Utilizing a combined experimental and computational approach, we demonstrate that NiOOH is the active phase for HMF oxidation. Additionally, we find a substantial impact of the electrochemical environment, particularly the electrolyte pH, on the reaction. Under highly alkaline conditions (pH = 13), higher activity for HMF oxidation is observed, accompanied by an increased selectivity toward 2,5-furandicarboxylic acid (FDCA) production. Conversely, a less alkaline environment (pH = 11) results in diminished HMF oxidation activity and a higher preference for the partial oxidation product 2,5-diformylfuran (DFF). Mechanistic insights from DFT studies reveal that geminal diols that are present under highly alkaline conditions undergo hydride transfer via HMFCA, while a shift to an alkoxide route occurs at a lower pH, favoring the DFF pathway. Hydride transfer energetics are also strongly affected by the surface Ni oxidation state. Finally, this integrated approach, bridging experimental and computational insights, provides a general framework for investigating the electrochemical oxidation of aldehydes and alcohols, thereby advancing rational design strategies in electrocatalysts for alcohol electro-oxidation reactions.

30 DIRECT ENERGY CONVERSION↗

Experimental and Computational Evaluation of Nicotinamide Cofactor Biomimetics

Oxidoreductase enzymes are widely used biocatalysts due to their high enantioselectivity and broad substrate compatibility in useful transformations. Many oxidoreductases require nicotinamide cofactors (i.e., NAD(P)H). To replace this costly natural cofactor, synthetic nicotinamide cofactor biomimetics (NCBs) offer different shapes, binding affinities, and reducing potentials that exceed the capabilities of wild-type NAD(P)H. However, the ill-defined structure–activity relationships (SARs) of various NCBs slow rationally guided innovation, such as customized reducing potentials. Here, we dissect two essential elements of NCB design, holding the nicotinamide invariant. First, the linker length between the nicotinamide and an unconjugated aromatic ring uncovered unexpected benefits to redox activity for two or three carbon linkers. Second, substitution on this unconjugated aryl group (Ring 2) might not be expected to affect activity. However, SAR trends demonstrate substantial benefits to reductive potential conferred by electron-donating functionalities on Ring 2. Furthermore, catalysis by two enzymes demonstrates enzyme-dependent tolerance or sensitivity to the NCB structures. Density functional theory (DFT) and computational modeling provide a theoretical framework to understand and build upon these observations. Ring 2 reaches up to the nicotinamide to stabilize its positive charge after oxidation through π–π stacking and charge transfer. Thus, the systematic examination of NCB’s stability, electrochemical redox potentials, and kinetics uncovers trends for the improved design of NCBs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗