Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational 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 1,567 records · Page 87

Unification of finite symmetries in the simulation of many-body systems on quantum computers

Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.

quantum algorithms↗

Emulation With Uncertainty Quantification of Regional Sea‐Level Change Caused by the Antarctic Ice Sheet

Abstract Projecting regional sea‐level change under various climate‐change scenarios typically involves running forward simulations of the Earth's gravitational, rotational and deformational (GRD) response to ice‐mass change, which requires substantial computational cost if applied to probabilistic frameworks requiring thousands to millions of samples. Here we build emulators of regional sea‐level change at 27 coastal locations, due to the GRD effects associated with future Antarctic Ice Sheet mass change over the 21st century. The emulators are evaluated against a numerical sea‐level model applied to an ensemble of ice‐sheet model simulations of the Antarctic Ice Sheet through 2100. We build a physics‐based emulator using a recent sensitivity kernel approach and compare it to machine learning based emulators (neural network and conditional variational autoencoder methods). In order to quantify uncertainty, we derive well‐calibrated prediction intervals for regional sea‐level change via split‐conformal inference and linear regression, and show that Monte Carlo dropout does not yield well‐calibrated uncertainties in this instance. We also demonstrate substantial gains in computational efficiency using both the physics‐based emulator and neural networks in comparison to the numerical model for the complete regional sea‐level solution. Overall, we find the physics‐based emulator modestly outperforms the machine learning emulators for this problem.

58 GEOSCIENCES↗

Software Engineering Support of the Third Round of Scientific Grand Challenge Investigations: Earth System Modeling Software Framework Survey

