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 181 records · Page 10

The economics of data acquisition computers for ST and MST radars

Some low cost options for data acquisition computers for ST (stratosphere, troposphere) and MST (mesosphere, stratosphere, troposphere) are presented. The particular equipment discussed reflects choices made by the University of Alaska group but of course many other options exist. The low cost microprocessor and array processor approach presented here has several advantages because of its modularity. An inexpensive system may be configured for a minimum performance ST radar, whereas a multiprocessor and/or a multiarray processor system may be used for a higher performance MST radar. This modularity is important for a network of radars because the initial cost is minimized while future upgrades will still be possible at minimal expense. This modularity also aids in lowering the cost of software development because system expansions should rquire little software changes. The functions of the radar computer will be to obtain Doppler spectra in near real time with some minor analysis such as vector wind determination.

Watkins, B. J.↗

First-principles calculation of the configurational energy density of states for a solid-state ion conductor with a variant of the Wang and Landau algorithm

In this work, a variant of the Wang and Landau algorithm for calculation of the configurational energy density of states is proposed. The algorithm was developed for the purpose of using first-principles simulations, such as density functional theory, to calculate the partition function of disordered sublattices in crystal materials. The expensive calculations of first-principles methods make a parallel algorithm necessary for a practical computation of the configurational energy density of states within a supercell approximation of a solid-state material. The algorithm developed in this work is tested with the two-dimensional (2d) Ising model to bench mark the algorithm and to help provide insight for implementation to a materials science application. Tests with the 2d Ising model revealed that the algorithm has good performance compared to the original Wang and Landau algorithm and the 1/$\textit{t}$ algorithm, in particular the short iteration performance. Further, a proof of convergence is presented within an adiabatic assumption, and the analysis is able to correctly predict the time dependence of the modification factor to the density of states. The algorithm was then applied to the lithium and lanthanum sublattice of the solid-state lithium ion conductor Li 0.5 La 0.5 TiO 3 . This was done to help understand the disordered nature of the lithium and lanthanum. The results find, overall, that the algorithm performs very well for the 2d Ising model and that the results for Li 0.5 La 0.5 TiO 3 are consistent with experiment while providing additional insight into the lithium and lanthanum ordering in the material. The primary result is that the lithium and lanthanum become more mixed between layers along the c axis for increasing temperature. In part, the simulation of the disordered Li 0.5 La 0.5 TiO 3 system serves as a benchmark for what size systems are currently and in the near future practical to calculate with density functional theory methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Modeling of Cavity Residence Time via Modeled Lagrangian Particle Tracking

One of the critical components in a scramjet is the cavity flame holder. In evaluating the sizing of this component, the residence time of the fuel in the cavity is a common parameter used. However, to obtain the residence time via CFD is an expensive undertaking. One method is to perform an LES simulation of the cavity and use Lagrangian particle tracking to obtain both the mean and probability density function of the time that the particles remain in the cavity. While this method affords a significant amount of information, it is very costly in CPU run time. A simpler method involves performing a time accurate RANS simulation of the cavity, and when converged, overlay a traceable scalar in the cavity region, and then record the decay of this scalar’s flux at a downstream location. The time scale of the decay rate can then be estimated and a residence time inferred. This method is less computationally expensive than the LES approach, but still requires a time-accurate solution while only providing a mean cavity residence time evaluation. In this paper a method of determining the mean cavity residence time as well as the Probability Density Function (PDF) of the residence time is proposed and demonstrated. This method is based on Lagrangian particle tracking modeled by the Generalized Langevin Equation and is implemented as a post-processing step for a steady RANS solution. Computational cost is on the order of minutes and the results are in agreement with values obtained by the LES and scalar decay methods.

Langevin↗

Photodissociation and Theory to Investigate Uranium Oxide Cluster Cations

