Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions

We present a method for dimensionally adaptive sparse trigonometric interpolation of multidimensional periodic functions belonging to a smoothness class of finite order. This method targets applications where periodicity must be preserved and the precise anisotropy is not known a priori. To the authors' knowledge, this is the first instance of a dimensionally adaptive sparse interpolation algorithm that uses a trigonometric interpolation basis. The motivating application behind this work is the adaptive approximation of a multi-input model for a molecular potential energy surface (PES) where each input represents an angle of rotation. Our method is based on an anisotropic quasi-optimal estimate for the decay rate of the Fourier coefficients of the model; a least-squares fit to the coefficients of the interpolant is used to estimate the anisotropy. Thus, our adaptive approximation strategy begins with a coarse isotropic interpolant, which is gradually refined using the estimated anisotropic rates. The procedure takes several iterations where ever-more accurate interpolants are used to generate ever-improving anisotropy rates. We present several numerical examples of our algorithm where the adaptive procedure successfully recovers the theoretical “best” convergence rate, including an application to a periodic PES approximation. An open-source implementation of our algorithm resides in the Tasmanian UQ library developed at Oak Ridge National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application to finite volume discretizations), and (iii) for providing a sequence of nonlinear operators in a full approximation scheme for solving nonlinear pressure equations discretized by the conservative two-point flux approximation. Finally, we illustrate the potential of the proposed multilevel technique in all three applications on a number of popular benchmark problems used in reservoir simulation.

multilevel Monte Carlo↗
DOE OSTI2021

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

MIONet: Learning Multiple-Input Operators via Tensor Product

As an emerging paradigm in scientific machine learning, neural operators aim to learn operators, via neural networks, that map between infinite-dimensional function spaces. Several neural operators have been recently developed. However, all the existing neural operators are only designed to learn operators defined on a single Banach space; i.e., the input of the operator is a single function. Here, for the first time, we study the operator regression via neural networks for multiple-input operators defined on the product of Banach spaces. We first prove a universal approximation theorem of continuous multiple-input operators. We also provide a detailed theoretical analysis including the approximation error, which provides guidance for the design of the network architecture. Based on our theory and a low-rank approximation, we propose a novel neural operator, MIONet, to learn multiple-input operators. MIONet consists of several branch nets for encoding the input functions and a trunk net for encoding the domain of the output function. Here, we demonstrate that MIONet can learn solution operators involving systems governed by ordinary and partial differential equations. In our computational examples, we also show that we can endow MIONet with prior knowledge of the underlying system, such as linearity and periodicity, to further improve accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty

Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.

58 GEOSCIENCES↗
DOE OSTI2021

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Neural Scaling Laws of Deep ReLU and Deep Operator Network: A Theoretical Study

Neural scaling laws play a pivotal role in the performance of deep neural networks and have been observed in a wide range of tasks. However, a complete theoretical framework for understanding these scaling laws remains underdeveloped. In this paper, we explore the neural scaling laws for deep operator networks, which involve learning mappings between function spaces, with a focus on the Chen and Chen style architecture. These approaches, which include the popular Deep Operator Network (DeepONet), approximate the output functions using a linear combination of learnable basis functions and coefficients that depend on the input functions. We establish a theoretical framework to quantify the neural scaling laws by analyzing its approximation and generalization errors. We articulate the relationship between the approximation and generalization errors of deep operator networks and key factors such as network model size and training data size. Moreover, we address cases where input functions exhibit low-dimensional structures, allowing us to derive tighter error bounds. These results also hold for deep ReLU networks and other similar structures. Our results offer a partial explanation of the neural scaling laws in operator learning and provide a theoretical foundation for their applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hydrogen Bond Benchmark: Focal‐Point Analysis and Assessment of DFT Functionals

We performed a hierarchical, convergent ab initio benchmark study and systematically analyzed the performance of density functional approximations for describing hydrogen bonds in small neutral, cationic, and anionic complexes, as well as in larger systems involving amide, urea, deltamide, and squaramide moieties. Focal point analyses (FPA), extrapolating to the ab initio limit, were carried out using correlated wave function methods up to CCSDT(Q) for the small complexes and CCSD(T) for the larger systems, together with correlation-consistent Gaussian basis sets up to the complete basis set limit. Optimized geometries and vibrational frequencies were obtained at the CCSD(T) level. The resulting FPA hydrogen-bond energies converge within a few tenths of a kcal mol −1 . These reference data were used to evaluate 60 density functionals (including 12 dispersion-corrected), spanning the local-density approximation (LDA), generalized gradient approximations (GGAs), meta-GGAs, hybrids, meta-hybrids, double-hybrids, and range-separated hybrids. Overall, the meta-hybrid M06-2X provides the best performance for both hydrogen bond energies and geometries, while the dispersion-corrected GGAs BLYP-D3(BJ) and BLYP-D4 also yield accurate hydrogen-bond data and can serve as cost-effective options for studying large and complex systems.

