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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Nonlinear elasticity with the Shifted Boundary Method

Here, we propose a new unfitted/immersed computational framework for nonlinear solid mechanics, which bypasses the complexities associated with the generation of CAD representations and subsequent body-fitted meshing. This approach allows to speed up the cycle of design and analysis in complex geometry and requires relatively simple computer graphics representations of the surface geometries to be simulated, such as the Standard Tessellation Language (STL format). Complex data structures and integration on cut elements are avoided by means of an approximate boundary representation and a modification (shifting) of the boundary conditions to maintain optimal accuracy. An extensive set of computational experiments in two and three dimensions is included.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2020

Modular performance prediction for scientific workflows using Machine Learning

Scientific workflows provide an opportunity for declarative computational experiment design in an intuitive and efficient way. A distributed workflow is typically executed on a variety of resources, and it uses a variety of computational algorithms or tools to achieve the desired outcomes. Such a variety imposes additional complexity in scheduling these workflows on large scale computers. As computation becomes more distributed, insights into expected workload that a workflow presents become critical for effective resource allocation. In this paper, we present a modular framework that leverages Machine Learning for creating precise performance predictions of a workflow. The central idea is to partition a workflow in such a way that makes the task of forecasting each atomic unit manageable and gives us a way to combine the individual predictions efficiently. We recognize a combination of an executable and a specific physical resource as a single module. This gives us a handle to characterize workload and machine power as a single unit of prediction. Overall, our modular technique of creating atomic modules and deployment of longest-path approach to estimate workflow performance, allows the framework to adapt to highly complex nested directed acyclic workflows and scale to new scenarios, since it does not make assumptions of underlying workflow structure. We present performance estimation results of independent workflow modules executed on the XSEDE SDSC Comet cluster using various Machine Learning algorithms. The results provide insights into the behavior and effectiveness of different algorithms in the context of scientific workflow performance prediction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluating integration and performance of containerized climate applications on a Hewlett Packard Enterprise Cray system

Containers have taken over large swaths of cloud computing as the most convenient way of packaging and deploying applications. The features that containers offer for packaging and deploying applications translate to high performance computing (HPC) as well. At The National Oceanic and Atmospheric Administration, containers provide an easy way to build and distribute complex HPC applications, allowing faster collaboration, portability, and experiment computer environment reproducibility amongst the scientific community. The challenge arises when applications rely on message passing interface (MPI). This necessitates investigation into how to properly run these applications with their own unique requirements and produce performance on par with native runs. We investigate the MPI performance for benchmarks and containerized climate models for various containers covering selection of compiler and MPI library combinations from the Cray provided programming environments on the Cray XC supercomputer GAEA. Performance from the benchmarks and the climate models shows that for the most part containerized applications perform on par with the natively built applications when the system optimized Cray MPICH libraries are bound into the container, and the hybrid model containers have poor performance in comparison. We also describe several challenges and our solutions in running these containers, particularly challenges with heterogeneous jobs for the containerized model runs.

Abraham, Subil↗
DOE OSTI2021

GPU-Accelerated Machine Learning Inference as a Service for Computing in Neutrino Experiments

Machine learning algorithms are becoming increasingly prevalent and performant in the reconstruction of events in accelerator-based neutrino experiments. These sophisticated algorithms can be computationally expensive. At the same time, the data volumes of such experiments are rapidly increasing. The demand to process billions of neutrino events with many machine learning algorithm inferences creates a computing challenge. We explore a computing model in which heterogeneous computing with GPU coprocessors is made available as a web service. The coprocessors can be efficiently and elastically deployed to provide the right amount of computing for a given processing task. With our approach, Services for Optimized Network Inference on Coprocessors (SONIC), we integrate GPU acceleration specifically for the ProtoDUNE-SP reconstruction chain without disrupting the native computing workflow. With our integrated framework, we accelerate the most time-consuming task, track and particle shower hit identification, by a factor of 17. This results in a factor of 2.7 reduction in the total processing time when compared with CPU-only production. For this particular task, only 1 GPU is required for every 68 CPU threads, providing a cost-effective solution.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Approximating Two-Stage Chance-Constrained Programs with Classical Probability Bounds

