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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

A new line-of-sight approach to the non-linear Cosmic Microwave Background

We develop the transport operator formalism, a new line-of-sight integration framework to calculate the anisotropies of the Cosmic Microwave Background (CMB) at the linear and non-linear level. This formalism utilises a transformation operator that removes all inhomogeneous propagation effects acting on the photon distribution function, thus achieving a split between perturbative collisional effects at recombination and non-perturbative line-of-sight effects at later times. The former can be computed in the framework of standard cosmological perturbation theory with a second-order Boltzmann code such as SONG, while the latter can be treated within a separate perturbative scheme allowing the use of non-linear Newtonian potentials. We thus provide a consistent framework to compute all physical effects contained in the Boltzmann equation and to combine the standard remapping approach with Boltzmann codes at any order in perturbation theory, without assuming that all sources are localised at recombination.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

IRIS: A Performance-Portable Framework for Cross-Platform Heterogeneous Computing

From edge to exascale, computer architectures are becoming more heterogeneous and complex. The systems typically have fat nodes, with multicore CPUs and multiple hardware accelerators such as GPUs, FPGAs, and DSPs. This complexity is causing a crisis in programming systems and performance portability. Several programming systems are working to address these challenges, but the increasing architectural diversity is forcing software stacks and applications to be specialized for each architecture. As we show, all of these approaches critically depend on their software framework for discovery, execution, scheduling, and data orchestration. To address this challenge, we believe that a more agile and proactive software framework is essential to increase performance portability and improve user productivity. To this end, we have designed and implemented IRIS: a performance-portable framework for cross-platform heterogeneous computing. IRIS can discover available resources, manage multiple diverse programming platforms (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, OpenMP) simultaneously in the same execution, respect data dependencies, orchestrate data movement proactively, and provide for user-configurable scheduling. To simplify data movement, IRIS introduces a shared virtual device memory with relaxed consistency among different heterogeneous devices. IRIS also adds an automatic kernel workload partitioning technique using the polyhedral model so that it can resize kernels for a wide range of devices. Our evaluation on three architectures, ranging from Qualcomm Snapdragon to a Summit supercomputer node, shows that IRIS improves portability across a wide range of diverse heterogeneous architectures with negligible overhead.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards Z-Next: The Integration of Theory, Experiments, and Computational Simulation in a Bayesian Data Assimilation Framework

Making reliable predictions in the presence of uncertainty is critical to high-consequence modeling and simulation activities, such as those encountered at Sandia National Laboratories. Surrogate or reduced-order models are often used to mitigate the expense of performing quality uncertainty analyses with high-fidelity, physics-based codes. However, phenomenological surrogate models do not always adhere to important physics and system properties. This project develops surrogate models that integrate physical theory with experimental data through a maximally-informative framework that accounts for the many uncertainties present in computational modeling problems. Correlations between relevant outputs are preserved through the use of multi-output or co-predictive surrogate models; known physical properties (specifically monotoncity) are also preserved; and unknown physics and phenomena are detected using a causal analysis. By endowing surrogate models with key properties of the physical system being studied, their predictive power is arguably enhanced, allowing for reliable simulations and analyses at a reduced computational cost.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Average Rényi entanglement entropy in Gaussian boson sampling

Recently, many experiments have been conducted with the goal of demonstrating a quantum advantage over classical computation. One popular framework for these experiments is Gaussian boson sampling, where quadratic photonic input states are interfered via a linear optical unitary and subsequently measured in the Fock basis. In this paper, we study the modal entanglement of the output states in this framework just before the measurement stage. Specifically, we compute Page curves as measured by various Rényi- α entropies, where the Page curve describes the entanglement between two partitioned groups of output modes averaged over all linear optical unitaries. We derive these formulas for α = 1 (i.e., the von Neumann entropy) and, more generally, for all positive integer α , in the asymptotic limit of infinite number of modes and for input states that are composed of single-mode-squeezed-vacuum state with equal squeezing strength. We then analyze the limiting behaviors when the squeezing is small and large. Having determined the averages, we then explicitly calculate the Rényi- α variance for integers α > 1 and are able to show that these entropies are weakly typical. Published by the American Physical Society 2025

Youm, Jason (ORCID:0009000057597782)↗
NASA NTRS2016

