Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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 1,765 records · Page 98

Multigrid methods with space–time concurrency

Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporal dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.

97 MATHEMATICS AND COMPUTING↗

Improved Models for Metallic Nanoparticle Cores from Atomic Pair Distribution Function (PDF) Analysis

X-ray atomic pair distribution functions (PDFs) were collected from a range of canonical metallic nanomaterials, both elemental and alloyed, prepared using different synthesis methods and exhibiting drastically different morphological properties. Widely applied shape-tuned attenuated crystal (AC) fcc models proved inadequate, yielding structured, coherent, and correlated fit residuals. However, equally simple discrete cluster models could account for the largest amplitude features in these difference signals. A hypothesis testing based approach to nanoparticle structure modeling systematically ruled out effects from crystallite size, composition, shape, and surface faceting as primary factors contributing to the AC misfit. On the other hand, decahedrally twinned cluster cores were found to be the origin of the AC structure misfits for a majority of the nanomaterials reported here. It is further motivated that the PDF can readily differentiate between the arrangement of domains in these multiply twinned motifs. Most of the nanomaterials surveyed also fall within the sub-5 nm size regime where traditional electron microscopy cannot easily detect and quantify domain structures, with sampling representative of the average nanocrystal synthesized. Here, the results demonstrate that PDF analysis is a powerful method for understanding internal atomic interfaces in small noble metallic nanomaterials. Such core cluster models, easily built algorithmically, should serve as starting structures for more advanced models able to capture atomic positional disorder, ligand induced or otherwise, near nanocrystal surfaces.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Measurement of jet substructure in boosted $t\overline{t}$ events with the ATLAS detector using 140 fb -1 of 13 TeV $pp$ collisions

Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Autonomous Human Activity Classification From Wearable Multi-Modal Sensors

There has been significant amount of research work on human activity classification relying either on Inertial Measurement Unit (IMU) data or data from static cameras providing a third-person view. There has been relatively less work using wearable cameras, providing first-person or egocentric view, and even fewer approaches combining egocentric video with IMU data. Utilizing only IMU data limits the variety and complexity of the activities that can be detected. For instance, the sitting activity can be detected by IMU data, but it cannot be determined whether the subject has sat on a chair or a sofa, or where the subject is. To perform fine-grained activity classification, and to distinguish between activities that cannot be differentiated by only IMU data, we present an autonomous and robust method using data from both wearable cameras and IMUs. In contrast to convolutional neural network-based approaches, we propose to employ capsule networks to obtain features from egocentric video data. Moreover, Convolutional Long Short Term Memory framework is employed both on egocentric videos and IMU data to capture the temporal aspect of actions. We also propose a genetic algorithm-based approach to autonomously and systematically set various network parameters, rather than using manual settings. Experiments have been conducted to perform 9- and 26-label activity classification, and the proposed method, using autonomously set network parameters, has provided very promising results, achieving overall accuracies of 86.6% and 77.2%, respectively. The proposed approach, combining both modalities, also provides increased accuracy compared to using only egovision data and only IMU data.

47 OTHER INSTRUMENTATION↗

Algebraic Multigrid Solvers for Coupled PDE Systems (Final Report – B619169)

The Pennsylvania State University (“Subcontractor”) worked on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications, with a main emphasis on the design of new optimal algebraic multigrid interpolation. Generally, the aim of this work was to develop geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers. The research in these areas built on previous works, focusing on the following topics: (1) design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity; (2) development of non-Galerkin coarsening techniques for the Wilson Dirac system; and (3) the use of this same Wilson MG solver for preconditioning the Overlap and Domain Wall formulations of the Dirac equation.

97 MATHEMATICS AND COMPUTING↗

AlgaeOrtho, a bioinformatics tool for processing ortholog inference results in algae

Introduction: Microalgae constitute a prominent feedstock for producing biofuels and biochemicals by virtue of their prolific reproduction, high bioproduct accumulation, and the ability to grow in brackish and saline water. However, naturally occurring wild type algal strains are rarely optimal for industrial use; therefore, bioengineering of algae is necessary to generate superior performing strains that can address production challenges in industrial settings, particularly the bioenergy and bioproduct sectors. One of the crucial steps in this process is deciding on a bioengineering target: namely, which gene/protein to differentially express. These targets are often orthologs which are defined as genes/proteins originating from a common ancestor in divergent species. Although bioinformatics tools for the identification of protein orthologs already exist, processing the output from such tools is nontrivial, especially for a researcher with little or no bioinformatics experience. Methods: The present study introduces AlgaeOrtho, a user-friendly tool that builds upon the SonicParanoid orthology inference tool (based on an algorithm that identifies potential protein orthologs based on amino acid sequences) and the PhycoCosm database from JGI (Joint Genome Institute) to help researchers identify orthologs of their proteins of interest in multiple diverse algal species. Results: The output of this application includes a table of the putative orthologs of their protein of interest, a heatmap showing sequence similarity (%), and an unrooted tree of the putative protein orthologs. Notably, the tool would be instrumental in identifying novel bioengineering targets in different algal strains, including targets in not-fully annotated algal species, since it does not depend on existing protein annotations. We tested AlgaeOrtho using three case studies, for which orthologs of proteins relevant to bioengineering targets, were identified from diverse algal species, demonstrating its ease of use and utility for bioengineering researchers. Discussion: This tool is unique in the protein ortholog identification space as it can visualize putative orthologs, as desired by the user, across several algal species.

