Search NASA⌕ Search

SEARCH · Search NASA

Results for “computationally expensive function”

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 19 records

Memory-efficient emulation of physical tabular data using quadtree decomposition

Computationally expensive functions are sometimes replaced in simulations with an emulator that approx-imates the true function (e.g., equations of state, wavelength-dependent opacity, or composition-dependent materials properties). For functions that have a constrained domain of interest, this can be done by discretizing the domain and performing a local interpolation on the tabulated function values of each local domain. For these so-called tabular data methods, the method of discretizing the domain and mapping the input space to each subdomain can drastically influence the memory and computational costs of the emulator. This is especially true for functions that vary drastically in different regions. We present a method for domain discretization and mapping that utilizes quadtrees, which results in significant reductions in the size of the emulator with minimal increases to computational costs or loss of global accuracy. We apply our method to the electron-positron Helmholtz free energy equation of state and show over an order of magnitude reduction in memory costs for reasonable levels of numerical accuracy.

97 MATHEMATICS AND COMPUTING↗

Structure-aware methods for expensive derivative-free nonsmooth composite optimization

We present new methods for solving a broad class of bound-constrained nonsmooth composite minimization problems. These methods are specially designed for objectives that are some known mapping of outputs from a computationally expensive function. We provide accompanying implementations of these methods: in particular, a novel manifold sampling algorithm (MS-P) with subproblems that are in a sense primal versions of the dual problems solved by previous manifold sampling methods and a method (GOOMBAH) that employs more difficult optimization subproblems. For these two methods, we provide rigorous convergence analysis and guarantees. We demonstrate extensive testing of these methods. Open-source implementations of the methods developed in this manuscript can be found at https://github.com/POptUS/ IBCDFO/.

97 MATHEMATICS AND COMPUTING↗

CONORBIT: constrained optimization by radial basis function interpolation in trust regions

Here, this paper presents CONORBIT (CONstrained Optimization by Radial Basis function Interpolation in Trust regions), a derivative-free algorithm for constrained black-box optimization where the objective and constraint functions are computationally expensive. CONORBIT employs a trust-region framework that uses interpolating radial basis function (RBF) models for the objective and constraint functions, and is an extension of the ORBIT algorithm. It uses a small margin for the RBF constraint models to facilitate the generation of feasible iterates, and extensive numerical tests confirm that such a margin is helpful in improving performance. CONORBIT is compared with other algorithms on 27 test problems, a chemical process optimization problem, and an automotive application. Numerical results show that CONORBIT performs better than COBYLA, a sequential penalty derivative-free method, an augmented Lagrangian method, a direct search method, and another RBF-based algorithm on the test problems and on the automotive application.

97 MATHEMATICS AND COMPUTING↗

Accurate Prediction of HSE06 Band Structures for a Diverse Set of Materials Using Δ-Learning

Here we used machine learning (ML) to accurately predict eigenvalues of the hybrid HSE06 functional using eigenvalues computed by the less computationally expensive PBE functional and associated electronic features based on the k-point resolved atomic band character. The ML model was trained by using eigenvalues from only one k-point for each of the 168 compounds in the training set. The HSE06 eigenvalues across all k-points were then predicted for a separate set of 169 compounds with a mean absolute error (MAE) of 0.13 eV, representing a significant improvement over the error of PBE-computed eigenvalues relative to that of HSE06 (MAE = 0.96 eV). These accurately predicted eigenvalues result in remarkably accurate predictions for the band structures, projected density of states, and band gaps, even though the model was not explicitly trained on these other properties. Finally, we demonstrate that our ML model has a similar accuracy for both ternary and quaternary compounds well outside the initial training set and on systems with 112 and 160 atoms, demonstrating its potential to rapidly predict HSE06-quality electronic structures of complex materials that are practically unfeasible for HSE06.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ConKer: An algorithm for evaluating correlations of arbitrary order

