Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

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 1,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

NCV Flow Diagnostic Test Results

There were two objectives for this test. First, was to assess the reasons why there is approximately 1.5 drag counts (cts) discrepancy between measured and computed drag improvement of the Non-linear Cruise Validation (NCV) over the Technology Concept Airplane (TCA) wing body (WB) configurations. The Navier-Stokes (N-S) pre-test predictions from Boeing Commercial Airplane Group (BCAG) show 4.5 drag cts of improvement for NCV over TCA at a lift coefficient (CL) of 0. I at Mach 2.4. The pre-test predictions from Boeing Phantom Works - Long Beach, BPW-LB, show 3.75 drag cts of improvement. BCAG used OVERFLOW and BPW-LB used CFL3D. The first test entry to validate the improvement was held at the NASA Langley Research Center (LARC) UPV;T, test number 1687. The experimental results showed that the drag improvement was only 2.6 cts, not accounting for laminar run and trip drag. This is approximately 1.5 cts less than predicted computationally. In addition to the low Reynolds Number (RN) test, there was a high RN test in the Boeing Supersonic Wind Tunnel (BSWT) of NCV and TCA. BSV@T test 647 showed that the drag improvement of NCV over TCA was also 2.6 cts, but this did account for laminar run and trip drag. Every effort needed to be done to assess if the improvement measured in LaRC UPWT and BSWT was correct. The second objective, once the first objective was met, was to assess the performance increment of NCV over TCA accounting for the associated laminar run and trip drag corrections in LaRC UPWT. We know that the configurations tested have laminar flow on portions of the wing and have trip drag due to the mechanisms used to force the flow to go from laminar to turbulent aft of the transition location.

Cappuccio, Mina↗
DOE OSTI2023

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Coupling Visualization, Simulation, and Deep Learning for Ensemble Steering of Complex Energy Models

We describe a new framework that allows users to explore and steer ensembles of energy systems simulations by coupling multiple energy models and interactive visualization through a dataflow API. Through the visual interface, users can interactively explore complex parameter spaces populated by hundreds, or thousands, of simulation runs and interactively spawn new simulations to 'fill in' regions of interest in the parameter space. The computational and visualization capabilities reside within a general-purpose dataflow architecture for connecting producers of multidimensional timeseries data, such as energy simulations, with consumers of that data, whether they be visualizations, statistical analyses, or datastores. Fast computation and agile dataflow can enhance the engagement with energy simulations, allowing users to populate the parameter space in real time. However, many energy simulations are far too slow to provide an interactive response. To support interactive feedback, we are creating reduced-form simulations developed through machine learning techniques, which provide statistically sound estimates of the results of the full simulations at a fraction of the computational cost. These reduced-form simulations have response times on the order of seconds, suitable for real-time human-in-the-loop design and analysis. The approximation methods apply to a wide range of computational models, including supply-chain models, electric power grid simulations, and building models. Such reduced-form representations do not replace or re-implement existing simulations, but instead supplement them by enabling rapid scenario design and exploration for large ensembles of simulations. The improved understanding, facilitated by the reduced-form models, dataflow API, and visualization tools, allows researchers to better allocate computational resources to capture informative relationships within the system as well as provide a low-cost method for validating and quality-checking large-scale modeling efforts.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
DOE OSTI2022

Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers

The application of quantum algorithms to the study of many-particle quantum systems requires the ability to prepare wave functions that are relevant in the behavior of the system under study. Hamiltonian symmetries are important instruments used to classify relevant many-particle wave functions and to improve the efficiency of numerical simulations. In this work, quantum circuits for the exact and approximate preparation of total spin eigenfunctions on quantum computers are presented. Two different strategies are discussed and compared: exact recursive construction of total spin eigenfunctions based on the addition theorem of angular momentum, and heuristic approximation of total spin eigenfunctions based on the variational optimization of a suitable cost function. The construction of these quantum circuits is illustrated in detail, and the preparation of total spin eigenfunctions is demonstrated on IBM quantum devices, focusing on three- and five-spin systems on graphs with triangle connectivity.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1998

Neural Network and Regression Approximations in High Speed Civil Transport Aircraft Design Optimization