Improving Fidelity of Launch Vehicle Liftoff Acoustic Simulations

Launch vehicles experience high acoustic loads during ignition and liftoff affected by the interaction of rocket plume generated acoustic waves with launch pad structures. Application of highly parallelized Computational Fluid Dynamics (CFD) analysis tools optimized for application on the NAS computer systems such as the Loci/CHEM program now enable simulation of time-accurate, turbulent, multi-species plume formation and interaction with launch pad geometry and capture the generation of acoustic noise at the source regions in the plume shear layers and impingement regions. These CFD solvers are robust in capturing the acoustic fluctuations, but they are too dissipative to accurately resolve the propagation of the acoustic waves throughout the launch environment domain along the vehicle. A hybrid Computational Fluid Dynamics and Computational Aero-Acoustics (CFD/CAA) modeling framework has been developed to improve such liftoff acoustic environment predictions. The framework combines the existing highly-scalable NASA production CFD code, Loci/CHEM, with a high-order accurate discontinuous Galerkin (DG) solver, Loci/THRUST, developed in the same computational framework. Loci/THRUST employs a low dissipation, high-order, unstructured DG method to accurately propagate acoustic waves away from the source regions across large distances. The DG solver is currently capable of solving up to 4th order solutions for non-linear, conservative acoustic field propagation. Higher order boundary conditions are implemented to accurately model the reflection and refraction of acoustic waves on launch pad components. The DG solver accepts generalized unstructured meshes, enabling efficient application of common mesh generation tools for CHEM and THRUST simulations. The DG solution is coupled with the CFD solution at interface boundaries placed near the CFD acoustic source regions. Both simulations are executed simultaneously with coordinated boundary condition data exchange.

Liever, Peter↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Task allocation in a distributed computing system

A conceptual framework is examined for task allocation in distributed systems. Application and computing system parameters critical to task allocation decision processes are discussed. Task allocation techniques are addressed which focus on achieving a balance in the load distribution among the system's processors. Equalization of computing load among the processing elements is the goal. Examples of system performance are presented for specific applications. Both static and dynamic allocation of tasks are considered and system performance is evaluated using different task allocation methodologies.

Seward, Walter D.↗
DOE OSTI2021

Realizing the data-driven, computational discovery of metal-organic framework catalysts

Metal-organic frameworks (MOFs) have been widely investigated for challenging catalytic transformations due to their well-defined structures and high degree of synthetic tunability. These features, at least in principle, make MOFs ideally suited for a computational approach towards catalyst design and discovery. Nonetheless, the widespread use of data science and machine learning to accelerate the discovery of MOF catalysts has yet to be substantially realized. In this review, we provide an overview of recent work that sets the stage for future high-throughput computational screening and machine learning studies involving MOF catalysts. This is followed by a discussion of several challenges currently facing the broad adoption of data-centric approaches in MOF computational catalysis, and we share possible solutions that can help propel the field forward.

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

Field-Driven Simulations to Probe the Impact of Ionic Correlations on Solution Transport Coefficients in Binary, Ternary, and Reciprocal Quaternary Aqueous Electrolytes

Ionic correlations play a critical role in governing transport properties of mixed-salt aqueous electrolyte solutions, yet their quantitative characterization remains challenging, particularly for multicomponent aqueous systems. Here, we develop a general nonequilibrium molecular dynamics framework to efficiently compute Onsager transport coefficients and ionic correlations in mixed-salt aqueous solutions. Using field-driven simulations, we obtain accurate Onsager matrices for LiCl/ KCl, KCl/KBr, and LiBr/KCl electrolyte solutions with significantly reduced computational cost relative to equilibrium Green−Kubo methods. The framework enables direct assessment of how attractive cation−anion and repulsive like-ion interactions contribute to conductivity and salt diffusivity across compositions. While static ion pairing exhibits strong composition dependence, dynamic ion correlations remain nearly invariant, leading to constant deviations from Nernst−Einstein predictions. These results highlight the disconnect between static ion association and dynamic transport correlations, and they establish a transferable approach for analyzing ion transport in complex electrolyte environments relevant to separation processes and electrochemical systems.

36 MATERIALS SCIENCE↗
DOE OSTI2017

