Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space computing”

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 361 records · Page 20

Quadratic pseudospectrum for identifying localized states

Here we examine the utility of the quadratic pseudospectrum for understanding and detecting states that are somewhat localized in position and energy, in particular, in the context of condensed matter physics. Specifically, the quadratic pseudospectrum represents a method for approaching systems with incompatible observables {A j |1 ≤ j ≤ d} as it minimizes collectively the errors $\parallel$A j v - λ j v$\parallel$ while defining a joint approximate spectrum of incompatible observables. Moreover, we derive an important estimate relating the Clifford and quadratic pseudospectra. Finally, we prove that the quadratic pseudospectrum is local and derive the bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.

97 MATHEMATICS AND COMPUTING↗

Spatiotemporal characterization of the field-induced insulator-to-metal transition

Watching a metal filament grow Resistive switching is a process in which the electrical resistance of a sample changes abruptly in response to a voltage pulse, often by orders of magnitude. This process is at the heart of many neuromorphic computing approaches but visualizing it in both space and time is tricky. del Valle et al . monitored the resistive switching in three different vanadium oxide compounds by measuring time- and space-resolved optical reflectivity (see the Perspective by Hilgenkamp and Gao). A characteristic conducting filament was quickly nucleated on the inhomogeneities in the sample and then propagated due to Joule heating. —JS

Science & Technology - Other Topics↗

FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica

Numerical simulations of Greenland and Antarctic ice sheets involve the solution of large-scale highly nonlinear systems of equations on complex shallow geometries. This work is concerned with the construction of Schwarz preconditioners for the solution of the associated tangent problems, which are challenging for solvers mainly because of the strong anisotropy of the meshes and wildly changing boundary conditions that can lead to poorly constrained problems on large portions of the domain. Here, two-level GDSW (Generalized Dryja–Smith–Widlund) type Schwarz preconditioners are applied to different land ice problems, i.e., a velocity problem, a temperature problem, as well as the coupling of the former two problems. We employ the MPI-parallel implementation of multi-level Schwarz preconditioners provided by the package FROSch (Fast and Robust Schwarz)from the Trilinos library. The strength of the proposed preconditioner is that it yields out-of-the-box scalable and robust preconditioners for the single physics problems. To our knowledge, this is the first time two-level Schwarz preconditioners are applied to the ice sheet problem and a scalable preconditioner has been used for the coupled problem. The pre-conditioner for the coupled problem differs from previous monolithic GDSW preconditioners in the sense that decoupled extension operators are used to compute the values in the interior of the sub-domains. Several approaches for improving the performance, such as reuse strategies and shared memory OpenMP parallelization, are explored as well. In our numerical study we target both uniform meshes of varying resolution for the Antarctic ice sheet as well as non uniform meshes for the Greenland ice sheet are considered. We present several weak and strong scaling studies confirming the robustness of the approach and the parallel scalability of the FROSch implementation. Among the highlights of the numerical results are a weak scaling study for up to 32 K processor cores (8 K MPI-ranks and 4 OpenMP threads) and 566 M degrees of freedom for the velocity problem as well as a strong scaling study for up to 4 K processor cores (and MPI-ranks) and 68 M degrees of freedom for the coupled problem.

58 GEOSCIENCES↗

An open-source framework for balancing computational speed and fidelity in production cost models

Studies of bulk power system operations need to incorporate uncertainty and sensitivity analyses, especially around exposure to weather and climate variability and extremes, but this remains a computational modeling challenge. Commercial production cost models (PCMs) have shorter runtimes, but also important limitations (opacity, license restrictions) that do not fully support stochastic simulation. Open-source PCMs represent a potential solution. They allow for multiple, simultaneous runs in high-performance computing environments and offer flexibility in model parameterization. Yet, developers must balance computational speed (i.e. runtime) with model fidelity (i.e. accuracy). In this paper, we present Grid Operations (GO), a framework for instantiating open-source, scale-adaptive PCMs. GO allows users to search across parameter spaces to identify model versions that appropriately balance computational speed and fidelity based on experimental needs and resource limits. Results provide generalizable insights on how to navigate the fidelity and computational speed tradeoff through parameter selection. We show that models with coarser network topologies can accurately mimic market operations, sometimes better than higher-resolution models. It is thus possible to conduct large simulation experiments that characterize operational risks related to climate and weather extremes while maintaining sufficient model accuracy.

