SEARCH · Engineering Papers
Results for “Function approximation”
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.
How Accurate Are Approximate Density Functionals for Noncovalent Interaction of Very Large Molecular Systems?
Noncovalent intermolecular interactions are very important in many research areas. Therefore, it is vital to understand the extent to which approximate density functionals give a proper description of noncovalent interactions. Previous research has demonstrated that some approximate density functionals can predict usefully accurate interaction energies for many noncovalent systems; however, most of that work is limited to small and moderate-sized molecules. Very recently though, accurate benchmarks have become available for some very large molecules. Here, the present work applies 21 approximate density functionals to compute the binding energies of seven large molecular systems that have a number of atoms ranging from 200 to 910. The results are judged by comparison to the recently published CIM-DLPNO-CCSD(T) results, which are assumed to provide a reliable benchmark. The five most accurate methods among those tested are found to be PW6B95-D4, PW6B95-D3(BJ), revM11, M06-L, and MN15.
On the piecewise convex or concave nature of ground state energy as a function of fractional number of electrons for approximate density functionals
In this paper, we provide a rigorous proof that the Hartree Fock energy, as a function of the fractional electron number, E(N), is piecewise concave. Moreover, for semi-local density functionals, we show that the piecewise convexity of the E(N) curve, as stated in the literature, is not generally true for all fractions. By an analysis based on exchange-only local density approximation and careful examination of the E(N) curve, we find for some systems, there exists a very small concave region, corresponding to adding a small fraction of electrons to the integer system, while the remaining E(N) curve is convex. Several numerical examples are provided as verification. Although the E(N) curve is not convex everywhere in these systems, the previous conclusions on the consequence of the delocalization error in the commonly used density functional approximations, in particular, the underestimation of ionization potential, and the overestimation of electron affinity, and other related issues, remain unchanged. Finally, this suggests that instead of using the term convexity, a modified and more rigorous description for the delocalization error is that the E(N) curve lies below the straight line segment across the neighboring integer points for these approximate functionals.
The Impulse Approximation Scattering Function and Its Use in Monte Carlo Photon Transport Simulations
The viability of using the impulse approximation scattering function in Monte Carlo photon transport simulations is explored. This scattering function can be constructed from the double differential incoherent scattering cross section developed by Ribberfors and Berggren. A commonly used method for modeling photon Doppler broadening, which is referred to as the hybrid Doppler broadening method, can also be derived from this cross section. A new photon Doppler broadening method, called the consistent Doppler broadening method, is derived and discussed. This method eliminates some of the commonly employed approximations in the hybrid Doppler broadening method, in part, by using the impulse approximation scattering function. Integrated incoherent cross sections generated using the impulse approximation scattering function and the widely used Waller-Hartree scattering function are in good agreement above 20 keV. Below 20 keV, differences as high as 70% are observed, which differs from the roughly 5% differences observed by Ribberfors for some of the materials. Integral and spectral quantities for two problems are also generated using the Monte Carlo photon transport capabilities of the Framework for REsearch in Nuclear ScIence and Engineering (FRENSIE). Due to the small, relative result differences observed when using the impulse approximation scattering function, it is considered a viable alternative to the Waller-Hartree scattering function. In addition, some small, but expected, differences in spectral fluxes at low energies can be avoided by adopting the consistent Doppler broadening method.
Conforming window functions for meshfree methods
Window functions provide a base for the construction of approximation functions in many meshfree methods. They control the smoothness and extent of the approximation functions and are commonly defined using Euclidean distances which helps eliminate the need for a meshed discretization, simplifying model development for some classes of problems. However, for problems with complicated geometries such as nonconvex or multi-body domains, poor solution accuracy and convergence can occur unless the extents of the window functions, and thus approximation functions, are carefully controlled, often a time consuming or intractable task. Here in this paper, we present a method to provide more control in window function design, allowing efficient and systematic handling of complex geometries. “Conforming” window functions are constructed using Bernstein–Bézier splines defined on local triangulations with constraints imposed to control smoothness. Graph distances are used in conjunction with Euclidean metrics to provide adequate information for shaping the window functions. The conforming window functions are demonstrated using the Reproducing Kernel Particle Method showing improved accuracy and convergence rates for problems with challenging geometries. Conforming window functions are also demonstrated as a means to simplify the imposition of essential boundary conditions.
Physically interpretable approximations of many-body spectral functions
The rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.
High-throughput predictions of metal–organic framework electronic properties: theoretical challenges, graph neural networks, and data exploration
Abstract With the goal of accelerating the design and discovery of metal–organic frameworks (MOFs) for electronic, optoelectronic, and energy storage applications, we present a dataset of predicted electronic structure properties for thousands of MOFs carried out using multiple density functional approximations. Compared to more accurate hybrid functionals, we find that the widely used PBE generalized gradient approximation (GGA) functional severely underpredicts MOF band gaps in a largely systematic manner for semi-conductors and insulators without magnetic character. However, an even larger and less predictable disparity in the band gap prediction is present for MOFs with open-shell 3 d transition metal cations. With regards to partial atomic charges, we find that different density functional approximations predict similar charges overall, although hybrid functionals tend to shift electron density away from the metal centers and onto the ligand environments compared to the GGA point of reference. Much more significant differences in partial atomic charges are observed when comparing different charge partitioning schemes. We conclude by using the dataset of computed MOF properties to train machine-learning models that can rapidly predict MOF band gaps for all four density functional approximations considered in this work, paving the way for future high-throughput screening studies. To encourage exploration and reuse of the theoretical calculations presented in this work, the curated data is made publicly available via an interactive and user-friendly web application on the Materials Project.
Double and Charge-Transfer Excitations in Time-Dependent Density Functional Theory
Time-dependent density functional theory has emerged as a method of choice for calculations of spectra and response properties in physics, chemistry, and biology, with its system-size scaling enabling computations on systems much larger than otherwise possible. While increasingly complex and interesting systems have been successfully tackled with relatively simple functional approximations, there has also been increasing awareness that these functionals tend to fail for certain classes of approximations. Here I review the fundamental challenges the approximate functionals have in describing double excitations and charge-transfer excitations, which are two of the most common impediments for the theory to be applied in a black-box way. At the same time, I describe the progress made in recent decades in developing functional approximations that give useful predictions for these excitations.
Compressed Continuous Computation v. 12/20/2016
A library for performing numerical computation with low-rank functions. The (C3) library enables performing continuous linear and multilinear algebra with multidimensional functions. Common tasks include taking "matrix" decompositions of vector- or matrix-valued functions, approximating multidimensional functions in low-rank format, adding or multiplying functions together, integrating multidimensional functions.
Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots
Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.
Approximation of functions and their conjugates in variable Lebesgue spaces
One-sided Steklov means are used to introduce moduli of continuity of natural order in variable L{sub 2π}{sup p(⋅)}-spaces. A direct theorem of Jackson- Stechkin type and an inverse theorem of Salem-Stechkin type are given. Similar results are obtained for the conjugate functions. Bibliography: 24 titles. (paper)
Heterogeneous Mixtures of Dictionary Functions to Approximate Subspace Invariance in Koopman Operators: Why Deep Koopman Operators Work
Abstract Koopman operators model nonlinear dynamics as a linear dynamic system acting on a nonlinear function as the state. This nonstandard state is often called a Koopman observable and is usually approximated numerically by a superposition of functions drawn from a dictionary . In a widely used algorithm, extended dynamic mode decomposition (EDMD), the dictionary functions are drawn from a fixed class of functions. Deep learning combined with EDMD has been used to learn novel dictionary functions in an algorithm called deep dynamic mode decomposition (deepDMD). The learned representation both (1) accurately models and (2) scales well with the dimension of the original nonlinear system. In this paper, we analyze the learned dictionaries from deepDMD and explore the theoretical basis for their strong performance. We explore State-Inclusive Logistic Lifting (SILL) dictionary functions to approximate Koopman observables. Error analysis of these dictionary functions show they satisfy a property of subspace approximation, which we define as uniform finite approximate closure. Typically, a Koopman dictionary’s nonlinear functions are homogeneous. In this paper, we discover that structured mixing of heterogeneous dictionary functions drawn from different classes of nonlinear functions achieve the same accuracy and dimensional scaling as the deep-learning-based deepDMD algorithm Yeung et al. ( In: 2019 American Control Conference (ACC), 2019). We specifically show this by building a heterogeneous dictionary comprised of SILL functions and conjunctive radial basis functions (RBFs). This mixed dictionary achieves similar accuracy and dimensional scaling to deepDMD with an order of magnitude reduction in parameters, while maintaining geometric interpretability. These results strengthen the viability of dictionary-based Koopman models to solving high-dimensional nonlinear learning problems.
Hole–hole Tamm–Dancoff-approximated density functional theory: A highly efficient electronic structure method incorporating dynamic and static correlation
The study of photochemical reaction dynamics requires accurate as well as computationally efficient electronic structure methods for the ground and excited states. While time-dependent density functional theory (TDDFT) is not able to capture static correlation, complete active space self-consistent field methods neglect much of the dynamic correlation. Hence, inexpensive methods that encompass both static and dynamic electron correlation effects are of high interest. Here, we revisit hole–hole Tamm–Dancoff approximated (hh-TDA) density functional theory for this purpose. The hh-TDA method is the hole–hole counterpart to the more established particle–particle TDA (pp-TDA) method, both of which are derived from the particle–particle random phase approximation (pp-RPA). In hh-TDA, the N-electron electronic states are obtained through double annihilations starting from a doubly anionic (N+2 electron) reference state. In this way, hh-TDA treats ground and excited states on equal footing, thus allowing for conical intersections to be correctly described. Furthermore, the treatment of dynamic correlation is introduced through the use of commonly employed density functional approximations to the exchange-correlation potential. Additionally, we show that hh-TDA is a promising candidate to efficiently treat the photochemistry of organic and biochemical systems that involve several low-lying excited states—particularly those with both low-lying ππ* and nπ* states where inclusion of dynamic correlation is essential to describe the relative energetics. In contrast to the existing literature on pp-TDA and pp-RPA, we employ a functional-dependent choice for the response kernel in pp- and hh-TDA, which closely resembles the response kernels occurring in linear response and collinear spin-flip TDDFT.
DFTB+, a software package for efficient approximate density functional theory based atomistic simulations
DFTB+ is a versatile community developed open source software package offering fast and efficient methods for carrying out atomistic quantum mechanical simulations. By implementing various methods approximating density functional theory (DFT), such as the density functional based tight binding (DFTB) and the extended tight binding method, it enables simulations of large systems and long timescales with reasonable accuracy while being considerably faster for typical simulations than the respective ab initio methods. Based on the DFTB framework, it additionally offers approximated versions of various DFT extensions including hybrid functionals, time dependent formalism for treating excited systems, electron transport using non-equilibrium Green’s functions, and many more. DFTB+ can be used as a user-friendly standalone application in addition to being embedded into other software packages as a library or acting as a calculation-server accessed by socket communication. We give an overview of the recently developed capabilities of the DFTB+ code, demonstrating with a few use case examples, discuss the strengths and weaknesses of the various features, and also discuss on-going developments and possible future perspectives.
Push it to the limit: Characterizing the convergence of common sequences of basis sets for intermolecular interactions as described by density functional theory
With the aim of systematically characterizing the convergence of common families of basis sets such that general recommendations for basis sets can be made, we have tested a wide variety of basis sets against complete-basis binding energies across the S22 set of intermolecular interactions—noncovalent interactions of small and medium-sized molecules consisting of first- and second-row atoms—with three distinct density functional approximations: SPW92, a form of local-density approximation; B3LYP, a global hybrid generalized gradient approximation; and B97M-V, a meta-generalized gradient approximation with nonlocal correlation. We have found that it is remarkably difficult to reach the basis set limit; for the methods and systems examined, the most complete basis is Jensen’s pc-4. The Dunning correlation-consistent sequence of basis sets converges slowly relative to the Jensen sequence. The Karlsruhe basis sets are quite cost effective, particularly when a correction for basis set superposition error is applied: counterpoise-corrected def2-SVPD binding energies are better than corresponding energies computed in comparably sized Dunning and Jensen bases, and on par with uncorrected results in basis sets 3-4 times larger. These trends are exhibited regardless of the level of density functional approximation employed. A sense of the magnitude of the intrinsic incompleteness error of each basis set not only provides a foundation for guiding basis set choice in future studies but also facilitates quantitative comparison of existing studies on similar types of systems.
Multi-fidelity Bayesian neural networks: Algorithms and applications
Here we propose a new class of Bayesian neural networks (BNNs) that can be trained using noisy data of variable fidelity, and we apply them to learn function approximations as well as to solve inverse problems based on partial differential equations (PDEs). These multi-fidelity BNNs consist of three neural networks: The first is a fully connected neural network, which is trained following the maximum a posteriori probability (MAP) method to fit the low-fidelity data; the second is a Bayesian neural network employed to capture the cross-correlation with uncertainty quantification between the low- and high-fidelity data; and the last one is the physics-informed neural network, which encodes the physical laws described by PDEs. For the training of the last two neural networks, we first employ the mean-field variational inference (VI) to maximize the evidence lower bound (ELBO) to obtain informative prior distributions for the hyperparameters in the BNNs, and subsequently we use the Hamiltonian Monte Carlo (HMC) method to estimate accurately the posterior distributions for the corresponding hyperparameters. We demonstrate the accuracy of the present method using synthetic data as well as real measurements. Specifically, we first approximate a one- and four-dimensional function, and then infer the reaction rates in one- and two-dimensional diffusion-reaction systems. Moreover, we infer the sea surface temperature (SST) in the Massachusetts and Cape Cod Bays using satellite images and in-situ measurements. Taken together, our results demonstrate that the present method can capture both linear and nonlinear correlation between the low- and high-fidelity data adaptively, identify unknown parameters in PDEs, and quantify uncertainties in predictions, given a few scattered noisy high-fidelity data. Finally, we demonstrate that we can effectively and efficiently reduce the uncertainties and hence enhance the prediction accuracy with an active learning approach, using as examples a specific one-dimensional function approximation and an inverse PDE problem.
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.