We consider a joint-chance constraint (JCC) as a union of sets, and approximate this union using bounds from classical probability theory. When these bounds are used in an optimization model constrained by the JCC, we obtain corresponding upper and lower bounds on the optimal objective function value. We compare the strength of these bounds against each other under two different sampling schemes, and observe that a larger correlation between the uncertainties tends to result in more computationally challenging optimization models. We also observe the same set of inequalities to provide the tightest upper and lower bounds in our computational experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The Silver Lining

Clouds are shareable scientific instruments that create the potential for reproducibility by ensuring that all investigators have access to a common execution platform on which computational experiments can be repeated and compared. By virtue of the interface they present, they also lead to the creation of digital artifacts compatible with the cloud, such as images or orchestration templates, that go a long way-and sometimes all the way-to representing an experiment in a digital, repeatable form. In this article, I describe how we developed these natural advantages of clouds in the Chameleon testbed and argue that we should leverage them to create a digital research marketplace that would make repeating experiments as natural and viable part of research as sharing ideas via reading papers is today.

Cloud computing↗
DOE OSTI2019

Effects of organic silicon compounds on syngas auto-ignition behavior

Siloxanes are a significant impurity in syngas feedstocks and an important source of silicon in combustion synthesis applications. However, little is known regarding the fundamental combustion chemistry of siloxane compounds. The impact of two organic silicon species with different but related chemical structures, trimethylsilanol (TMSO) and hexamethyldisiloxane (HMDSO), on syngas auto-ignition behavior was investigated in this study using physical and computational experiments. A rapid compression facility (RCF) was used to create temperatures of 1010–1070 K and pressures of 8–10.3 atm for auto-ignition experiments. Experiments with trace concentrations of TMSO (100 ppm, mole basis) or HMDSO (100 ppm) were added to a surrogate syngas blend (CO and H 2 with a molar ratio of 2.34:1, air levels of dilution, with molar equivalence ratios of Φ = 0.1). The measured ignition delay times showed both siloxane species promote ignition behavior with TMSO yielding faster ignition delay times by approximately 37% and HMDSO yielding faster times by approximately 50% compared with the reference syngas mixture which contained no siloxanes. A computational study was conducted to interpret the results of the ignition experiments. Due to the fact that detailed chemistry does not exist for these organo-silicon compounds, the effects of the addition of CH 3 , H, and OH radicals to H 2 and CO mixtures were explored to simulate the potential rapid decomposition of the siloxanes in the H 2 and CO system. Addition of the radicals decreased the predicted ignition delay times when compared with the H 2 and CO mixture simulations without the radical species, but the simulations did not fully capture the behavior observed in the experiments, indicating the siloxane chemistry is more complex than providing a rapid source of radicals.

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

A data-driven multiscale model for reactive wetting simulations

Here, we describe a data-driven, multiscale technique to model reactive wetting of a silver–aluminum alloy on a Kovar™ (Fe-Ni-Co alloy) surface. We employ molecular dynamics simulations to elucidate the dependence of surface tension and wetting angle on the drop’s composition and temperature. A design of computational experiments is used to efficiently generate training data of surface tension and wetting angle from a limited number of molecular dynamics simulations. The simulation results are used to parameterize models of the material’s wetting properties and compute the uncertainty in the models due to limited data. The data-driven models are incorporated into an engineering-scale (continuum) model of a silver–aluminum sessile drop on a Kovar™ substrate. Model predictions of the wetting angle are compared with experiments of pure silver spreading on Kovar™ to quantify the model-form errors introduced by the limited training data versus the simplifications inherent in the molecular dynamics simulations. The paper presents innovations in the determination of “convergence” of noisy MD simulations before they are used to extract the wetting angle and surface tension, and the construction of their models which approximate physio-chemical processes that are left unresolved by the engineering-scale model. Together, these constitute a multiscale approach that integrates molecular-scale information into continuum scale models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Designing Critical Experiments Using Gaussian Process Optimization

New nuclear applications may lack similarity between the application and existing ICSBEP benchmarks. Without accurate benchmark data, predictive simulations will have high uncertainty in the estimate of a parameter of interest (such as k eff ). The design of critical experiments tuned for specific applications of interest is one solution to reducing uncertainty in the necessarily nuclear data. We propose an optimization technique to design critical experiments that match the cross-section sensitivities of an application model while minimizing the number of simulation runs in the optimization. The optimization of a critical experiment is slow because the potential design space covers many qualitative variables (types of material and geometries) and corresponding quantitative variables (e.g., material dimensions) and the evaluation of any specific design requires running an expensive code like MCNP1 and Whisper. The optimization of expensive black-box computer codes with quantitative variables has been extensively explored in the literature of design of computer experiments. We propose a modified version of standard Gaussian process (GP) optimization that optimizes over multiple discrete configurations of qualitative variables in parallel which reduces the computational cost of the entire optimization. The goal of this work is to minimize the number of MCNP evaluations while still exploring many different design configurations in parallel.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Transient creep‐fatigue crack growth in creep‐brittle materials: Application to Alloy 718