42 ENGINEERING↗

Sequential Bayesian Methods for Analyzing Computer Models

Efficient analysis of computer models is essential for the validation and uncertainty quantification of those models. Surrogate models, and Gaussian processes in particular, are a common and powerful approach to analyzing computer models that treat computer models as a black-box function. Gaussian processes form a Bayesian model over a space of functions that gives a measure of uncertainty about the computer model output at unobserved locations and a framework for sequential sampling. This tutorial will show how to fit Gaussian processes on a series of test functions and apply sequential design techniques to estimate extrema, level sets, and reliabilities of those test functions.

97 MATHEMATICS AND COMPUTING↗

Practical choices for space-filling designs

Space-filling designs are now commonly used as a flexible model-free strategy for providing good coverage throughout an input space of interest for a variety of computer and physical experiment design scenarios. Some of the preliminary choices about how to frame the problem and which type of design to use can have a substantial impact on the success or failure of the experiment, and yet how to make these critical choices is often under-emphasized in the literature. In this paper, we explore several of the practical choices required by the experimenter and describe a sequence of steps to help create an ideal design that matches the goals and constraints of the experiment. These choices include the specification of the input space, the scaling of the variables, the degree of uniformity of the design points across the input space, and the space-filling characteristics. In addition, some new tools for defining the weights to implement non-uniform space-filling designs are provided. Finally, the methods are demonstrated with several illustrative examples and a real-world chemical engineering experiment for carbon capture.

42 ENGINEERING↗

Global calculation of two-neutrino double- β decay within the finite amplitude method in nuclear density functional theory

Two-neutrino double-beta (2νββ) decay has been used to constrain the neutron-proton part of effective interactions, which in turn is used to compute the nuclear matrix elements for neutrinoless double-beta decay, the observation of which would have important consequences for fundamental physics. We carefully examine 2νββ matrix elements within the proton-neutron quasiparticle random-phase approximation with nuclear energy density functionals. Here we work with functionals that are fit globally to single-beta-decay half-lives and charge-exchange giant-resonance energies, but not to 2νββ half-lives themselves, to evaluate the 2νββ nuclear matrix elements for all important nuclei, including those whose half-lives have not yet been measured. Such a comprehensive evaluation in large model spaces without configuration truncation requires an efficient computational scheme; we employ a double contour integration within the finite amplitude method. The results generally reproduce the nuclear matrix element extracted from half-lives well, without the use of any of those half-lives in the fitting procedure. We present predictions of the matrix elements in a total of 27 nuclei with half-lives that are still unmeasured.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Flow-driven spectral chaos (FSC) method for simulating long-time dynamics of arbitrary-order non-linear stochastic dynamical systems

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time. However, because the random function space is constructed using tensor products, TD-gPC-based methods are known to suffer from the curse of dimensionality. Here, we introduce a new numerical method called the flow-driven spectral chaos (FSC) which overcomes this curse of dimensionality at the random-function-space level. The proposed method is not only computationally more efficient than existing TD-gPC-based methods but is also far more accurate. The FSC method uses the concept of enriched stochastic flow maps to track the evolution of a finite-dimensional random function space efficiently in time. To transfer the probability information from one random function space to another, two approaches are developed and studied herein. In the first approach, the probability information is transferred in the mean-square sense, whereas in the second approach the transfer is done exactly using a new theorem that was developed for this purpose. The FSC method can quantify uncertainties with high fidelity, especially for the long-time response of stochastic dynamical systems governed by ODEs of arbitrary order. Six representative numerical examples, including a nonlinear problem (the Van-der-Pol oscillator), are presented to demonstrate the performance of the FSC method and corroborate the claims of its superior numerical properties. Finally, a parametric, high-dimensional stochastic problem is used to demonstrate that when the FSC method is used in conjunction with Monte Carlo integration, the curse of dimensionality can be overcome altogether.

