Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer experiments”

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 109 records · Page 6

Probabilistic Perturbations in Flexible Production Systems

In formulating the engineering principles for flexible production systems, the probabilistic perturbations of their operation must be taken into account. A set of computational experiments based on a special computer application is described. The place of the proposed method in the overall predesign sequence is established.

42 ENGINEERING↗

Unifying Quantum Materials Modeling and Experiments: The Role of Machine Learning Interatomic Potentials

Computational experiments have emerged as a powerful complement to traditional experiments in the design of new materials. The development of machine learning (ML) and deep learning techniques, combined with database construction and data mining, has significantly enhanced traditional quantum mechanical methods. This synergy enables the rapid development of structure-property relationships. In this talk, I will discuss our recent efforts in applying Machine Learning Interatomic Potentials (MLIAPs) to accelerate materials modeling across various material classes and challenging applications where traditional methods fall short. First, I will highlight the success of MLIAPs in accurately modeling the melting behavior of complex materials. Our results demonstrate high fidelity with experimental observations and also with calculated reference melting temperatures. In the second application, I will discuss how MLIAPs are trained and applied to elucidate the interplay between segregation tendencies and surface reconstructions in CuNi alloys under oxidizing conditions. A key factor in the success of these MLIAP applications is the design of minimalistic yet flexible datasets along with a computational framework for training MLIAPs.

Saidi, Wissam↗

Bayesian D‐Optimal Designs for Gaussian Process Surrogate Models

Computer experiments often employ space-filling strategies to create surrogate models with strong predictive performance. The impact of model parameter estimation for Gaussian process surrogates, however, is often overlooked. Obtaining a better initial estimate of the covariance lengthscale parameter, θ, can greatly improve the resulting Gaussian process fit through more effective sequential acquisitions during active learning. In this work, we propose a novel initial design maximizing the Bayesian D-optimality criterion of the Gaussian process lengthscale parameter. Previously published results have shown the emphasis on lengthscale estimation to be promising, but relied on an empirically driven design creation process. Our Bayesian D-optimal designs are rooted in information theory and lead to more informative sequential acquisitions by improving lengthscale estimation. In many cases, these gains eventually result in better surrogates than those seeded with space-filling initial designs. Furthermore, Bayesian D-optimal designs can be tailored to either isotropic or anisotropic covariance structures, and the Bayesian framework enables the inclusion of prior knowledge in the design process, offering greater flexibility and adaptability. Through several simulation studies, we demonstrate the advantages of Bayesian D-optimal designs in terms of both lengthscale estimation accuracy and predictive performance during active learning.

Bayesian experimental design↗

Decomposing the Train-Scheduling Problem into Integer-Optimal Polytopes

This paper presents conditions for which the linear relaxation for the train-scheduling problem is integer optimal. These conditions are then used to identify how to partition a general problem’s feasible region into integer-optimal polytopes. Such an approach yields an extended formulation that contains far fewer binary variables. Our computational experiments show that this approach results in significant computational savings. Moreover, this approach scales well when the train-scheduling problem is modeled using smaller time increments, allowing for higher fidelity models to be solved without significantly increasing the required computational time.

97 MATHEMATICS AND COMPUTING↗

DUNE Computing [Slides]

DUNE’s main purpose is to understand neutrino properties. This presentation covers: The experiment, Computational challenges, Results from prototypes, and Towards common solutions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Subsurface Noble Gas Sampling Manual

The intent of this document is to provide information about best available approaches for performing subsurface soil gas sampling during an On Site Inspection or OSI. This information is based on field sampling experiments, computer simulations and data from the NA-22 Noble Gas Signature Experiment Test Bed at the Nevada Nuclear Security Site (NNSS). The approaches should optimize the gas concentration from the subsurface cavity or chimney regime while simultaneously minimizing the potential for atmospheric radioxenon and near-surface Argon-37 contamination. Where possible, we quantitatively assess differences in sampling practices for the same sets of environmental conditions. We recognize that all sampling scenarios cannot be addressed. However, if this document helps to inform the intuition of the reader about addressing the challenges resulting from the inevitable deviations from the scenario assumed here, it will have achieved its goal.

58 GEOSCIENCES↗

Towards Quantum Gravity in the Lab on Quantum Processors

The holographic principle and its realization in the AdS/CFT correspondence led to unexpected connections between general relativity and quantum information. This set the stage for studying aspects of quantum gravity models, which are otherwise difficult to access, in table-top quantum-computational experiments. Recent works have designed a special teleportation protocol that realizes a surprising communication phenomenon most naturally explained by the physics of a traversable wormhole. In this work, we have carried out quantum experiments based on this protocol on state-of-the-art quantum computers. The target quantum processing units (QPUs) included the Quantinuum's trapped-ion System Model H1-1 and five IBM superconducting QPUs of various architectures, with public and premium user access. We report the observed teleportation signals from these QPUs with the best one reaching 80% of theoretical predictions. We outline the experimental challenges we have faced in the course of implementation, as well as the new theoretical insights into quantum dynamics the work has led to. We also developed QGLab – an open-source end-to-end software solution that facilitates conducting the wormhole-inspired teleportation experiments on state-of-the-art and emergent generations of QPUs supported by the Q i s k i t and t k e t SDKs. We consider our study and deliverables as an early practical step towards the realization of more complex experiments for the indirect probing of quantum gravity in the lab.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The OSG open facility: A sharing ecosystem

