Engineering Papers⌕ Search

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.

At least 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

LBC (Learning Building Control)

LBC encompasses the source code and data to reproduce and extend results for a manuscript that compares demand responsive control schemes for multi-zone buildings. It includes examples of model predictive control (MPC), value function approximation via CVXPYLAYERS, and differentiable predictive control (DPC). The goal of the study is to evaluate state-of-the-art controllers and establish the efficacy (if any) of learning-based approaches that leverage deep neural networks in one way or another.

Zhang, Xiangyu↗
DOE OSTI2022

Comparing machine learning and interpolation methods for loop-level calculations

The need to approximate functions is ubiquitous in science, either due to empirical constraints or high computational cost of accessing the function. In high-energy physics, the precise computation of the scattering cross-section of a process requires the evaluation of computationally intensive integrals. A wide variety of methods in machine learning have been used to tackle this problem, but often the motivation of using one method over another is lacking. Comparing these methods is typically highly dependent on the problem at hand, so we specify to the case where we can evaluate the function a large number of times, after which quick and accurate evaluation can take place. We consider four interpolation and three machine learning techniques and compare their performance on three toy functions, the four-point scalar Passarino-Veltman D_0 D 0 function, and the two-loop self-energy master integral M. We find that in low dimensions (d = 3), traditional interpolation techniques like the Radial Basis Function perform very well, but in higher dimensions (d=5, 6, 9) we find that multi-layer perceptrons (a.k.a neural networks) do not suffer as much from the curse of dimensionality and provide the fastest and most accurate predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Model-form Error Correction using Universal Differential Equations for an Agent-Based Model of Infectious Disease

This report demonstrates universal differential equations (UDEs) as an approach to bridge the gap between ordinary differential equations (ODE) models and agent-based models (ABMs). Using UDE models as surrogates for ABMs allows us to preserve the foundational ODE that represents global disease dynamics while coupling it with a neural network model to approximate functions for the local behaviors of the ABM.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Properties of Dislocation Drag from Phonon Wind at Ambient Conditions

It is well known that, under plastic deformation, dislocations are not only created but also move through the crystal, and their mobility is impeded by their interaction with the crystal structure. At high stress and temperature, this “drag” is dominated by phonon wind, i.e., phonons scattering off dislocations. Employing the semi-isotropic approach discussed in detail in a previous paper (J. Phys. Chem. Solids 2019, 124, 24–35), we discuss here the approximate functional dependence of dislocation drag B on dislocation velocity in various regimes between a few percent of transverse sound speed c T and c T (where c T is the effective average transverse sound speed of the polycrystal). In doing so, we find an effective functional form for dislocation drag B ( v ) for different slip systems and dislocation characters at fixed (room) temperature and low pressure.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Constraining the Dense Matter Equation of State with Joint Analysis of NICER and LIGO/Virgo Measurements

The Neutron Star Interior Composition Explorer collaboration recently published a joint estimate of the mass and the radius of PSR J0030+0451, derived via X-ray pulse-profile modeling. Raaijmakers et al. explored the implications of this measurement for the dense matter equation of state (EOS) using two parameterizations of the high-density EOS: a piecewise-polytropic model, and a model based on the speed of sound in neutron stars (NSs). In this work we obtain further constraints on the EOS following this approach, but we also include information about the tidal deformability of NSs from the gravitational wave signal of the compact binary merger GW170817. Further, we compare the constraints on the EOS to those set by the recent measurement of a 2.14 Me pulsar, included as a likelihood function approximated by a Gaussian, and find a small increase in information gain. To show the flexibility of our method, we also explore the possibility that GW170817 was a NS–black hole merger, which yields weaker constraints on the EOS.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2017

nmrfit

Nmrfit reads the output from a nuclear magnetic resonance (NMR) experiment and, through a number of intuitive API calls, produces a least-squares fit of Voigt-function approximations via particle swarm optimization.

Source record↗
DOE OSTI2017

A Fresh Math Perspective Opens New Possibilities for Computational Chemistry

By reformulating the TDDFT problem as a matrix function approximation, making use of a special transformation and taking advantage of the underlying symmetry with respect to a non-Euclidean metric, Yang and his colleagues were able to apply the Lanczos algorithm and a Kernal Polynomial Method (KPM) to approximate the absorption spectrum of several molecules. Both of these algorithms require relatively low-memory compared to non-symmetrical alternatives, which is the key to the computational savings.

Vu, Linda↗
DOE OSTI2021

Computational Math Problems for a Clean Energy Future

Cutting edge computational mathematics are ubiquitous in renewable energy research. Problems in resilient and reliable electric grid operations, infrastructure planning, wind farm yaw control, and more demand sophisticated and scalable computational tools that enable the transition of renewable energy technologies from proof of concept to deployment into our energy system. The mission of the Computational Science Center at NREL is to lead the lab's efforts to solve energy challenges using high-performance computing (HPC), computational science, applied mathematics, scientific data management, visualization, and informatics. In this poster, we provide a short overview of three areas of computational mathematics research at NREL: wind power scenario generation for stochastic grid operations and infrastructure planning, improved rational function approximations for electromagnetic transients codes, and wind farm yaw control using a combination of the Alternating Direction Method of Multipliers (ADMM) and reinforcement learning (RL). Increasing penetrations of renewable energy into power grids motivate the investigation of new approaches to characterizing uncertainty for five-minute economic dispatch problems. Similarly, as the penetration of distributed energy resources on power grids increases, it becomes important to revisit our methods of modelling transient phenomena, i.e. electromagnetic transients programs. Finally, the combination of ADMM and RL for wind farm yaw control presented here can potentially increase the efficiency of the deployed distributed controllers by orders of magnitude.