(nonlinear) stochastic dynamical systems↗

GAHLS: an optimized graph analytics based high level synthesis framework

The urgent need for low latency, high-compute and low power on-board intelligence in autonomous systems, cyber-physical systems, robotics, edge computing, evolvable computing, and complex data science calls for determining the optimal amount and type of specialized hardware together with reconfigurability capabilities. With these goals in mind, we propose a novel comprehensive graph analytics based high level synthesis (GAHLS) framework that efficiently analyzes complex high level programs through a combined compiler-based approach and graph theoretic optimization and synthesizes them into message passing domain-specific accelerators. This GAHLS framework first constructs a compiler-assisted dependency graph (CaDG) from low level virtual machine (LLVM) intermediate representation (IR) of high level programs and converts it into a hardware friendly description representation. Next, the GAHLS framework performs a memory design space exploration while account for the identified computational properties from the CaDG and optimizing the system performance for higher bandwidth. The GAHLS framework also performs a robust optimization to identify the CaDG subgraphs with similar computational structures and aggregate them into intelligent processing clusters in order to optimize the usage of underlying hardware resources. Finally, the GAHLS framework synthesizes this compressed specialized CaDG into processing elements while optimizing the system performance and area metrics. Evaluations of the GAHLS framework on several real-life applications (e.g., deep learning, brain machine interfaces) demonstrate that it provides 14.27× performance improvements compared to state-of-the-art approaches such as LegUp 6.2.

97 MATHEMATICS AND COMPUTING↗

VTAnDeM: A python toolkit for simultaneously visualizing phase stability, defect energetics, and carrier concentrations of materials

Phase stability, defect formation energies, and carrier concentrations are closely interrelated features of semiconductors. Due to their joint dependence on the multidimensional chemical potential space, it is challenging to quantitatively establish patterns between these quantities in a given semiconductor, especially when the semiconductor is comprised of multiple elements. To enable synchronous visualization and analysis of these complementary material properties and their interdependence, we developed the Visualization Toolkit for Analyzing Defects in Materials (VTAnDeM). This python-based toolkit allows users to interactively explore how defect formation energies and carrier concentrations vary across the composition and chemical potential spaces of multicomponent semiconductors. Here, we illustrate the computational workflow that employs VTAnDeM as a post-processing tool for first-principles calculations and describe the data organization and theory underlying the visualization scheme. Furthermore, we believe that this software will serve as a useful tool for simultaneously visualizing the often complex and non-intuitive chemical potential – defect – carrier concentration phase space of semiconductors.

36 MATERIALS SCIENCE↗

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Combining different 3-D global and regional seismic wave propagation solvers towards box tomography in the deep Earth

SUMMARY In previous publications, we presented a general framework, which we called ‘box tomography’, that allows the coupling of any two different numerical seismic wave propagation solvers, respectively outside and inside a target region, or ‘box’. The goal of such hybrid wavefield computations is to reduce the cost of computations in the context of full-waveform inversion for structure within the target region, when sources and/or receivers are located at large distances from the box. Previously, we had demonstrated this approach with sources and receivers outside the target region in a 2-D acoustic spherical earth model, and demonstrated and applied this methodology in the 3-D spherical elastic Earth in a continental scale inversion in which all stations were inside the target region. Here we extend the implementation of the approach to the case of a 3-D global elastic earth model in the case where both sources and stations are outside the box. We couple a global 3-D solver, SPECFEM3D_GLOBE, for the computation of the wavefield and Green’s functions in a reference 3-D model, with a regional 3-D solver, RegSEM, for the computation of the wavefield within the box, by means of time-reversal mirrors. We briefly review key theoretical aspects, showing in particular how only the displacement is needed to be stored at the boundary of the box. We provide details of the practical implementation, including the geometrical design of the mirrors, how we deal with different sizes of meshes in the two solvers, and how we address memory-saving through the use of B-spline compression of the recorded wavefield on the mirror. The proposed approach is numerically efficient but also versatile, since adapting it to other solvers is straightforward and does not require any changes in the solver codes themselves, as long as the displacement can be recovered at any point in time and space. We present benchmarks of the hybrid computations against direct computations of the wavefield between a source and an array of stations in a realistic geometry centred in the Yellowstone region, with and without a hypothetical plume within the ‘box’, and with a 1-D or a 3-D background model, down to a period of 20 s. The ultimate goal of this development is for applications in the context of imaging of remote target regions in the deep mantle, such as, for example, Ultra Low Velocity Zones.

