Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Smooth 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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗
DOE OSTI2026

Deep Neural Networks are Adaptive to Function Regularity and Data Distribution in Approximation and Estimation

Deep learning has exhibited remarkable results across diverse areas. To understand its success, substantial research has been directed towards its theoretical foundations. Nev- ertheless, the majority of these studies examine how well deep neural networks can model functions with uniform regularities. In this paper, we explore a different angle: how deep neural networks can adapt to varying degrees of smoothness in functions and nonuni- form data distributions across different locations and scales. More precisely, we focus on a broad class of functions defined by nonlinear tree-based approximation methods. This class encompasses a range of function types, such as functions with uniform regularities and discontinuous functions. We develop nonparametric approximation and estimation theories for this class using deep ReLU networks. Our results show that deep neural networks are adaptive to the nonuniform smoothness of functions and nonuniform data distributions at different locations and scales. We apply our results to several function classes, and derive the corresponding approximation and generalization errors. The validity of our results is demonstrated through numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness

We report the accuracy of deep learning, i.e., deep neural networks, can be characterized by dividing the total error into three main types: approximation error, optimization error, and generalization error. Whereas there are some satisfactory answers to the problems of approximation and optimization, much less is known about the theory of generalization. Most existing theoretical works for generalization fail to explain the performance of neural networks in practice. To derive a meaningful bound, we study the generalization error of neural networks for classification problems in terms of data distribution and neural network smoothness. We introduce the cover complexity (CC) to measure the difficulty of learning a data set and the inverse of the modulus of continuity to quantify neural network smoothness. A quantitative bound for expected accuracy/error is derived by considering both the CC and neural network smoothness. Although most of the analysis is general and not specific to neural networks, we validate our theoretical assumptions and results numerically for neural networks by several data sets of images. The numerical results confirm that the expected error of trained networks scaled with the square root of the number of classes has a linear relationship with respect to the CC. We also observe a clear consistency between test loss and neural network smoothness during the training process. In addition, we demonstrate empirically that the neural network smoothness decreases when the network size increases whereas the smoothness is insensitive to training dataset size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Cosmological constraints from the Subaru Hyper Suprime-Cam year 1 shear catalogue lensing convergence probability distribution function

Here we utilize the probability distribution function (PDF) of normalized convergence maps reconstructed from the Subaru Hyper Suprime-Cam (HSC) year 1 shear catalogue, in combination with the power spectrum, to measure the matter clustering amplitude S 8 = σ 8 $\sqrt {Ω_{m}/0.3}$. The large-scale structure’s statistical properties are incompletely described by the traditional two-point statistics, motivating our investigation of the PDF—a complementary higher-order statistic. By defining the PDF over the standard-deviation-normalized convergence map, we are able to isolate the non-Gaussian information. We use tailored simulations to compress the data vector and construct a likelihood approximation. We mitigate the impact of survey and astrophysical systematics with cuts on smoothing scales, redshift bins, and data vectors. We find S 8 = $0.860^{+0.066}_{–0.109}$ from the PDF alone and S 8 = 0.798$^{+0.029}_{–0.042}$ from the combination of the PDF and power spectrum (68% confidential level (CL)). The PDF improves the power-spectrum-only constraint by about 10%.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Calculation of Dynamical Response Functions Using a Bound-State Method

Abstract We investigate a method to extract response functions (dynamical polarisabilities) directly from a bound-state approach applied to calculations of perturbation-induced reactions. The use of a square-integrable basis leads to a response in the form of a sum of $$\delta $$ δ functions. We integrate this over energy and fit a smooth function to the resulting stepwise-continuous one. Its derivative gives the final approximation to the physical response function. We show that the method reproduces analytical results where known, and analyse the details for a variety of models. We apply it to some simple models, using the stochastic variational method as the numerical method. Albeit we find that this approach, and other numerical techniques, have some difficulties with the threshold behavior in coupled-channel problems with multiple thresholds, its stochastic nature allows us to extract robust results even for such cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Gaussian process hydrodynamics

