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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Theoretical Assessment of the Transition Between Electron Emission Mechanisms for Nonplanar Diodes

Theoretically and computationally describing the operation of nanodiodes requires characterizing the transitions between multiple electron emission mechanisms for nanodiodes with complicated geometries. This motivates our development of techniques to determine when simplified theories for individual mechanisms suffice compared to more complete, but more computationally expensive, models. Leveraging recent theories that define a canonical gap distance to translate planar theory to nonplanar diodes, we derive the conditions for the transitions among thermal emission, field emission, and space-charge-limited current density (SCLCD) in vacuum and with collisions for non-Cartesian coordinate systems, including spherical, cylindrical, and prolate spheroidal coordinate systems. Particle-in-cell (PIC) simulations of the current density as a function of applied voltage for a tip-to-plate geometry in vacuum agreed qualitatively with the asymptotes for thermal emission at low voltage and SCLCD at higher voltage using the canonical gap distance. As a result, this demonstrates the utility of this approach for guiding system design and suggests future extensions to save simulation time for more realistic geometries that are more computationally expensive.

Conformal mapping↗
DOE OSTI2020

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Robust wind farm layout optimization

Wake interactions in wind farms cause losses in annual energy production (AEP) on the order of 10%. Wind farm designers optimize the layout of the farm to mitigate wake losses, especially in the dominant site-specific wind directions. As wind turbines and wind farms grow in scale, optimization becomes more complex. Offshore wind farms regularly comprise more than 100 wind turbines and are characterized by complex boundaries due to shipping lanes, neighboring wind farms, and other constraints. Layout optimization methods are broadly split between gradient-based and gradient-free approaches. Gradient-based approaches can converge quickly and perform well for smaller, academic problems but are often sensitive to initial conditions and tuning parameters and require expert knowledge to use. On the other hand, gradient-free approaches can be more robust to problem complexities. We present a robust layout optimization approach based on a random search algorithm. The algorithm is intended for those who are not optimization experts and has few tuning parameters that need specification to achieve satisfactory results. Unlike off-the-shelf methods, which use generally available, non-domain-specific optimization routines that accept as inputs an optimization function and constraint definitions, this approach takes advantage of the relative computational costs of the different evaluations by evaluating cheaper computations first (boundary and minimum distance constraints) and running expensive AEP evaluations only if all other checks pass. Moreover, an outer genetic algorithm allows multiple solutions to evolve in parallel, enabling rapid solution development on high-performance computers. We discuss the relative ease of selecting necessary tuning parameters and demonstrate the efficacy of the genetic random search on a complex layout problem consisting of placing 70 turbines in a nonconvex and unconnected boundary region.

17 WIND ENERGY↗
DOE OSTI2025

Conditional Pseudo-Reversible Normalizing Flow for Surrogate Modeling in Quantifying Uncertainty Propagation

We introduce a conditional pseudo-reversible normalizing flow (PR-NF) that directly learns conditional probability distributions from noisy physical models to efficiently quantify both forward and inverse uncertainty propagation. Traditional surrogate modeling approaches approximate only the deterministic component of physical models, requiring separate noise characterization and computationally expensive sampling methods for inverse problems. Here, in this work, we develop the conditional PR-NF model to directly learn and efficiently generate samples from the conditional probability density functions (PDFs). The training process utilizes dataset consisting of input-output pairs without requiring prior knowledge about the noise and the function. Once trained, our model efficiently generates samples from conditional PDFs for any input within the training domain. Moreover, the pseudo-reversibility feature allows for the use of fully connected neural network architectures, which simplifies the implementation and enables theoretical analysis. We provide a rigorous convergence analysis of the conditional PR-NF model, showing its ability to converge to the target conditional PDF using the Kullback−Leibler divergence. To demonstrate the effectiveness of our method, we apply it to several benchmark tests and a real-world geologic carbon storage problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Prediction of O and OH Adsorption on Transition Metal Oxide Surfaces from Bulk Descriptors

