Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer science, Physics”

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 793 records · Page 44

TPSAS-NF1676L-35322-DND

This talk discusses emerging methods that seek to fuse and integrate physics-based modeling with machine learning. With the recent rise of machine learning and artificial intelligence, there has been a huge surge in data-driven approaches to solve computational science and engineering problems. However, neglecting a priori knowledge of established physical laws and relying solely on data-driven methods can yield unreliable, less interpretable, and/or non-physical results, especially when data is sparse or predictions are required outside of the training data domain. This two part talk presents two distinct approaches for accelerating predictions with machine learning that are grounded and constrained by relevant physics and their application to problems at NASA.

Julian Cuevas Paniagua↗

Recent advances and challenges in optimization models for expansion planning of power systems and reliability optimization

Optimization models for expansion planning of power systems aim to determine capacities, investment timing, and location of power systems to satisfy the power demands while minimizing the total cost. The models have become complex in recent years to reflect both regulations on conventional energy sources and the increasing penetration of renewable energy sources (RES). This paper reviews the basic concepts and optimization models for expansion planning of power systems. We first explain the definition and features of generation expansion planning (GEP), transmission expansion planning (TEP), and generation and transmission expansion planning (GTEP). To address the computational challenges of large-scale expansion planning problems, we review several simplifications including temporal and spatial aggregation, and decomposition methods. This paper also addresses power system reliability defined as the probability of satisfying the load demand while withstanding failures of components. Finally, the goal of this paper is to provide a research overview, discuss trends in expansion planning of power systems, and suggest directions for future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Nyström type exponential integrators for strongly magnetized charged particle dynamics

Solving for charged particle motion in electromagnetic fields (i.e. the particle pushing problem) is a computationally intensive component of particle-in-cell (PIC) methods for plasma physics simulations. This task is especially challenging when the plasma is strongly magnetized due numerical stiffness arising from the wide range of time scales between highly oscillatory gyromotion and long term macroscopic behavior. A promising approach to solve these problems is by a class of methods known as exponential integrators that can solve linear problems exactly and are A-stable. This work extends the standard exponential integration framework to derive Nyström-type exponential integrators that integrates the Newtonian equations of motion as a second-order differential equation directly. In particular, we derive second-order and third-order Nyström-type exponential integrators for strongly magnetized particle pushing problems. Numerical experiments show that the Nyström-type exponential integrators exhibit significant improvement in computation speed over the standard exponential integrators.

general physics↗

Efficient Fourier basis particle simulation

The standard particle-in-cell algorithm suffers from grid heating. There exists a gridless alternative which bypasses the deposition step and calculates each Fourier mode of the charge density directly from the particle positions. We show that a gridless method can be computed efficiently through the use of an Unequally Spaced Fast Fourier Transform (USFFT) algorithm. After a spectral field solve, the forces on the particles are calculated via the inverse USFFT (a rapid solution of an approximate linear system). We provide one and two dimensional implementations of this algorithm with an asymptotic runtime of O ( N p + N m D log ⁡ N m D ) for each iteration, identical to the standard PIC algorithm (where N p is the number of particles, N m is the number of Fourier modes, and D is the spatial dimensionality of the problem). We demonstrate superior energy conservation and reduced noise, as well as convergence of the energy conservation at small time steps.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improving Estimation of the Koopman Operator with Kolmogorov–Smirnov Indicator Functions

It has become common to perform kinetic analysis using approximate Koopman operators that transform high-dimensional timeseries of observables into ranked dynamical modes. The key to the practical success of the approach is the identification of a set of observables that form a good basis on which to expand the slow relaxation modes. Good observables are, however, difficult to identify a priori and suboptimal choices can lead to significant underestimations of characteristic time scales. Leveraging the representation of slow dynamics in terms of Hidden Markov Models (HMM), we propose a simple and computationally efficient clustering procedure to infer surrogate observables that form a good basis for slow modes. Here, we apply the approach to an analytically solvable model system as well as on three protein systems of different complexities. We consistently demonstrate that the inferred indicator functions can significantly improve the estimation of the leading eigenvalues of Koopman operators and correctly identify key states and transition time scales of stochastic systems, even when good observables are not known a priori.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling Nanoconfinement Effects Using Active Learning