Abstract We present a Gaussian process (GP) approach, called Gaussian process hydrodynamics (GPH) for approximating the solution to the Euler and Navier-Stokes (NS) equations. Similar to smoothed particle hydrodynamics (SPH), GPH is a Lagrangian particle-based approach that involves the tracking of a finite number of particles transported by a flow. However, these particles do not represent mollified particles of matter but carry discrete/partial information about the continuous flow. Closure is achieved by placing a divergence-free GP prior ξ on the velocity field and conditioning it on the vorticity at the particle locations. Known physics (e.g., the Richardson cascade and velocity increment power laws) is incorporated into the GP prior by using physics-informed additive kernels. This is equivalent to expressing ξ as a sum of independent GPs ξ l , which we call modes, acting at different scales (each mode ξ l self-activates to represent the formation of eddies at the corresponding scales). This approach enables a quantitative analysis of the Richardson cascade through the analysis of the activation of these modes, and enables us to analyze coarse-grain turbulence statistically rather than deterministically. Because GPH is formulated by using the vorticity equations, it does not require solving a pressure equation. By enforcing incompressibility and fluid-structure boundary conditions through the selection of a kernel, GPH requires significantly fewer particles than SPH. Because GPH has a natural probabilistic interpretation, the numerical results come with uncertainty estimates, enabling their incorporation into an uncertainty quantification (UQ) pipeline and adding/removing particles (quanta of information) in an adapted manner. The proposed approach is suitable for analysis because it inherits the complexity of state-of-the-art solvers for dense kernel matrices and results in a natural definition of turbulence as information loss. Numerical experiments support the importance of selecting physics-informed kernels and illustrate the major impact of such kernels on the accuracy and stability. Because the proposed approach uses a Bayesian interpretation, it naturally enables data assimilation and predictions and estimations by mixing simulation data and experimental data.

Mathematics↗
DOE OSTI2021

Solar Transposition Modeling via Deep Neural Networks With Sky Images

This article presents a notable advance toward the development of a new method of increasing the single-axis tracking photovoltaic (PV) system power output by improving the determination and near-term prediction of the optimum module tilt angle. The tilt angle of the plane receiving the greatest total irradiance changes with Sun position and atmospheric conditions including cloud formation and movement, aerosols, and particulate loading, as well as varying albedo within a module's field of view. In this article, we present a multi-input convolutional neural network that can create a profile of plane-of-array irradiance versus surface tilt angle over a full 180° arc from horizon to horizon. As input, the neural network uses the calculated solar position and clear-sky irradiance values, along with sky images. The target irradiance values are provided by the multiplanar irradiance sensor (MPIS). In order to account for varying irradiance conditions, the MPIS signal is normalized by the theoretical clear-sky global horizontal irradiance. Using this information, the neural network outputs an N -dimensional vector, where N is the number of points to approximate the MPIS curve via Fourier resampling. The output vector of the model is smoothed with a Gaussian kernel to account for error in the downsamping and subsequent upsampling steps, as well as to smooth the unconstrained output of the model. Furthermore, these profiles may be used to perform near-term prediction of angular irradiance, which can then inform the movement of a PV tracker.

42 ENGINEERING↗
DOE OSTI2024

Image-Based Digital Twin for Assessing the Coupled Electro-Chemo-Mechanical Behavior of Li-Ion Batteries

In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. In this work, a digital twin is created to investigate the performance of a Li-ion battery cathode and simulate degradation accumulation. Pixel-based model construction is used to represent the complex material geometries from microstructural images supplied by the National Renewable Energy Laboratory (NREL). Because of the expected large deformation and crack opening, the reproducing kernel particle method (RKPM), a meshfree method with discretization at the image pixels, is used to approximate the field variables: electrostatic potential, concentration, and displacement. An interface modified reproducing kernel (IM-RK) is constructed by scaling a smooth kernel function with an interface-distance function to achieve strategic discontinuity types (i.e. weak discontinuities for strain discontinuities and strong discontinuities for cracks) and alleviate Gibbs oscillations near these transition zones. The discrete nature of the images' pixel points is employed throughout the model and approximation construction. The mechanical model is verified using an image-based microstructure under tensile loading. A transient electro-chemo-mechanical coupled simulation is performed to evaluate the potential micro-cracking induced degradation of the battery cathode material subjected to charge/discharge cycling.

battery degradation↗
DOE OSTI2021