High-Throughput Computational Screening of Multivariate Metal–Organic Frameworks (MTV-MOFs) for CO 2 Capture

Multivariate metal–organic frameworks (MTV-MOFs) contain multiple linker types within a single structure. Arrangements of linkers containing different functional groups confer structural diversity and surface heterogeneity and result in a combinatorial explosion in the number of possible structures. Here, we carried out high-throughput computational screening of a large number of computer-generated MTV-MOFs to assess their CO 2 capture properties using grand canonical Monte Carlo simulations. The results demonstrate that functionalization enhances CO 2 capture performance of MTV-MOFs when compared to their parent (unfunctionalized) counterparts, and the pore size plays a dominant role in determining the CO 2 adsorption capabilities of MTV-MOFs irrespective of the combinations of the three functional groups (-F, -NH 2 , and -OCH 3 ) that we explored. We also found that the functionalization of parent MOFs with small pores led to larger enhancements in CO 2 uptake and CO 2 /N 2 selectivity than functionalization in larger-pore MOFs. Free energy contour maps are presented to visually compare the influence of linker functionalization between frameworks with large and small pores.

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

OpenACC to FPGA: A Framework for Directive-based High-Performance Reconfigurable Computing

This paper presents a directive-based, high-level programming framework for high-performance reconfigurable computing. It takes a standard, portable OpenACC C program as input and generates a hardware configuration file for execution on FPGAs. We implemented this prototype system using our open-source OpenARC compiler; it performs source-to-source translation and optimization of the input OpenACC program into an OpenCL code, which is further compiled into a FPGA program by the backend Altera Offline OpenCL compiler. Internally, the design of OpenARC uses a high- level intermediate representation that separates concerns of program representation from underlying architectures, which facilitates portability of OpenARC. In fact, this design allowed us to create the OpenACC-to-FPGA translation framework with minimal extensions to our existing system. In addition, we show that our proposed FPGA-specific compiler optimizations and novel OpenACC pragma extensions assist the compiler in generating more efficient FPGA hardware configuration files. Our empirical evaluation on an Altera Stratix V FPGA with eight OpenACC benchmarks demonstrate the benefits of our strategy. To demonstrate the portability of OpenARC, we show results for the same benchmarks executing on other heterogeneous platforms, including NVIDIA GPUs, AMD GPUs, and Intel Xeon Phis. This initial evidence helps support the goal of using a directive-based, high-level programming strategy for performance portability across heterogeneous HPC architectures.

Lee, Seyong↗
DOE OSTI2024

Liquid Crystal Orientation and Shape Optimization for the Active Response of Liquid Crystal Elastomers

Liquid crystal elastomers (LCEs) are responsive materials that can undergo large reversible deformations upon exposure to external stimuli, such as electrical and thermal fields. Controlling the alignment of their liquid crystals mesogens to achieve desired shape changes unlocks a new design paradigm that is unavailable when using traditional materials. While experimental measurements can provide valuable insights into their behavior, computational analysis is essential to exploit their full potential. Accurate simulation is not, however, the end goal; rather, it is the means to achieve their optimal design. Such design optimization problems are best solved with algorithms that require gradients, i.e., sensitivities, of the cost and constraint functions with respect to the design parameters, to efficiently traverse the design space. In this work, a nonlinear LCE model and adjoint sensitivity analysis are implemented in a scalable and flexible finite element-based open source framework and integrated into a gradient-based design optimization tool. To display the versatility of the computational framework, LCE design problems that optimize both the material, i.e., liquid crystal orientation, and structural shape to reach a target actuated shapes or maximize energy absorption are solved. Multiple parameterizations, customized to address fabrication limitations, are investigated in both 2D and 3D. The case studies are followed by a discussion on the simulation and design optimization hurdles, as well as potential avenues for improving the robustness of similar computational frameworks for applications of interest.

42 ENGINEERING↗
NASA NTRS1998

Integration of a CAD System Into an MDO Framework