Predicting the spatial configuration of gas in nanopores of is relevant in applications such as fluid flow forecasting and hydrocarbon reserves estimation. For example, shale reservoirs have suffered from computationally intractable multiscale problems, since fluid properties such as viscosity, density, and adsorption must be calculated by using expensive molecular dynamics (MD) simulations within each nanopore, whereas flow through these connected nanopores must be simulated at the micrometer scale. We utilize machine learning techniques to quickly and accurately model nanoscale confinement effects as an important step toward bridging the nano and micro scales. Our workflow is based on building and training physics-based deep-neural-networks models by learning from a database of MD calculations. The model accounts for the adsorption phenomenon by predicting the statistical distribution of gas inside nanopores. Because large databases of MD calculations are expensive to create, we investigate active learning (AL) as a data set construction strategy. In this workflow, new data are selected based on the model uncertainty via the query-by-committee approach. We show that our workflow obtains accurate models that generalize to real scanning electron microscopy geometries with 1/10th of the number of MD calculations required vs random data set generation. Our method enables the possibility of modeling nanoconfinement effects at the mesoscale, where complex connected sets of nanopores affect flow.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

One order of magnitude faster phase change at reduced power in Ti-Sb-Te

To date, slow Set operation speed and high Reset operation power remain to be important limitations for substituting dynamic random access memory by phase change memory. Here, we demonstrate phase change memory cell based on Ti0.4Sb2Te3 alloy, showing one order of magnitude faster Set operation speed and as low as one-fifth Reset operation power, compared with Ge2Sb2Te5-based phase change memory cell at the same size. The enhancements may be rooted in the common presence of titanium-centred octahedral motifs in both amorphous and crystalline Ti0.4Sb2Te3 phases. The essentially unchanged local structures around the titanium atoms may be responsible for the significantly improved performance, as these structures could act as nucleation centres to facilitate a swift, low-energy order-disorder transition for the rest of the Sb-centred octahedrons. Our study may provide an alternative to the development of high-speed, low-power dynamic random access memory-like phase change memory technology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Synthesis of molecular metallic barium superhydride: pseudocubic BaH 12

Following the discovery of high-temperature superconductivity in the La–H system, we studied the formation of new chemical compounds in the barium-hydrogen system at pressures from 75 to 173 GPa. Using in situ generation of hydrogen from NH 3 BH 3 , we synthesized previously unknown superhydride BaH 12 with a pseudocubic (fcc) Ba sublattice in four independent experiments. Density functional theory calculations indicate close agreement between the theoretical and experimental equations of state. In addition, we identified previously known P6/mmm-BaH 2 and possibly BaH 10 and BaH 6 as impurities in the samples. Ab initio calculations show that newly discovered semimetallic BaH 12 contains H 2 and H 3 – molecular units and detached H 12 chains which are formed as a result of a Peierls-type distortion of the cubic cage structure. Barium dodecahydride is a unique molecular hydride with metallic conductivity that demonstrates the superconducting transition around 20 K at 140 GPa.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum algorithmic measurement

There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics: determining whether a system’s Hamiltonian is time-independent or time-dependent, and determining the symmetry class of the dynamics of the system. We study abstractions of these problems and show for both cases that if the experimentalist can use her experimental samples coherently (in both space and time), a provable exponential speedup is achieved compared to the standard situation in which each experimental sample is accessed separately. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved machine learning algorithm for predicting ground state properties

Finding the ground state of a quantum many-body system is a fundamental problem in quantum physics. In this work, we give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding geometric locality. The proposed ML model can efficiently predict ground state properties of an n-qubit gapped local Hamiltonian after learning from only $\mathcal{O}$(log(n)) data about other Hamiltonians in the same quantum phase of matter. This improves substantially upon previous results that require $\mathcal{O}$(n c ) data for a large constant c. Furthermore, the training and prediction time of the proposed ML model scale as $\mathcal{O}$(n log n) in the number of qubits n. Numerical experiments on physical systems with up to 45 qubits confirm the favorable scaling in predicting ground state properties using a small training dataset.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-site integrated optical addressing of trapped ions