Context. High order correlations in the cosmic matter density have become increasingly valuable in cosmological analyses. However, computing these correlation functions is computationally expensive. Aims. We aim to circumvent these challenges by developing a new algorithm called ConKer for estimating correlation functions. Methods. This algorithm performs convolutions of matter distributions with spherical kernels using FFT. Since matter distributions and kernels are defined on a grid, it results in some loss of accuracy in the distance and angle definitions. We study the algorithm setting at which these limitations become critical and suggest ways to minimize them. Results. ConKer is applied to the CMASS sample of the SDSS DR12 galaxy survey and corresponding mock catalogs, and is used to compute the correlation functions up to correlation order n = 5. We compare the n = 2 and n = 3 cases to traditional algorithms to verify the accuracy of the new algorithm. We perform a timing study of the algorithm and find that three of the four distinct processes within the algorithm are nearly independent of the catalog size N , while one subdominant component scales as O ( N ). The dominant portion of the calculation has complexity of O ( N c 4/3 log N c ), where N c is the of cells in a three-dimensional grid corresponding to the matter density. Conclusions. We find ConKer to be a fast and accurate method of probing high order correlations in the cosmic matter density, then discuss its application to upcoming surveys of large-scale structure.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic average model methods

We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are computationally expensive and evaluating all summands on every iteration of an optimization method may be undesirable. Here we present the idea of stochastic average model (SAM) methods, inspired by stochastic average gradient methods. SAM methods sample component functions on each iteration of a trust-region method according to a discrete probability distribution on component functions; the distribution is designed to minimize an upper bound on the variance of the resulting stochastic model. We present promising numerical results concerning an implemented variant extending the derivative-free model-based trust-region solver POUNDERS, which we name SAM-POUNDERS.

97 MATHEMATICS AND COMPUTING↗

Determining frequentist confidence limits using a directed parameter space search

We consider the problem of inferring constraints on a high-dimensional parameter space with a computationally expensive likelihood function. We propose a machine learning algorithm that maps out the Frequentist confidence limit on parameter space by intelligently targeting likelihood evaluations so as to quickly and accurately characterize the likelihood surface in both low- and high-likelihood regions. We compare our algorithm to Bayesian credible limits derived by the well-tested Markov Chain Monte Carlo (MCMC) algorithm using both multi-modal toy likelihood functions and the seven yr Wilkinson Microwave Anisotropy Probe cosmic microwave background likelihood function. We find that our algorithm correctly identifies the location, general size, and general shape of high-likelihood regions in parameter space while being more robust against multi-modality than MCMC.

79 ASTRONOMY AND ASTROPHYSICS↗

Classifier-Guided Sampling for Complex Energy System Optimization

This report documents the results of a Laboratory Directed Research and Development (LDRD) effort entitled “Classifier-Guided Sampling for Complex Energy System Optimization” that was conducted during FY 2014 and FY 2015. The goal of this project was to develop, implement, and test major improvements to the classifier-guided sampling (CGS) algorithm. CGS is type of evolutionary algorithm for performing search and optimization over a set of discrete design variables in the face of one or more objective functions. Existing evolutionary algorithms, such as genetic algorithms, may require a large number of objective function evaluations to identify optimal or near-optimal solutions. Reducing the number of evaluations can result in significant time savings, especially if the objective function is computationally expensive. CGS reduces the evaluation count by using a Bayesian network classifier to filter out non-promising candidate designs, prior to evaluation, based on their posterior probabilities. In this project, both the single-objective and multi-objective versions of the CGS are developed and tested on a set of benchmark problems. As a domain-specific case study, CGS is used to design a microgrid for use in islanded mode during an extended bulk power grid outage.

24 POWER TRANSMISSION AND DISTRIBUTION↗

MISO - Mixed Integer Surrogate Optimization

MISO is an optimization framework for solving computationally expensive mixed-integer, black-box, global optimization problems. MISO uses surrogate models to approximate the computationally expensive objective function. Hence, derivative information, which is generally unavailable for black-box simulation objective functions, is not needed. MISO allows the user to choose the initial experimental design strategy, the type of surrogate model, and the sampling strategy.

Mueller, Juliane↗

Exploring the dependence of gas cooling and heating functions on the incident radiation field with machine learning

ABSTRACT Gas cooling and heating functions play a crucial role in galaxy formation. But, it is computationally expensive to exactly compute these functions in the presence of an incident radiation field. These computations can be greatly sped up by using interpolation tables of pre-computed values, at the expense of making significant and sometimes even unjustified approximations. Here, we explore the capacity of machine learning to approximate cooling and heating functions with a generalized radiation field. Specifically, we use the machine learning algorithm XGBoost to predict cooling and heating functions calculated with the photoionization code cloudy at fixed metallicity, using different combinations of photoionization rates as features. We perform a constrained quadratic fit in metallicity to enable a fair comparison with traditional interpolation methods at arbitrary metallicity. We consider the relative importance of various photoionization rates through both a principal component analysis (PCA) and calculation of SHapley Additive exPlanation (shap) values for our XGBoost models. We use feature importance information to select different subsets of rates to use in model training. Our XGBoost models outperform a traditional interpolation approach at each fixed metallicity, regardless of feature selection. At arbitrary metallicity, we are able to reduce the frequency of the largest cooling and heating function errors compared to an interpolation table. We find that the primary bottleneck to increasing accuracy lies in accurately capturing the metallicity dependence. This study demonstrates the potential of machine learning methods such as XGBoost to capture the non-linear behaviour of cooling and heating functions.

