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

Visualization of Multi-Fidelity Approximations of Stochastic Economic Dispatch

As renewable energy generation deployment increases, the operation of electrical grids becomes more complex. Economic dispatch is part of a grid operator's regular decision process where the amount of energy to generate is determined based on the number of available generators and the actual level of energy demand. Renewable generators are inherently stochastic due to the chaotic nature of weather patterns, and thus, real-time decisions of economic dispatch become increasingly complex. Modeling efforts to assist in these decisions in the highest fidelity typically take hours to days to solve on leadership-class computers; too long for the 5-minute operational time-frame demanded of operators. Alternatively, multi-fidelity approximations can be used to predict generation levels quickly and with sufficient accuracy to be used for real-time operations. We have developed a visualization tool to demonstrate the utility of multi-fidelity approximations by displaying contextual results of economic dispatch approximations, comparisons across fidelity levels of generation levels and possible failures to meet demand, and meta-data on the modeling setup.

interactive visualization↗
DOE OSTI2023

Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut

Finding high-quality parameters is a central obstacle to using the quantum approximate optimization algorithm (QAOA). Previous work partially addresses this issue for QAOA on unweighted MaxCut problems by leveraging similarities in the objective landscape among different problem instances. However, we show that the more general weighted MaxCut problem has significantly modified objective landscapes, with a proliferation of poor local optima. Our main contribution is a simple rescaling scheme that overcomes these deleterious effects of weights. Here we show that for a given QAOA depth, a single “typical” vector of QAOA parameters can be successfully transferred to weighted MaxCut instances. This transfer leads to a median decrease in the approximation ratio of only 2.0 percentage points relative to a considerably more expensive direct optimization on a dataset of 34,701 instances with up to 20 nodes and multiple weight distributions. This decrease can be reduced to 1.2 percentage points at the cost of only 10 additional QAOA circuit evaluations with parameters sampled from a pretrained metadistribution, or the transferred parameters can be used as a starting point for a single local optimization run to obtain approximation ratios equivalent to those achieved by exhaustive optimization in 96.35% of our cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Analysis of the Conformally Flat Approximation for Binary Neutron Star Initial Conditions

The spatially conformally flat approximation (CFA) is a viable method to deduce initial conditions for the subsequent evolution of binary neutron stars employing the full Einstein equations. Here in this paper, we analyze the viability of the CFA for the general relativistic hydrodynamic initial conditions of binary neutron stars. We illustrate the stability of the conformally flat condition on the hydrodynamics by numerically evolving ~100 quasicircular orbits. We illustrate the use of this approximation for orbiting neutron stars in the quasicircular orbit approximation to demonstrate the equation of state dependence of these initial conditions and how they might affect the emergent gravitational wave frequency as the stars approach the innermost stable circular orbit.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Non-intrusive nonlinear model reduction via machine learning approximations to low-dimensional operators

Abstract Although projection-based reduced-order models (ROMs) for parameterized nonlinear dynamical systems have demonstrated exciting results across a range of applications, their broad adoption has been limited by their intrusivity: implementing such a reduced-order model typically requires significant modifications to the underlying simulation code. To address this, we propose a method that enables traditionally intrusive reduced-order models to be accurately approximated in a non-intrusive manner. Specifically, the approach approximates the low-dimensional operators associated with projection-based reduced-order models (ROMs) using modern machine-learning regression techniques. The only requirement of the simulation code is the ability to export the velocity given the state and parameters; this functionality is used to train the approximated low-dimensional operators. In addition to enabling nonintrusivity, we demonstrate that the approach also leads to very low computational complexity, achieving up to $$10^3{\times }$$ 10 3 × in run time. We demonstrate the effectiveness of the proposed technique on two types of PDEs. The domain of applications include both parabolic and hyperbolic PDEs, regardless of the dimension of full-order models (FOMs).

42 ENGINEERING↗
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 OSTI2016

A separate phase drag model and a surrogate approximation for simulation of the steam assisted gravity drainage (SAGD) process

