Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gradient estimation”

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 55 records · Page 3

Stochastic gradient descent for optimization for nuclear systems

The use of gradient descent methods for optimizing k-eigenvalue nuclear systems has been shown to be useful in the past, but the use of k-eigenvalue gradients have proved computationally challenging due to their stochastic nature. ADAM is a gradient descent method that accounts for gradients with a stochastic nature. This analysis uses challenge problems constructed to verify if ADAM is a suitable tool to optimize k-eigenvalue nuclear systems. ADAM is able to successfully optimize nuclear systems using the gradients of k-eigenvalue problems despite their stochastic nature and uncertainty. Furthermore, it is clearly demonstrated that low-compute time, high-variance estimates of the gradient lead to better performance in the optimization challenge problems tested here.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Temperature Homogeneity under Selective and Localized Microwave Heating in Structured Flow Reactors

Selective heating of different phases of multiphase systems via microwaves can result in energy savings and suppression of side reactions. However, materials properties and operating conditions that maximize temperature gradients are poorly understood. Here we utilize computational fluid dynamics (CFD) computations and temperature measurements in structured flow reactors (monoliths) in a monomodal microwave cavity to assess the temperature difference between the walls and the fluid and develop a simple lumped model to estimate when temperature gradients exist. We also explore the material’s thermal and electrical properties of structured reactors for isothermal catalyst conditions. We propose that CFD simulations can be used as a nonintrusive, predictive tool of temperature homogeneity. Importantly, we demonstrate that localized heating in the bed under several conditions rather than selective heating is responsible for the selectivity enhancement. Furthermore, our results indicate that structured beds made of high thermal conductivity materials avoid arcing and enable temperature homogeneity and low electrical conductivity materials allow microwaves to penetrate the domain.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the convergence and convergence order of finite volume gradient schemes for oblique derivative boundary value problems

This work is an improvement of the previous note (Bradji in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) which dealt with the convergence analysis of a finite volume scheme for the Poisson’s equation with a linear oblique derivative boundary condition. The formulation of the finite volume scheme given in Bradji (in: Fuhrmann et al., Finite volumes for complex applications VII–methods, theoretical aspects. Proceedings of the FVCA 7, Berlin, 2014) involves the discrete gradient introduced recently in Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010). In this paper, we consider the convergence analysis of finite volume schemes involving the discrete gradient of Eymard et al. (IMA J Numer Anal 30(4):1009–1043, 2010) for elliptic and parabolic equations with linear oblique derivative boundary conditions. Linear oblique derivative boundary conditions arise for instance in the study of the motion of water in a canal, cf. Lesnic (Commun Numer Methods Eng 23(12):1071–1080, 2007). We derive error estimates in several norms which allow us to get error estimates for the approximations of the exact solutions and its first derivatives. In particular, we provide an error estimate between the gradient of the exact solutions and the discrete gradient of the approximate solutions. Convergence of the family of finite volume approximate solutions towards the exact solution under weak regularity assumption is also investigated. In the case of parabolic equations with oblique derivative boundary conditions, we develop a new discrete a priori estimate result. The proof of this result is based on the use of a discrete mean Poincaré–Wirtinger inequality. Thanks to the stated a priori estimate and to a comparison with an appropriately chosen auxiliary finite volume scheme, we derive the convergence results. This work can be viewed as a continuation of the previous work (Bradji and Gallouët in Int J Finite Vol 3(2):1–35, 2006) where a convergence analysis for a finite volume scheme, based on the admissible mesh of Eymard et al. (In: Ciarlet and Lions, Handbook of numerical analysis, North-Holland, Amsterdam, 2000), for the Poisson’s equation with a linear oblique derivative boundary conditions is given. The obtained convergence results do not require any relation between the mesh sizes of the spatial and time discretizations. Some numerical tests are presented for both elliptic and parabolic equations. In particular, we present three methods to compute the discrete solution.

97 MATHEMATICS AND COMPUTING↗

Automated extraction of interfacial dislocations and disconnections from atomistic data

Here we introduce Interfacial Line Defect Analysis (ILDA), a method for identifying and extracting interfacial dislocations and disconnections with little-to-no input from the user on the nature of the interface. By simply providing the orientations and coherency strains for the crystals in a coherent reference state of the interface, ILDA provides exact Burgers vectors. Alternatively, these orientations and strains can be estimated using local atomic deformation gradients, making ILDA fully automated and providing estimated Burgers vectors. ILDA also determines the step height associated with each defect line segment, in case the associated defect is a disconnection. The heart of the method is the identification of atoms residing at co-incidence sites between the two crystals and the construction of a surface mesh connecting these sites that is used to compose Burgers circuits and insert defect line segments. We demonstrate the performance of ILDA in two test cases: a twist grain boundary and a phase boundary.

