Engineering Papers⌕ Search

SEARCH · Engineering Papers

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

Simplifying activations with linear approximations in neural networks

A key step in Neural Networks is activation. Among the different types of activation functions, sigmoid, tanh, and others involve the usage of exponents for calculation. From a hardware perspective, exponential implementation implies the usage of Taylor series or repeated methods involving many addition, multiplication, and division steps, and as a result are power-hungry and consume many clock cycles. We implement a piecewise linear approximation of the sigmoid function as a replacement for standard sigmoid activation libraries. This approach provides a practical alternative by leveraging piecewise segmentation, which simplifies hardware implementation and improves computational efficiency. In this paper, we detail piecewise functions that can be implemented using linear approximations and their implications for overall model accuracy and performance gain. Our results show that for the DenseNet, ResNet, and GoogLeNet architectures, the piecewise linear approximation of the sigmoid function provides faster execution times compared to the standard TensorFlow sigmoid implementation while maintaining comparable accuracy. Specifically, for MNIST with DenseNet, accuracy reaches 99.91% (Piecewise) vs. 99.97% (Base) with up to 1.31x speedup in execution time. For CIFAR-10 with DenseNet, accuracy improves to 98.97% (Piecewise) vs. 99.40% (Base) while achieving 1.24x faster execution. Similarly, for CIFAR-100 with DenseNet, the accuracy is 97.93% (Piecewise) vs. 98.39% (Base), with a 1.18x execution time reduction. These results confirm the proposed method’s capability to efficiently process large-scale datasets and computationally demanding tasks, offering a practical means to accelerate deep learning models, including LSTMs, without compromising accuracy.

Activation function↗
DOE OSTI2024

Adiabatic approximation and Aharonov-Casher bands in twisted homobilayer transition metal dichalcogenides

Topological flat moiré bands with nearly ideal quantum geometry have been identified in homobilayer transition metal dichalcogenide moiré superlattices, and are thought to be crucial for understanding the fractional Chern insulating states recently observed therein. Previous study proposed viewing the system using an adiabatic approximation that replaces the position dependence of the layer spinor with a nonuniform periodic effective magnetic field. When the local zero-point kinetic energy of this magnetic field cancels identically against that of an effective Zeeman energy, a Bloch-band version of Aharonov-Casher zero-energy modes, which we refer to as Aharonov-Casher band, emerges leading to ideal quantum geometry. Here, we critically examine the validity of the adiabatic approximation and identify the parameter regimes under which Aharonov-Casher bands emerge. We show that the adiabatic approximation is accurate for a wide range of parameters including those realized in experiments. Furthermore, we show that while the cancellation leading to the emergence of Aharonov-Casher bands is generally not possible beyond the leading Fourier harmonic, the leading harmonic is the dominant term in the Fourier expansions of the zero-point kinetic energy and Zeeman energy. Finally, the leading harmonic expansion accurately captures the trend of the bandwidth and quantum geometry, although it may fail to quantitatively reproduce more detailed information about the bands such as the Berry curvature distribution.

36 MATERIALS SCIENCE↗
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 OSTI2024

Approximation of ice phenology of Maine lakes using Aqua MODIS surface temperature data

Studies of lake ice phenology have historically relied on limited in situ data. Relatively few observations exist for ice out and fewer still for ice in, both of which are necessary to determine the temporal extent of ice cover. Satellite data provide an opportunity to better document patterns of ice phenology across landscapes and relate them to the climatological drivers behind changing ice phenology. We developed a model, the Cumulative Sum Method (CSM), that uses daytime and nighttime surface temperature observations from the Moderate Resolution Imaging Spectroradiometer (MODIS) sensor on board the Earth-observing Aqua satellite to approximate ice in (the onset of ice cover) and ice out from training datasets of 13 and 58 Maine lakes, respectively, during the 2002/2003 through 2017/2018 ice seasons. Ice in was signaled by reaching a threshold of cumulative negative degrees following the first day of the season below 0°C. Ice out was signaled by reaching a threshold of cumulative positive degrees following the first day of the year above 0°C. The comparison of observed and remotely sensed ice-in dates showed relative agreement with a correlation coefficient of 0.71 and a mean absolute error (MAE) of 9.8 days. Ice-out approximations had a correlation coefficient of 0.67 and an MAE of 8.8 days. Lakes smaller in surface area and nearer the Atlantic coast had the greatest error in approximation. Application of the CSM to 20 additional lakes in Maine produced a comparable ice-out MAE of 8.9 days. Ice-out model performance was weaker for the warmest years; there was a larger MAE of 12.0 days when the model was applied to the years 2019–2023 for the original 58 lakes. The development of this model, which utilizes daily satellite data, demonstrates the promise of remote sensing for quantifying ice phenology over short, temporal scales, and wider geographic regions than can be observed in situ, and allows exploration of the influence of surface temperature patterns on the process and timing of ice in and ice out.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2025