Uranium oxide cluster cations of the form U n O m + are produced by laser vaporization of a depleted uranium rod in a pulsed supersonic expansion. Ions are mass-analyzed and mass-selected with a time-of-flight spectrometer and studied with UV laser multiphoton dissociation. Cations of the stoichiometry UO 2 (UO 3 ) n + were observed as photofragments from all photodissociated cluster cations. (UO 3 ) n + clusters were also observed to result from dissociation of larger (UO 3 ) n + clusters, with UO 3 neutral as a common leaving group. Electronic structure calculations were used to investigate the stability of the prominent uranium oxide cluster cations using density functional theory (DFT) with the hybrid B3LYP exchange-correlation functional and at the CCSD(T) level and cc-pVnZ-PP basis sets (n = D,T), including diffuse orbitals as computational expense and availability permitted. Clustering energies, relative energies and dissociation energies of the cations are reported. The lowest energy neutral (UO 3 ) n clusters up to n = 3 are rings, n = 4 and 5 are chains with very low energy rings, and n = 6 is 3D. Finally, the lowest energy structures for UO 2 (UO 3 ) n + are composed of uranyl-like UO 2 + units bound by bridging oxygens to other UO 2 2+ units for n = 2 and 3, and for n = 4 a more complex 3D structure is predicted.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Meta-modeling strategy for data-driven forecasting

Accurately forecasting the weather is a key requirement for climate change mitigation. Data-driven methods offer the ability to make more accurate forecasts, but lack interpretability and can be expensive to train and deploy if models are not carefully developed. Here, we make use of two historical climate data sets and tools from machine learning, to accurately predict temperature fields. Furthermore, we are able to use low fidelity models that are cheap to train and evaluate, to selectively avoid expensive high fidelity function evaluations, as well as uncover seasonal variations in predictive power. This allows for an adaptive training strategy for computationally efficient geophysical emulation.

Skinner, Dominic J↗

Demonstration of RANS models with wall functions in the spectral element code Nek5000

The spectral element based computational fluid dynamics (CFD) code Nek5000 has been traditionally used for high-fidelity applications, such as direct numerical simulation (DNS) and large eddy simulation (LES). These techniques require very fine numerical resolution to accurately capture turbulent fluctuations which can be prohibitively expensive for users without access to leadership class computing facilities. For broader application and adoption, significant effort has been invested to develop Reynolds-averaged Navier–Stokes (RANS) capabilities in Nek5000. Here, this work presents details of the implementation and demonstration of the standard wall functions for the κ–τ model in Nek5000. Results using the wall-modeled approach are compared to a wall-resolved approach for cases with negligible pressure gradient, viz., channel flow, pipe flow and flow in a reactor subchannel. Results show reasonably good agreement between the two approaches for friction factor and Nusselt number. Some expected differences are identified near the wall. These cases demonstrate the potential for significant computational savings by using much coarser meshes for the wall-modeled approach, with only minor differences between the predicted result. Additionally, several Reynolds numbers up to 1,000,000 are demonstrated for pipe flow and predicted friction factors and Nusselt numbers compared well to available correlations, with the worst below 10%. As the Reynolds number is increased, better agreement is observed between the correlations and the wall-modeled approach. In addition, flow in a molten salt fast reactor (MSFR) core is considered which features an adverse pressure gradient and flow separation. It showcases the inability of standard wall functions to accurately predict flows with adverse pressure gradients. The results, however, match reasonably well in trend in regions of the flow where the boundary layer is attached. Ongoing research is dedicated to include a pressure gradient correction to wall functions to improve the accuracy of flows with separation or reattachment and adverse or favorable pressure gradients.

42 ENGINEERING↗

Temperature effects in first-principles solid state calculations of the chemical shielding tensor made simple