Abstract One of the most effective ways to advance the performance of quantum computers and quantum sensors is to increase the number of qubits or quantum resources in the system. A major technical challenge that must be solved to realize this goal for trapped-ion systems is scaling the delivery of optical signals to many individual ions. In this paper we demonstrate an approach employing waveguides and multi-mode interferometer splitters to optically address multiple 171 Yb + ions in a surface trap by delivering all wavelengths required for full qubit control. Measurements of hyperfine spectra and Rabi flopping were performed on the E2 clock transition, using integrated waveguides for delivering the light needed for Doppler cooling, state preparation, coherent operations, and detection. We describe the use of splitters to address multiple ions using a single optical input per wavelength and use them to demonstrate simultaneous Rabi flopping on two different transitions occurring at distinct trap sites. This work represents an important step towards the realization of scalable integrated photonics for atomic clocks and trapped-ion quantum information systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Analog simulator of integro-differential equations with classical memristors

An analog computer makes use of continuously changeable quantities of a system, such as its electrical, mechanical, or hydraulic properties, to solve a given problem. While these devices are usually computationally more powerful than their digital counterparts, they suffer from analog noise which does not allow for error control. We will focus on analog computers based on active electrical networks comprised of resistors, capacitors, and operational amplifiers which are capable of simulating any linear ordinary differential equation. However, the class of nonlinear dynamics they can solve is limited. In this work, by adding memristors to the electrical network, we show that the analog computer can simulate a large variety of linear and nonlinear integro-differential equations by carefully choosing the conductance and the dynamics of the memristor state variable. We study the performance of these analog computers by simulating integro-diferential models related to fluid dynamics, nonlinear Volterra equations for population growth, and quantum models describing non-Markovian memory effects, among others. Finally, we perform stability tests by considering imperfect analog components, obtaining robust solutions with up to 13% relative error for relevant timescales.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tracking blobs in the turbulent edge plasma of a tokamak fusion device

Abstract The analysis of turbulence in plasmas is fundamental in fusion research. Despite extensive progress in theoretical modeling in the past 15 years, we still lack a complete and consistent understanding of turbulence in magnetic confinement devices, such as tokamaks. Experimental studies are challenging due to the diverse processes that drive the high-speed dynamics of turbulent phenomena. This work presents a novel application of motion tracking to identify and track turbulent filaments in fusion plasmas, called blobs, in a high-frequency video obtained from Gas Puff Imaging diagnostics. We compare four baseline methods (RAFT, Mask R-CNN, GMA, and Flow Walk) trained on synthetic data and then test on synthetic and real-world data obtained from plasmas in the Tokamak à Configuration Variable (TCV). The blob regime identified from an analysis of blob trajectories agrees with state-of-the-art conditional averaging methods for each of the baseline methods employed, giving confidence in the accuracy of these techniques. By making a dataset and benchmark publicly available, we aim to lower the entry barrier to tokamak plasma research, thereby greatly broadening the community of scientists and engineers who might apply their talents to this endeavor.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Local Bayesian Dirichlet mixing of imperfect models

Abstract To improve the predictability of complex computational models in the experimentally-unknown domains, we propose a Bayesian statistical machine learning framework utilizing the Dirichlet distribution that combines results of several imperfect models. This framework can be viewed as an extension of Bayesian stacking. To illustrate the method, we study the ability of Bayesian model averaging and mixing techniques to mine nuclear masses. We show that the global and local mixtures of models reach excellent performance on both prediction accuracy and uncertainty quantification and are preferable to classical Bayesian model averaging. Additionally, our statistical analysis indicates that improving model predictions through mixing rather than mixing of corrected models leads to more robust extrapolations.

97 MATHEMATICS AND COMPUTING↗

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↗