Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “emulation”

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 955 records · Page 53

Latent variable Gaussian process models: A rank‐based analysis and an alternative approach

Abstract Gaussian process (GP) models have been extended to emulate expensive computer simulations with both qualitative/categorical and quantitative/continuous variables. Latent variable (LV) GP models, which have been recently developed to map each qualitative variable to some underlying numerical LVs, have strong physics‐based justification and have achieved promising performance. Two versions use LVs in Cartesian (LV‐Car) space and hyperspherical (LV‐sph) space, respectively. Despite their success, the effects of these different LV structures are still poorly understood. This article illuminates this issue with two contributions. First, we develop a theorem on the effect of the ranks of the qualitative factor correlation matrices of mixed‐variable GP models, from which we conclude that the LV‐sph model restricts the interactions between the input variables and thus restricts the types of response surface data with which the model can be consistent. Second, following a rank‐based perspective like in the theorem, we propose a new alternative model named LV‐mix that combines the LV‐based correlation structures from both LV‐Car and LV‐sph models to achieve better model flexibility than them. Through extensive case studies, we show that LV‐mix achieves higher average accuracy compared with the existing two.

Tao, Siyu↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

Dispersion-enhanced sequential batch sampling for adaptive contour estimation

In computer simulation and optimal design, sequential batch sampling offers an appealing way to iteratively stipulate optimal sampling points based upon existing selections and efficiently construct surrogate modeling. Nonetheless, the issue of near duplicates poses tremendous quandary for sequential learning. It refers to the situation that selected critical points cluster together in each sampling batch, which are individually but not collectively informative towards the optimal design. Near duplicates severely diminish the computational efficiency as they barely contribute extra information towards update of the surrogate. To address this issue, we impose a dispersion criterion on concurrent selection of sampling points, which essentially forces a sparse distribution of critical points in each batch, and demonstrate the effectiveness of this approach in adaptive contour estimation. Specifically, we adopt Gaussian process surrogate to emulate the simulator, acquire variance reduction of the critical region from new sampling points as a dispersion criterion, and combine it with the modified expected improvement (EI) function for critical batch selection. The critical region here is the proximity of the contour of interest. This proposed approach is vindicated in numerical examples of a two-dimensional four-branch function, a four-dimensional function with a disjoint contour of interest and a time-delay dynamic system.

97 MATHEMATICS AND COMPUTING↗

Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules

Abstract Materials simulations involving strongly correlated electrons pose fundamental challenges to state‐of‐the‐art electronic structure methods but are hypothesized to be the ideal use case for quantum computing algorithms. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real‐world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near‐term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using the VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies using it have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near‐term feasibility of modeling a molecule with d‐orbitals on real quantum hardware. We demonstrate that the inclusion of d‐orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE + UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust control of a family of uncertain nonminimum‐phase systems via continuous‐time and sampled‐data output feedback

Summary The problem of global robust stabilization is studied by both continuous‐time and sampled‐data output feedback for a family of nonminimum‐phase nonlinear systems with uncertainty. The uncertain nonlinear system considered in this paper has an interconnect structure consisting of a driving system and a possibly unstable zero dynamics with uncertainty, ie, the uncertain driven system. Under a linear growth condition on the uncertain zero dynamics and a Lipschitz condition on the driving system, we show that it is possible to globally robustly stabilize the family of uncertain nonminimum‐phase systems by a single continuous‐time or a sampled‐data output feedback controller. The sampled‐data output feedback controller is designed by using the emulated versions of a continuous‐time observer and a state feedback controller, ie, by holding the input/output signals constant over each sampling interval. The design of either continuous‐time or sampled‐data output compensator uses only the information of the nominal system of the uncertain controlled plant. In the case of sampled‐data control, global robust stability of the hybrid closed‐loop system with uncertainty is established by means of a feedback domination method together with the robustness of the nominal closed‐loop system if the sampling time is small enough.

Lin, Wei↗

Non-uniform active learning for Gaussian process models with applications to trajectory informed aerodynamic databases

The ability to non-uniformly weight the input space is desirable for many applications, and has been explored for space-filling approaches. Increased interests in linking models, such as in a digital twinning framework, increases the need for sampling emulators where they are most likely to be evaluated. In particular, here we apply non-uniform sampling methods for the construction of aerodynamic databases. This paper combines non-uniform weighting with active learning for Gaussian Processes (GPs) to develop a closed-form solution to a non-uniform active learning criterion. We accomplish this by utilizing a kernel density estimator as the weight function. We demonstrate the need and efficacy of this approach with an atmospheric entry example that accounts for both model uncertainty as well as the practical state space of the vehicle, as determined by forward modeling within the active learning loop.