NASA Langley has developed a heterogeneous distributed computing environment, called the Framework for Inter-disciplinary Design Optimization, or FIDO. Its purpose has been to demonstrate framework technical feasibility and usefulness for optimizing the preliminary design of complex systems and to provide a working environment for testing optimization schemes. Its initial implementation has been for a simplified model of preliminary design of a high-speed civil transport. Upgrades being considered for the FIDO system include a more complete geometry description, required by high-fidelity aerodynamics and structures codes and based on a commercial Computer Aided Design (CAD) system. This report presents the philosophy behind some of the decisions that have shaped the FIDO system and gives a brief case study of the problems and successes encountered in integrating a CAD system into the FEDO framework.

Townsend, J. C.↗
DOE OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗
DOE OSTI2025

HARD: A performance portable radiation hydrodynamics code based on FleCSI framework

Hydrodynamics And Radiation Diffusion (HARD) is an open-source application for high-performance simulations of compressible hydrodynamics with radiation-diffusion coupling. Built on the FleCSI (Bergen et al., 2021 [1]) (Flexible Computational Science Infrastructure) framework, HARD expresses its computational units as tasks whose execution can be orchestrated by multiple back-end runtimes, including Legion (Bauer et al., 2012 [2]), MPI (Forum, 1994 [3]), and HPX (Kaiser et al., 2020 [4]). Node-level parallelism is handled through Kokkos (Edwards et al., 2014 [5]), providing a single-source, portable code base that runs efficiently on laptops, small homogeneous clusters, and the largest heterogeneous supercomputers currently available. To ensure scientific reliability, HARD includes a regression test suite that automatically reproduces canonical verification problems such as the Sod and LeBlanc shock tubes, and the Sedov blast wave, comparing numerical solutions against known analytical results. The project is distributed under an OSI-approved license, hosted on GitHub, and accompanied by reproducible build scripts and continuous integration workflows. This combination of performance portability, verification infrastructure, and community-focused development makes HARD a sustainable platform for advancing radiation hydrodynamics research across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Inverse problem in the large momentum effective theory framework

One proposal to compute parton distributions from first principles is the large momentum effective theory (LaMET), which requires the Fourier transform of matrix elements computed nonperturbatively. Lattice quantum chromodynamics (QCD) provides calculations of these matrix elements over a finite range of Fourier harmonics that are often noisy or unreliable in the largest computed harmonics. It has been suggested that enforcing an exponential decay of the missing harmonics helps alleviate this issue. Using nonperturbative data, we show that the uncertainty introduced by this inverse problem in a realistic setup remains significant without very restrictive assumptions, and that the importance of the exact asymptotic behavior is minimal for values of 𝑥 where the framework is currently applicable. We show that the crux of the inverse problem lies in harmonics of the order of 𝜆 = 𝑧⁢𝑃 𝑧 ∼ 5–15, where the signal in the lattice data is often barely existent in current studies, and the asymptotic behavior is not firmly established. We stress the need for more sophisticated techniques to account for this inverse problem, whether in the LaMET or related frameworks like the short-distance factorization. We also address a misconception that, with available lattice methods, the LaMET framework allows a “direct” computation of the 𝑥-dependence, whereas the alternative short-distance factorization only gives access to moments or fits of the 𝑥-dependence.

Dutrieux, Hervé [Aix-Marseille Université, Marseil↗
DOE OSTI2024

Error mitigation in variational quantum eigensolvers using tailored probabilistic machine learning

Quantum computing technology has the potential to revolutionize the simulation of materials and molecules in the near future. A primary challenge in achieving near-term quantum advantage is effectively mitigating the noise effects inherent in current quantum processing units (QPUs). This challenge is also decisive in the context of quantum-classical hybrid schemes employing variational quantum eigensolvers (VQEs) that have attracted significant interest in recent years. In this paper, we present a method that employs parametric Gaussian process regression (GPR) within an active learning framework to mitigate noise in quantum computations, focusing on VQEs. Our approach, grounded in probabilistic machine learning, exploits a custom prior based on the VQE ansatz to capture the underlying correlations between VQE outputs for different variational parameters, thereby enhancing both accuracy and efficiency. We demonstrate the effectiveness of our method on a two-site Anderson impurity model and a eight-site Heisenberg model, using the IBM open-source quantum computing framework, Qiskit, showcasing substantial improvements in the accuracy of VQE outputs while reducing the number of direct QPU energy evaluations. This paper contributes to the ongoing efforts in quantum-error mitigation and optimization, bringing us a step closer to realizing the potential of quantum computing in quantum matter simulations. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