The Open Science Grid (OSG) ties together individual experiments’ computing power, connecting their resources to create a large, robust computing grid, this computing infrastructure started primarily as a collection of sites associated with large HEP experiments such as ATLAS, CDF, CMS, and DZero. In the years since, the OSG has broadened its focus to also address the needs of other US researchers and increased delivery of Distributed High Through-put Computing (DHTC) to users from a wide variety of disciplines via the OSG Open Facility. Presently, the Open Facility delivers about 100 million computing wall hours per year to researchers who are not already associated with the owners of the computing sites, this is primarily accomplished by harvesting and organizing the temporarily unused capacity (i.e. opportunistic cycles) from the sites in the OSG. Using these methods, OSG resource providers and scientists share computing hours with researchers in many other fields to enable their science, striving to make sure that these computing power used with maximal efficiency. Furthermore, we believe that expanded access to DHTC is an essential tool for scientific innovation and work continues in expanding this service.

97 MATHEMATICS AND COMPUTING↗

Scalable In Situ Computation of Lagrangian Representations via Local Flow Maps

In situ computation of Lagrangian flow maps to enable post hoc time-varying vector field analysis has recently become an active area of research. However, the current literature is largely limited to theoretical settings and lacks a solution to address scalability of the technique in distributed memory. To improve scalability, we propose and evaluate the benefits and limitations of a simple, yet novel, performance optimization. Our proposed optimization is a communication-free model resulting in local Lagrangian flow maps, requiring no message passing or synchronization between processes, intrinsically improving scalability, and thereby reducing overall execution time and alleviating the encumbrance placed on simulation codes from communication overheads. To evaluate our approach, we computed Lagrangian flow maps for four time-varying simulation vector fields and investigated how execution time and reconstruction accuracy are impacted by the number of GPUs per compute node, the total number of compute nodes, particles per rank, and storage intervals. Our study consisted of experiments computing Lagrangian flow maps with up to 67M particle trajectories over 500 cycles and used as many as 2048 GPUs across 512 compute nodes. In all, our study contributes an evaluation of a communication-free model as well as a scalability study of computing distributed Lagrangian flow maps at scale using in situ infrastructure on a modern supercomputer.

Sane, Sudhanshu↗

XCP- Computational Summer Workshop: Equation of State Overview [Slides]

An overview of Equation of State (EOS) theory, some relevant physics, experiments, computational methods, and the SESAME database will be presented. The goal will be to describe what types of data and modeling are required to make an EOS that typically spans up to ~10 9 GPa in pressure and 10 9 K in temperature.

42 ENGINEERING↗

Optimization of the configuration of manufacturing systems

Software for optimizing the configuration of manufacturing systems so as to reduce expenditures in all stages of the product life cycle is considered. Mathematical expressions are given for the three crossover operators used in the genetic optimization algorithm. A computational experiment indicates the most effective crossover operator.

42 ENGINEERING↗

Equation of state of boron nitride combining computation, modeling, and experiment

The equation of state (EOS) of materials at warm dense conditions poses significant challenges to both theory and experiment. We report a combined computational, modeling, and experimental investigation leveraging new theoretical and experimental capabilities to investigate warm-dense boron nitride (BN). The simulation methodologies include path integral Monte Carlo (PIMC), several density functional theory (DFT) molecular dynamics methods [plane-wave pseudopotential, Fermi operator expansion (FOE), and spectral quadrature (SQ)], activity expansion (actex), and all-electron Green's function Korringa-Kohn-Rostoker (mecca), and compute the pressure and internal energy of BN over a broad range of densities and temperatures. Our experiments were conducted at the Omega laser facility and the Hugoniot response of BN to unprecedented pressures (1200–2650 GPa). The EOSs computed using different methods cross validate one another in the warm-dense matter regime, and the experimental Hugoniot data are in good agreement with our theoretical predictions. By comparing the EOS results from different methods, we assess that the largest discrepancies between theoretical predictions are ≲ 4% in pressure and ≲ 3% in energy and occur at 10 6 K, slightly below the peak compression that corresponds to the K -shell ionization regime. At these conditions, we find remarkable consistency between the EOS from DFT calculations performed on different platforms and using different exchange-correlation functionals and those from PIMC using free-particle nodes. This provides strong evidence for the accuracy of both PIMC and DFT in the high-pressure, high-temperature regime. Moreover, the recently developed SQ and FOE methods produce EOS data that have significantly smaller statistical error bars than PIMC, and so represent significant advances for efficient computation at high temperatures. The shock Hugoniot predicted by PIMC, actex, and mecca shows a maximum compression ratio of 4.55 ± 0.05 for an initial density of 2.26 g/cm 3 , higher than the Thomas-Fermi predictions by about 5%. In addition, we construct tabular EOS models that are consistent with the first-principles simulations and the experimental data. Our findings clarify the ionic and electronic structure of BN over a broad range of temperatures and densities and quantify their roles in the EOS and properties of this material. The tabular models may be utilized for future simulations of laser-driven experiments that include BN as a candidate ablator material.