Backpropagation-based learning with local derivative approximation and memory replay in biologically plausible neural systems

When learning, the brain modifies individual synaptic connections to reach a desired behavior. Animal and human brains have been shown to be incredibly capable of learning complex and varied functions across a wide variety of tasks. In recent years, artificial neural networks, inspired by human and animal brains, have shown great capabilities in learning a wide variety of difficult tasks. However, artificial neural networks primarily teach themselves through the use of backpropagation, a learning method which has no clear analogue within the brain. Additionally, Artificial Neural Networks primarily use continuous activation functions, which differ significantly from the spiking neuronal behavior present in the brain. In this paper, we discuss and demonstrate a biologically plausible learning method that approximates backpropagation through two techniques on Spiking Neural Networks. First, we show that the local temporal derivatives that are necessary for backpropagation can be approximately recovered through reconstruction using spike timings. Second, we show that through learning during a sleep phase, inspired by neuroscience research into memory replay, the localized parallel feedback path can learn to approximate the derivative through the forward path weight matrix, thus solving the weight transport problem. Lastly, we demonstrate that the combination of these two methods can approach or exceed the accuracy of backpropagation-based methods for a variety of neuromorphic vision tasks while maintaining biological plausibility.

42 ENGINEERING↗
DOE OSTI2024

A windowed mean trajectory approximation for condensed phase dynamics

We propose a trajectory-based quasi-classical method for approximating dynamics in condensed phase systems. Building upon the previously developed optimized mean trajectory approximation that has been used to compute linear and nonlinear spectra, we borrow some ideas from filtering trajectory methods to obtain a novel semiclassical method for the dynamical propagation of density matrices. This new approximation is tested rigorously against standard multistate electronic models, spin-boson models, and models of the Fenna–Matthews–Olson complex. For dissipative systems, the current method is significantly better or as good as many other semiclassical methods available, especially at low temperatures and for off-diagonal density matrix elements, whereas for scattering models, the current method bears similar limitations as mean-field propagation schemes. All results are tested against the numerically exact hierarchical equations of motion method. In conclusion, the new method shows excellent agreement across various parameter regimes with numerically exact results, highlighting the robustness and accuracy of our approach.

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

An analytic approximation to the covariance between pre- and post-reconstruction galaxy two-point statistics

We present a simple analytic approximation for the covariance between pre-reconstruction galaxy power spectrum measurements and post-reconstruction two-point correlation functions. This cross-covariance is essential for joint analyses that combine full-shape clustering information with baryon acoustic oscillation (BAO) measurements, as commonly performed in modern spectroscopic surveys. Our model builds on the disconnected contribution to the covariance and accounts for the damping of correlations due to the BAO reconstruction process. We validate our analytic prescription against numerical simulations from the Dark Energy Spectroscopic Instrument (DESI), testing both idealized cubic geometries and realistic survey configurations including complex footprints and fiber assignment effects. Despite neglecting survey window functions in the analytic calculation, we find excellent agreement with simulation-based covariances and demonstrate that cosmological parameter constraints are virtually unchanged when using our approximation. Our results show that the pre-post cross-covariance is sufficiently small that even approximate treatments are adequate for cosmological inference, opening a pathway toward fully analytic covariance matrices for next-generation galaxy surveys.

baryon acoustic oscillations↗
DOE OSTI2025

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Extended Galerkin Neural Network Approximation of Singular Variational Problems with Error Control

We present extended Galerkin neural networks, a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory guiding the construction of new weighted least squares variational formulations suitable for use in neural network approximation of general BVPs, and (2) an “extended” feedforward network architecture which incorporates and is even capable of learning singular solution structures, thus greatly improving approximability of singular solutions. Furthermore, numerical results are presented for several problems, including steady Stokes flow around reentrant corners and in convex corners with Moffatt eddies in order to demonstrate efficacy of the method.

a posteriori error estimate↗
DOE OSTI2025

Exploring Data Set Bias and Decision Support with Predictive Uncertainty Through Bayesian Approximations and Convolutional Neural Networks