42 ENGINEERING↗

Nanoscale Imaging and Control of Volatile and Non-Volatile Resistive Switching in VO 2

Control of the metal-insulator phase transition is vital for emerging neuromorphic and memristive technologies. The ability to alter the electrically driven transition between volatile and non-volatile states is particularly important for quantum-materials-based emulation of neurons and synapses. The major challenge of this implementation is to understand and control the nanoscale mechanisms behind these two fundamental switching modalities. In this study, in situ X-ray nanoimaging is used to follow the evolution of the nanostructure and disorder in the archetypal Mott insulator VO 2 during an electrically driven transition. Our findings demonstrate selective and reversible stabilization of either the insulating or metallic phases achieved by manipulating the defect concentration. This mechanism enables us to alter the local switching response between volatile and persistent regimes and demonstrates a new possibility for nanoscale control of the resistive switching in Mott materials.

36 MATERIALS SCIENCE↗

Virtual Infrastructure Twins: Software Testing Platforms for Computing-Instrument Ecosystems

Science ecosystems are being built by federating computing systems and instruments located at geographically distributed sites over wide-area networks. These computing-instrument ecosystems are expected to support complex workflows that incorporate remote, automated AI-driven science experiments. Their realization, however, requires various designs to be explored and software components to be developed, in order to support the orchestration of distributed computations and experiments. It is often too expensive, infeasible, or disruptive for the entire ecosystem to be available during the typically long software development and testing periods. We propose a Virtual Infrastructure Twin (VIT) of the ecosystem that emulates its network and computing components, and incorporates its instrument software simulators. It provides a software environment nearly identical to the ecosystem to support early development and testing, and design space exploration. We present a brief overview of previous digital infrastructure twins that culminated in the VIT concept, including (i) the virtual science network environment for developing software-defined networking solutions, and (ii) the virtual federated science instrument environment for testing the federation software stack and remote instrument control software. We briefly describe VITs for Nion microscope steering and access to GPU systems.

Rao, Nageswara↗

Mixing stops at the LHC

We study the phenomenology of a light stop NLSP in the presence of large mixing with either the first or the second generation. R-symmetric models provide a prime setting for this scenario, but our discussion also applies to the MSSM when a significant amount of mixing can be accommodated. In our framework the dominant stop decay is through the flavor violating mode into a light jet and the LSP in an extended region of parameter space. There are currently no limits from ATLAS and CMS in this region. We emulate shape-based hadronic SUSY searches for this topology, and find that they have potential sensitivity. If the extension of these analyses to this region is robust, we find that these searches can set strong exclusion limits on light stops. If not, then the flavor violating decay mode is challenging and may represent a blind spot in stop searches even at 13 TeV. Thus, an experimental investigation of this scenario is well motivated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards a real-time computation of timelike hadronic vacuum polarization and light-by-light scattering: Schwinger Model tests

Hadronic vacuum polarization (HVP) and light-by-light scattering (HLBL) are crucial for evaluating the Standard Model predictions concerning the muon’s anomalous magnetic moment. However, direct first-principle lattice gauge theory-based calculations of these observables in the timelike region remain challenging. Discrepancies persist between lattice quantum chromodynamics (QCD) calculations in the spacelike region and dispersive approaches relying on experimental data parametrization from the timelike region. Here, we introduce a methodology employing 1+1-dimensional quantum electrodynamics (QED), i.e. the Schwinger Model, to investigate the HVP and HLBL. To that end, we use both tensor network techniques, specifically matrix product states, and classical emulators of digital quantum computers. Demonstrating feasibility in a simplified model, our approach sets the stage for future endeavors leveraging digital quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Robust calibration of non-perturbative models with history matching

We apply, for the first time, Bayes Linear Emulation and History Matching to the calibration of non-perturbative models in Monte Carlo event generators. In contrast to the usual approach of "Monte Carlo tuning", History Matching does not result in best-fit plus ellipsoidal parameter uncertainty estimates but instead identifies all parameter space regions that are consistent with data. This approach leads to a systematic and robust quantification of parametric uncertainties in the models, especially in those challenging cases where different, possibly disjoint, regions of parameter space deliver similar results, which are usually not properly treated with current methodology. We highlight the power of this method with the hadronisation models available through Sherpa : the built-in cluster fragmentation Ahadic and string fragmentation through an interface to Pythia .

