SEARCH · Engineering Papers

Results for “APPROXIMATIONS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

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↗

NASA NTRS2001

The 'Brick Wall' radio loss approximation and the performance of strong channel codes for deep space applications at high data rates

In order to evaluate performance of strong channel codes in presence of imperfect carrier phase tracking for residual carrier BPSK modulation in this paper an approximate 'brick wall' model is developed which is independent of the channel code type for high data rates. It is shown that this approximation is reasonably accurate (less than 0.7dB for low FERs for (1784,1/6) code and less than 0.35dB for low FERs for (5920,1/6) code). Based on the approximation's accuracy, it is concluded that the effects of imperfect carrier tracking are more or less independent of the channel code type for strong channel codes. Therefore, the advantage that one strong channel code has over another with perfect carrier tracking translates to nearly the same advantage under imperfect carrier tracking conditions. This will allow the link designers to incorporate projected channel code performance of strong channel codes into their design tables without worrying about their behavior in the face of imperfect carrier phase tracking.

turbo codes↗

NASA NTRS2016

Optics of Water Microdroplets with Soot Inclusions: Exact Versus Approximate Results

We use the recently generalized version of the multi-sphere superposition T-matrix method (STMM) to compute the scattering and absorption properties of microscopic water droplets contaminated by black carbon. The soot material is assumed to be randomly distributed throughout the droplet interior in the form of numerous small spherical inclusions. Our numerically-exact STMM results are compared with approximate ones obtained using the Maxwell-Garnett effective-medium approximation (MGA) and the Monte Carlo ray-tracing approximation (MCRTA). We show that the popular MGA can be used to calculate the droplet optical cross sections, single-scattering albedo, and asymmetry parameter provided that the soot inclusions are quasi-uniformly distributed throughout the droplet interior, but can fail in computations of the elements of the scattering matrix depending on the volume fraction of soot inclusions. The integral radiative characteristics computed with the MCRTA can deviate more significantly from their exact STMM counterparts, while accurate MCRTA computations of the phase function require droplet size parameters substantially exceeding 60.

cloud droplets↗

NASA NTRS2022

Alternative regularizations for Outer-Approximation algorithms for convex MINLP

In this work, we extend the regularization framework from Kronqvist et al. (Math Program 180(1):285–310, 2020) by incorporating several new regularization functions and develop a regularized single-tree search method for solving convex mixed-integer nonlinear programming (MINLP) problems. We propose a set of regularization functions based on distance metrics and Lagrangean approximations, used in the projection problem for finding new integer combinations to be used within the Outer-Approximation (OA) method. The new approach, called Regularized Outer-Approximation (ROA), has been implemented as part of the open-source Mixed-integer nonlinear decomposition toolbox for Pyomo—MindtPy. We compare the OA method with seven regularization function alternatives for ROA. Moreover, we extend the LP/NLP Branch and Bound method proposed by Quesada and Grossmann (Comput Chem Eng 16(10–11):937–947, 1992) to include regularization in an algorithm denoted RLP/NLP. We provide convergence guarantees for both ROA and RLP/NLP. Finally, we perform an extensive computational experiment considering all convex MINLP problems in the benchmark library MINLPLib. The computational results show clear advantages of using regularization combined with the OA method.

Convex Mixed-integer nonlinear programming↗

NASA NTRS2024

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗

DOE OSTI2024

Physically interpretable approximations of many-body spectral functions

The rational function approximation provides a natural and interpretable representation of response functions such as the many-body spectral functions. We apply the vector fitting (VFIT) algorithm to fit a variety of spectral functions calculated from the Holstein model of electron-phonon interactions. We show that the resulting rational functions are highly efficient in their fitting of sharp features in the spectral functions, and could provide a means to infer physically relevant information from a spectral data set. The position of the peaks in the approximated spectral function are determined by the location of poles in the complex plane. Additionally, we developed a variant of VFIT that incorporates regularization to improve the quality of fits. With this procedure, we demonstrate it is possible to achieve accurate spectral function fits that vary smoothly as a function of physical conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2021

The Rankine-Kirchhoff approximations for moist thermodynamics

The Rankine-Kirchhoff equation for the saturation vapor pressure has been derived independently many times, sometimes with the presumption of novelty. As a result, the equation is referred to in the literature by a bewildering number of different names and, often, by no name at all. In this work, the history of the Rankine-Kirchhoff equation is reviewed. The three approximations used to derive it (ideal gas, constant heat capacities, and zero-volume condensates) can be used to derive a whole system of accurate and analytic expressions of relevance to the atmosphere. Consequently, it is proposed that this set of approximations be elevated to a named entity, e.g., the Rankine-Kirchhoff approximations.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2021

Approximate Bacon-Shor code and holography

We explicitly construct a class of holographic quantum error correction codes with non-trivial centers in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by “skewing” the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can “back-react” on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest from the point of view of the “entanglement wedge” and bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the “large N limit” where they are built by concatenating a large N number of copies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