Source term method for binary neutron stars initial data

The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Applications of the modified Hulthén-Kohn method for bound and scattering states

We adapt the Hulthén–Kohn method suggested by Efros [Phys. Rev. C 99, 034620 (2019)] for calculating various observables in the continuum and discrete spectrum using two-body interactions in single- and coupled channel systems. We explore the convergence of phase shifts and wave functions as well as the location of S-matrix poles which enables obtaining both resonance and bound state parameters. We find that employing a harmonic oscillator basis, together with an interaction smoothing scheme introduced by Gyarmati et al. [Nucl. Phys. A 326, 119 (1979)], and adopting approximate bound-state solutions for the short-range components of basis wave functions lead to good convergence even with restricted oscillator quanta accessible for modern no-core shell model codes. The adapted Efros method will facilitate ab initio many-body nuclear structure applications.

Nuclear reactions↗
DOE OSTI2022

Generalized Bootstrap AMG and AIR-AMG for coupled PDE systems with a focus on spacetime discretizatoins

The Pennsylvania State University (“Subcontractor”) has worked on the design of new algebraic, parallel, multilevel methods that obtain the full space and time solution of systems of PDEs. In particular, the PI and his collaborators explored semi-intrusive approaches based on algebraic multigrid (AMG). The focus of the research has been on the development of these techniques for the Euler equations in 1d and 2d. The overall research focused on the development of adaptive AIR (approximate ideal restriction) AMG solvers for these problems. The PI also explored the use of smoothed aggregation and root-node energy-based AMG solvers for these problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A differentiable model of the evolution of dark matter halo concentration

ABSTRACT We introduce a new model of the evolution of the concentration of dark matter haloes, c(t). For individual haloes, our model approximates c(t) as a power law with a time-dependent index, such that at early times, concentration has a nearly constant value of c ≈ 3–4, and as cosmic time progresses, c(t) smoothly increases. Using large samples of halo merger trees taken from the Bolshoi–Planck and MultiDark Planck 2 cosmological simulations, we demonstrate that our three-parameter model can approximate the evolution of the concentration of individual haloes with a typical accuracy of 0.1 dex for $t\gtrsim 2\, {\rm Gyr}$ for all Bolshoi–Planck and MultiDark Planck 2 haloes of present-day peak mass $M_{0}\gtrsim 10^{11.5}\, {\rm M}_{\odot }$. We additionally present a new model of the evolution of the concentration of halo populations, which we show faithfully reproduces both average concentration growth and the diversity of smooth trajectories of c(t), including capturing correlations with halo mass and halo assembly history. Our publicly available source code, diffprof, can be used to generate Monte Carlo realizations of the concentration histories of cosmologically representative halo populations. diffprof is differentiable due to its implementation in the jax autodiff library, which facilitates the incorporation of our model into existing analytical halo model frameworks.

Stevanovich, Dash↗
DOE OSTI2023

Fourier-informed knot placement schemes for B-spline approximation

Fitting B-splines to scientific data is especially challenging when the given data contain noise, jumps, or corners. Here, we describe how periodic data sets with these features can be efficiently approximated with B-splines by analyzing the Fourier spectrum of the data. Our method uses a collection of spectral filters to compute high-order derivatives, smoothed versions of noisy data, and the locations of jump discontinuities. Further, these quantities are then combined to choose knots that capture the qualitative features of the data, leading to accurate B-spline approximations with few knots. The method we introduce is direct and does not require any intermediate B-spline fitting before choosing the final knot distribution. Aside from fast Fourier transforms to transfer to and from Fourier space, the method runs in linear time with very little communication. We assess performance on several test cases in one and two dimensions, including data sets with jump discontinuities and noise. These tests show the method fits discontinuous data without spurious oscillations and remains effective in the presence of noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Microstrata

