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 127 records · Page 7

Coarse-grained simulations of vortex dynamics and transition in complex high-Re flows

Turbulent flow complexity in applications in engineering, geophysics and astrophysics typically requires achieving accurate and dependable large scale predictions of highly nonlinear processes with under-resolved computer simulation models. Laboratory observations typically demonstrate the end outcome of complex non-linear three-dimensional physical processes with many unexplained details and mechanisms. Carefully controlled computational experiments based on the numerical solution of the conservation equations for mass, momentum, and energy, provide insights into the underlying flow dynamics. Relevant computational fluid dynamics issues to be addressed relate to the modeling of the unresolved tlow conditions at the subgrid scale (SGS) level - within a computational cell, and at the supergrid (SPG) scale - at initialization and beyond computational boundaries. SGS and SPG information must be prescribed for closure of the equations solved numerically. SGS models appear explicitly or implicitly as additional source tenns in the modified flow equations solved by the numerical solutions being calculated, while SPG models provide the necessary set of initial and boundary conditions that must be prescribed to ensure unique well-posed solutions. From this perspective, it is clear that the simulation process is inherently determined by the SGS and SPG information prescription process. On the other hand, observables in laboratory experiments are always characterized by the finite scales of the instrumental resolution of measuring/visualizing devices, and subject as well to SPG issues. It is thus important to recognize the inherently intrusive nature of observations based on numerical or laboratory experiments. Ultimately, verification and validation (V & V) frameworks and appropriate metrics for the specific problems at hand are needed to establish predictability of the simulation model. Direct numerical simulation (DNS) - resolving all relevant space/time scales, is prohibitively expensive in the foreseeable future for most practical flows of interest at moderate-to-high Reynolds number (Re). On the other end of the simulation spectrum are the Reynolds-Averaged Navier-Stokes (RANS) approaches - which model the turbulent effects. In the coarsegrained large eddy simulation (LES) strategies, the large energy containing structures are resolved, the smaller structures are filtered out, and unresolved SGS effects are modeled. By necessity - rather than choice, LES effectively becomes the intermediate approach between DNS and RANS. Extensive work has demonstrated that predictive simulations of turbulent velocity fields are possible using a particular LES denoted implicit LES (ILES), using the class of nonoscillatory finite-volume (NFV) numerical algorithms. Use of the modified equation as framework for theoretical analysis, demonstrates that leading truncation tenns associated with NFV methods provide implicit SGS models of mixed anisotropic type and regularized motion of discrete observables. Tests in fundamental applications ranging from canonical to very complex flows indicate that ILES is competitive with conventional LES in the LES realm proper - flows driven by large scale features. High-Re flows are vortex dominated and governed by short convective timescales compared to those of diffusion, and kinematically characterized at the smallest scales by slender worm vortices with insignificant internal structure. This motivates nominally inviscid ILES methods capable of capturing the high-Re dissipation dynamics and of handling vortices as shocks in shock capturing schemes. Depending on flow regimes, initial conditions, and resolution, additional modeling may be needed to emulate SGS driven physics, such as backscatter, chemical reaction, material mixing, and near-wall flow-dynamics - where typically-intertwined SGS/SPG issues need to be addressed. A major research focus is recognizing when additional explicit models and/or numerical treatments are needed and ensuring that mixed explicit and implicit SGS models can effectively act in collaborative rather than interfering fashion. We survey our present understanding of the theoretical basis of lLES, including connections with the classical LES and finite-scale dynamics perspectives. Examples from recent lLES studies are presented, including canonical turbulence test cases and shock driven turbulence; relevant V & V issues are demonstrated in this context.

58 GEOSCIENCES↗

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

Computational Modeling To Adapt Neutralizing Antibody

Monoclonal antibodies (mAbs) is the leading therapy for viral infections because it provides immediate protection and can be administered at higher levels than in a natural immune response. Finding mAbs that neutralize a broad spectrum of viral targets has proven difficult because many species and strains exist and blanket targeting is a slow and laborious process to experimentally screen 108 variants. A new method is needed to rapidly redesign mAbs for homologous targets. This project speeds up redesign using structure-based computational design to reduce the mAbs search space to a manageable level and screen mutants at a much higher rate than in experiments. Computation will also provide critical knowledge about the fundamental interactions. The project will adapt S230, a human antibody that neutralizes SARS-CoV, to neutralize SARS-COV-2.

60 APPLIED LIFE SCIENCES↗

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↗

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]↗

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↗

Data Assimilation - Advances and Applications

This presentation provides an overview of data assimilation (model calibration) for complex computer experiments. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Utilization of surrogate models and empirical adjustment for model form error in code calibration form the basis for the statistical methodology considered. The role of probabilistic code calibration in supporting code validation is discussed. Incorporation of model form uncertainty in rigorous uncertainty quantification (UQ) analyses is also addressed. Design criteria used within a batch sequential design algorithm are introduced for efficiently achieving predictive maturity and improved code calibration. Predictive maturity refers to obtaining stable predictive inference with calibrated computer codes. These approaches allow for augmentation of initial experiment designs for collecting new physical data. A standard framework for data assimilation is presented and techniques for updating the posterior distribution of the state variables based on particle filtering and the ensemble Kalman filter are introduced.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Web-based, GPU-accelerated, Monte Carlo simulation and visualization of indirect radiation imaging detector performance

Purpose: Monte Carlo simulations play a vital role in the understanding of the fundamental limitations, design, and optimization of existing and emerging medical imaging systems. Efforts in this area have resulted in the development of a wide variety of open-source software packages. One such package, hybridMANTIS, uses a novel hybrid concept to model indirect scintillator detectors by balancing the computational load using dual CPU and graphics processing unit (GPU) processors, obtaining computational efficiency with reasonable accuracy. In this work, the authors describe two open-source visualization interfaces, webMANTIS and visualMANTIS to facilitate the setup of computational experiments via hybridMANTIS. Methods: The visualization tools visualMANTIS and webMANTIS enable the user to control simulation properties through a user interface. In the case of webMANTIS, control via a web browser allows access through mobile devices such as smartphones or tablets. webMANTIS acts as a server back-end and communicates with an NVIDIA GPU computing cluster that can support multiuser environments where users can execute different experiments in parallel. Results: The output consists of point response and pulse-height spectrum, and optical transport statistics generated by hybridMANTIS. The users can download the output images and statistics through a zip file for future reference. In addition, webMANTIS provides a visualization window that displays a few selected optical photon path as they get transported through the detector columns and allows the user to trace the history of the optical photons. Conclusions: The visualization tools visualMANTIS and webMANTIS provide features such as on the fly generation of pulse-height spectra and response functions for microcolumnar x-ray imagers while allowing users to save simulation parameters and results from prior experiments. The graphical interfaces simplify the simulation setup and allow the user to go directly from specifying input parameters to receiving visual feedback for the model predictions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

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↗

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↗

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↗

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗

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↗

Designing Experiments Through Compressed Sensing

In the following paper, we discuss how to design an ensemble of experiments through the use of compressed sensing. Specifically, we show how to conduct a small number of physical experiments and then use compressed sensing to reconstruct a larger set of data. In order to accomplish this, we organize our results into four sections. We begin by extending the theory of compressed sensing to a finite product of Hilbert spaces. Then, we show how these results apply to experiment design. Next, we develop an efficient reconstruction algorithm that allows us to reconstruct experimental data projected onto a finite element basis. Finally, we verify our approach with two computational experiments.

Young, Joseph G.↗

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↗

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↗

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↗