In the search for stable and active catalysts, density functional theory and machine learning (ML) based models can accelerate the screening of materials. While stability is conveniently addressed on the bulk level of computation, the modelling of catalytic activity requires expensive surface simulations. Here, in this work, we develop models for the surface adsorption energy of O and OH intermediates across a consistent and extensive dataset of pure transition metal oxide surfaces. We show that adsorption energies across metal oxidation states of +2 to +6 are well captured from the metal-oxygen bond strength extracted from the bulk level calculation. Specifically, we calculate the integrated crystal orbital Hamiltonian population (ICOHP) of the metal-oxygen bond in the bulk oxide and employ a simple normalization scheme to obtain a strong correlation with adsorption energetics. By combining our ICOHP descriptor with non DFT features in a Gaussian Process regression (GPR) model, we achieve high model accuracy with mean absolute errors of 0.166 and 0.219 eV for OH and O adsorption, respectively. By targeting the O-OH adsorption energy difference with our GPR model, we predict the the oxygen evolution reaction (OER) activity from bulk descriptors only. Furthermore, we utilize the strong correlation between the COHP and metal oxygen bond lengths to rapidly predict adsorption energetics and catalytic activity from the optimized bulk geometry. Our approach can enable an efficient search for active catalysts by eliminating the need for surface calculations in the initial screening phase.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Adaptive, Active Learning, and Multifidelity Monte Carlo Methods in the MOOSE Stochastic Tools Module

MOOSE is an open-source computational platform for constructing multi-physics models and executing them in a massively parallel fashion. It has a stochastic tools module (STM) for forward/inverse uncertainty quantification (UQ) and surrogate modeling. This presentation details some recent developments to the STM with respect to the implementation of adaptive, active learning, and multifidelity Monte Carlo methods for forward UQ of computational models. Specifically, the adaptive Monte Carlo methods include Markov Chain Monte Carlo (MCMC)-driven algorithms like adaptive importance sampling and parallelized subset simulation for statistical QoI estimation, rare events analysis, and stochastic gradient-free optimization. The active learning methods include Gaussian Process (GP) surrogates and their training via Adam optimization, design of acquisition functions, and integration with samplers like Monte Carlo, adaptive importance, and parallelized subset simulation. These active learning methods are also designed to work in a batch mode, wherein, the required calls to the full computational model are executed in parallel whenever a user-specified batch size is met. The multifidelity methods in STM are broadly divided into two categories: hierarchical, where a defined hierarchy exists among the low-fidelity models, and peer, where all the low-fidelity models are treated equally. A GP surrogate is used to learn the differences between the low- and high-fidelity models in both multifidelity categories, and acquisition functions from the active learning classes are used to decide whether to rely on a low-fidelity model or call the expensive high-fidelity model. Alongside the software description and usage, applications are also presented to nuclear engineering computational models including a TRISO nuclear fuel particle, a reactor pressure vessel, and a heat-pipe microreactor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Gaussian approximation potentials for accurate thermal properties of two-dimensional materials

Two-dimensional materials (2DMs) continue to attract a lot of attention, particularly for their extreme flexibility and superior thermal properties. Molecular dynamics simulations are among the most powerful methods for computing these properties, but their reliability depends on the accuracy of interatomic interactions. While first principles approaches provide the most accurate description of interatomic forces, they are computationally expensive. In contrast, classical force fields are computationally efficient, but have limited accuracy in interatomic force description. Machine learning interatomic potentials, such as Gaussian Approximation Potentials, trained on density functional theory (DFT) calculations offer a compromise by providing both accurate estimation and computational efficiency. Here, in this work, we present a systematic procedure to develop Gaussian approximation potentials for selected 2DMs, graphene, buckled silicene, and h-XN (X = B, Al, and Ga, as binary compounds) structures. We validate our approach through calculations that require various levels of accuracy in interatomic interactions. The calculated phonon dispersion curves and lattice thermal conductivity, obtained through harmonic and anharmonic force constants (including fourth order) are in excellent agreement with DFT results. HIPHIVE calculations, in which the generated GAP potentials were used to compute higher-order force constants instead of DFT, demonstrated the first-principles level accuracy of the potentials for interatomic force description. Molecular dynamics simulations based on phonon density of states calculations, which agree closely with DFT-based calculations, also show the success of the generated potentials in high-temperature simulations.

2D Materials↗
DOE OSTI2022

A Computational Framework to Accelerate the Discovery of Perovskites for Solar Thermochemical Hydrogen Production: Identification of Gd Perovskite Oxide Redox Mediators