One of the most significant challenges in large-scale climate modeling, as well as in high-performance computing in other scientific fields, is that of effectively integrating many software models from multiple contributors. A software framework facilitates the integration task, both in the development and runtime stages of the simulation. Effective software frameworks reduce the programming burden for the investigators, freeing them to focus more on the science and less on the parallel communication implementation. while maintaining high performance across numerous supercomputer and workstation architectures. This document surveys numerous software frameworks for potential use in Earth science modeling. Several frameworks are evaluated in depth, including Parallel Object-Oriented Methods and Applications (POOMA), Cactus (from (he relativistic physics community), Overture, Goddard Earth Modeling System (GEMS), the National Center for Atmospheric Research Flux Coupler, and UCLA/UCB Distributed Data Broker (DDB). Frameworks evaluated in less detail include ROOT, Parallel Application Workspace (PAWS), and Advanced Large-Scale Integrated Computational Environment (ALICE). A host of other frameworks and related tools are referenced in this context. The frameworks are evaluated individually and also compared with each other.

Talbot, Bryan↗

Scaling dynamics in low-salt-rejection reverse osmosis for high-salinity produced water desalination: Mechanistic modeling and membrane autopsy

Membrane scaling remains a critical barrier to the reliable operation of desalination systems, particularly for hypersaline produced water (PW) treatment. This study fills the knowledge gap of autopsy-based model validation for PW desalination by elucidating scaling mechanisms in a Low-Salt-Rejection Reverse Osmosis (LSRRO) system through the integration of pilot-scale experimentation and complementary modeling approaches. A semi-empirical modeling framework was developed and applied to a multistage pilot LSRRO system equipped with nanofiltration and RO membranes treating high-salinity PW from the Permian Basin. Water quality analysis showed that total dissolved solids decreased from ~130,000 mg/L to ~1900 mg/L in the permeate, then further reduced to ~300 mg/L by a second-pass RO. Two different thermodynamic modeling approaches were evaluated: the first extends the LSRRO framework by incorporating system complexity and scaling phenomena, whereas the second method explicitly captures concentration polarization in localized supersaturation. Both methods illustrate the tendency for carbonate and sulfate scaling throughout the stages. Membrane autopsies revealed a silica-dominated deposit matrix, localized CaSO 4 at Stage 2, and minor barite/celestite despite their prominence in model predictions. Quantum-chemical calculations indicated silica scaling can be rationalized by favorable adsorption of H 4 SiO 4 on Fe-oxide surfaces (ΔG ≈ −44 kJ/mol), providing a kinetic pathway for interfacial inorganic polymerization even when bulk equilibrium predictions are conservative. Overall, the thermodynamic scaling modeling and membrane autopsy revealed heterogeneous, localized deposits with limited impact on LSRRO performance, while quantum analysis rationalized the thermodynamically unfavorable precipitation formation under bulk equilibrium, reconciling model–autopsy discrepancies. These insights support targeted pretreatment and silica-specific antiscalants to extend membrane lifetime and increase recovery, providing a transferable framework for hypersaline water desalination systems. The combined experimental–computational approach provides new mechanistic insight into scaling in hypersaline membrane systems and establishes a transferable framework for predicting and mitigating scaling in next-generation desalination technologies.

Low-salt-rejection reverse osmosis↗

Absorbing boundary conditions in material point method adopting perfectly matched layer theory

This study focuses on solving the numerical challenges of imposing absorbing boundary conditions for dynamic simulations in the material point method (MPM). To attenuate elastic waves leaving the computational domain, the current work integrates the Perfectly Matched Layer (PML) theory into the implicit MPM framework. The proposed approach introduces absorbing particles surrounding the computational domain that efficiently absorb outgoing waves and reduce reflections, allowing for accurate modeling of wave propagation and its further impact on geotechnical slope stability analysis. The study also includes several benchmark tests to validate the effectiveness of the proposed method, such as several types of impulse loading and symmetric and asymmetric base shaking. The conducted numerical tests also demonstrate the ability to handle large deformation problems, including the failure of elasto-plastic soils under gravity and dynamic excitations. The findings extend the capability of MPM in simulating continuous analysis of earthquake-induced landslides, from shaking to failure.

58 GEOSCIENCES↗

Scaling-law for the energy dependence of anatomic power spectrum in dedicated breast CT

Purpose: To determine the x-ray photon energy dependence of the anatomic power spectrum of the breast when imaged with dedicated breast computed tomography (CT). Methods: A theoretical framework for scaling the empirically determined anatomic power spectrum at one x-ray photon energy to that at any given x-ray photon energy when imaged with dedicated breast CT was developed. Theory predicted that when the anatomic power spectrum is fitted with a power curve of the form k f{sup -{beta}}, where k and {beta} are fit coefficients and f is spatial frequency, the exponent {beta} would be independent of x-ray photon energy (E), and the amplitude k scales with the square of the difference in energy-dependent linear attenuation coefficients of fibroglandular and adipose tissues. Twenty mastectomy specimens based numerical phantoms that were previously imaged with a benchtop flat-panel cone-beam CT system were converted to 3D distribution of glandular weight fraction (f{sub g}) and were used to verify the theoretical findings. The 3D power spectrum was computed in terms of f{sub g} and after converting to linear attenuation coefficients at monoenergetic x-ray photon energies of 20-80 keV in 5 keV intervals. The 1D power spectra along the axes were extracted and fitted with a power curve of the form k f{sup -{beta}}. The energy dependence of k and {beta} were analyzed. Results: For the 20 mastectomy specimen based numerical phantoms used in the study, the exponent {beta} was found to be in the range of 2.34-2.42, depending on the axis of measurement. Numerical simulations agreed with the theoretical predictions that for a power-law anatomic spectrum of the form k f{sup -{beta}}, {beta} was independent of E and k(E) =k{sub 1}[{mu}{sub g}(E) -{mu}{sub a}(E)]{sup 2}, where k{sub 1} is a constant, and {mu}{sub g}(E) and {mu}{sub a}(E) represent the energy-dependent linear attenuation coefficients of fibroglandular and adipose tissues, respectively. Conclusions: Numerical simulations confirmed the theoretical predictions that in dedicated breast CT, the spatial frequency dependence of the anatomic power spectrum will be independent of x-ray photon energy, and the amplitude of the anatomic power spectrum scales by the square of difference in linear attenuation coefficients of fibroglandular and adipose tissues.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

NUMA-Aware Thread Scheduling for Big Data Transfers over Terabits Network Infrastructure

The evergrowing trend of big data has led scientists to share and transfer the simulation and analytical data across the geodistributed research and computing facilities. However, the existing data transfer frameworks used for data sharing lack the capability to adopt the attributes of the underlying parallel file systems (PFS). LADS (Layout-Aware Data Scheduling) is an end-to-end data transfer tool optimized for terabit network using a layout-aware data scheduling via PFS. However, it does not consider the NUMA (Nonuniform Memory Access) architecture. In this paper, we propose a NUMA-aware thread and resource scheduling for optimized data transfer in terabit network. First, we propose distributed RMA buffers to reduce memory controller contention in CPU sockets and then schedule the threads based on CPU socket and NUMA nodes inside CPU socket to reduce memory access latency. We design and implement the proposed resource and thread scheduling in the existing LADS framework. Experimental results showed from 21.7% to 44% improvement with memory-level optimizations in the LADS framework as compared to the baseline without any optimization.

97 MATHEMATICS AND COMPUTING↗

Development of an Aeroelastic Modeling Capability for Transient Nozzle Side Load Analysis

Lateral nozzle forces are known to cause severe structural damage to any new rocket engine in development. Currently there is no fully coupled computational tool to analyze this fluid/structure interaction process. The objective of this study was to develop a fully coupled aeroelastic modeling capability to describe the fluid/structure interaction process during the transient nozzle operations. The aeroelastic model composes of three components: the computational fluid dynamics component based on an unstructured-grid, pressure-based computational fluid dynamics formulation, the computational structural dynamics component developed in the framework of modal analysis, and the fluid-structural interface component. The developed aeroelastic model was applied to the transient nozzle startup process of the Space Shuttle Main Engine at sea level. The computed nozzle side loads and the axial nozzle wall pressure profiles from the aeroelastic nozzle are compared with those of the published rigid nozzle results, and the impact of the fluid/structure interaction on nozzle side loads is interrogated and presented.

Wang, Ten-See↗

Mesoflow: An Open-Source Reacting Flow Solver for Catalysis at Mesoscale

We present the capabilities and software performance metrics of our open-source continuum solver for catalysis, Mesoflow, developed specifically for modeling transport and chemistry at the mesoscale. Our solver utilizes Cartesian block-structured adaptive mesh refinement to resolve complex catalyst surface morphologies directly obtained from X-ray tomography data. An immersed boundary based formulation enables rapid representation of complex geometries prevalent in most mesoporous catalyst interfaces. The solver is developed on top of open-source performance portable library, AMReX, providing parallel execution capabilities on current and upcoming high-performance-computing (HPC) architectures. Our flexible software framework enables integration of complex chemical mechanisms at heterogenous interfaces and time-split algorithms for circumventing highly disparate reaction and flow time-scales. Our current studies indicate a ten-fold performance gain by using graphics-processing-units (GPUs) compared to a single processor for representative problem sizes (2 million cell mesh). We will also present a brief introduction on how to build and use this software for application problems pertaining to catalytic upgrading and gas transport within porous catalyst particles.

adaptive meshing↗

The Exascale Framework for High Fidelity coupled Simulations (EFFIS): Enabling whole device modeling in fusion science

We present the Exascale Framework for High Fidelity coupled Simulations (EFFIS), a workflow and code coupling framework developed as part of the Whole Device Modeling Application (WDMApp) in the Exascale Computing Project. EFFIS consists of a library, command line utilities, and a collection of run-time daemons. Together, these software products enable users to easily compose and execute workflows that include: strong or weak coupling, in situ (or offline) analysis/visualization/monitoring, command-and-control actions, remote dashboard integration, and more. We describe WDMApp physics coupling cases and computer science requirements that motivate the design of the EFFIS framework. Furthermore, we explain the essential enabling technology that EFFIS leverages: ADIOS for performant data movement, PerfStubs/TAU for performance monitoring, and an advanced COUPLER for transforming coupling data from its native format to the representation needed by another application. Finally, we demonstrate EFFIS using coupled multi-simulation WDMApp workflows and exemplify how the framework supports the project’s needs. We show that EFFIS and its associated services for data movement, visualization, and performance collection does not introduce appreciable overhead to the WDMApp workflow and that the resource-dominant application’s idle time while waiting for data is minimal.

97 MATHEMATICS AND COMPUTING↗

Contributions of vegetation heterogeneity within tower footprint to CO 2 flux estimations through graph neural network modeling

Net ecosystem exchange of CO 2 (Fc) measured directly by eddy covariance towers is based on various assumptions, including large, flat and homogenous land cover type. In reality, often a tower site is not large enough for flux measurements, and landscapes consist of patches of different land cover types within the flux footprint. In addition, some portions of fluxes are contributed by different cover types when a footprint exceeds the size of the target ecosystem. The contributions of non-dominant patches to Fc are often ignored. Here, in this study, we propose a novel integrated modeling framework that combines random forest (RF) and XGBoost with a residual correction module based on a deep graph convolutional network (DeeperGCN) to simulate Fc for seven flux measurement sites in southwest Michigan. High-resolution remote sensing vegetation indices, soil properties, meteorological variables, and footprint-weighted spatial features were used as model inputs at three spatial resolutions (10 m, 20 m, 30 m), and their importance in predicting Fc with DeeperGCN was assessed. We found that residual correction using DeeperGCN significantly improved prediction accuracy, with the R 2 increasing from 0.9098 to 0.9479 for RF and from 0.9235 to 0.9433 for XGBoost. At site level, the maximum improvement in R 2 reached 0.1617. Paired t-tests confirmed that these improvements were statistically significant (p < 0.05). Among all predictors, leaf area index and incoming shortwave radiation emerged as the dominant drivers of spatial residual variation, followed by precipitation, relative humidity, and selected vegetation indices. The 20 m resolution yielded the best balance between model performance and computational efficiency. In conclusion, our modeling framework effectively captures both spatial heterogeneity and nonlinear interactions, offering a robust solution for spatially explicit flux modeling in structurally diverse ecosystems beyond the study sites.

footprint model↗

Small tensor product distributed active space (STP-DAS) framework for relativistic and non-relativistic multiconfiguration calculations: Scaling from 10 9 on a laptop to 10 12 determinants on a supercomputer

Despite the power and flexibility of configuration interaction (CI) based methods in computational chemistry, their broader application is limited by an exponential increase in both computational and storage requirements, particularly due to the substantial memory needed for excitation lists that are crucial for scalable parallel computing. Here, the objective of this work is to develop a new CI framework, namely, the small tensor product distributed active space (STP-DAS) framework, aimed at drastically reducing memory demands for extensive CI calculations on individual workstations or laptops, while simultaneously enhancing scalability for extensive parallel computing. Moreover, the STP-DAS framework can support various CI-based techniques, such as complete active space (CAS), restricted active space, generalized active space, multireference CI, and multireference perturbation theory, applicable to both relativistic (two- and four-component) and non-relativistic theories, thus extending the utility of CI methods in computational research. We conducted benchmark studies on a supercomputer to evaluate the storage needs, parallel scalability, and communication downtime using a realistic exact-two-component CASCI (X2C-CASCI) approach, covering a range of determinants from 10 9 to 10 12 . Additionally, we performed large X2C-CASCI calculations on a single laptop and examined how the STP-DAS partitioning affects performance.

Complete-active space self-consistent field↗

MetaHeuristic Feature Selection for Energy Group Optimization and Analysis

Energy discretization is a crucial component of deterministic neutron transport simulations. Metaheuristic (MH) optimizers are effective algorithms to determine group structures that maximize both solution accuracy and computational efficiency. This project establishes a framework for optimizing group structures for PARTISN simulations using the Python library MEALPY. Group structure optimization is formulated as a binary feature selection problem, and results are investigated with permutation and material importance techniques to determine physically relevant energy bounds. We conclude that MH optimizers find group structures that drastically improve flux calculations while preserving k-effective accuracy. Further, we find that individual energy bounds are not necessarily physically relevant, but rather specific energy ranges are.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Prediction of cardiac death after adenosine myocardial perfusion SPECT based on machine learning

Background: We developed machine-learning (ML) models to estimate a patient’s risk of cardiac death based on adenosine myocardial perfusion SPECT (MPS) and associated clinical data, and compared their performance to baseline logistic regression (LR). We demonstrated an approach to visually convey the reasoning behind a patient’s risk to provide insight to clinicians beyond that of a “black box.” Methods: We trained multiple models using 122 potential clinical predictors (features) for 8321 patients, including 551 cases of subsequent cardiac death. Accuracy was measured by area under the ROC curve (AUC), computed within a cross-validation framework. We developed a method to display the model’s rationale to facilitate clinical interpretation. Results: The baseline LR (AUC = 0.76; 14 features) was outperformed by all other methods. A least absolute shrinkage and selection operator (LASSO) model (AUC = 0.77; p = .045; 6 features) required the fewest features. A support vector machine (SVM) model (AUC = 0.83; p < .0001; 49 features) provided the highest accuracy. Conclusions: LASSO outperformed LR in both accuracy and simplicity (number of features), with SVM yielding best AUC for prediction of cardiac death in patients undergoing MPS. Combined with presenting the reasoning behind the risk scores, our results suggest that ML can be more effective than LR for this application.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

B-DeepONet: An enhanced Bayesian DeepONet for solving noisy parametric PDEs using accelerated replica exchange SGLD

Here, the Deep Operator Network (DeepONet) is a neural network architecture used to approximate operators, including the solution operator of parametric PDEs. DeepONets have shown remarkable approximation ability. However, the performance of DeepONets deteriorates when the training data is polluted with noise, a scenario that occurs in practice. To handle noisy data, we propose a Bayesian DeepONet based on replica exchange Langevin diffusion (reLD). Replica exchange uses two particles. The first particle trains a DeepONet to exploit the loss landscape and make predictions. The other particle trains a different DeepONet to explore the loss landscape and escape local minima via swapping. Compared to DeepONets trained with state-of-the-art gradient-based algorithms (e.g., Adam), the proposed Bayesian DeepONet greatly improves the training convergence for noisy scenarios and accurately estimates the uncertainty. To further reduce the high computational cost of the reLD training of DeepONets, we propose (1) an accelerated training framework that exploits the DeepONet's architecture to reduce its computational cost up to 25% without compromising performance and (2) a transfer learning strategy that accelerates training DeepONets for PDEs with different parameter values. Finally, we illustrate the effectiveness of the proposed Bayesian DeepONet using four parametric PDE problems.

97 MATHEMATICS AND COMPUTING↗

Understanding Mixed Precision GEMM with MPGemmFI: Insights into Fault Resilience

Emerging deep learning workloads urgently need fast general matrix multiplication (GEMM). Thus, one of the critical features of machine-learning-specific accelerators such as NVIDIA Tensor Cores, AMD Matrix Cores, and Google TPUs is the support of mixed-precision enabled GEMM. For DNN models, lower-precision FP data formats and computation offer acceptable correctness but significant performance, area, and memory footprint improvement. While promising, the mixed-precision computation on error resilience remains unexplored. To this end, we develop a fault injection framework that systematically injects fault into the mixed-precision computation results. We investigate how the faults affect the accuracy of machine learning applications. Based on the characteristics of error resilience, we offer lightweight error detection and correction solutions that significantly improve the overall model accuracy by 75% if the models experience hardware faults. The solutions can be efficiently integrated into the accelerator's pipelines.

Fang, Bo↗

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Position Paper - pFLogger: The Parallel Fortran Logging framework for HPC Applications

In the context of high performance computing (HPC), software investments in support of text-based diagnostics, which monitor a running application, are typically limited compared to those for other types of IO. Examples of such diagnostics include reiteration of configuration parameters, progress indicators, simple metrics (e.g., mass conservation, convergence of solvers, etc.), and timers. To some degree, this difference in priority is justifiable as other forms of output are the primary products of a scientific model and, due to their large data volume, much more likely to be a significant performance concern. In contrast, text-based diagnostic content is generally not shared beyond the individual or group running an application and is most often used to troubleshoot when something goes wrong. We suggest that a more systematic approach enabled by a logging facility (or logger) similar to those routinely used by many communities would provide significant value to complex scientific applications. In the context of high-performance computing, an appropriate logger would provide specialized support for distributed and shared-memory parallelism and have low performance overhead. In this paper, we present our prototype implementation of pFlogger a parallel Fortran-based logging framework, and assess its suitability for use in a complex scientific application.

Fortran↗