09 BIOMASS FUELS↗

Obtaining Accurate Derivatives Across Adaptive-Step Integration

Obtaining derivatives through the integration of a set of ordinary differential equations is of interest to a number of fields of research. Approaches for doing so that are available in the literature, however, do not account for details associated with variable step integrator that cause inaccuracies in the total derivatives. In this paper, we explore the causes of the accumulation of derivative error in adaptive-step Runge-Kutta integration schemes and propose a solution to eliminate them. The new algorithm proposed is a transformation of each step of a Runge-Kutta integration into a set of residual equations. This work demonstrates the improvement in accuracy of total derivatives when the new algorithm is utilized.

Kaushik Ponnapalli↗

Identification of Unknown Interface Locations in a Source/Shield System Using the Mesh Adaptive Direct Search Method

The Levenberg-Marquardt (or simply Marquardt) and differential evolution (DE) optimization methods were recently applied to solve inverse transport problems. The Marquardt method is fast but convergence of the method is dependent on the initial guess. While it has been shown to work extremely well at finding an optimum independent of the initial guess, the DE method does not provide a global optimal solution in some problems. In this paper, we apply the Mesh Adaptive Direct Search (MADS) algorithm to solve the inverse problem of material interface location identification in one-dimensional spherical radiation source/shield systems, and we compare the results obtained by MADS to those obtained by Levenberg-Marquardt and DE.

42 ENGINEERING↗

Method and apparatus for constructing informative outcomes to guide multi-policy decision making

In Multi-Policy Decision-Making (MPDM), many computationally-expensive forward simulations are performed in order to predict the performance of a set of candidate policies. In risk-aware formulations of MPDM, only the worst outcomes affect the decision making process, and efficiently finding these influential outcomes becomes the core challenge. Recently, stochastic gradient optimization algorithms, using a heuristic function, were shown to be significantly superior to random sampling. In this disclosure, it was shown that accurate gradients can be computed-even through a complex forward simulation—using approaches similar to those in dep networks. The proposed approach finds influential outcomes more reliably, and is faster than earlier methods, allowing one to evaluate more policies while simultaneously eliminating the need to design an easily-differentiable heuristic function.

Olson, Edwin↗

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗

Three-phase Interstellar Medium in Galaxies Resolving Evolution with Star Formation and Supernova Feedback (TIGRESS): Algorithms, Fiducial Model, and Convergence

We introduce TIGRESS, a novel framework for multi-physics numerical simulations of the star-forming interstellar medium (ISM) implemented in the Athena MHD code. The algorithms of TIGRESS are designed to spatially and temporally resolve key physical features, including: (1) the gravitational collapse and ongoing accretion of gas that leads to star formation in clusters; (2) the explosions of supernovae (SNe), both near their progenitor birth sites and from runaway OB stars, with time delays relative to star formation determined by population synthesis; (3) explicit evolution of SN remnants prior to the onset of cooling, which leads to the creation of the hot ISM; (4) photoelectric heating of the warm and cold phases of the ISM that tracks the time-dependent ambient FUV field from the young cluster population; (5) large-scale galactic differential rotation, which leads to epicyclic motion and shears out overdense structures, limiting large-scale gravitational collapse; (6) accurate evolution of magnetic fields, which can be important for vertical support of the ISM disk as well as angular momentum transport. We present tests of the newly implemented physics modules, and demonstrate application of TIGRESS in a fiducial model representing the solar neighborhood environment. We use a resolution study to demonstrate convergence and evaluate the minimum resolution Δx required to correctly recover several ISM properties, including the star formation rate, wind mass-loss rate, disk scale height, turbulent and Alfvénic velocity dispersions, and volume fractions of warm and hot phases. For the solar neighborhood model, all these ISM properties are converged at Δx⩽8 pc.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of Gaussian Bayes classifier to differentiate chlorine-based chemical agents

The Portable Isotopic Neutron Spectroscopy (PINS) is a commercialized system developed by Idaho National Laboratory (INL) to examine chemical warfare agents (CWA) non-destructively, utilizing Prompt Gamma Neutron Activation Analysis (PGNAA) techniques. The PINS system takes advantage of a high-resolution gamma-ray spectrum from a mechanically-cooled high-purity germanium (HPGe) detector. One of the difficult technical challenges is to discriminate the chlorine-based chemical agents. Especially, CN, CNB, CNS and CG have similar chemical compositions to make it hard to discriminate them with a higher confidence. Current identification algorithms for PINS systems with 252-Cf sources have been improved and updated continuously as more field data became available, and new algorithms was studied to complement the current algorithms by adopting the Gaussian Bayes classifier. These new algorithms were intended to be applied to a subset of chlorine-based chemical agents, and their main goal is discriminate CN, CNB, CNS and CG with their ratios of the chlorine neutron inelastic 1763keV peak to the chlorine thermal neutron capture 1959keV peak, which is referred to as the “Cl i/c” or “clic” ratio in this study. The Cl i/c ratios were assumed to follow Gaussian distributions with the means and the standard deviations unique to their corresponding chemical agents. The prior probabilities of these four chemical agents were optimized with a collection of field data to achieve the best performance in terms of precision or positive predictive value (PPV). Finally, their posterior probabilities as functions of the Cl i/c ratio were implemented in the current version of PINS analysis software in order to be tested with more field data.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Nanoindentation mapping defects filtration for heterogeneous materials using generative adversarial networks

