Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “functional 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A finite element formulation for scattering from electrically large 2-dimensional structures

A finite element formulation is given using the scattered field approach with a fictitious material absorber to truncate the mesh. The formulation includes the use of arbitrary approximation functions so that more accurate results can be achieved without any modification to the software. Additionally, non-polynomial approximation functions can be used, including complex approximation functions. The banded system that results is solved with an efficient sparse/banded iterative scheme and as a consequence, large structures can be analyzed. Results are given for simple cases to verify the formulation and also for large, complex geometries.

Ross, Daniel C.↗
DOE OSTI2024

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.

Science & Technology - Other Topics↗
DOE OSTI2017

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)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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.

Johnson, Charles A.↗
NASA NTRS1972

Spline smoothing of histograms by linear programming

An algorithm for an approximating function to the frequency distribution is obtained from a sample of size n. To obtain the approximating function a histogram is made from the data. Next, Euclidean space approximations to the graph of the histogram using central B-splines as basis elements are obtained by linear programming. The approximating function has area one and is nonnegative.

Bennett, J. O.↗
DOE OSTI2020

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.

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

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.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2016

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.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2011

Least-Squares Adaptive Control Using Chebyshev Orthogonal Polynomials

This paper presents a new adaptive control approach using Chebyshev orthogonal polynomials as basis functions in a least-squares functional approximation. The use of orthogonal basis functions improves the function approximation significantly and enables better convergence of parameter estimates. Flight control simulations demonstrate the effectiveness of the proposed adaptive control approach.

Nguyen, Nhan T.↗
NASA NTRS2012

A Cross-Validation Approach to Approximate Basis Function Selection of the Stall Flutter Response of a Rectangular Wing in a Wind Tunnel

The stall flutter response of a rectangular wing in a low speed wind tunnel is modelled using a nonlinear difference equation description. Static and dynamic tests are used to select a suitable model structure and basis function. Bifurcation criteria such as the Hopf condition and vibration amplitude variation with airspeed were used to ensure the model was representative of experimentally measured stall flutter phenomena. Dynamic test data were used to estimate model parameters and estimate an approximate basis function.

Kukreja, Sunil L.↗
NASA NTRS1991

A system identification model for adaptive nonlinear control

A system identification model that combines generalized-spline function approximation with a nonlinear control system is described. The complete control system contains three main elements: a nonlinear-inverse-dynamic control law that depends on a comprehensive model of the plant, a state estimator whose outputs drive the control law, and a function approximation scheme that models the system dynamics. The system-identification task, which combines an extended Kalman filter with a function approximator modeled as an artificial neural network, is considered. The results of an application of the identification techniques to a nonlinear transport aircraft model are presented.

Linse, Dennis J.↗
DOE OSTI2021

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.

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 OSTI2022

Mechanical properties of zeolite-templated carbons from approximate density functional theory calculations

Zeolite-templated carbon (ZTC) is a unique porous carbonaceous material whose structure is ordered at the nanometre scale, enabling a representative periodic description at the atomistic level. Utilizing an existing, well-defined reference model for ZTCs, a structural library of varying compositions was developed by refinement using density-functional tight-binding (DFTB) potentials parameterized for materials science applications. We first determined the quantum chemical-refined structures of models with CH, CHO, CHON, CHOB, and CHOBN compositions with various degrees of heteroatom substitution. These structural models comprise the characteristic morphological features of highly porous carbon materials, such as open-blade surfaces, edges, saddles, and closed-strut formations, spanning a range of curvatures and characteristic sizes. Second, we carried out alternating compression and expansion of the CHO model unit cell to determine the lowest energy structure as well as to obtain its bulk modulus in order to demonstrate a close connection between macroscopic observations and atomic-scale structures. Further, the agreement between experimental measurements and the computational model is remarkable and demonstrates the power of approximate density functional theory as a cost-effective computational tool with chemical accuracy for the investigation of structure/property relationships in real-world carbon-based solids.

03 NATURAL GAS↗
DOE OSTI2016

mBEEF-vdW: Robust fitting of error estimation density functionals