36 MATERIALS SCIENCE↗

Gradient-Based Multi-Area Distribution System State Estimation

The increasing distributed and renewable energy resources and controllable devices in distribution systems make fast distribution system state estimation (DSSE) crucial in system monitoring and control. We consider a large multi-phase distribution system and formulate DSSE as a weighted least squares (WLS) problem. We divide the large distribution system into smaller areas of subtree structure, and by jointly exploring the linearized power flow model and the network topology, we propose a gradient-based multi-area algorithm to exactly and efficiently solve the WLS problem. The proposed algorithm enables distributed and parallel computation of the state estimation problem without compromising any performance. Numerical results on a 4,521-node test feeder show that the designed algorithm features fast convergence and accurate estimation results. Comparison with traditional Gauss-Newton method shows that the proposed method has much better performance in distribution systems with a limited amount of reliable measurement. The real-time implementation of the algorithm tracks time-varying system states with high accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Deep Learning Approaches to Surrogates for Solving the Diffusion Equation for Mechanistic Real-World Simulations

In many mechanistic medical, biological, physical, and engineered spatiotemporal dynamic models the numerical solution of partial differential equations (PDEs), especially for diffusion, fluid flow and mechanical relaxation, can make simulations impractically slow. Biological models of tissues and organs often require the simultaneous calculation of the spatial variation of concentration of dozens of diffusing chemical species. One clinical example where rapid calculation of a diffusing field is of use is the estimation of oxygen gradients in the retina, based on imaging of the retinal vasculature, to guide surgical interventions in diabetic retinopathy. Furthermore, the ability to predict blood perfusion and oxygenation may one day guide clinical interventions in diverse settings, i.e., from stent placement in treating heart disease to BOLD fMRI interpretation in evaluating cognitive function (Xie et al., 2019; Lee et al., 2020). Since the quasi-steady-state solutions required for fast-diffusing chemical species like oxygen are particularly computationally costly, we consider the use of a neural network to provide an approximate solution to the steady-state diffusion equation. Machine learning surrogates, neural networks trained to provide approximate solutions to such complicated numerical problems, can often provide speed-ups of several orders of magnitude compared to direct calculation. Surrogates of PDEs could enable use of larger and more detailed models than are possible with direct calculation and can make including such simulations in real-time or near-real time workflows practical. Creating a surrogate requires running the direct calculation tens of thousands of times to generate training data and then training the neural network, both of which are computationally expensive. Often the practical applications of such models require thousands to millions of replica simulations, for example for parameter identification and uncertainty quantification, each of which gains speed from surrogate use and rapidly recovers the up-front costs of surrogate generation. We use a Convolutional Neural Network to approximate the stationary solution to the diffusion equation in the case of two equal-diameter, circular, constant-value sources located at random positions in a two-dimensional square domain with absorbing boundary conditions. Such a configuration caricatures the chemical concentration field of a fast-diffusing species like oxygen in a tissue with two parallel blood vessels in a cross section perpendicular to the two blood vessels. To improve convergence during training, we apply a training approach that uses roll-back to reject stochastic changes to the network that increase the loss function. The trained neural network approximation is about 1000 times faster than the direct calculation for individual replicas. Because different applications will have different criteria for acceptable approximation accuracy, we discuss a variety of loss functions and accuracy estimators that can help select the best network for a particular application. We briefly discuss some of the issues we encountered with overfitting, mismapping of the field values and the geometrical conditions that lead to large absolute and relative errors in the approximate solution.

60 APPLIED LIFE SCIENCES↗

Finding wombling boundaries in LHC data with Voronoi and Delaunay tessellations

We address the problem of finding a wombling boundary in point data generated by a general Poisson point process, a specific example of which is an LHC event sample distributed in the phase space of a final state signature, with the wombling boundary created by some new physics. We discuss the use of Voronoi and Delaunay tessellations of the point data for estimating the local gradients and investigate methods for sharpening the boundaries by reducing the statistical noise. The outcome from traditional wombling algorithms is a set of boundary cell candidates with relatively large gradients, whose spatial properties must then be scrutinized in order to construct the boundary and evaluate its significance. Here we propose an alternative approach where we simultaneously form and evaluate the significance of all possible boundaries in terms of the total gradient flux. We illustrate our method with several toy examples of both straight and curved boundaries with varying amounts of signal present in the data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The effects of turbulence on the flame structure and NO formation of ammonia turbulent premixed combustion at various equivalence ratios

