Search NASA⌕ Search

SEARCH · Search NASA

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Rapid State Space Modeling Tool for Rectangular Wing Aeroservoelastic Studies

This paper introduces a modeling and simulation tool for aeroservoelastic analysis of rectangular wings with trailing edge control surfaces. The inputs to the code are planform design parameters such as wing span, aspect ratio and number of control surfaces. A doublet lattice approach is taken to compute generalized forces. A rational function approximation is computed. The output, computed in a few seconds, is a state space aeroservoelastic model which can be used for analysis and control design. The tool is fully parameterized with default information so there is little required interaction with the model developer. Although, all parameters can be easily modified if desired.The focus of this paper is on tool presentation, verification and validation. This process is carried out in stages throughout the paper. The rational function approximation is verified against computed generalized forces for a plate model. A model composed of finite element plates is compared to a modal analysis from commercial software and an independently conducted experimental ground vibration test analysis. Aeroservoelastic analysis is the ultimate goal of this tool. Therefore the flutter speed and frequency for a clamped plate are computed using V-g and V-f analysis. The computational results are compared to a previously published computational analysis and wind tunnel results for the same structure. Finally a case study of a generic wing model with a single control surface is presented. Verification of the state space model is presented in comparison to V-g and V-f analysis. This also includes the analysis of the model in response to a 1-cos gust.

Modeling and Simulation↗
DOE OSTI2022

Assessments of epistemic uncertainty using Gaussian stochastic weight averaging for fluid-flow regression

Here, we use Gaussian stochastic weight averaging (SWAG) to assess the epistemic uncertainty associated with neural-network-based function approximation relevant to fluid flows. SWAG approximates a posterior Gaussian distribution of each weight, given training data, and a constant learning rate. Having access to this distribution, it is able to create multiple models with various combinations of sampled weights, which can be used to obtain ensemble predictions. The average of such an ensemble can be regarded as the 'mean estimation', whereas its standard deviation can be used to construct 'confidence intervals', which enable us to perform uncertainty quantification (UQ) with regard to the training process of neural networks. We utilize representative neural-network-based function approximation tasks for the following cases: (i) a two-dimensional circular-cylinder wake; (ii) the DayMET dataset (maximum daily temperature in North America); (iii) a three-dimensional square-cylinder wake; and (iv) urban flow, to assess the generalizability of the present idea for a wide range of complex datasets. SWAG-based UQ can be applied regardless of the network architecture, and therefore, we demonstrate the applicability of the method for two types of neural networks: (i) global field reconstruction from sparse sensors by combining convolutional neural network (CNN) and multi-layer perceptron (MLP); and (ii) far-field state estimation from sectional data with two-dimensional CNN. We find that SWAG can obtain physically-interpretable confidence-interval estimates from the perspective of epistemic uncertainty. This capability supports its use for a wide range of problems in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Dynamic aspects of graphene deformation and fracture from approximate density functional theory

Graphene is one of the most intriguing two-dimensional carbon materials. Its mechanical strength and failure are key concerns for materials engineering and applications. Despite the success of fracture mechanics, the mechanism of how pristine materials fail remains an elusive problem. While many theoretical studies based on molecular dynamics using empirical forcefields have tried to address this question, atomic-scale mechanics are not clearly understood. Especially, a widely employed bond-breaking approach based on the critical bond length has not been rigorously tested. Here, utilizing molecular dynamics simulations with density functional based tight binding, we investigate how the failure of the pristine material initiates. The Wiberg bond order (W BO ) to estimate the change of chemical bonds shows a transition from sp 2 (W BO ~ 1.33) to sp 3 (WBO < 1.0) during the deformation. However, it reveals that a single threshold value for either the WBO or bond length is insufficient to decide failure of pristine material without free edges or defects. Instead, collective behaviors of the local atomic group govern the fracture initiation of pristine graphene. Overall, our study provides dynamic mechanical responses based on quantum mechanics, which have not been captured by empirical forcefields, opening opportunities to design properties by precisely coupling the mechanics and quantum mechanics.

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

Erratum: “DFTB+, a software package for efficient approximate density functional theory based atomistic simulations” [J. Chem. Phys. 152, 124101 (2020)]

The implementation of the GPU support in DFTB+, as described in Sec. III C of the original publication,1 was developed based on a previous unpublished implementation by Jacek Jakowski. In order to acknowledge his work on this first implementation, the authors of the original publication wish to include J. Jakowski as co-author. The scientific content of the original publication is not affected.

42 ENGINEERING↗
DOE OSTI2023

Mathematical nuances of Gaussian process-driven autonomous experimentation