A natural mechanism for approximate Higgs alignment in the 2HDM

The 2HDM possesses a neutral scalar interaction eigenstate whose tree-level properties coincide with the Standard Model (SM) Higgs boson. In light of the LHC Higgs data which suggests that the observed Higgs boson is SM-like, it follows that the mixing of the SM Higgs interaction eigenstate with the other neutral scalar interaction eigenstates of the 2HDM should be suppressed, corresponding to the so-called Higgs alignment limit. The exact Higgs alignment limit can arise naturally due to a global symmetry of the scalar potential. If this symmetry is softly broken, then the Higgs alignment limit becomes approximate (although still potentially consistent with the current LHC Higgs data). In this paper, we obtain the approximate Higgs alignment suggested by the LHC Higgs data as a consequence of a softly broken global symmetry of the Higgs Lagrangian. However, this can only be accomplished if the Yukawa sector of the theory is extended. We propose an extended 2HDM with vector-like top quark partners, where explicit mass terms in the top sector provide the source of the soft symmetry breaking of a generalized CP symmetry. In this way, we can realize approximate Higgs alignment without a significant fine-tuning of the model parameters. We then explore the implications of the current LHC bounds on vector-like top quark partners for the success of our proposed scenario.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 OSTI2023

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

In this report, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ exploits a cheaper Voronoi cell computation. Our design leverages asynchronous processing and message prioritization to accelerate convergence of distance computations, and harnesses vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance using real-world graphs with up to 128 billion edges and 512 compute nodes, and show the ability to find Steiner trees with up to one million seed vertices. Using 12 data instances, we present comparison with the state-of-the-art exact solver, SCIP-Jack, and two sequential 2-approximate algorithms. We empirically show that, on average, the total distance of the Steiner tree identified by our solution is 1.1290 times greater than the Steiner minimal tree – well within the theoretical approximation bound of 2.

97 MATHEMATICS AND COMPUTING↗

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 OSTI2023

Non-adiabatic approximations in time-dependent density functional theory: progress and prospects

Time-dependent density functional theory continues to draw a large number of users in a wide range of fields exploring myriad applications involving electronic spectra and dynamics. Although in principle exact, the predictivity of the calculations is limited by the available approximations for the exchange-correlation functional. In particular, it is known that the exact exchange-correlation functional has memory-dependence, but in practise adiabatic approximations are used which ignore this. Here we review the development of non-adiabatic functional approximations, their impact on calculations, and challenges in developing practical and accurate memory-dependent functionals for general purposes.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Relaxation time approximations in PAOFLOW 2.0

Abstract Regardless of its success, the constant relaxation time approximation has limited validity. Temperature and energy dependent effects are important to match experimental trends even in simple situations. We present the implementation of relaxation time approximation models in the calculation of Boltzmann transport in 2.0 and apply those to model band-structures. In addition, using a self-consistent fitting of the model parameters to experimental conductivity data, we provide a flexible tool to extract scattering rates with high accuracy. We illustrate the approximations using simple models and then apply the method to GaAs, Si, $$\hbox {Mg}_3\hbox {Sb}_2$$ Mg 3 Sb 2 , and $$\hbox {CoSb}_3$$ CoSb 3 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Charge transfer rate constants for the carotenoid-porphyrin-C 60 molecular triad dissolved in tetrahydrofuran: The spin-boson model vs the linearized semiclassical approximation

Charge transfer rate constants were calculated for the carotenoid-porphyrin-C 60 (CPC 60 ) molecular triad dissolved in explicit tetrahydrofuran. The calculation was based on mapping the all-atom anharmonic Hamiltonian of this system onto the spin-boson Hamiltonian. The mapping was based on discretizing the spectral density from the time correlation function of the donor–acceptor potential energy gap, as obtained from all-atom molecular dynamics simulations. Different spin-boson Hamiltonians were constructed for each of the possible transitions between the three excited electronic states in two different triad conformations. The rate constants of three possible transitions were calculated via the quantum-mechanically exact Fermi’s golden rule (FGR), as well as a progression of more approximate expressions that lead to the classical Marcus expression. The advantage of the spin-boson approach is that once the mapping is established, the quantum-mechanically exact FGR and the hierarchy of approximations are known in closed form. The classical Marcus charge transfer rate constants obtained with the spin-boson Hamiltonians were found to reproduce those obtained from all-atom simulations with the linearized semiclassical approximation, thereby confirming the equivalence of the two approaches for this system. Furthermore, within the spin-boson Hamiltonian, we also found that the quantum-mechanically exact FGR rate constants were significantly enhanced compared to the classical Marcus theory rate constants for two out of three transitions in one of the two conformations under consideration. The results confirm that mapping to the spin-boson model can yield accurate predictions for charge transfer rate constants in a system as complex as CPC 60 dissolved in tetrahydrofuran.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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 OSTI2020

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