Ammonia is carbon-free and is regarded as a potential fuel to address global warming issues. Here, in this work, three-dimensional direct numerical simulations (DNS) of ammonia/air turbulent premixed flames were performed to explore the influence of turbulence and equivalence ratio on the flame structure and NO formation characteristics. Two equivalence ratios were considered, i.e. Φ=0.9 and Φ=1.1. The general flame structures were presented and species distributions were examined. The NO mass fraction was found to be the highest in the product for the lean case and in the reaction zone for the rich case. The conditional mean values of species mass fractions and reaction rates were compared with those of the unstrained and strained laminar premixed flames to explore how well the laminar flame structures can approach those of the turbulent flame. The budget analysis of the species transport equations showed that turbulent diffusion plays an important role in species transport. The turbulent diffusivity D T was estimated using the gradient hypothesis based on the DNS data. Various laminar flame simulations with different diffusivities were carried out. It was shown that the conditional means of the DNS agree well with those of the laminar flames including D T in the transport property calculation. The global and local NO formation characteristics were investigated. It was found that the mean NO production conditioned on the progress variable is lower compared with the corresponding laminar flame in the rich case. However, the relative contributions from various NO pathways are rarely affected by turbulence. The NO mass fraction is higher in negative curvature regions compared with positive curvature regions of the flame surface for the rich case, which is due to the preferential diffusion of H 2 and other radicals and the enhanced NO pathways in negatively curved regions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of nonlinear turbulence in stellarators

We present new stellarator equilibria that have been optimized for reduced turbulent transport using nonlinear gyrokinetic simulations within the optimization loop. The optimization routine involves coupling the pseudo-spectral GPU-native gyrokinetic code GX with the stellarator equilibrium and optimization code DESC . Since using GX allows for fast nonlinear simulations, we directly optimize for reduced nonlinear heat fluxes. To handle the noisy heat flux traces returned by these simulations, we employ the simultaneous perturbation stochastic approximation (SPSA) method that only uses two objective function evaluations for a simple estimate of the gradient. We show several examples that optimize for both reduced heat fluxes and good quasi-symmetry as a proxy for low neoclassical transport. Finally, we run full transport simulations using the T3D stellarator transport code to evaluate the changes in the macroscopic profiles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resource frugal optimizer for quantum machine learning

Quantum-enhanced data science, also known as quantum machine learning (QML), is of growing interest as an application of near-term quantum computers. Variational QML algorithms have the potential to solve practical problems on real hardware, particularly when involving quantum data. However, training these algorithms can be challenging and calls for tailored optimization procedures. Specifically, QML applications can require a large shot-count overhead due to the large datasets involved. In this work, we advocate for simultaneous random sampling over both the dataset as well as the measurement operators that define the loss function. We consider a highly general loss function that encompasses many QML applications, and we show how to construct an unbiased estimator of its gradient. This allows us to propose a shot-frugal gradient descent optimizer called Refoqus (REsource Frugal Optimizer for QUantum Stochastic gradient descent). Our numerics indicate that Refoqus can save several orders of magnitude in shot cost, even relative to optimizers that sample over measurement operators alone.

97 MATHEMATICS AND COMPUTING↗

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗

Quantifying radial migration in the Milky Way: inefficient over short time-scales but essential to the very outer disc beyond ∼15 kpc

ABSTRACT Stellar radial migration plays an important role in reshaping a galaxy’s structure and the radial distribution of stellar population properties. In this work, we revisit reported observational evidence for radial migration and quantify its strength using the age–[Fe/H] distribution of stars across the Milky Way with APOGEE data. We find a broken age–[Fe/H] relation in the Galactic disc at r > 6 kpc, with a more pronounced break at larger radii. To quantify the strength of radial migration, we assume stars born at each radius have a unique age and metallicity, and then decompose the metallicity distribution function (MDF) of mono-age young populations into different Gaussian components that originated from various birth radii at rbirth < 13 kpc. We find that, at ages of 2 and 3 Gyr, roughly half the stars were formed within 1 kpc of their present radius, and very few stars (<5 per cent) were formed more than 4 kpc away from their present radius. These results suggest limited short-distance radial migration and inefficient long-distance migration in the Milky Way during the last 3 Gyr. In the very outer disc beyond 15 kpc, the observed age–[Fe/H] distribution is consistent with the prediction of pure radial migration from smaller radii, suggesting a migration origin of the very outer disc. We also estimate intrinsic metallicity gradients at ages of 2 and 3 Gyr of −0.061 and −0.063 dex kpc−1, respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗

Field Sensitivity Analysis of Turbulence Model Parameters for Flow Over a Wing