Here, we propose a general-purpose semilocal/nonlocal exchange-correlation functional approximation, named mBEEF-vdW. The exchange is a meta generalized gradient approximation, and the correlation is a semilocal and nonlocal mixture, with the Rutgers-Chalmers approximation for van der Waals (vdW) forces. The functional is fitted within the Bayesian error estimation functional (BEEF) framework. We improve the previously used fitting procedures by introducing a robust MM-estimator based loss function, reducing the sensitivity to outliers in the datasets. To more reliably determine the optimal model complexity, we furthermore introduce a generalization of the bootstrap 0.632 estimator with hierarchical bootstrap sampling and geometric mean estimator over the training datasets. Using this estimator, we show that the robust loss function leads to a 10% improvement in the estimated prediction error over the previously used least-squares loss function. The mBEEF-vdW functional is benchmarked against popular density functional approximations over a wide range of datasets relevant for heterogeneous catalysis, including datasets that were not used for its training. Overall, we find that mBEEF-vdW has a higher general accuracy than competing popular functionals, and it is one of the best performing functionals on chemisorption systems, surface energies, lattice constants, and dispersion. We also show the potential-energy curve of graphene on the nickel(111) surface, where mBEEF-vdW matches the experimental binding length. mBEEF-vdW is currently available in gpaw and other density functional theory codes through Libxc, version 3.0.0.

36 MATERIALS SCIENCE↗
NASA NTRS1987

Postbuckling of laminated anisotropic panels

A two-part study of the buckling and postbuckling of laminated anisotropic plates with bending-extensional coupling is presented. The first part involves the development and application of a modified Rayleigh-Ritz analysis technique. Modifications made to the classical technique can be grouped into three areas. First, known symmetries of anisotropic panels are exploited in the selection of approximation functions. Second, a reduced basis technique based on these same symmetries is applied in the linear range. Finally, geometric boundary conditions are enforced via an exterior penalty function approach, rather than relying on choice of approximation functions to satisfy these boundary conditions. Numerical results are presented for both the linear and nonlinear range, with additional studies made to determine the effect of variation in penalty parameter and number of basis vectors. In the second part, six panels possessing anisotropy and bending-extensional coupling are tested. Detailed comparisons are made between experiment and finite element results in order to gain insight into the postbuckling and failure characteristics of such panels. The panels are constructed using two different lamination sequences, and panels with three different aspect ratios were constructed for each lamination sequence.

Jeffrey, Glenda L.↗
DOE OSTI2025

Massively parallel and universal approximation of nonlinear functions using diffractive processors

Nonlinear computation is essential for a wide range of information processing tasks, yet implementing nonlinear functions using optical systems remains a challenge due to the weak and power-intensive nature of optical nonlinearities. Overcoming this limitation without relying on nonlinear optical materials could unlock unprecedented opportunities for ultrafast and parallel optical computing systems. Here, we demonstrate that large-scale nonlinear computation can be performed using linear optics through optimized diffractive processors composed of passive phase-only surfaces. In this framework, the input variables of nonlinear functions are encoded into the phase of an optical wavefront—e.g., via a spatial light modulator (SLM)—and transformed by an optimized diffractive structure with spatially varying point-spread functions to yield output intensities that approximate a large set of unique nonlinear functions–all in parallel. We provide proof establishing that this architecture serves as a universal function approximator for an arbitrary set of bandlimited nonlinear functions, also covering wavelength-multiplexed nonlinear functions as well as multi-variate and complex-valued functions that are all-optically cascadable. Our analysis also indicates the successful approximation of typical nonlinear activation functions commonly used in neural networks, including the sigmoid, tanh, ReLU (rectified linear unit), and softplus. We numerically demonstrate the parallel computation of one million distinct nonlinear functions, accurately executed at wavelength-scale spatial density at the output of a diffractive optical processor. Furthermore, we experimentally validated this framework using in situ optical learning and approximated 35 unique nonlinear functions in a single shot using a compact setup consisting of an SLM and an image sensor. These results establish diffractive optical processors as a scalable platform for massively parallel universal nonlinear function approximation, paving the way for new capabilities in analog optical computing based on linear materials.

Rahman, Md Sadman Sakib [University of California,↗
DOE OSTI2014

Kinetic and electron-electron energies for convex sums of ground state densities with degeneracies and fractional electron number

Properties of exact density functionals provide useful constraints for the development of new approximate functionals. This paper focuses on convex sums of ground-level densities. It is observed that the electronic kinetic energy of a convex sum of degenerate ground-level densities is equal to the convex sum of the kinetic energies of the individual degenerate densities. (The same type of relationship holds also for the electron-electron repulsion energy.) This extends a known property of the Levy-Valone Ensemble Constrained-Search and the Lieb Legendre-Transform refomulations of the Hohenberg-Kohn functional to the individual components of the functional. Moreover, we observe that the kinetic and electron-repulsion results also apply to densities with fractional electron number (even if there are no degeneracies), and we close with an analogous point-wise property involving the external potential. Examples where different degenerate states have different kinetic energy and electron-nuclear attraction energy are given; consequently, individual components of the ground state electronic energy can change abruptly when the molecular geometry changes. These discontinuities are predicted to be ubiquitous at conical intersections, complicating the development of universally applicable density-functional approximations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