General ensemble phase averaged equations for multiphase flows have been specialized for the simulation of the steam assisted gravity drainage (SAGD) process. In the average momentum equation, fluid-solid and fluid-fluid viscous interactions are represented by separate force terms. This equation has a form similar to that of Darcy’s law for multiphase flow but augmented by the fluid-fluid viscous forces. Models for these fluid-fluid interactions are suggested and implemented into the numerical code CartaBlanca. Numerical results indicate that the model captures the main features of the multiphase flow in the SAGD process, but the detailed features, such as plumes are missed. We find that viscous coupling among the fluid phases is important. Advection time scales for the different fluids differ by several orders of magnitude because of vast viscosity differences. Numerically resolving all of these time scales is time consuming. To address this problem, we introduce a steam surrogate approximation to increase the steam advection time scale, while keeping the mass and energy fluxes well approximated. This approximation leads to about a 40-fold speed-up in execution speed of the numerical calculations at the cost of a few percent error in the relevant quantities.

02 PETROLEUM↗
DOE OSTI2020

Adding Magnetization to the Eddy Current Approximation of Maxwell's Equations

The eddy current approximation to Maxwell's equation often omits terms associated with magnetization, removing permanent magnets from the domain of validity of the approximation. We show that adding these terms back into the eddy current approximation is relatively straightforward, and demonstrate this on using a simple material constitutive model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Raytracing Project: Graybody Approximation [Slides]

Graybody approximation is first step to infrared raytracing code. Graybody approximation can capture temperature, but obviously cannot be used for gas species characterization. Graybody approximation will be used for comparisons to experimental data that is integrated across wavenumber.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Analysis of Approximations in Modeling of BWR Bundle Void Distributions

In boiling water reactors, complex heterogeneous bundle designs, control blades adjacent to the corner of bundles, and the presence of boiling can lead to complex internal void distributions. A few approximations exist to model these void distributions. They could be modeled using a 1D axial solver in which each axial node is assumed to be at an average void, or each pin cell could be modeled with its own void concentration. In the latter case, the void could be discretized in pin-centered or coolant-centered channels. The goal of this project was to quantify the effect of using the different approximations for modeling internal void distributions on neutronics calculations. Using 3D void distributions calculated with CTF, Monte Carlo Neutral Particle (MCNP) transport code models were created for GE-9 and GE-14 lattices. For each model, the internal void distribution from CTF at a given axial node was selected, and a lattice calculation was carried out with MCNP. Comparisons between models using a lattice-averaged void, or using a void distribution in coolant-centered channels, showed large differences in reactivity which in some cases were well above 1,000 pcm, and it also showed differences in normalized fission rates greater than 20%. It was also found that using a lattice average void can lead to a significant difference in the estimation of the worth of a control blade. The differences found when comparing results from models using pin-centered and coolant-centered channels were up to 200 pcm in reactivity and up to 1.4% in the normalized fission rates. In addition to these two sets of comparisons, MCNP models were set up so that each subchannel had a saturated liquid component around the fuel pins and a saturated vapor component in the center to approximate annular flow. In comparison to the models using coolant-centered subchannels, up to 1–3% differences in normalized fission rates could be found.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2018

Approximating Photo- z PDFs for Large Surveys

Modern galaxy surveys produce redshift probability density functions (PDFs) in addition to traditional photometric redshift (photo-z) point estimates. However, the storage of photo-z PDFs may present a challenge with increasingly large catalogs, as we face a trade-off between the accuracy of subsequent science measurements and the limitation of finite storage resources. This work presents qp, a Python package for manipulating parameterizations of one-dimensional PDFs, as suitable for photo-z PDF compression. We use qp to investigate the performance of three simple PDF storage formats (quantiles, samples, and step functions) as a function of the number of stored parameters on two realistic mock data sets, representative of upcoming surveys with different data qualities. We propose some best practices for choosing a photo-z PDF approximation scheme and demonstrate the approach on a science case using performance metrics on both ensembles of individual photo-z PDFs and an estimator of the overall redshift distribution function. We show that both the properties of the set of PDFs we wish to approximate and the fidelity metric(s) chosen affect the optimal parameterization. Additionally, we find that quantiles and samples outperform step functions, and we encourage further consideration of these formats for PDF approximation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗
DOE OSTI2023