ADMM↗
DOE OSTI2019

First-principles calculation of correlated electron materials based on Gutzwiller wave function beyond Gutzwiller approximation

We introduce a plan that is under the framework of Gutzwiller wave function but goes beyond the commonly adopted Gutzwiller approximation to improve the accuracy and flexibility in treating the correlation effects. Detailed formalism is described for a dimer which is straightforwardly generalized later to more complicated periodic bulk systems. The accuracy of the approach is shown by evaluating the potential energy curves of spin-singlet N 2 dimer, spin-triplet O 2 dimer, and one-dimensional hydrogen chain. The computational workload of the approach can be easily handled by efficient parallel computing.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Anti-symmetric barron functions and their approximation with sums of determinants

A fundamental problem in quantum physics is to encode functions that are completely anti-symmetric under permutations of identical particles. The architecture of neural network models for the electron wave function typically comprises an equivariant component followed by a summation of determinants. The recently introduced Generic Antisymmetric (GA) block is designed to enhance the expressivity of such neural wave functions, and it was found that the 2-layer GA block achieved more accurate energies than the corresponding single-determinant FermiNet architecure, suggesting its promise as a way to improve the expressivity of neural wave functions. In this paper we show how the function expressed by the 2-layer GA block can be decomposed into a sum of determinants. We formalize this result by defining the antisymmetric Barron space as a generalized version of the 2-layer GA block and providing an appromation theorem for this function class. This result can be viewed as a negative result showing that the 2-layer GA block is not more expressive than using multiple determinants.

Abrahamsen, Nilin↗
DOE OSTI2020

A step in the direction of resolving the paradox of Perdew–Zunger self-interaction correction. II. Gauge consistency of the energy density at three levels of approximation

The Perdew-Zunger(PZ) self-interaction correction (SIC) was designed to correct the one-electron limit of any approximate density functional for the exchange-correlation (xc) energy, while yielding no correction to the exact functional. Unfortunately, it spoils the slowly-varying-in-space limits of the uncorrected approximate functionals, where those functionals are right by construction. The right limits can be restored by locally scaling down the energy density of the PZ SIC in many-electron regions, but then a spurious correction to the exact functional would be found unless the self-Hartree and exact self-xc terms of the PZ SIC energy density were expressed in the same gauge. Only the local density approximation satisfies the same-gauge condition for the energy density, which explains why the recent local-scaling SIC (LSIC) is found here to work excellently for atoms and molecules only with this basic approximation, and not with the more advanced generalized gradient approximations (GGAs) and meta-GGAs, which lose the Hartree gauge via simplifying integrations by parts. The transformation of energy density that achieves the Hartree gauge for the exact xc functional can also be applied to approximate functionals. Doing so leads to a simple scaled-down self-interaction (sdSIC) correction that is typically much more accurate than PZ SIC in tests for many molecular properties (including equilibrium bond lengths). The present work shows unambiguously that the largest errors of PZ SIC applied to standard functionals at three levels of approximation can be removed by restoring their correct slowlyvarying- density limits. Here, it also confirms the relevance of these limits to atoms and molecules.

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

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗
DOE OSTI2017

A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions

In this paper, we present a new algorithm for computing the convolution of two compactly supported functions. The algorithm approximates the functions to be convolved using Fourier extensions and then uses the fast Fourier transform to efficiently compute Fourier extension approximations to the pieces of the result. Finally, the complexity of the algorithm is O(N(log N) 2 ), where N is the number of degrees of freedom used in each of the Fourier extensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A linear surrogate for optimising functions of an orthogonal matrix with applications in wave function theory

The technique of surrogate optimisation is to use a simpler function to approximate a complex function that is time-consuming to evaluate. Here we show that the maximum of a special type of surrogate function f(U)=Tr(AU),UϵO(n) is at A T (AA T ) 1/2 , and that there is one and only one local maximum both in SO(n) and O(n)–SO(n). This function f(U) has been found to be useful in various aspects of electronic structure theory, including proving the Carlson-Keller theorem, and localising orbitals. As one other example, we apply it here to optimise the ground state of molecules using the Generalised Valence Bond wavefunction.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Multiscale Neural Networks for Approximating Green’s Functions

Neural networks (NNs) have been widely used to solve partial differential equations (PDEs) in the applications of physics, biology, and engineering. One effective approach for solving PDEs with a fixed differential operator is learning Green’s functions. However, Green’s functions are notoriously difficult to learn due to their poor regularity, which typically requires larger NNs and longer training times. In this work, we address these challenges by leveraging multiscale NNs to learn Green’s functions. Through theoretical analysis using multiscale Barron space methods and experimental validation, we show that the multiscale approach significantly reduces the necessary NN size and accelerates training.

97 MATHEMATICS AND COMPUTING↗