Geochemistry & Geophysics↗

A spectral metric for collider geometry

By quantifying the distance between two collider events, one can triangulate a metric space and reframe collider data analysis as computational geometry. One popular geometric approach is to first represent events as an energy flow on an idealized celestial sphere and then define the metric in terms of optimal transport in two dimensions. In this paper, we advocate for representing events in terms of a spectral function that encodes pairwise particle angles and products of particle energies, which enables a metric distance defined in terms of one-dimensional optimal transport. This approach has the advantage of automatically incorporating obvious isometries of the data, like rotations about the colliding beam axis. It also facilitates first-principles calculations, since there are simple closed-form expressions for optimal transport in one dimension. Up to isometries and event sets of measure zero, the spectral representation is unique, so the metric on the space of spectral functions is a metric on the space of events. At lowest order in perturbation theory in electron-positron collisions, our metric is simply the summed squared invariant masses of the two event hemispheres. Going to higher orders, we present predictions for the distribution of metric distances between jets in fixed-order and resummed perturbation theory as well as in parton-shower generators. Finally, we speculate on whether the spectral approach could furnish a useful metric on the space of quantum field theories.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Real-space observation of ergodicity transitions in artificial spin ice

Abstract Ever since its introduction by Ludwig Boltzmann, the ergodic hypothesis became a cornerstone analytical concept of equilibrium thermodynamics and complex dynamic processes. Examples of its relevance range from modeling decision-making processes in brain science to economic predictions. In condensed matter physics, ergodicity remains a concept largely investigated via theoretical and computational models. Here, we demonstrate the direct real-space observation of ergodicity transitions in a vertex-frustrated artificial spin ice. Using synchrotron-based photoemission electron microscopy we record thermally-driven moment fluctuations as a function of temperature, allowing us to directly observe transitions between ergodicity-breaking dynamics to system freezing, standing in contrast to simple trends observed for the temperature-dependent vertex populations, all while the entropy features arise as a function of temperature. These results highlight how a geometrically frustrated system, with thermodynamics strictly adhering to local ice-rule constraints, runs back-and-forth through periods of ergodicity-breaking dynamics. Ergodicity breaking and the emergence of memory is important for emergent computation, particularly in physical reservoir computing. Our work serves as further evidence of how fundamental laws of thermodynamics can be experimentally explored via real-space imaging.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics-Informed Machine Learning-Aided System Space Discretization

Decision-making is the process of identifying and choosing alternatives based on an agreed-upon set of metrics and preferences established by the decision-maker. There are options to be considered during the decision-making process and each option offers a different trajectory and associated success profile in moving from a given system state to the desired system state. The decision-making process typically involves uncertainties associated with the current component and system states. In this sense, probabilistic risk assessment (PRA) can be an analytical method and tool for accomplishing the probabilistic aspect of the decision-making process. Dynamic PRA is an evolution of conventional PRA methodology in which driving forces on modeled plant elements and the element behaviors are explicitly modeled over time. In the recent past, risk assessment methodologies have evolved to address risk issues in a continuously evolving environment and a novel probabilistic dynamics framework in continuous time and state-space discretization forms has been proposed. While state-space discretization has shown its strength in both consequence and causal reasoning modes, several challenges, including the computational requirement and physically meaningful system state identification, exist. Conventional system space discretization has usually been done by either the equal width discretization method or a data-driven method. Those methods naturally possess challenges coming from the physical understanding of discretized system space (i.e., system state) and the trajectory moving from a given system state to another system state. The purpose of this paper is to present a physics-based and data-driven system state discretization method such that one can justify what the discretized system space implies and understand the state trajectory from the viewpoint of operational actions.

Kim, Junyung↗