Abstract This study presents incremental finite element computations of creep‐fatigue crack growth in Alloy 718 at in air. Alloy 718 is representative of creep‐brittle materials, in which viscoplastic deformation is restricted near the tip of a growing crack. The computations predict crack growth using a unique combination of an irreversible cohesive zone formulation and a strain gradient viscoplastic material model based on the Kocks–Mecking formulation. Cohesive zone damage parameters are estimated using sustained loading and constant‐amplitude cyclic loading experiments. Computations of crack extension under three different waveforms containing overloads all predict post‐overload retardation. The amount of retardation depends strongly on the overload ratio, consistent with experiments in the literature using similar waveforms. Analysis of the crack‐tip fields demonstrates retardation is associated with unloading in the highly deformed material near the advancing crack tip. Dynamic recovery and geometrically necessary dislocations are shown to significantly influence post‐overload crack extension.

36 MATERIALS SCIENCE↗
DOE OSTI2019

First Annual Report on Pulsed Thermal Tomography Nondestructive Evaluation of Additively Manufactured Reactor Materials and Components: Pulsed Thermal Tomography Nondestructive Examination of Additively Manufactured Reactor Materials and Components

Additive manufacturing (AM, or 3D printing) for commercial nuclear energy applications is an emerging method for cost-efficient manufacturing aimed at replacing aging nuclear reactor parts and reducing costs for new construction. Because of the geometry of metallic structures of interest for nuclear applications, which consist of planar primitives with no symmetry of revolution, limited options are available for nondestructive evaluation (NDE), either during or post manufacturing. Known material flaws in AM include low-density regions consisting of non-sintered powder, which have to be detected to ensure the safety of long-term performance nuclear reactor components. As a solution to NDE of AM, we are developing pulsed thermal tomography (PTT) models and depth inversion algorithms for 3D imaging. PTT has many advantages because the method is non-contact and allows for in-service, NDE of AM nuclear reactor parts. By analyzing transients of surface temperature response due to internal thermal resistances, one can obtain 3D reconstructions of material effusivity using a unique inversion algorithm developed at Argonne. This report provides results of preliminary performance evaluation of PTT capability in detection of flaws in metallic structures, as well imaging complex geometry AM structures. Performance of PTT was investigated through modeling and experiments, Computer models of PTT were developed using COMSOL Heat Transfer module. Defects were modeled as cylindrical flat bottom holes (FBH), which is a common model of calibrated material flaws in thermal tomography experiments. Materials considered in this study include stainless steel 316 (SS316), stainless steel 304 (SS304), and Inconel 718. Theoretical analyses were conducted to validate inversion of simulated PTT data with COMSOL for a plate. Subsequently, 3D reconstructions were performed on COMSOL simulations for FBH, revealing a decrease in spatial resolution over depth due to thermal diffusion. The results of this study show that the performance of the inversion algorithm for detecting smaller defects depends strongly on the depth of the defect as well as the incident heat flux. The size of detectable defect was estimated by fitting a Gaussian function to surface temperature profile. The criteria for detectability was taken as 20mK noise equivalent temperature difference (NETD), which is currently the sensitivity limit of high-performance infrared cameras. It was determined through computer simulations that the smallest detectable FBH in SS316 has a 50µm diameter and is located 0.5mm below the plate surface. Preliminary experimental studies were performed to evaluate PTT performance in detecting calibrated flaws using metallic specimens with AM defects simulated as drilled-in FBH’s. High strength Stainless Steel 316 and Inconel 718 alloys were considered, as well as lower grade Stainless Steel 304, Nickel 200, and Hastelloy C276. Specimens investigated in this report consisted of approximately 1/4in-thick plates made out of these alloys using conventional manufacturing methods. The diameters of FBH’s varied from 1mm to 8mm, and their depths below the plate flat surface varied between 1mm and 6mm. The size of the smallest FBH was limited to 1mm because conventional mechanical drills were used for creating the holes. PTT imaging results have shown that 1mm-diameter FBH located 1mm and 2mm below the surface were detectable. Larger size FBH were detectable at greater depth. For example, 6mm-diameter FBH could be detected at 8mm depth. Image contrast varied slightly between the specimens, with the best reconstructions obtained in SS316 and C276 plates. Finally, PTT capability in imaging several AM structures fabricated from Inconel 718 (IN718) powder feedstock was investigated. The AM structures have complex geometry, but do not have calibrated internal defects. The objective is to determine PTT settings, such as the total integration time, for imaging of representative AM structures. A new FLIR X8500sc IR camera with higher spatial resolution (1280x1024 at 181Hz frame rate) was integrated into the PTT laboratory setup. Software tools were developed to ensure compatibility of new camera files with legacy effusivity reconstruction codes. The new camera was used to obtain 3-D reconstructions of AM IN718 nozzle plate and a particle filter plate. It was shown that PTT can scan through 2/3in-thick Inconel 718 plates in approximately 15s. Several modes of 3-D data visualization were explored, including using ImageJ and MATLAB software packages. The results demonstrate the capability of PTT in 3-D imaging of complex geometry AM structures. Intermediate results demonstrated in this report will be developed further to investigate detection of flaws in AM specimens.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Uncertainty quantification in scientific machine learning: Methods, metrics, and comparisons

