Search NASA⌕ Search

SEARCH · Search NASA

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Tri-Sectional Approximation of the Shortest Path to Long-Term Voltage Stability Boundary with Distributed Energy Resources

Ensuring long-term voltage stability is critical for reliable operations of power grids. High share of distributed energy resources (DERs) can create complicated system operation modes that may invalidate the traditional long-term voltage stability analysis based on typical operation modes. To address this challenge, this paper investigates how to compute the shortest path to the voltage stability boundary in the DER aggregated load space with large dispersion. Instead of working in the Euclidean space, we establish the analysis and computations on the algebraic power flow manifold to better capture the curvature change of the shortest path along the direction of losing stability. A modified optimal control framework is presented for obtaining the ground-truth of the smooth shortest path on the manifold. To efficiently and accurately solve for the shortest path, we further leverage the geometric features of the power flow manifold and propose a tri-sectional approximation model that is scalable for large-scale systems. Several numerical examples, up to the 1354-bus system, with different DER penetration levels and high dimensional renewable power injection variations are evaluated. The simulation results demonstrate that the tri-sectional approximation achieves high accuracy and efficiency to approximate the shortest path to the voltage stability boundary.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite number of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

SFU-Driven Transparent Approximation Acceleration on GPUs

Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for substantial performance boost or power reduction, is one of the most promising solutions to enable power control and performance scaling towards exascale. Although most existing approximation designs target the emerging data-intensive applications that are comparatively more error-tolerable, there is still high demand for the acceleration of traditional scientific applications (e.g., weather and nuclear simulation), which often comprise intensive transcendental function calls and are very sensitive to accuracy loss. To address this challenge, we focus on a very important but often ignored approximation unit on GPUs.

Approximate computing↗
DOE OSTI2019

Approximate Scheduling of DERs with Discrete Complex Injections

Rapid penetration of renewable energy based Distributed Energy Resources (DER) has the potential to exacerbate the challenges inherent in grid frequency and voltage regulation. However, their real time controllability can be leveraged to not only mitigate such challenges, but improve the economics and quality of grid operations. A plethora of DER scheduling algorithms have been developed for fast and efficient scheduling of these resources. These algorithms schedule the complex - real and reactive power injected into (or drawn from) the grid by the DERs under various cost objective functions and grid constraints. However, a vast majority of such algorithms assume the feasible range of power injections to be continuous. In reality, the control options available for several DERs form a discrete space. This implies that the feasible range of power injections also forms a discrete space. This makes DER scheduling an NP-hard problem. Integer/Mixed Integer program based algorithms, which guarantee optimality in the objective value, have been developed. But these are prohibitively expensive in terms of computational time requirements. On the other hand, fast heuristic based solutions have also been developed. But as they do not provide any guarantee on the optimality of the objective, or on satisfying the constraints, they are unreliable for grid operations. Recent works have developed approximation algorithms which offer the best of both the approaches above: (near) optimality and low computational complexity, both of which are governed by a user defined accuracy parameter ϵ. In this work, we significantly improve upon such existing works by developing an approximation algorithm which schedules DERs with complex injections (as opposed to only real injection) and whose runtime is polynomial (as opposed to exponential) in 1/ϵ. We provide theoretical analysis and support them with experimental results to validate the guarantees provided by our approximation algorithm.

14 SOLAR ENERGY↗
DOE OSTI2022

Universal approximation of symmetric and anti-symmetric functions

In this work, we consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with explicit bounds on the number of parameters with respect to the dimension and the target accuracy ϵ. While the approximation still suffers from the curse of dimensionality, to the best of our knowledge, these are the first results in the literature with explicit error bounds for functions with symmetry or anti-symmetry constraints

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations

In this study, we present a data-driven approach for approximating entropy-based closures of moment systems from kinetic equations. The proposed closure learns the entropy function by fitting the map between the moments and the entropy of the moment system, and thus does not depend on the spacetime discretization of the moment system or specific problem configurations such as initial and boundary conditions. With convex and C 2 approximations, this data-driven closure inherits several structural properties from entropy-based closures, such as entropy dissipation, hyperbolicity, and H-Theorem. We construct convex approximations to the Maxwell–Boltzmann entropy using convex splines and neural networks, test them on the plane source benchmark problem for linear transport in slab geometry, and compare the results to the standard, entropy-based systems which solve a convex optimization problem to find the closure. Numerical results indicate that these data-driven closures provide accurate solutions in much less computation time than that required by the optimization routine.

97 MATHEMATICS AND COMPUTING↗
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

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 OSTI2018

Energy release rate approximation for edge cracks using higher-order topological derivatives

Topological derivatives provide the variation of a functional when an infinitesimal hole is introduced into the domain. In Silva et al. (J Mech Phys Solids 59(5):925–939, 2011), the authors developed a first-order approximation of the energy release rate associated with a small crack at any boundary location and at any orientation using a first-order topological derivative. This approach offers significant computational advantages over other methods because (i) it requires only a single analysis while other methods require an analysis for each crack size-location-direction combination, and (ii) it is performed on the non-cracked domain, removing the need to create very fine meshes in the vicinity of the crack. In the present study, higher-precision approximations of the energy release rate are developed using higher-order topological derivatives which allow the analyst to accurately treat longer cracks and determine the crack lengths for which the first-order approximation is accurate.

42 ENGINEERING↗
DOE OSTI2018

Comparison of AC Losses of YBCO Circular Pancake Coils and Infinitely Long Stack Approximation

High-temperature superconducting (HTS) coils are key parts of many large-scale AC applications, such as transformers, superconducting magnetic energy storage, and motors. The estimation of AC losses of pancake coils is necessary for optimizing the design of HTS devices and cryogenic systems. To speed up the computation of AC losses, the numerical model of an infinitely long HTS stack is often utilized. An HTS stack is a good approximation of the circular coil only if the coil radius is sufficiently large, since AC losses will exhibit a stronger asymmetry along the radial direction for small values of coil radii. To assess the validation of an infinitely long stack approximation, the comparisons of AC losses between infinitely long stacks and circular coils with different radii are presented. The turn number varies from 10 to 80. We find that the AC losses of HTS circular coils will gradually increase to the same value as an infinitely long stack with increasing coil radii. A new parameter is proposed to quantitatively describe the correctness of infinitely long stack approximation. Finally, a method of AC loss estimation of HTS pancake coils is proposed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Sufficient Conditions for the Equivalent Convergence of Sequences of Different Approximants for Two-Dimensional Continued Fractions

By the method of fundamental inequalities, we study the equivalent convergence of two figured approximants for two-dimensional continued fractions, namely, the approximants obtained from the problem of correspondence of two-dimensional continued fractions to some formal double power series and the problem of equivalence of two-dimensional continued fractions. We also establish sufficient conditions under which the indicated two approximants of two-dimensional continued fractions converge to the same limit.

97 MATHEMATICS AND COMPUTING↗