We study the effects of atomic vibrations on the solid-state chemical shielding tensor using first principles density functional theory calculations. At the harmonic level, we use a Monte Carlo method and a perturbative expansion. The Monte Carlo method is accurate but computationally expensive, while the perturbative method is computationally more efficient, but approximate. We find excellent agreement between the two methods for both the isotropic shift and the shielding anisotropy. The effects of zero-point quantum mechanical nuclear motion are important up to relatively high temperatures: at 500 K they still represent about half of the overall vibrational contribution. We also investigate the effects of anharmonic vibrations, finding that their contribution to the zero-point correction to the chemical shielding tensor is small. We exemplify these ideas using magnesium oxide and the molecular crystals L-alanine and β-aspartyl-L-alanine. We therefore propose as the method of choice to incorporate the effects of temperature in solid state chemical shielding tensor calculations using the perturbative expansion within the harmonic approximation. This approach is accurate and requires a computational effort that is about an order of magnitude smaller than that of dynamical or Monte Carlo approaches, so these effects might be routinely accounted for.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High-Performance Computing Optimization for Aladyn – Adaptive Neural Network Molecular Dynamics Mini-Application

This report provides a description and performance evaluation of the optimization techniques for high performance computing (HPC) implementation of the open source Computational Materials mini-application Aladyn (https://github.com/nasa/aladyn). Aladyn is a basic molecular dynamics code written in FORTRAN 2003, which is designed to demonstrate the use of adaptive neural networks (ANNs) in atomistic simulations. The role of ANNs is to efficiently reproduce the very complex energy landscape resulting from the atomic interactions in materials with the accuracy of the more expensive quantum mechanics-based calculations. The ANN is trained on a large set of atomic structures calculated using the density functional theory (DFT) method. While achieving orders of magnitude faster computational performance than DFT, the ANN-based approach was still very computationally demanding compared to the conventional approach of using empirically fitted energy functions. After its initial development, Aladyn was evaluated and optimized by experts at the NASA Advanced Supercomputing (NAS) division to exploit modern supercomputer architectures. The code has been optimized for execution on multicore central processing units (CPUs), including Intel® Skylake microarchitecture, and on graphic accelerators, such as Nvidia® V100 graphic processing units (GPUs), using Open Multi-Processing (OpenMP) and Open Accelerators (OpenACC) programming interfaces. The optimization achieved a speedup of 4.7 times the baseline version on CPU performance and an additional 2.4 times on CPU+GPU performance. Atomistic computer simulations are a fundamental tool in materials research to model material properties form physics-based first principles. Atomic interaction, governed by Quantum Mechanics (QM) require sophisticated and highly computationally demanding mathematical models to calculate [1]. Classical methods use approximate functional forms, empirically fitted through a set of variable parameters to emulate atomic energies as direct functions of atomic coordinates [2]. While empirical potentials are computationally much simpler, allowing simulations of large-scale systems of up to a trillion (1012) atoms [3], they are substantially less accurate compared to quantum calculations and applicable only to very specific atomic configurations or predefined crystallographic phases. A recently suggested approach is to use heuristic machine learning methods [4], such as those based on Adaptive Neural Networks (ANNs) to predict atomic energies, after being trained on a sufficiently large database of QM-calculated structures [5,6]. This approach reduces significantly the computational complexity, allowing for simulations of orders of magnitude larger systems compared to QM-based methods without compromising accuracy. Still, compared to classical methods using empirical energy functions, ANN methods remain two- to three orders of magnitude more computationally demanding. Hence, the computational cost of simulations, together with the need for extensive training of ANNs, still makes the practical implementation of ANN-based methods quite challenging. The purpose of the Aladyn mini-application software [7], available as open source at https://github.com/nasa/aladyn, is to be a testbed for exploring possible optimization strategies to develop highly scalable parallel algorithms for ANN-based atomistic simulations. Aladyn is aimed at utilizing the architecture of the high-end modern highperformance computing (HPC) hardware based on multicore central processing units (CPUs) equipped with graphic processing unit (GPU) accelerators. Specifically, the goal is to optimize the performance on a single HPC compute node, before implementing scaling to multi-node parallelization using message passing interface (MPI). At the same time, the open source code of Aladyn can serve as a training model for students and professors in academia.

Yamakov, Vesselin I.↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

Peak Reduction in a Residential Community Through Bayesian Optimization of Transactive Control Signals

Daily residential power consumption in aggregate tends to have a large peak that places stress on the distribution system and induces high operational costs. This work shows that coordinated transactive control of noncritical loads within a residential community or microgrid can help to alleviate peak-time stress on the distribution system by flattening the aggregate load curve. Treating the load forecaster as a high-fidelity, expensive black-box function, a new algorithm utilizing Bayesian optimization (BO) is proposed to achieve the best solution under uncertainty with minimal computing effort. The proposed BO algorithm manipulates the shape of the load based on transactive signals sent to each home. The thermostatically controlled loads (TCLs) act out of self-interest in response to the given price while maintaining comfort, and the optimizer exploits the thermal energy retention of the homes for the benefit of the community. Simulations confirm consistent neighborhood-level peak power reduction and energy cost savings.

Schomer, Ian↗

CFD: A Castle in the Sand?

The computational simulation community is not routinely publishing independently verifiable tests to accompany new models or algorithms. A survey reveals that only 22% of new models published are accompanied by tests suitable for independently verifying the new model. As the community develops larger codes with increased functionality, and hence increased complexity in terms of the number of building block components and their interactions, it becomes prohibitively expensive for each development group to derive the appropriate tests for each component. Therefore, the computational simulation community is building its collective castle on a very shaky foundation of components with unpublished and unrepeatable verification tests. The computational simulation community needs to begin publishing component level verification tests before the tide of complexity undermines its foundation.

Kleb, Bil↗

CFD: A Castle in the Sand?

The computational simulation community is not routinely publishing independently verifiable tests to accompany new models or algorithms. A survey reveals that only 22% of new models published are accompanied by tests suitable for independently verifying the new model. As the community develops larger codes with increased functionality, and hence increased complexity in terms of the number of building block components and their interactions, it becomes prohibitively expensive for each development group to derive the appropriate tests for each component. Therefore, the computational simulation community is building its collective castle on a very shaky foundation of components with unpublished and unrepeatable verification tests. The computational simulation community needs to begin publishing component level verification tests before the tide of complexity undermines its foundation.

Kleb, William L.↗

Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.

Keyes, David E.↗

GPU acceleration of local and semilocal density functional calculations in the SPARC electronic structure code

We present a Graphics Processing Unit (GPU)-accelerated version of the real-space SPARC electronic structure code for performing Kohn–Sham density functional theory calculations within the local density and generalized gradient approximations. In particular, we develop a modular math-kernel based implementation for NVIDIA architectures wherein the computationally expensive operations are carried out on the GPUs, with the remainder of the workload retained on the central processing units (CPUs). Here, using representative bulk and slab examples, we show that relative to CPU-only execution, GPUs enable speedups of up to 6× and 60× in node and core hours, respectively, bringing time to solution down to less than 30 s for a metallic system with over 14 000 electrons and enabling significant reductions in computational resources required for a given wall time.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Electronic structure prediction of multi-million atom systems through uncertainty quantification enabled transfer learning

The ground state electron density — obtainable using Kohn-Sham Density Functional Theory (KS-DFT) simulations — contains a wealth of material information, making its prediction via machine learning (ML) models attractive. However, the computational expense of KS-DFT scales cubically with system size which tends to stymie training data generation, making it difficult to develop quantifiably accurate ML models that are applicable across many scales and system configurations. Here, we address this fundamental challenge by employing transfer learning to leverage the multi-scale nature of the training data, while comprehensively sampling system configurations using thermalization. Our ML models are less reliant on heuristics, and being based on Bayesian neural networks, enable uncertainty quantification. We show that our models incur significantly lower data generation costs while allowing confident — and when verifiable, accurate — predictions for a wide variety of bulk systems well beyond training, including systems with defects, different alloy compositions, and at multi-million-atom scales. Moreover, such predictions can be carried out using only modest computational resources.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Homogeneous ice nucleation in an ab initio machine-learning model of water

Molecular simulations have provided valuable insight into the microscopic mechanisms underlying homogeneous ice nucleation. While empirical models have been used extensively to study this phenomenon, simulations based on first-principles calculations have so far proven prohibitively expensive. Here, we circumvent this difficulty by using an efficient machine-learning model trained on density-functional theory energies and forces. We compute nucleation rates at atmospheric pressure, over a broad range of supercoolings, using the seeding technique and systems of up to hundreds of thousands of atoms simulated with ab initio accuracy. The key quantity provided by the seeding technique is the size of the critical cluster (i.e., a size such that the cluster has equal probabilities of growing or melting at the given supersaturation), which is used together with the equations of classical nucleation theory to compute nucleation rates. We find that nucleation rates for our model at moderate supercoolings are in good agreement with experimental measurements within the error of our calculation. We also study the impact of properties such as the thermodynamic driving force, interfacial free energy, and stacking disorder on the calculated rates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling

The increasing complexity of both scientific simulations and high-performance computing system architectures are driving the need for adaptive workflows, in which the composition and execution of computational and data manipulation steps dynamically depend on the evolutionary state of the simulation itself. Consider, for example, the frequency of data storage. Critical phases of the simulation should be captured with high frequency and with high fidelity for postanalysis; however, we cannot afford to retain the same frequency for the full simulation due to the high cost of data movement. We can instead look for triggers, indicators that the simulation will be entering a critical phase, and adapt the workflow accordingly. In this paper, we present a methodology for detecting triggers and demonstrate its use in the context of direct numerical simulations of turbulent combustion using S3D. We show that chemical explosive mode analysis (CEMA) can be used to devise a noise-tolerant indicator for rapid increase in heat release. However, exhaustive computation of CEMA values dominates the total simulation, and thus is prohibitively expensive. To overcome this computational bottleneck, we propose a quantile sampling approach. Our sampling-based algorithm comes with provable error/confidence bounds, as a function of the number of samples. Most importantly, the number of samples is independent of the problem size, and thus our proposed sampling algorithm offers perfect scalability. Our experiments on homogeneous charge compression ignition and reactivity controlled compression ignition simulations show that the proposed method can detect rapid increases in heat release, and its computational overhead is negligible. Our results will be used to make dynamic workflow decisions regarding data storage and mesh resolution in future combustion simulations.

97 MATHEMATICS AND COMPUTING↗

Grappling Spacecraft

This article provides a survey overview of the techniques, mechanisms, algorithms, and test and validation strategies required for the design of roboticgrappling vehicles intended to approach and grapple free-flying client satellites. We concentrate on using a robotic arm to grapple a free-floating spacecraft, as distinct from spacecraft docking and berthing, where two spacecraft directly mate with each other. Robotic grappling of client spacecraft is a deceptively complex problem: It entails designing a robotic system that functions robustly in the visually stark, thermally extreme orbital environment,operating near massive and extremely expensive yet fragile client hardware,using relatively slow flight computers with limited and laggy communica-tions. Spaceflight robotic systems are challenging to test and validate priorto deployment and extremely expensive to launch, which significantly limitsopportunities to experiment with new techniques. These factors make thedesign and operation of orbital robotic systems significantly different fromthose of their terrestrial counterparts, and as a result, only a relative handfulof systems have been demonstrated on orbit. Nevertheless, there is increas-ing interest in on-orbit robotic servicing and assembly missions, and grap-pling is the core requirement for these systems. Although existing systemssuch as the Space Station Remote Manipulator System have demonstratedextremely reliable operation, upcoming missions will attempt to expand thetypes of spacecraft that can be safely and dependably grappled and berthed.

Carl Glen Henshaw↗