Systems and methods for approximating musculoskeletal dynamics

An approximation method and system are provided for more quickly controlling a prosthetic or other device by reducing computational processing time in a muscle model that can be used to control the prosthetic. For a given muscle, the approximation method can quickly compute polynomial structures for a muscle length and for each associated moment arms, which may be used to generate a torque for a joint position of a physics model. The physics model, in turn, produces a next joint position and velocity data for driving a prosthetic. The approximation method expands the polynomial structures as long as expansion is possible and sufficiently beneficial. The computations can be performed quickly by expanding the polynomial structures in a way that constrains the muscle length polynomial to the moment arm polynomial structures, and vice versa.

Sobinov, Anton↗
DOE OSTI2023

A localized ensemble of approximate Gaussian processes for fast sequential emulation

More attention has been given to the computational cost associated with the fitting of an emulator. Substantially less attention is given to the computational cost of using that emulator for prediction. This is primarily because the cost of fitting an emulator is usually far greater than that of obtaining a single prediction, and predictions can often be obtained in parallel. In many settings, especially those requiring Markov Chain Monte Carlo, predictions may arrive sequentially and parallelization is not possible. In this case, using an emulator procedure which can produce accurate predictions efficiently can lead to substantial time savings in practice. In this paper, we propose a global model approximate Gaussian process framework via extension of a popular local approximate Gaussian process (laGP) framework. Our proposed emulator can be viewed as a treed Gaussian process where the leaf nodes are laGP models, and the tree structure is learned greedily as a function of the prediction stream. The suggested method (called leapGP) has interpretable tuning parameters which control the time‐memory trade‐off. One reasonable choice of settings leads to an emulator with a training cost and makes predictions rapidly with an asymptotic amortized cost of .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Self‐Consistent Convolutional Density Functional Approximations: Application to Adsorption at Metal Surfaces

The exchange-correlation (XC) functional in density functional theory is used to approximate multi-electron interactions. A plethora of different functionals are available, but nearly all are based on the hierarchy of inputs commonly referred to as “Jacob's ladder.” This paper introduces an approach to construct XC functionals with inputs from convolutions of arbitrary kernels with the electron density, providing a route to move beyond Jacob's ladder. We derive the variational derivative of these functionals, showing consistency with the generalized gradient approximation (GGA), and provide equations for variational derivatives based on multipole features from convolutional kernels. A proof-of-concept functional, PBEq, which generalizes the PBEα framework with mathematical equation being a spatially-resolved function of the monopole of the electron density, is presented and implemented. It allows a single functional to use different GGAs at different spatial points in a system, while obeying PBE constraints. Analysis of the results underlines the importance of error cancellation and the XC potential in data-driven functional design. After testing on small molecules, bulk metals, and surface catalysts, the results indicate that this approach is a promising route to simultaneously optimize multiple properties of interest.

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

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Universality for 1d Random Band Matrices: Sigma-Model Approximation

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233–1260, 2016; Commun Math Phys 351:1009–1044, 2017). We consider random Hermitian block band matrices consisting of W×W random Gaussian blocks (parametrized by j,k∈Λ=[1,n]{sup d}∩ℤ{sup d}) with a fixed entry’s variance J{sub jk}=δ{sub j,k}W{sup −1}+βΔ{sub j,k}W{sup −2}, β>0 in each block. Taking the limit W→∞ with fixed n and β, we derive the sigma-model approximation of the second correlation function similar to Efetov’s one. Then, considering the limit β,n→∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β≫n, is determined by the classical Wigner–Dyson statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Approximate Synthesis of Distributed Optimal Control for Hyperbolic Equations with Rapidly Oscillating Coefficients

We study the problem of finding approximations to the optimal control with respect to a quadratic-type quality criterion in the form of feedback (synthesis) for a linear-quadratic problem in the from of a hyperbolic equation with rapidly oscillating coefficients and distributed control on the right-hand side. On the basis of the exact formula of synthesis, its approximate version (based on the replacement of the rapidly oscillating variables by averaged quantities) is substantiated.

97 MATHEMATICS AND COMPUTING↗