coupled cluster theory↗
DOE OSTI2020

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Factors Affecting Bait Site Visitation: Area of Influence of Baits

Baiting is a fundamental strategy for the global management of wild pigs (Sus scrofa); however, little information exists on how anthropogenic bait affects wild pig movements on a landscape. We investigated factors that are important in determining the spatial area of attraction for wild pigs to bait (‘area of influence’ of a bait site) using data from Global Positioning System (GPS) collars and locations of bait sites. We monitored movements of wild pigs in 2 distinct study areas in the United States from February to September 2016 and used locational data using GPS collars to analyze the influence of habitat quality (dependent on site), home range size, number of bait sites in the home range, distance to a bait site, and sex in relation to movement in time and space. We determined the average area of influence by calculating the area of a circle with the radius as the average maximum distance travelled by wild pigs to reach a bait site. The average area of influence for our bait sites was 6.7 km 2 (or a radius of approximately 1.5 km), suggesting a bait spacing of approximately 1.5 km would be adequate to capture visitation by most wild pigs and a spacing of 3 km could allow substantial visitation while minimizing redundant effort depending on the spatial structure of the populations. Eighty percent of wild pigs first visited bait sites within 8.9 days after bait deployment; and they visited earlier when their home range size was larger. As the number of bait sites in an individual's home range increased, individual pigs visited more bait sites, and the probability of a visit increased dramatically up to approximately 5 bait sites and much less thereafter. Wild pigs travelled farther distances to visit bait sites in lower quality habitat. Our results support the hypothesis that habitat quality can mediate the efficacy of baiting programs for wildlife by influencing their movement patterns and motivation to use anthropogenic resources. Our results suggest wild pigs will travel extensively within their home range to visit bait sites, and that in lower quality habitat, most animals will find bait sites more quickly. Determining the area of influence of bait sites can increase the efficacy of planning and monitoring management programs. Overall, our study provides new information to help managers plan baiting designs to attract the greatest number of pigs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Sub-leading structures in superconformal indices: subdominant saddles and logarithmic contributions

We systematically study various sub-leading structures in the superconformal index of N = 4 supersymmetric Yang-Mills theory with SU(N) gauge group. We concentrate in the superconformal index description as a matrix model of elliptic gamma functions and in the Bethe-Ansatz presentation. Our saddle-point approximation goes beyond the Cardy-like limit and we uncover various saddles governed by a matrix model corresponding to SU(N) Chern-Simons theory. The dominant saddle, however, leads to perfect agreement with the Bethe-Ansatz approach. We also determine the logarithmic correction to the superconformal index to be log N, finding precise agreement between the saddle-point and Bethe-Ansatz approaches in their respective approximations. We generalize the two approaches to cover a large class of 4d N = 1 superconformal theories. We find that also in this case both approximations agree all the way down to a universal contribution of the form log N. The universality of this last result constitutes a robust signature of this ultraviolet description of asymptotically AdS 5 black holes and could be tested by low-energy IIB supergravity.

1/N expansion↗
DOE OSTI2021

Obstacles to constructing de Sitter space in string theory

There have been many attempts to construct de Sitter space-times in string theory. While arguably there have been some successes, this has proven challenging, leading to the de Sitter swampland conjecture: quantum theories of gravity do not admit stable or metastable de Sitter space. Here we explain that, within controlled approximations, one lacks the tools to construct de Sitter space in string theory. Such approximations would require the existence of a set of (arbitrarily) small parameters, subject to severe constraints. But beyond this one also needs an understanding of big-bang and big-crunch singularities that is not currently accessible to standard approximations in string theory. The existence or non-existence of metastable de Sitter space in string theory remains a matter of conjecture.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Learning likelihood ratios with neural network classifiers

The likelihood ratio is a crucial quantity for statistical inference in science that enables hypothesis testing, construction of confidence intervals, reweighting of distributions, and more. Many modern scientific applications, however, make use of data- or simulation-driven models for which computing the likelihood ratio can be very difficult or even impossible. By applying the so-called “likelihood ratio trick,” approximations of the likelihood ratio may be computed using clever parametrizations of neural network-based classifiers. A number of different neural network setups can be defined to satisfy this procedure, each with varying performance in approximating the likelihood ratio when using finite training data. We present a series of empirical studies detailing the performance of several common loss functionals and parametrizations of the classifier output in approximating the likelihood ratio of two univariate and multivariate Gaussian distributions as well as simulated high-energy particle physics datasets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Wormholes and black hole microstates in AdS/CFT