Reynolds-averaged-Navier-Stokes (RANS) turbulence models are a critical tool in computational-fluid-dynamics simulations of aerodynamic systems, but simulation results can be highly sensitive to RANS-model parameter choices. Sensitivity analysis can be used to quantify these impacts, and the objective of this study is to demonstrate field sensitivity analysis with respect to ten parameters in the 2003 Menter shear-stress-transport (SST) turbulence model. Here, the analysis is demonstrated for an application relevant to wind energy, namely, flow over a NACA 0015 wing at 12 degree angle of attack and a Reynolds number of 1.5 x 10 6 . We quantify sensitivity using Sobol indices and the mean-squared gradient, which are estimated using polynomial chaos and active subspace models, respectively. Our results indicate that there are substantial spatial variations in parameter sensitivities, with different sets of most-sensitive parameters near the wing, as well as in the downstream wake, consistent with the physical interpretations of the turbulence model inputs. We show that, for this particular turbulence model and flow, simultaneous dimension reduction is possible across all quantities of interest, enabling efficient exploration of model outcomes. Ultimately, this analysis provides new insights into turbulence model parameter sensitivities in incompressible flows, and also demonstrates the implementation of field sensitivity analysis for applications relevant to aerodynamics simulations.

17 WIND ENERGY↗

Analysis of vapor diffusion Nb$^{3}$Sn coating at Fermilab: Minimizing impurities using TOF-SIMS

Nb₃Sn demonstrates steady advancements nowadays offering reduced power cost in superconducting radio-frequency cavities due to its high critical temperature, quality factor, and achieved accelerating gradient. However, theoretical estimates of its radio-frequency parameters have not been achieved due to several potentially limiting mechanisms: tin spots, patchy regions, defects, thermal impedance, and impurities. While some of these limitations have been intensively studied, impurity analysis in Nb$_3$Sn coatings have received less attention. We report an investigation of impurities in several vapor-diffused Nb₃Sn coated samples using time-of-flight secondary ion mass spectroscopy (TOF-SIMS) and show allowable impurity levels in view of superconducting cavity performance. Challenges and lessons learned in maintaining clean Nb$_3$Sn coatings are also discussed.

Tagdulang, Nikki [Fermilab]↗

Challenges of Vapor Diffusion $Nb_3Sn$ Coating at Fermilab: Minimizing Impurities Using TOF-SIMS

Nb$_3$Sn demonstrates steady advancements nowadays offering reduced power cost in superconducting radio-frequency cavities due to its high critical temperature, quality factor, and achieved accelerating gradient. However, theoretical estimates of its radio-frequency parameters have not been achieved due to several potentially limiting mechanisms: tin spots, patchy regions, defects, thermal impedance, and impurities. While some of these limitations have been intensively studied, impurity analysis in Nb$_3$Sn coatings have received less attention. We report an investigation of impurities in several vapor-diffused Nb$_3$Snn coated samples using time-of-flight secondary ion mass spectroscopy (TOF-SIMS) and show allowable impurity levels in view of superconducting cavity performance. Challenges and lessons learned in maintaining clean Nb$_3$Sn coatings are also discussed.

Tagdulang, N. [Fermilab]↗

Training Restricted Boltzmann Machines With a D-Wave Quantum Annealer

Restricted Boltzmann Machine (RBM) is an energy-based, undirected graphical model. It is commonly used for unsupervised and supervised machine learning. Typically, RBM is trained using contrastive divergence (CD). However, training with CD is slow and does not estimate the exact gradient of the log-likelihood cost function. In this work, the model expectation of gradient learning for RBM has been calculated using a quantum annealer (D-Wave 2000Q), where obtaining samples is faster than Markov chain Monte Carlo (MCMC) used in CD. Training and classification results of RBM trained using quantum annealing are compared with the CD-based method. The performance of the two approaches is compared with respect to the classification accuracies, image reconstruction, and log-likelihood results. The classification accuracy results indicate comparable performances of the two methods. Image reconstruction and log-likelihood results show improved performance of the CD-based method. It is shown that the samples obtained from quantum annealer can be used to train an RBM on a 64-bit “bars and stripes” dataset with classification performance similar to an RBM trained with CD. Though training based on CD showed improved learning performance, training using a quantum annealer could be useful as it eliminates computationally expensive MCMC steps of CD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation and uncertainty quantification for the output from quantum simulators

The problem of estimating certain distributions over {0, 1} d is considered here. The distribution represents a quantum system of d qubits, where there are non-trivial dependencies between the qubits. A maximum entropy approach is adopted to reconstruct the distribution from exact moments or observed empirical moments. The Robbins Monro algorithm is used to solve the intractable maximum entropy problem, by constructing an unbiased estimator of the un-normalized target with a sequential Monte Carlo sampler at each iteration. In the case of empirical moments, this coincides with a maximum likelihood estimator. A Bayesian formulation is also considered in order to quantify uncertainty a posteriori. Several approaches are proposed in order to tackle this challenging problem, according to recently developed methodologies. In particular, unbiased estimators of the gradient of the log posterior are constructed and used within a provably convergent Langevin-based Markov chain Monte Carlo method. The methods are illustrated on classically simulated output from quantum simulators.

97 MATHEMATICS AND COMPUTING↗