Neural networks (NNs) are currently changing the computational paradigm on how to combine data with mathematical laws in physics and engineering in a profound way, tackling challenging inverse and ill-posed problems not solvable with traditional methods. However, quantifying errors and uncertainties in NN-based inference is more complicated than in traditional methods. This is because in addition to aleatoric uncertainty associated with noisy data, there is also uncertainty due to limited data, but also due to NN hyperparameters, overparametrization, optimization and sampling errors as well as model misspecification. Although there are some recent works on uncertainty quantification (UQ) in NNs, there is no systematic investigation of suitable methods towards quantifying the total uncertainty effectively and efficiently even for function approximation, and there is even less work on solving partial differential equations and learning operator mappings between infinite-dimensional function spaces using NNs. In this work, we present a comprehensive framework that includes uncertainty modeling, new and existing solution methods, as well as evaluation metrics and post-hoc improvement approaches. Further, to demonstrate the applicability and reliability of our framework, we present an extensive comparative study in which various methods are tested on prototype problems, including problems with mixed input-output data, and stochastic problems in high dimensions. In the Appendix, we include a comprehensive description of all the UQ methods employed. Further, to help facilitate the deployment of UQ in Scientific Machine Learning research and practice, we present and develop in [1] an open-source Python library (github.com/Crunch-UQ4MI/neuraluq), termed NeuralUQ, that is accompanied by an educational tutorial and additional computational experiments.

11 physics-informed neural networks↗
DOE OSTI2018

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

MapsTorch : automatic differentiation for X-ray fluorescence data analysis

X-ray fluorescence (XRF) is a popular spectroscopy technique for elemental analysis. Spectrum fitting and parameter tuning are at the core of XRF analysis and are conventionally manually intensive, especially for synchrotron experiments involving large amounts of diverse samples. This work introduces the automatic differentiation (AD) technique to XRF and an open-source package called MapsTorch. By transforming an analytical model of the XRF spectrum into a differentiable computation graph with AD, MapsTorch enables robust optimization of parameters and elemental intensities. We evaluate MapsTorch by conducting computational experiments on a large number of historical synchrotron XRF datasets and compare its performance with the currently practiced fitting tool NLopt. The results show that MapsTorch consistently achieves high-quality fits and often leads to better fitting quality than NLopt, particularly in tasks such as initial spectrum fitting and elemental intensity refinement. The robust performance of MapsTorch paves the way for developing automated and high-throughput XRF data analysis workflows to handle the increasing data volumes expected from next-generation synchrotron facilities.

X-ray fluorescence↗
DOE OSTI2025

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Solving Unit Commitment Problems with Demand Responsive Loads: Preprint

This paper focuses on using variations of the Frank-Wolfe algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the RTS-GMLC test system that the time series of demand responsive load decisions obtained through our approach are near optimal and provide details regarding how large scale parallel implementations of our approach can be highly computationally efficient.

demand response↗