Nonlinear mathematical-programming-based design optimization can be an elegant method. However, the calculations required to generate the merit function, constraints, and their gradients, which are frequently required, can make the process computational intensive. The computational burden can be greatly reduced by using approximating analyzers derived from an original analyzer utilizing neural networks and linear regression methods. The experience gained from using both of these approximation methods in the design optimization of a high speed civil transport aircraft is the subject of this paper. The Langley Research Center's Flight Optimization System was selected for the aircraft analysis. This software was exercised to generate a set of training data with which a neural network and a regression method were trained, thereby producing the two approximating analyzers. The derived analyzers were coupled to the Lewis Research Center's CometBoards test bed to provide the optimization capability. With the combined software, both approximation methods were examined for use in aircraft design optimization, and both performed satisfactorily. The CPU time for solution of the problem, which had been measured in hours, was reduced to minutes with the neural network approximation and to seconds with the regression method. Instability encountered in the aircraft analysis software at certain design points was also eliminated. On the other hand, there were costs and difficulties associated with training the approximating analyzers. The CPU time required to generate the input-output pairs and to train the approximating analyzers was seven times that required for solution of the problem.

Patniak, Surya N.↗
NASA NTRS1974

An approximate inviscid radiating flow-field analysis for sphere-cone Venusian entry vehicles

A computational method based on the earlier work of one of the authors has been improved and modified to provide an accurate and rapid prediction of the radiating flow about blunt conical probes entering the atmosphere of Venus. Special features include a more general approximate equation of state, a more rapidly converging iteration scheme, a 38-step absorption coefficient model for a Venus atmosphere gas mixture model, and a shock-shape formula which yields a computed body shape in excellent agreement with the desired body. The method was used to calculate distributions of radiative heating for a large spherically blunted conical probe vehicle (1.219 m base diameter) and for three small spherically blunted conical probe vehicles (0.724 m base diameter). Solutions obtained with the presently developed approximate method required short computing times of the order of 1 to 3 minutes for each complete solution and gave agreements of 10% to 15% with the more exact predictions.

Falanga, R. A.↗
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 OSTI2023

The Good, the Bad, and the Ugly: Pseudopotential Inconsistency Errors in Molecular Applications of Density Functional Theory

The pseudopotential (PP) approximation is one of the most common techniques in computational chemistry. Despite its long history, the development of custom PPs has not tracked with the explosion of different density functional approximations (DFAs). As a result, the use of PPs with exchange/correlation models for which they were not developed is widespread, although this practice is known to be theoretically unsound. The extent of PP inconsistency errors (PPIEs) associated with this practice has not been systematically explored across the types of energy differences commonly evaluated in chemical applications. Here, we evaluate PPIEs for a number of PPs and DFAs across 196 chemically relevant systems of both transition-metal and main-group elements, as represented by the W4-11, TMC34, and S22 data sets. Near the complete basis set limit, these PPs are found to cleanly approach all-electron (AE) results for noncovalent interactions but introduce root-mean-squared errors (RMSEs) upwards of 15 kcal mol –1 into predictions of covalent bond energies for a number of popular DFAs. We achieve significant improvements through the use of empirical atom- and DFA-specific PP corrections, indicating considerable systematicity of the PPIEs. The results of this work have implications for chemical modeling in both molecular contexts and for DFA design, which we discuss.

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

Rates of adsorption and desorption: Entropic contributions and errors due to mean-field approximations

We have performed exact classical rate calculations to compute adsorption and desorption rate constants with a model representative of a real system. We compute the desorption rate using transition-state theory by taking the dividing-surface far from the surface of the solid. We find that using a mean-field assumption, i.e., applying potential of mean force to transition state theory, could lead to two orders-of-magnitude errors in the rate constant owing to large fluctuations in the desorption barrier. Furthermore, we compute the adsorption rate by including a dynamical factor which reflects the probability of sticking to the solid surface. We find that the sticking probability is highly sensitive to the coverage. Also, we find that the adsorption rate computed from the mean-field assumption is not very different from the exact adsorption rate. We also compute entropic contribution to desorption rates and compare it to that obtained from two limiting models of adsorption—2D ideal gas and 2D ideal lattice gas. We show that at high temperatures (700 K), the entropic contribution to desorption rates computed from the exact calculations is very close to that obtained from the 2D ideal gas model. However, for lower to intermediate temperatures from 200 K to 500 K, the entropic contributions cover a wide range which lies in between the two limiting models and could lead to over two-orders-of-magnitude errors in the rate coefficient.

Activation energies↗
DOE OSTI2022

Initial study on cross-section generation requirements for a PBR equilibrium core