Unitarity cuts of the worldsheet

We compute the imaginary parts of genus-one string scattering amplitudes. Following Witten’s i\varepsilon i ε prescription for the integration contour on the moduli space of worldsheets, we give a general algorithm for computing unitarity cuts of the annulus, Möbius strip, and torus topologies exactly in \alpha' α ′ . With the help of tropical analysis, we show how the intricate pattern of thresholds (normal and anomalous) opening up arises from the worldsheet computation. The result is a manifestly-convergent representation of the imaginary parts of amplitudes, which has the analytic form expected from Cutkosky rules in field theory, but bypasses the need for performing laborious sums over the intermediate states. We use this representation to study various physical aspects of string amplitudes, including their behavior in the (s,t) ( s , t ) plane, exponential suppression, decay widths of massive strings, total cross section, and low-energy expansions. We find that planar annulus amplitudes exhibit a version of low-spin dominance: at any finite energy, only a finite number of low partial-wave spins give an appreciable contribution to the imaginary part.

97 MATHEMATICS AND COMPUTING↗

Advanced Modeling of Beam Physics and Performance Optimization for Nuclear Physics Colliders

High energy colliders provide a critical tool in nuclear physics study by probing the fundamental structure and dynamics of matter. To maximize the potential of scientific discovery in nuclear physics study, it is important to optimize the parameters of these colliders to attain the best performance. The performance of a collider is typically measured by its integrated luminosity of colliding beams since the probability of a new event is proportional to the integrated luminosity. However, the achievable luminosity is limited by the electromagnetic interactions (beam-beam effects) of two colliding beams at higher energy, and the interplay between the space-charge effects and the beam-beam effects at lower energy. To achieve the best performance of a collider means to attain the highest luminosity of the collider with optimized collider parameters. Optimizing the collider’s machine parameters is both computationally and experimentally expensive. A fast and robust computational framework including beam-beam and space-charge effects will be critical to attaining the best performance of the collider. In this project, we will study the beam dynamics challenges, specifically the interplay of the space-charge and the beam-beam effects, and the machine tuning models for maximizing the performance of RHIC experiments. We will develop an advanced modeling framework based on first-principles physical simulations, lattice models and the state-of-the-art machine learning methods and apply this framework to performance improvement of the RHIC in operation. We will build data manipulation packages to connect the simulation data and the experimental data with the framework, develop a self-consistent hybrid model of space-charge and beam-beam effects, study underlying physics mechanisms, build surrogate models using the labeled data, integrate the models into the advanced modeling framework, and apply the framework to RHIC luminosity (STAR and sPHENIX) optimization. The success of this project would substantially improve the performance of existing and future colliders and increase the opportunity for scientific discovery.

43 PARTICLE ACCELERATORS↗

Uncertainty Quantification and Sensitivity Analysis of Low-Dimensional Manifold via Co-Kurtosis PCA in Combustion Modeling

For multi-scale multi-physics applications e.g., the turbulent combustion code Pele, robust and accurate dimensionality reduction is crucial to solving problems at exascale and beyond. A recently developed technique, Co-Kurtosis based Principal Component Analysis (CoK-PCA) which leverages principal vectors of co-kurtosis, is a promising alternative to traditional PCA for complex chemical systems. To improve the effectiveness of this approach, we employ Artificial Neural Networks for reconstructing thermo-chemical scalars, species production rates, and overall heat release rates corresponding to the full state space. Our focus is on bolstering confidence in this deep learning based non-linear reconstruction through Uncertainty Quantification (UQ) and Sensitivity Analysis (SA). UQ involves quantifying uncertainties in inputs and outputs, while SA identifies influential inputs. One of the noteworthy challenges is the computational expense inherent in both endeavors. To address this, we employ the Monte Carlo methods to effectively quantify and propagate uncertainties in our reduced spaces while managing computational demands. Our research carries profound implications not only for the realm of combustion modeling but also for a broader audience in UQ. By showcasing the reliability and robustness of CoK-PCA in dimensionality reduction and deep learning predictions, we empower researchers and decision-makers to navigate complex combustion systems with greater confidence.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