79 ASTRONOMY AND ASTROPHYSICS↗

Structural and dynamic properties of solvated hydroxide and hydronium ions in water from ab initio modeling

Predicting the asymmetric structure and dynamics of solvated hydroxide and hydronium in water from ab initio molecular dynamics (AIMD) has been a challenging task. The difficulty mainly comes from a lack of accurate and efficient exchange–correlation functional in elucidating the amphiphilic nature and the ubiquitous proton transfer behaviors of the two ions. By adopting the strongly constrained and appropriately normed (SCAN) meta-generalized gradient approximation functional in AIMD simulations, we systematically examine the amphiphilic properties, the solvation structures, the electronic structures, and the dynamic properties of the two water ions. In particular, we compare these results to those predicted by the PBE0-TS functional, which is an accurate yet computationally more expensive exchange–correlation functional. We demonstrate that the general-purpose SCAN functional provides a reliable choice for describing the two water ions. Specifically, in the SCAN picture of water ions, the appearance of the fourth and fifth hydrogen bonds near hydroxide stabilizes the pot-like shape solvation structure and suppresses the structural diffusion, while the hydronium stably donates three hydrogen bonds to its neighbors. We apply a detailed analysis of the proton transfer mechanism of the two ions and find the two ions exhibit substantially different proton transfer patterns. In conclusion, our AIMD simulations indicate that hydroxide diffuses more slowly than hydronium in water, which is consistent with the experimental results.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Derivative-free optimization for parameter estimation in computational nuclear physics

We consider optimization problems that arise when estimating a set of unknown parameters from experimental data, particularly in the context of nuclear density functional theory. We examine the cost of not having derivatives of these functionals with respect to the parameters. We show that the POUNDERS code for local derivative-free optimization obtains consistent solutions on a variety of computationally expensive energy density functional calibration problems. We also provide a primer on the operation of the POUNDERS software in the Toolkit for advanced optimization.

Wild, Stefan M. (ORCID:0000000260992772)↗