Iskauskas, Andrew [Durham U. (main)] (ORCID:000000↗

Resurgence and dynamics of O(N) and Grassmannian sigma models

Here, we study the non-perturbative dynamics of the two dimensional O( N ) and Grassmannian sigma models by using compactification with twisted boundary conditions on R× S 1 , semi-classical techniques and resurgence. While the O(N) model has no instantons for N > 3, it has (non-instanton) saddles on R 2 , which we call 2d-saddles. On R× S 1 , the resurgent relation between perturbation theory and non-perturbative physics is encoded in new saddles, which are associated with the affine root system of the o( N ) algebra. These events may be viewed as fractionalizations of the 2d-saddles. The first beta function coefficient, given by the dual Coxeter number, can then be intepreted as the sum of the multiplicities (dual Kac labels) of these fractionalized objects. Surprisingly, the new saddles in O( N ) models in compactified space are in one-to-one correspondence with monopole-instanton saddles in SO( N ) gauge theory on R 3 ×S 1 . The Grassmannian sigma models Gr( N , M ) have 2d instantons, which fractionalize into N kink-instantons. The small circle dynamics of both sigma models can be described as a dilute gas of the one-events and two-events, bions. One-events are the leading source of a variety of non-perturbative effects, and produce the strong scale of the 2d theory in the compactified theory. We show that in both types of sigma models the neutral bion emulates the role of IR-renormalons. We also study the topological theta angle dependence in both the O (3) model and Gr( N , M ), and describe the multi-branched structure of the observables in terms of the theta-angle dependence of the saddle amplitudes, providing a microscopic argument for Haldane’s conjecture.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fitting a deep generative hadronization model

Hadronization is a critical step in the simulation of high-energy particle and nuclear physics experiments. As there is no first principles understanding of this process, physically-inspired hadronization models have a large number of parameters that are fit to data. Deep generative models are a natural replacement for classical techniques, since they are more flexible and may be able to improve the overall precision. Proof of principle studies have shown how to use neural networks to emulate specific hadronization when trained using the inputs and outputs of classical methods. However, these approaches will not work with data, where we do not have a matching between observed hadrons and partons. In this paper, we develop a protocol for fitting a deep generative hadronization model in a realistic setting, where we only have access to a set of hadrons in data. Our approach uses a variation of a Generative Adversarial Network with a permutation invariant discriminator. We find that this setup is able to match the hadronization model in Herwig with multiple sets of parameters. This work represents a significant step forward in a longer term program to develop, train, and integrate machine learning-based hadronization models into parton shower Monte Carlo programs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Molecular dynamics simulations of the first charge of a Li-ion—Si-anode nanobattery

Rechargeable lithium-ion batteries are the most popular devices for energy storage but still a lot of research needs to be done to improve their cycling and storage capacity. Silicon has been proposed as an anode material because of its large theoretical capacity of ~3600 mAh/g. Therefore, focus is needed on the lithiation process of silicon anodes where it is known that the anode increases its volume more than 300%, producing cracking and other damages. In this study, we performed molecular dynamics atomistic simulations to study the swelling, alloying, and amorphization of a silicon nanocrystal anode in a full nanobattery model during the first charging cycle. A dissolved salt of lithium hexafluorophosphate in ethylene carbonate was chosen as the electrolyte solution and lithium cobalt oxide as cathode. External electric fields are applied to emulate the charging, causing the migration of the Li-ions from the cathode to the anode, by drifting through the electrolyte solution, thus converting pristine Si gradually into Li 14 Si 5 when fully lithiated. When the electric field is applied to the nanobattery, the temperature never exceeds 360 K due to a temperature control imposed resembling a cooling mechanism. The volume of the anode increases with the amorphization of the silicon as the external field is applied by creating a layer of LiSi alloy between the electrolyte and the silicon nanocrystal and then, at the arrival of more Li-ions changing to an alloy, where the drift velocity of Li-ions is greater than the velocity in the initial nanocrystal structure. Charge neutrality is maintained by concerted complementary reduction-oxidation reactions at the anode and cathode, respectively. Also, the nanobattery model developed here can be used to study charge mobility, current density, conductance and resistivity, among several other properties of several candidate materials for rechargeable batteries and constitutes the initial point for further studies on the formation of the solid electrolyte interphase in the anode.

25 ENERGY STORAGE↗

Parallel application-level behavioral attributes for performance and energy management of high-performance computing systems

Run time variability of parallel applications continues to present significant challenges to their performance and energy efficiency in high-performance computing (HPC) systems. When run times are extended and unpredictable, application developers perceive this as a degradation of system (or subsystem) performance. Extended run times directly contribute to proportionally higher energy consumption, potentially negating efforts by applications, or the HPC system, to optimize energy consumption using low-level control techniques, such as dynamic voltage and frequency scaling (DVFS). Therefore, successful systemic management of application run time performance can result in less wasted energy, or even energy savings. We have been studying run time variability in terms of communication time, from the perspective of the application, focusing on the interconnection network. More recently, our focus has shifted to developing a more complete understanding of the effects of HPC subsystem interactions on parallel applications. In this context, the set of executing applications on the HPC system is treated as a subsystem, along with more traditional subsystems like the communication subsystem, storage subsystem, etc. To gain insight into the run time variability problem, our earlier work developed a framework to emulate parallel applications (PACE) that stresses the communication subsystem. Evaluation of run time sensitivity to network performance of real applications is performed with a tool called PARSE, which uses PACE. In this paper, we propose a model defining application-level behavioral attributes, that collectively describes how applications behave in terms of their run time performance, as functions of their process distribution on the system (spacial locality), and subsystem interactions (communication subsystem degradation). These subsystem interactions are produced when multiple applications execute concurrently on the same HPC system. We also revisit our evaluation framework and tools to demonstrate the flexibility of our application characterization techniques, and the ease with which attributes can be quantified. The validity of the model is demonstrated using our tools with several parallel benchmarks and application fragments. Results suggest that it is possible to articulate application-level behavioral attributes as a tuple of numeric values that describe course-grained performance behavior.

Computer Science↗

A programmable shared-memory system for an array of processing-in-memory devices

Processing in memory (PIM), the concept of integrating processing directly with memory has been attracting a lot of attention, since PIM can assist in overcoming the throughput limitation caused by data movement between CPU and memory. The challenge, however, is that it requires the programmers to have a deep understanding of the PIM architecture to maximize the benefits such as data locality and parallel thread execution on multiple PIM devices. In this study, we present AnalyzeThat, a programmable shared-memory system for parallel data processing with PIM devices. Thematic to AnalyzeThat is a rich PIM-aware data structure (PADS), which is an encapsulation that integrally ties together the data, the analysis tasks and the runtime needed to interface with the PIM device array. The PADS abstraction provides (i) a sophisticated key-value data container that allows programmers to easily store data on multiple PIMs, (ii) a suite of parallel operations with which users can easily implement data analysis applications, and (iii) a runtime, hidden to programmers, which provides the mechanisms needed to overlay both the data and the tasks on the PIM device array in an intelligent fashion, based on PIM-specific information collected from the hardware. We have developed a PIM emulation framework called AnalyzeThat. In conclusion, our experimental evaluation with representative data analytics applications suggests that the proposed system can significantly reduce the PIM programming effort without losing its technology benefits.

97 MATHEMATICS AND COMPUTING↗

Optimizing human activity patterns using global sensitivity analysis

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

97 MATHEMATICS AND COMPUTING↗

Possibility of an integrated transmission electron microscope: enabling complex in-situ experiments

Abstract Multimodal in-situ experiments are the wave of the future, as this approach will permit multispectral data collection and analysis during real-time nanoscale observation. In contrast, the evolution of technique development in the electron microscopy field has generally trended toward specialization and subsequent bifurcation into more and more niche instruments, creating a challenge for reintegration and backward compatibility for in-situ experiments on state-of-the-art microscopes. We do not believe this to be a requirement in the field; therefore, we propose an adaptive instrument that is designed to allow nearly simultaneous collection of data from aberration-corrected transmission electron microscopy (TEM), probe-corrected scanning transmission electron microscopy, ultrafast TEM, and dynamic TEM with a flexible in-situ testing chamber, where the entire instrument can be modified as future technologies are developed. The value would be to obtain a holistic understanding of the underlying physics and chemistry of the process-structure–property relationships in materials exposed to controlled extreme environments. Such a tool would permit the ability to explore, in-situ, the active reaction mechanisms in a controlled manner emulating those of real-world applications with nanometer and nanosecond resolution. If such a powerful tool is developed, it has the potential to revolutionize our materials understanding of nanoscale mechanisms and transients. Graphical Abstract

36 MATERIALS SCIENCE↗