A high-throughput computational framework to identify novel multinary perovskite redox mediators is presented, and this framework is applied to discover the Gd-containing perovskite oxide compositions Gd 2 BB'O 6 , GdA'B 2 O 6 , and GdA'BB'O 6 that split water. The computational scheme uses a sequence of empirical approaches to evaluate the stabilities, electronic properties, and oxygen vacancy thermodynamics of these materials, including contributions to the enthalpies and entropies of reduction, ΔH TR and ΔS TR . This scheme uses the machine-learned descriptor τ to identify compositions that are likely stable as perovskites, the bond valence method to estimate the magnitude and phase of BO 6 octahedral tilting and provide accurate initial estimates of perovskite geometries, and density functional theory including magnetic- and defect-sampling to predict STCH-relevant properties. Eighty-three promising STCH candidate perovskite oxides down-selected from 4392 Gd-containing compositions are reported, three of which are referred to experimental collaborators for characterization and exhibit STCH activity. Our results demonstrate that the high-throughput computational scheme described herein—which is used to evaluate Gd-containing compositions but can be applied to any multinary perovskite oxide compositional space(s) of interest—accelerates the discovery of novel STCH active redox mediators with reasonable computational expense.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Sensitivity Analysis and Emulation for Functional Data using Bayesian Adaptive Splines

When a computer code is used to simulate a complex system, one of the fundamental tasks is to assess the sensitivity of the simulator to the different input parameters. In the case of computationally expensive simulators, this is often accomplished via a surrogate statistical model, a statistical output emulator. An effective emulator is one that provides good approximations to the computer code output for wide ranges of input values. In addition, an emulator should be able to handle large dimensional simulation output for a relevant number of inputs; it should flexibly capture heterogeneities in the variability of the response surface; it should be fast to evaluate for arbitrary combinations of input parameters, and it should provide an accurate quantification of the emulation uncertainty. In this paper we discuss the Bayesian approach to multivariate adaptive regression splines (BMARS) as an emulator for a computer model that outputs curves. We introduce modifications to traditional BMARS approaches that allow for fitting large amounts of data and allow for more efficient MCMC sampling. We emphasize the ease with which sensitivity analysis can be performed in this situation. We present a sensitivity analysis of a computer model of the deformation of a protective plate used in pressure-driven experiments. Our example serves as an illustration of the ability of BMARS emulators to fulfill all the necessities of computability, flexibility and reliable calculation on relevant measures of sensitivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Exact Gaussian processes for massive datasets via non-stationary sparsity-discovering kernels

Abstract A Gaussian Process (GP) is a prominent mathematical framework for stochastic function approximation in science and engineering applications. Its success is largely attributed to the GP’s analytical tractability, robustness, and natural inclusion of uncertainty quantification. Unfortunately, the use of exact GPs is prohibitively expensive for large datasets due to their unfavorable numerical complexity of $$O(N^3)$$ O ( N 3 ) in computation and $$O(N^2)$$ O ( N 2 ) in storage. All existing methods addressing this issue utilize some form of approximation—usually considering subsets of the full dataset or finding representative pseudo-points that render the covariance matrix well-structured and sparse. These approximate methods can lead to inaccuracies in function approximations and often limit the user’s flexibility in designing expressive kernels. Instead of inducing sparsity via data-point geometry and structure, we propose to take advantage of naturally-occurring sparsity by allowing the kernel to discover—instead of induce—sparse structure. The premise of this paper is that the data sets and physical processes modeled by GPs often exhibit natural or implicit sparsities, but commonly-used kernels do not allow us to exploit such sparsity. The core concept of exact, and at the same time sparse GPs relies on kernel definitions that provide enough flexibility to learn and encode not only non-zero but also zero covariances. This principle of ultra-flexible, compactly-supported, and non-stationary kernels, combined with HPC and constrained optimization, lets us scale exact GPs well beyond 5 million data points.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A method to improve prediction of secondary structure for large single RNA sequences

The function of a particular RNA molecule within an organic system is principally determined by its structure. The current physical methods available for structure determination are time consuming and expensive. Hence, computational methods for structure prediction are often used. }The prediction of the structure of a large single sequence of RNA needs a lot of research work. In the present work, a method is introduced to improve the prediction of large single sequence RNA secondary structure obtained by Mfold program using the concept of minimum free energy. The Mfold program contains a constraint option that allows forcing some helices in the predicted structure. In our method, some of the firstly formed hairpins that are expected, by a statistical study, to be present in the real structure are forced in the Mfold predicted structure. The results show improvement, toward the real structure, in the Mfold predicted structure and this gives evidence to the RNA kinetic folding.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Static and dynamic properties of multi-ionic plasma mixtures