Advanced composite materials with multiple phases and heterogeneous microstructure necessitate spatial mapping characterization of elastic modulus to develop constitutive relations and overall mechanical response. Such modulus mapping can be obtained using the nanoindentation technique, where the indenter tip raster over the selected microstructure region. Typically, a surface preparation procedure is done in the specimens to ensure proper contact between the indenter tip and sample surface. However, a near-perfect surface finish is unachievable in heterogeneous materials, primarily with ceramic reinforcements, due to the differential material removal rate during polishing. Thus, the nanoindenter records localized erroneous measurements due to differences in surface roughness and corresponding force response. This study establishes a novel deep learning-based strategy to rectify incorrect experimental spatial measurements acquire during nanoindentation modulus mapping. Here, the integrated bicubic interpolation and generative adversarial networks (GANs) model was trained using 14 ceramic and 18 metallic data sets, each comprising 65,536 measurements. The developed algorithm was validated against experimental measurements on four unknown specimens. The standard deviation in measured elastic modulus reduces by ~50% in ceramics and ~72% in metallic samples. This computational framework proposes a novel approach to reducing uncertainty in materials’ properties using state-of-the-art computer vision techniques.

36 MATERIALS SCIENCE↗

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An extended trajectory-mechanics approach for calculating two-phase flow paths

A technique originating in quantum dynamics is used to derive a trajectory-based, semi-analytical solution for two-phase flow. The partial differential equation governing the evolution of the aqueous phase is equivalent to a family of ordinary differential equations defined along a path through the porous medium. The trajectories may be found by solving the differential equations directly or by post-processing the output of a numerical solution to the full set of governing equations. The trajectories, which differ from conventional streamlines, are found to bend downward in response to gravitational forces. The curvature is more pronounced as the dip of the porous layer containing the flow increases. Subtle changes in the relative permeability curve can lead to significant variations in the trajectories. The ordinary differential equation for the trajectory provides an expression for the travel time along the path. The expression produces a semi-analytical approximation to the model parameter sensitivities, the partial derivatives of the travel times with respect to changes in the permeability model. The semi-analytical trajectory-based sensitivities generally agree with those computed using a numerical reservoir simulator and a perturbation approach. The sensitivities are useful in tomographic imaging algorithms designed to estimate the spatial variation in permeability within a porous medium using multiphase observations.

58 GEOSCIENCES↗

Convex relaxation for Fokker–Planck equation

We propose an approach to directly estimate the moments or marginals for a high-dimensional equilibrium distribution in statistical mechanics by solving the high-dimensional Fokker–Planck equation in terms of low-order cluster moments or marginals. With this approach, we bypass the exponential complexity of estimating the full high-dimensional distribution and directly solve the simplified partial differential equations for low-order moments/marginals. Moreover, the proposed moment/marginal relaxation is fully convex and can be solved via off-the-shelf solvers. We further propose a time-dependent version of the convex programs to study non-equilibrium dynamics. In a specific setting, we show the proposed method can recover a mean-field-type equilibrium density. Numerical results are provided to demonstrate the performance of the proposed algorithm for high-dimensional systems.

Chen, Yian↗

Stochastic basis adaptation and spatial domain decomposition for partial differential equations with random coefficients

We present a novel approach for high-dimensional stochastic partial differential equations that decomposes the computational domain into smaller disjoint subdomains and reduces the random dimension in each subdomain to save computational costs. The proposed approach combines spatial domain decomposition and stochastic basis adaptation in each subdomain. We adapt the stochastic basis in each subdomain such that the local solution has a low-dimensional random space representation. To compute the stochastic solution in each subdomain, we use the Neumann-Neumann algorithm, where we first estimate the interface solution and then evaluate the interior solution in each subdomain using the interface solution as a boundary condition. The interior solutions in each subdomain are computed independently of each other, which reduces the operation count from $\approx O(N^\alpha)$ to $\approx O(M^\alpha),$ where $N$ is the total number of degrees of freedom, $M$ is the number of degrees of freedom in each subdomain, and the exponent $\alpha>1$ depends on the uncertainty quantification method used. In addition, the localized nature of solutions makes the proposed approach highly parallelizable. We illustrate the accuracy and efficiency of the approach for a steady-state diffusion equation with a random space-dependent diffusion coefficient.

uncertainty quantification, basis adaptation↗