36 MATERIALS SCIENCE↗

An investigation of exploitation versus exploration in GBEA optimization of PORS 15 and 16 Problems

It was hypothesized that the variations in time to solution are driven by the competing mechanisms of exploration and exploitation.This thesis explores this hypothesis by examining two contrasting problems that embody the hypothesized tradeoff between exploration and exploitation. Plus one recall store (PORS) is an optimization problem based on the idea of a simple calculator with four buttons: plus, one, store, and recall. Integer addition and store are classified as operations, and one and memory recall are classified as terminals. The goal is to arrange a fixed number of keystrokes in a way that maximizes the numerical result. PORS 15 (15 keystrokes) represents the subset of difficult PORS problems and PORS 16 (16 keystrokes) represents the subset of PORS problems that are easiest to optimize. The goal of this work is to examine the tradeoff between exploitation and exploration in graph based evolutionary algorithm (GBEA) optimization. To do this, computational experiments are used to examine how solutions evolve in PORS 15 and 16 problems when solved using GBEAs. The experiment is comprised of three components; the graphs and the population, the evolutionary algorithm rule set, and the example problems. The complete, hypercube, and cycle graphs were used for this experiment. A fixed population size was used.

97 MATHEMATICS AND COMPUTING↗

Review on modeling of the anode solid electrolyte interphase (SEI) for lithium-ion batteries

A passivation layer called the solid electrolyte interphase (SEI) is formed on electrode surfaces from decomposition products of electrolytes. The SEI allows Li + transport and blocks electrons in order to prevent further electrolyte decomposition and ensure continued electrochemical reactions. The formation and growth mechanism of the nanometer thick SEI films are yet to be completely understood owing to their complex structure and lack of reliable in situ experimental techniques. Significant advances in computational methods have made it possible to predictively model the fundamentals of SEI. This review aims to give an overview of state-of-the-art modeling progress in the investigation of SEI films on the anodes, ranging from electronic structure calculations to mesoscale modeling, covering the thermodynamics and kinetics of electrolyte reduction reactions, SEI formation, modification through electrolyte design, correlation of SEI properties with battery performance, and the artificial SEI design. Multi-scale simulations have been summarized and compared with each other as well as with experiments. Computational details of the fundamental properties of SEI, such as electron tunneling, Li-ion transport, chemical/mechanical stability of the bulk SEI and electrode/(SEI/) electrolyte interfaces have been discussed. This review shows the potential of computational approaches in the deconvolution of SEI properties and design of artificial SEI. We believe that computational modeling can be integrated with experiments to complement each other and lead to a better understanding of the complex SEI for the development of a highly efficient battery in the future.

25 ENERGY STORAGE↗

A Benders based rolling horizon algorithm for a dynamic facility location problem

This study presents a well-known capacitated dynamic facility location problem (DFLP) that satisfies the customer demand at a minimum cost by determining the time period for opening, closing, or retaining an existing facility in a given location. To solve this challenging NP-hard problem, this paper develops a unique hybrid solution algorithm that combines a rolling horizon algorithm with an accelerated Benders decomposition algorithm. Extensive computational experiments are performed on benchmark test instances to evaluate the hybrid algorithm’s efficiency and robustness in solving the DFLP problem. Computational results indicate that the hybrid Benders based rolling horizon algorithm consistently offers high quality feasible solutions in a much shorter computational time period than the standalone rolling horizon and accelerated Benders decomposition algorithms in the experimental range.

97 MATHEMATICS AND COMPUTING↗

Coarse-grained computation for particle coagulation and sintering processes by linking Quadrature Method of Moments with Monte-Carlo

The study of particle coagulation and sintering processes is important in a variety of research studies ranging from cell fusion and dust motion to aerosol formation applications. These processes are traditionally simulated using either Monte-Carlo methods or integro-differential equations for particle number density functions. In this paper, we present a computational technique for cases where we believe that accurate closed evolution equations for a finite number of moments of the density function exist in principle, but are not explicitly available. The so-called equation-free computational framework is then employed to numerically obtain the solution of these unavailable closed moment equations by exploiting (through intelligent design of computational experiments) the corresponding fine-scale (here, Monte-Carlo) simulation. We illustrate the use of this method by accelerating the computation of evolving moments of uni- and bivariate particle coagulation and sintering through short simulation bursts of a constant-number Monte-Carlo scheme.

97 MATHEMATICS AND COMPUTING↗