Abstract The fields of machine learning (ML) and artificial intelligence (AI) have transformed almost every aspect of science and engineering. The excitement for AI/ML methods is in large part due to their perceived novelty, as compared to traditional methods of statistics, computation, and applied mathematics. But clearly, all methods in ML have their foundations in mathematical theories, such as function approximation, uncertainty quantification, and function optimization. Autonomous experimentation is no exception; it is often formulated as a chain of off-the-shelf tools, organized in a closed loop, without emphasis on the intricacies of each algorithm involved. The uncomfortable truth is that the success of any ML endeavor, and this includes autonomous experimentation, strongly depends on the sophistication of the underlying mathematical methods and software that have to allow for enough flexibility to consider functions that are in agreement with particular physical theories. We have observed that standard off-the-shelf tools, used by many in the applied ML community, often hide the underlying complexities and therefore perform poorly. In this paper, we want to give a perspective on the intricate connections between mathematics and ML, with a focus on Gaussian process-driven autonomous experimentation. Although the Gaussian process is a powerful mathematical concept, it has to be implemented and customized correctly for optimal performance. We present several simple toy problems to explore these nuances and highlight the importance of mathematical and statistical rigor in autonomous experimentation and ML. One key takeaway is that ML is not, as many had hoped, a set of agnostic plug-and-play solvers for everyday scientific problems, but instead needs expertise and mastery to be applied successfully. Graphical abstract

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Hybrid Analytical Technique for Nonlinear Vibration Analysis of Thin-Walled Beams

A two-step hybrid analytical technique is presented for the nonlinear vibration analysis of thin-walled beams. The first step involves the generation of various-order perturbation functions using the Linstedt-Poincare perturbation technique. The second step consists of using the perturbation functions as coordinate (or approximation) functions and then computing both the amplitudes of these functions and the nonlinear frequency of vibration via a direct variational procedure. The analytical formulation is based on a form of the geometrically nonlinear beam theory with the effects of in-plane inertia, rotatory inertia, and transverse shear deformation included. The effectiveness of the proposed technique is demonstrated by means of a numerical example of thin-walled beam with a doubly symmetric I-section. The solutions obtained using a single-spatial mode were compared with those obtained using multiple-spatial modes. The standard of comparison was taken to be the frequencies obtained by the direct integration/fast Fourier transform (FFT) technique. The nonlinear frequencies obtained by the hybrid technique were shown to converge to the corresponding ones obtained by the direct integration/fast Fourier transform (FFT) technique well beyond the range of applicability of the perturbation technique. The frequencies and total strain energy of the beam were overestimated by using a single-spatial mode.

Noor, Ahmed K.↗
NASA NTRSDate not supplied

An Interactive MATLAB Program for Fitting Transfer Functions to Frequency Responses

A computer program called FRFit (Frequency Response Fitting) for matching single-input single-output (SISO) transfer function models to empirical frequency response data is described. The program was written in MATLAB and has a graphical user interface (GUI). It is interactive in that the user manually builds the transfer function model using ``elementary factors'' (gain, delay, differentiators and integrators, and first- and second-order poles and zeros) and adjusts their values with sliders or entry fields. A nonlinear optimization can also be used to determine maximum-likelihood estimates of the transfer function parameters and their associated uncertainties. The program has some usefulness as a teaching aid, and can be applied to model structure determination, reduced-order modeling, preliminary analysis, and other system identification problems. FRFit is demonstrated using example problems, including the identification of aircraft transfer functions and rational function approximations of Theodorsen's function.

Frequency response↗
NASA NTRS1973

New methods of fragmentary approximation of a function

Certain special methods of fragmentary approximation of a function are examined and the properties of the most widespread elementary functions for such approximation methods are investigated, for the purpose of developing useful characteristics and properties for practical realization, in particular, for their reproduction by analog functional converters, with a significantly smaller number of controlable or adjustable parameters than in known ones.

Kolesnichenko, S. G.↗
DOE OSTI2025

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗
DOE OSTI2023

DeepONet-grid-UQ: A trustworthy deep operator framework for predicting the power grid’s post-fault trajectories

This paper proposes a novel data-driven method for the reliable prediction of the power grid’s post-fault trajectories, i.e., the power grid’s dynamic response after a disturbance or fault. Here, the proposed method is based on the recently proposed concept of Deep Operator Networks (DeepONets). Unlike traditional neural networks that learn to approximate functions, DeepONets are designed to approximate nonlinear operators, i.e., mappings between infinite-dimensional spaces. Under this operator framework, we design a novel and efficient DeepONet that (i) takes as inputs the trajectories collected before and during the fault and (ii) outputs the predicted post-fault trajectories. In addition, we endow our method with the much-needed ability to balance efficiency with reliable/trustworthy predictions via uncertainty quantification. To this end, we propose and compare two novel methods that enable quantifying the predictive uncertainty. First, we propose a Bayesian DeepONet (B-DeepONet) that uses stochastic gradient Hamiltonian Monte-Carlo to sample from the posterior distribution of the DeepONet trainable parameters. Then, we design a Probabilistic DeepONet (Prob-DeepONet) that uses a probabilistic training strategy to enable quantifying uncertainty at virtually no extra computational cost. Finally, we validate the proposed methods’ predictive power and uncertainty quantification capability using the New York-New England power grid model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1989