Plasma Physics Approximations in Ares

Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, F n ( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Machine Learning Thermodynamics And Kinetics of Defects For Accelerated Materials Discovery

Atomistic defects play a pivotal role in functional and structural materials’ performance across a myriad of technology applications. Quantitative prediction of the thermodynamics and kinetics of defect formation and migration, respectively, typically requires accurate but expensive first-principles approaches, such as density functional theory (DFT). Their computational expense limits the throughput needed to perform high-throughput materials discovery/screening exercises or to perform materials modeling tasks relying on extensive sampling techniques. Therefore, in this Sandia National Laboratories Laboratory Directed Research and Development (LDRD) project (Project #229366), we developed a variety of machine learning techniques, trained on density functional theory calculations, to accelerate the discovery and modeling of materials in which vacancy and interstitial defects primarily dictate material performance. These include applications such as metal oxides for water-splitting or mixed ionic-electronic conduction, metal hydrides for hydrogen storage, and transition metal dichalcogenides for electronics, and the approaches developed herein can further be applied to many other domains that similarly depend on materials’ thermodynamic and kinetic defect properties for their desired functionality.

36 MATERIALS SCIENCE↗

Graph neural networks for CO 2 solubility predictions in Deep Eutectic Solvents

Deep Eutectic Solvents (DESs) are a promising class of solvents for CO 2 capture. DESs are complex mixtures that can be designed to optimize CO solubility and overall capture process efficiency. However, the vast design landscape of DES mixtures makes experimental investigation prohibitive; as such, there is a need for computational models that can quickly and efficiently navigate the design space and inform data collection efforts. In this work, we propose Graph Neural Network (GNN) models for predicting CO 2 solubility for DESs; the GNN leverages a mixture graph representation that captures the molecular structure of the DES components as well as their intermolecular interactions. Here, we compare the GNN framework against alternative architectures (neural networks, graph convolution networks, and random forests) and data representations (molecular fingerprints, sigma profiles, and graphs). We show that the proposed approach offers superior predictive performance; specifically, we show that solubility can be predicted reliably directly from molecular structure (without the need of using sigma profiles as proposed in previous studies). This result is important, as obtaining sigma profiles requires expensive density functional theory computations. We also explored the ability of GNNs to predict solubility for new DES mixtures and operating conditions. We found that the model extrapolates across temperature reliably. However, we also found deficiencies in the ability of the model to predict solubility for DES mixtures, pressures, and molar ratio not included in the training sets; we show that this is due to an inherent lack of chemical diversity in datasets available in the literature. The proposed computational capabilities can thus help navigate the design space of DES and inform data collection efforts. Our models, data, and benchmarks are shared as Python code implemented in Jupyter notebooks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine-Learning X-Ray Absorption Spectra to Quantitative Accuracy

Simulations of excited state properties, such as spectral functions, are often computationally expensive and therefore not suitable for high-throughput modeling. As a proof of principle, here we demonstrate that graph-based neural networks can be used to predict the x-ray absorption near-edge structure spectra of molecules to quantitative accuracy. Specifically, the predicted spectra reproduce nearly all prominent peaks, with 90% of the predicted peak locations within 1 eV of the ground truth. Besides its own utility in spectral analysis and structure inference, our method can be combined with structure search algorithms to enable high-throughput spectrum sampling of the vast material configuration space, which opens up new pathways to material design and discovery.

97 MATHEMATICS AND COMPUTING↗

Importance of elastic finite-size effects: Neutral defects in ionic compounds

Small system sizes are a well known source of error in DFT calculations, yet computational constraints frequently dictate the use of small supercells, often as small as 96 atoms in oxides and compound semiconductors. In ionic compounds, electrostatic finite size effects have been well characterised, but self-interaction of charge neutral defects is often discounted or assumed to follow an asymptotic behaviour and thus easily corrected with linear elastic theory. Here we show that elastic effect are also important in the description of defects in ionic compounds and can lead to qualitatively incorrect conclusions if inadequatly small supercells are used; moreover, the spurious self-interaction does not follow the behaviour predicted by linear elastic theory. Considering the exemplar cases of metal oxides with fluorite structure, we show that numerous previous studies, employing 96-atom supercells, misidentify the ground state structure of (charge neutral) Schottky defects. We show that the error is eliminated by employing larger cells (324, 768 and 1500 atoms), and careful analysis determines that elastic effects, not electrostatic, are responsible. The spurious self-interaction was also observed in non-oxide ionic compounds and irrespective of the computational method used, thereby resolving long standing discrepancies between DFT and force-field methods, previously attributed to the level of theory. The surprising magnitude of the elastic effects are a cautionary tale for defect calculations in ionic materials, particularly when employing computationally expensive methods (e.g. hybrid functionals) or when modelling large defect clusters. We propose two computationally practicable methods to test the magnitude of the elastic self-interaction in any ionic system. In commonly studies oxides, where electrostatic effects would be expected to be dominant, it is the elastic effects that dictate the need for larger supercells | greater than 96 atoms.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The Quest for Accurate Liquid Water Properties from First Principles

Developing accurate ab initio molecular dynamics (AIMD) models that capture both electronic reorganization and nuclear quantum effects associated with hydrogen bonding is key to quantitative understanding of bulk water and its anomalies, as well as its role as a universal solvent. For condensed phase simulations, AIMD has typically relied on the generalized gradient approximation (GGA) of Density Functional Theory (DFT) as the underlying model chemistry for the potential energy surface, with nuclear quantum effects (NQEs) sometimes modeled by performing classical molecular dynamics simulations at elevated temperatures. Here we show that the properties of liquid water obtained from the meta-GGA B97M-rV functional, when evaluated using accelerated path integral molecular dynamics simulations, displays accuracy comparable to a computationally expensive dispersion corrected hybrid functional, revPBE0-D 3 . We show that the meta-GGA DFT reproduces bulk water properties including radial distribution functions, self-diffusion coefficients, and infrared (IR) spectra with comparable accuracy of a much more expensive hybrid functional. In conclusion, this work demonstrates that the underlying quality of a good DFT functional requires evaluation with quantum nuclei, and that high temperature simulations are a poor proxy for properly treating nuclear quantum effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