Complex plasma mixtures with three or more components are often encountered in astrophysics or in inertial confinement fusion (ICF) experiments. For mixtures containing species with large differences in atomic number Z, the modeling needs to consider at the same time the kinetic theory for low-Z elements combined with the theory of strongly coupled plasma for high-Z elements, as well as all the intermediate situations that can appear in multi-component systems. For such cases, we study the pair distribution functions, self-diffusions, mutual diffusion and viscosity for ternary mixtures at extreme conditions. These quantities can be produced from first principles using orbital free molecular dynamics at the computational expense of very intensive simulations to reach good statistics. Utilizing the first-principles results as reference data, we assess the merit of a global analytic model for transport coefficients, "Pseudo-Ions in Jellium" (PIJ), based on an iso-electronic assumption (iso-n e ). With a multi-component hypernetted-chain integral equation, we verify the quality of the iso-n e prescription for describing the static structure of the mixtures. This semi-analytical modeling compares well with the simulation results and allows one to consider plasma mixtures not accessible to simulations. Further, applications are given for the mix of materials in ICF experiments. A reduction of a multicomponent mixture to an effective binary mixture is also established in the hydrodynamic limit and compared with PIJ estimations for ICF relevant mixtures.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Multiscale Approach to Fast ModSim for Laser Processing of Metals for Future Nuclear Deterrence Environments

Predicting performance of parts produced using laser-metal processing remains an out- standing challenge. While many computational models exist, they are generally too computationally expensive to simulate the build of an engineering-scale part. This work develops a reduced order thermal model of a laser-metal system using analytical Green's function solutions to the linear heat equation, representing a step towards achieving a full part performance prediction in an "overnight" time frame. The developed model is able to calculate a thermal history for an example problem 72 times faster than a traditional FEM method. The model parameters are calibrated using a non-linear solution and microstructures and residual stresses calculated and compared to a non-linear case. The calibrated model shows promising agreement with a non-linear solution.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A Practical Framework for Simulating Time-Resolved Spectroscopy Based on a Real-Time Dyson Expansion

Time-resolved spectroscopy is a powerful tool for probing electron dynamics in molecules and solids, revealing transient phenomena on subfemtosecond time scales. The interpretation of experimental results is often enhanced by parallel numerical studies, which can provide insight and validation for experimental hypotheses. However, developing a theoretical framework for simulating time-resolved spectra remains a significant challenge. The most suitable approach involves the many-body nonequilibrium Green's function formalism, which accounts for crucial dynamical many-body correlations during time evolution. While these dynamical correlations are essential for observing emergent behavior in time-resolved spectra, they also render the formalism prohibitively expensive for large-scale simulations. Substantial effort has been devoted to reducing this computational cost─through approximations and numerical techniques─while preserving the key dynamical correlations. The ultimate goal is to enable first-principles simulations of time-dependent systems ranging from small molecules to large, periodic, multidimensional solids. Here, in this perspective, we outline key challenges in developing practical simulations for time-resolved spectroscopy, with a particular focus on Green's function methodologies. We highlight a recent advancement toward a scalable framework: the real-time Dyson expansion (RT-DE) [Phys. Rev. Lett. 2024, 133, 226902]. We introduce the theoretical foundation of RT-DE and discuss strategies for improving scalability, which have already enabled simulations of system sizes beyond the reach of previous fully dynamical approaches. We conclude with an outlook on future directions for extending RT-DE to first-principles studies of dynamically correlated, nonequilibrium systems.

Reeves, Cian C. [Univ. of California, Santa Barbar↗
DOE OSTI2015

Including parameter dependence in the data and covariance for cosmological inference

The final step of most large-scale structure analyses involves the comparison of power spectra or correlation functions to theoretical models. It is clear that the theoretical models have parameter dependence, but frequently the measurements and the covariance matrix depend upon some of the parameters as well. We show that a very simple interpolation scheme from an unstructured mesh allows for an efficient way to include this parameter dependence self-consistently in the analysis at modest computational expense. We describe two schemes for covariance matrices. The scheme which uses the geometric structure of such matrices performs roughly twice as well as the simplest scheme, though both perform very well.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2014

A systematic way for the cost reduction of density fitting methods

We present a simple approach for the reduction of the size of auxiliary basis sets used in methods exploiting the density fitting (resolution of identity) approximation for electron repulsion integrals. Starting out of the singular value decomposition of three-center two-electron integrals, new auxiliary functions are constructed as linear combinations of the original fitting functions. The new functions, which we term natural auxiliary functions (NAFs), are analogous to the natural orbitals widely used for the cost reduction of correlation methods. The use of the NAF basis enables the systematic truncation of the fitting basis, and thereby potentially the reduction of the computational expenses of the methods, though the scaling with the system size is not altered. The performance of the new approach has been tested for several quantum chemical methods. It is demonstrated that the most pronounced gain in computational efficiency can be expected for iterative models which scale quadratically with the size of the fitting basis set, such as the direct random phase approximation. The approach also has the promise of accelerating local correlation methods, for which the processing of three-center Coulomb integrals is a bottleneck.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