Global properties of pseudospectral methods

The present application of polynomial interpolation methods to function-approximation and numerical solutions for hyperbolic and elliptic PDEs allows the explicit construction of the derivative matrix for a general sequence of collocation points. An evaluation of the effect of several factors on the performance of these methods indicates an inability to interpret global methods in terms of local ones; the accuracy of the approximation will differ when the function's large gradients occur near the center of the region or near the boundary, irrespective of the boundary vicinity's collocation-point density.

Solomonoff, A.↗
DOE OSTI2021

Confronting Domain Shift in Trained Neural Networks

Neural networks (NNs) are known as universal function approximators and can interpolate nonlinear functions between observed data points. However, when the target domain for deployment shifts from the training domain and NNs must extrapolate, the results are notoriously poor. Prior work Martinez et al. (2019) has shown that NN uncertainty estimates can be used to correct binary predictions in shifted domains without retraining the model. We hypothesize that this approach can be extended to correct real-valued time series predictions. As an exemplar, we consider two mechanical systems with nonlinear dynamics. The first system consists of a spring-mass system where the stiffness changes abruptly, and the second is a real experimental system with a frictional joint that is an open challenge for structural dynamicists to model efficiently. Our experiments will test whether 1) NN uncertainty estimates can identify when the input domain has shifted from the training domain and 2) whether the information used to calculate uncertainty estimates can be used to correct the NN’s time series predictions. While the method as proposed did not significantly improve predictions, our results did show potential for modifications that could improve models’ predictions and play a role in structural health monitoring systems that directly impact public safety.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Estimation of correlation functions by stochastic approximation.

Consideration of the autocorrelation function of a zero-mean stationary random process. The techniques are applicable to processes with nonzero mean provided the mean is estimated first and subtracted. Two recursive techniques are proposed, both of which are based on the method of stochastic approximation and assume a functional form for the correlation function that depends on a number of parameters that are recursively estimated from successive records. One technique uses a standard point estimator of the correlation function to provide estimates of the parameters that minimize the mean-square error between the point estimates and the parametric function. The other technique provides estimates of the parameters that maximize a likelihood function relating the parameters of the function to the random process. Examples are presented.

Habibi, A.↗
NASA NTRS1987

Performance evaluation of fault tolerant systems represented by Markov models

A method to evaluate the performance of fault tolerant systems whose configuration can be represented by time-invariant, discrete-time, discrete-state Markov models is introduced. Each state is assumed to be associated with a constant qualitative measure of the system's performance. The method first computes the moments of the performance probability mass function (PMF) and then finds an approximating function that has the same moments. The form of this function is a maximum entropy solution of the moment matching problem. A simple algorithm for calculating the necessary moments is derived and a method for finding the approximate performance PMF is suggested. After some modification, the method is applied to an example, the Inertial Upper Stage navigation system.

Missana, Jean-Olivier A. A.↗
DOE OSTI2023

Self-consistent implementation of locally scaled self-interaction-correction method

Recently proposed local self-interaction correction (LSIC) method is a one-electron self-interaction-correction (SIC) method that uses an iso-orbital indicator to apply the SIC at each point in space by scaling the exchange–correlation and Coulomb energy densities. The LSIC method is exact for the one-electron densities, also recovers the uniform electron gas limit of the uncorrected density functional approximation, and reduces to the well-known Perdew–Zunger SIC (PZSIC) method as a special case. This article presents the self-consistent implementation of the LSIC method using the ratio of Weizsäcker and Kohn–Sham kinetic energy densities as an iso-orbital indicator. The atomic forces as well as the forces on the Fermi-Löwdin orbitals are also implemented for the LSIC energy functional. Results show that LSIC with the simplest local spin density functional predicts atomization energies of the AE6 dataset better than some of the most widely used generalized-gradient-approximation (GGA) functional and barrier heights of the BH6 database better than some of the most widely used hybrid functionals. The LSIC method [a mean absolute error (MAE) of 0.008 Å] predicts bond lengths of a small set of molecules better than the PZSIC-LSDA (MAE 0.042 Å) and LSDA (0.011 Å). Furthermore, this work shows that accurate results can be obtained from the simplest density functional by removing the self-interaction-errors using an appropriately designed SIC method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