A Serpent model of the equilibrium core HTR-PM small modular nuclear reactor in China, was developed for use in cross-section preparation studies in order to guide methods development for the Griffin reactor multiphysics application. The model includes detailed isotopics for 10 distinct pebble burnup groups in 126 core zones with unique fuel and moderator temperatures obtained from a coupled neutronics-thermal-fluids equilibrium core calculation using Griffin-Pronghorn. A sensitivity study of the fuel and moderator temperatures for various core regions was performed with the MOOSE stochastic tools. The results show that the uncertainties are, not unexpectedly, dominated by the value of the fluid temperature and that the power level, heat transfer coefficient and effective conduction to neighboring pebbles and fluid constitute, at best, second order effects. The temperature uncertainty range varies from 28 K to 57 K between the core entry and exit planes, respectively, but these values are probably higher. We still have to quantify the significance of these uncertainties in the preparation of cross-sections in future work. In addition, we verified that the effective pebble approximation used in the PEBBED and V.S.O.P. computer codes works well for the preparation of region averaged cross-sections. Nevertheless, there are some discrepancies in the cross-sections when compared to the multi-pebble model, which could affect the prediction of peak values and the depletion calculation. We conclude that is highly desirable for future studies with Griffin to be able to handle both the 'effective' pebble approximation and the multi-pebble approach for various pebble burnup groups. This enables Griffin users with the flexibility to perform higher-fidelity studies. Finally, we initiated the preparation of cross-sections for various core regions from the full core Serpent reference model. We quantified the differences in 26 group cross-sections from infinite domain models versus the full core approach. These reference cross-sections will serve to verify the double heterogeneity, self-shielding, and spectrum-correction methods in Griffin. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Incorporating the effects of objects in an approximate model of light transport in scattering media

A computationally efficient radiative transport model is presented that predicts a camera measurement and accounts for the light reflected and blocked by an object in a scattering medium. The model is in good agreement with experimental data acquired at the Sandia National Laboratory Fog Chamber Facility (SNLFC). The model is applicable in computational imaging to detect, localize, and image objects hidden in scattering media. Here, a statistical approach was implemented to study object detection limits in fog.

42 ENGINEERING↗
NASA NTRS1983

Numerical computations on one-dimensional inverse scattering problems

An approximate method to determine the index of refraction of a dielectric obstacle is presented. For simplicity one dimensional models of electromagnetic scattering are treated. The governing equations yield a second order boundary value problem, in which the index of refraction appears as a functional parameter. The availability of reflection coefficients yield two additional boundary conditions. The index of refraction by a k-th order spline which can be written as a linear combination of B-splines is approximated. For N distinct reflection coefficients, the resulting N boundary value problems yield a system of N nonlinear equations in N unknowns which are the coefficients of the B-splines.

Dunn, M. H.↗
NASA NTRS1983

Computational methods for estimation of parameters in hyperbolic systems

Approximation techniques for estimating spatially varying coefficients and unknown boundary parameters in second order hyperbolic systems are discussed. Methods for state approximation (cubic splines, tau-Legendre) and approximation of function space parameters (interpolatory splines) are outlined and numerical findings for use of the resulting schemes in model "one dimensional seismic inversion' problems are summarized.

Banks, H. T.↗
NASA NTRS1984

Numerical computations on one-dimensional inverse scattering problems

An approximate method to determine the index of refraction of a dielectric obstacle is presented. For simplicity one dimensional models of electromagnetic scattering are treated. The governing equations yield a second order boundary value problem, in which the index of refraction appears as a functional parameter. The availability of reflection coefficients yield two additional boundary conditions. The index of refraction by a k-th order spline which can be written as a linear combination of B-splines is approximated. For N distinct reflection coefficients, the resulting N boundary value problems yield a system of N nonlinear equations in N unknowns which are the coefficients of the B-splines.

Dunn, M. H.↗
NASA NTRS1987

Steady state computations for wave propagation problems

The behavior of difference approximations of hyperbolic partial differential equations as time t goes to infinity is studied. The rate of convergence to steady state is analyzed theoretically and experimentally for the advection equation and the linearized Euler equations. The choice of difference formulas and boundary conditions strongly influences the rate of convergence in practical steady-state calculations. In particular it is shown that upwind difference methods and characteristic boundary conditions have very attractive convergence properties.

Engquist, Bjorn↗
NASA NTRS1989

Nonlinear filters for efficient shock computation

A new type of methods for the numerical approximation of hyperbolic conservation laws with discontinuous solution is introduced. The methods are based on standard finite difference schemes. The difference solution is processed with a nonlinear conservation form filter at every time level to eliminate spurious oscillations near shocks. It is proved that the filter can control the total variation of the solution and also produce sharp discrete shocks. The method is simpler and faster than many other high resolution schemes for shock calculations. Numerical examples in one and two space dimensions are presented.

Engquist, Bjorn↗