It has long been known that the coarse-grained approximation to the black hole density of states can be computed using classical Euclidean gravity. In this work we argue for another entry in the dictionary between Euclidean gravity and black hole physics, namely that Euclidean wormholes describe a coarse-grained approximation to the energy level statistics of black hole microstates. To do so we use the method of constrained instantons to obtain an integral representation of wormhole amplitudes in Einstein gravity and in full-fledged AdS/CFT. These amplitudes are non-perturbative corrections to the two-boundary problem in AdS quantum gravity. The full amplitude is likely UV sensitive, dominated by small wormholes, but we show it admits an integral transformation with a macroscopic, weakly curved saddle-point approximation. The saddle is the “double cone” geometry of Saad, Shenker, and Stanford, with fixed moduli. In the boundary description this saddle appears to dominate a smeared version of the connected two-point function of the black hole density of states, and suggests level repulsion in the microstate spectrum. Using these methods we further study Euclidean wormholes in pure Einstein gravity and in IIB supergravity on Euclidean AdS 5 × S 5 . We address the perturbative stability of these backgrounds and study brane nucleation instabilities in 10d supergravity. In particular, brane nucleation instabilities of the Euclidean wormholes are lifted by the analytic continuation required to obtain the Lorentzian spectral form factor from gravity. Our results indicate a factorization paradox in AdS/CFT.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

CGC for ultra-peripheral Pb+Pb collisions at the Large Hadron Collider: a more realistic calculation

We provide the first calculation of two-gluon production at mid-rapidity in ultra-peripheral collisions in the Color Glass Condensate framework. To estimate systematic uncertainty associated with poor understanding of the wave function of the nearly real photon, we consider two diametrically different models: the dilute quark-antiquark dipole approximation and a vector meson, in which color charge density is approximated by McLerran-Venugopalan model. In the experimentally relevant range, the target nucleus can be faithfully approximated by a highly saturated state. This simplification enables us to perform efficient numerical simulations and extract the two-gluon correlation functions and the associated azimuthal harmonics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗
DOE OSTI2021

Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation

In this work, we consider the problem of designing a cloak for waves described by the Helmholtz equation from an integer programming point of view. The problem can be modeled as a PDE-constrained optimization problem with integer-valued control inputs that are distributed in the computational domain. A first-discretize-then-optimize approach results in a large-scale mixed-integer nonlinear program that is in general intractable because of the large number of integer variables that arise from the discretization of the domain. Instead, we propose an efficient algorithm that is able to approximate the local infima of the underlying nonconvex infinite-dimensional problem arbitrarily close without the need to solve the discretized finite-dimensional integer programs to optimality. We optimize only the continuous relaxations of the approximations for local minima and then apply the sum-up rounding methodology to obtain integer-valued controls. If the solutions of the discretized continuous relaxations converge to a local minimizer of the continuous relaxation, then the resulting discrete-valued control sequence converges weakly \(^*\) in \(L^\infty\) to the same local minimizer. These approximation properties follow under suitable refinements of the involved discretization grids. Our results use familiar concepts arising from the analytical properties of the underlying PDE and complement previous results, derived from a topology optimization point of view.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Hydrogen Adsorption on Ordered and Disordered Pt-Ni Alloys

The bulk properties and chemical reactivity of disordered Pt-Ni alloys in the A1 ( fcc ) structure are investigated herein using different methods: Virtual Crystal Approximation (VCA), Korringa–Kohn–Rostoker Coherent Potential Approximation (KKR-CPA), and large explicit supercells generated using Super-Cell Random Approximates (SCRAPs). While VCA predicts lattice constants that closely follow Vegard’s law, the large supercells and KKR-CPA predict lattice constants that are consistently larger than Vegard’s law. KKR-CPA results closely agree with those from the large supercells for the disordered alloys, producing similar projected density of states and magnetic moment across the composition range. For instance, while VCA predicts the disordered alloys to be non-magnetic at a Pt concentration ( x Pt ) ≥ 0.5, KKR-CPA and SCRAPs predict the disordered alloys to remain ferromagnetic to higher Pt concentrations. As x Pt decreases, the adsorption of H becomes more exothermic on bulk-terminated (111) surfaces but less exothermic on Pt monolayer-terminated (111) surfaces due largely to strain effects. (111) surfaces cut from the large supercells predict average H adsorption energies on the disordered alloys similar to those on the ordered phases of the same compositions, while VCA predicts H adsorption to be more exothermic.

36 MATERIALS SCIENCE↗