Individual seismic catalogs can contain multiscale observations from fault level to global scales and associated waveforms from discrete events reflect crustal structure across many different scales and locations. Seismic network aperture, geographic location, and observation distance may not provide informative guidance or intuition on how different catalogs will behave across models trained under different conditions. We rely on uncertainty to provide guardrails for when to trust model decisions, but understanding when our uncertainty is trustworthy is an open challenge. Here, in this work, we explore Bayesian approximation methods for assigning predictive uncertainty in seismic event classification problems. We find that computationally expensive Bayesian approximations do not outperform simple ensemble methods. We also find that when exploiting multiple seismic event catalogs, joint training with data from all the catalogs combined with Bayesian approximations and supervised training for classification can obscure bias and result in less robust uncertainty while also not providing substantial performance benefits compared to training individual models for each catalog.

58 GEOSCIENCES↗
DOE OSTI2026

Local Spin Density Approximation Strongly Improved by a Better-Informed Local Scaling of Its Self-Interaction Correction

The Perdew−Zunger self-interaction correction (PZSIC) makes density functional approximations (DFAs) exact for all one-electron densities. However, it overcorrects in manyelectron regions, introducing errors for the uniform-density limit, where uncorrected DFAs are exact. The locally scaled PZSIC (LSIC), based on the iso-orbital indicator zσ [which distinguishes single-orbital and slowly varying density regions and is used with the local spin density approximation (LSDA)], restores the uniform-density limit and significantly improves results for many properties, including chemical reaction barrier heights, atomization energies, and ionization potentials. Yet, LSIC performs poorly for weakly bonded systems, leaving many unbound, due to limitations of its iso-orbital indicator. To correct this, in this work we propose a new local scaling, LSIC-α, based on the iso-orbital indicator ασ (which additionally identifies regions of overlapping density tails). A two-parameter scaling function of ασ is fitted to a subset of the nonbonded appropriate norms for the SCAN and r2SCAN meta- GGAs, and tested on many properties of main-group atoms, molecules, and molecular complexes. LSIC-α greatly improves the interaction energies of weakly bonded systems in the S22 data set while retaining LSIC’s accuracy for other properties. This work shows that the errors of LSDA (and presumably of higher-level DFAs) can be largely but not entirely repaired by a proper “do no harm” self-interaction correction.

Approximation↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2026

Effective medium approximation for the refractive index of stratified metal oxide composites synthesized by atomic layer deposition

Atomic layer deposition (ALD) is a unique method for synthesizing conformal layers with precise composition. It is especially useful for the synthesis of mixed metal oxides for functional materials. One application of interest is the use of ALD for tailoring the refractive index of coatings. In homogeneously distributed composites of metal oxides, the refractive properties can be approximated as the average of the indices of the components. This is known as an effective medium approximation (EMA) and can be used to design the macroscopic properties of composites. ALD produces layered, anisotropic films, so the validity of an EMA in describing these films is not clear. Here, we use optical simulations and experimental characterization of stratified composites of TiO 2 and Al 2 O 3 to study the application of an EMA to the transmission and reflection behavior of ALD-prepared mixed metal oxide thin films. We found that when the characteristic layer thickness is smaller than roughly 10 nm, the optical spectra of theoretical and experimental ALD films match the equivalent theoretical spectra for a material with a refractive index calculated from a simple, compositionally weighted EMA. Hence, this EMA could describe the transmission and reflectance spectra in ALD-derived TiO2–Al 2 O 3 nanolaminates when the films were sufficiently stratified even without thorough characterization of the real layers in the films. As a result, we demonstrated that ALD can be used to prepare effectively homogenous mixed metal oxide films with a predictable, tailorable refractive index of any value between those of the TiO 2 and Al 2 O 3 component materials.

42 ENGINEERING↗
DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗
DOE OSTI2025

Leptodermic corrections to the TOV equations and nuclear astrophysics within the effective surface approximation

The macroscopic model for a neutron star (NS) as a liquid drop at the equilibrium is used to extend the Tolman-Oppenheimer-Volkoff (TOV) equations taking into account the gradient terms responsible for the system surface. The parameters of the Schwarzschild metric in the spherical case are found with these surface corrections to the known leading (zero) order of the leptodermic approximation a/R << 1, where a is the NS effective-surface (ES) thickness, and R is the effective NS radius. The energy density $\mathscr{E}$ is considered in a general form including the functions of the particle number density and of its gradient terms. The macroscopic gravitational component $Φ$(ρ) of the energy density is taken into account in the simplest form as expansion in powers of $ρ$ – $\overline{ρ}$, where $\overline{ρ}$ is the saturation density, up to second order, in terms of its contributions to the separation particle energy and incompressibility. Density distributions ρ across the NS ES in the normal direction to the ES, which are derived in the simple analytical form at the same leading approximation, was used for the derivation of the modified TOV (MTOV) equations by accounting for their NS surface corrections. As a result, the MTOV equations are analytically solved at first order and the results are compared with the standard TOV approach of the zero order.

Magner, A. G. [Institute for Nuclear Research, Kyi↗