Abstract Microstrata are the non-extremal analogues of superstrata: they are smooth, non-extremal (non-BPS) solitonic solutions to IIB supergravity whose deep-throat limits approximate black holes. Using perturbation theory and numerical methods, we construct families of solutions using a consistent truncation to three-dimensional supergravity. The most general families presented here involve two continuous parameters, or amplitudes, and four quantized parameters that set the angular momenta and energy levels. Our solutions are asymptotic to the vacuum of the D1-D5 system: AdS 3 ×S 3 × 𝕋 4 . Using holography, we show that the they are dual to multi-particle states in the D1-D5 CFT involving a large number of mutually non-BPS supergravitons and we determine the anomalous dimensions of these states from the binding energies in supergravity. These binding energies are uniformly negative and depend non-linearly on the amplitudes of the states. In one family of solutions, smoothness restricts some of the fields to lie on a special locus of the parameter space. Using precision holography we show that this special locus can be identified with the multi-particle states constructed via the standard OPE of the single-particle constituents. Our numerical analysis shows that microstrata are robust at large amplitudes and the solutions can be obtained to very high precision.

Physics↗
DOE OSTI2022

Physics‐Informed Machine Learning Method for Large‐Scale Data Assimilation Problems

Abstract We develop a physics‐informed machine learning approach for large‐scale data assimilation and parameter estimation and apply it for estimating transmissivity and hydraulic head in the two‐dimensional steady‐state subsurface flow model of the Hanford Site given synthetic measurements of said variables. In our approach, we extend the physics‐informed conditional Karhunen‐Loéve expansion (PICKLE) method to modeling subsurface flow with unknown flux (Neumann) and varying head (time‐dependent Dirichlet) boundary conditions. We demonstrate that the PICKLE method is comparable in accuracy with the standard maximum a posteriori (MAP) method, but is significantly faster than MAP for large‐scale problems. Both methods use a mesh to discretize the computational domain. In MAP, the parameters and states are discretized on the mesh; therefore, the size of the MAP parameter estimation problem directly depends on the mesh size. In PICKLE, the mesh is used to evaluate the residuals of the governing equation, while the parameters and states are approximated by the truncated conditional Karhunen‐Loéve expansions with the number of parameters controlled by the smoothness of the parameter and state fields, and not by the mesh size. For a considered example, we demonstrate that the computational cost of PICKLE increases near linearly (as N 1.15 ) with the number of grid nodes N , while that of MAP increases much faster (as N 3.28 ). We also show that once trained for one set of Dirichlet boundary conditions (i.e., one river stage), the PICKLE method provides accurate estimates of the hydraulic head for any value of the Dirichlet boundary conditions (i.e., for any river stage).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The effects of storms and a transient sandy veneer on the interannual planform evolution of a low-relief coastal cliff and shore platform at Sargent Beach, Texas, USA

Coastal cliff erosion is alongshore-variable and episodic, with retreat rates that depend upon sediment as either tools of abrasion or protective cover. However, the feedbacks between coastal cliff planform morphology, retreat rate, and sediment cover are poorly quantified. This study investigates Sargent Beach, Texas, USA, at the annual to interannual scale to explore (1) the relationship between temporal and spatial variability in cliff retreat rate, roughness, and sinuosity and (2) the response of retreat rate and roughness to changes in sand and shell hash cover of the underlying mud substrate as well as the impact of major storms using field measurements of sediment cover, erosion, and aerial images to measure shore platform morphology and retreat. A storm event in 2009 increased the planform roughness and sinuosity of the coastal cliff at Sargent Beach. Following the storm, aerial-image-derived shorelines with annual resolution show a decrease in average alongshore erosion rates from 12 to 4 m yr –1 , coincident with a decrease in shoreline roughness and sinuosity (smoothing). Like the previous storm, a storm event in 2017 increased the planform roughness and sinuosity of the cliff. Over shorter timescales, monthly retreat of the sea cliff occurred only when the platform was sparsely covered with sediment cover on the shore platform, indicating that the tools and cover effects can significantly affect short-term erosion rates. The timescale to return to a smooth shoreline following a storm or roughening event, given a steady-state erosion rate, is approximately 24 years, with the long-term rate suggesting a maximum of ~107 years until Sargent Beach breaches, compromising the Gulf Intracoastal Waterway (GIWW) under current conditions and assuming no future storms or intervention. The observed retreat rate varies, both spatially and temporally, with cliff face morphology, demonstrating the importance of multi-scale measurements and analysis for interpretation of coastal processes and patterns of cliff retreat.

58 GEOSCIENCES↗
DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