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 415 records · Page 23

Approximation of Failure Probability Using Conditional Sampling

In analyzing systems which depend on uncertain parameters, one technique is to partition the uncertain parameter domain into a failure set and its complement, and judge the quality of the system by estimating the probability of failure. If this is done by a sampling technique such as Monte Carlo and the probability of failure is small, accurate approximation can require so many sample points that the computational expense is prohibitive. Previous work of the authors has shown how to bound the failure event by sets of such simple geometry that their probabilities can be calculated analytically. In this paper, it is shown how to make use of these failure bounding sets and conditional sampling within them to substantially reduce the computational burden of approximating failure probability. It is also shown how the use of these sampling techniques improves the confidence intervals for the failure probability estimate for a given number of sample points and how they reduce the number of sample point analyses needed to achieve a given level of confidence.

Giesy. Daniel P.↗

Study of high speed complex number algorithms

A method of evaluating the radiation integral on the curved surface of a reflecting antenna is presented. A three dimensional Fourier transform approach is used to generate a two dimensional radiation cross-section along a planer cut at any angle phi through the far field pattern. Salient to the method is an algorithm for evaluating a subset of the total three dimensional discrete Fourier transform results. The subset elements are selectively evaluated to yield data along a geometric plane of constant. The algorithm is extremely efficient so that computation of the induced surface currents via the physical optics approximation dominates the computer time required to compute a radiation pattern. Application to paraboloid reflectors with off-focus feeds in presented, but the method is easily extended to offset antenna systems and reflectors of arbitrary shapes. Numerical results were computed for both gain and phase and are compared with other published work.

Heisler, R.↗

A comparison of the reduced and approximate systems for the time dependent computation of the polar wind and multiconstituent stellar winds

The paper derives the 'reduced' system of equations commonly used to describe the time evolution of the polar wind and multiconstituent stellar winds from the equations for a multispecies plasma with known temperature profiles by assuming that the electron thermal speed approaches infinity. The reduced system is proved to have unbounded growth near the sonic point of the protons for many of the standard parameter cases. For the same parameter cases, the unmodified system exhibits growth in some of the Fourier modes, but this growth is bounded. An alternate system (the 'approximate' system) in which the electron thermal speed is slowed down is introduced. The approximate system retains the mathematical behavior of the unmodified system and can be shown to accurately describe the smooth solutions of the unmodified system. Other advantages of the approximate system over the reduced system are discussed.

Browning, G. L.↗

Approximate Simulation of Turbulence

Computed spectra resemble von Karman spectra of frequencies of interest. Numerical technique yields simulated atmospheric-turbulence spectra that closely approximates von Karman spectra within frequency ranges of interest for aircraft response. Suitable for computation in that they represent stable systems and roll off as f-2 at high frequencies outside range of interest.

Campbell, C. W.↗

Application of the ENS3DAE Euler/Navier-Stokes Aeroelastic method

This paper discusses recent applications of the ENS3DAE computational aeroelasticity method. In particular, it describes aeroelastic and unsteady aerodynamics calculations performed on wings with trailing edge control surfaces. These simulations include the investigation of control reversal for a structurally flexible wing with a deflected control surface, and a static and dynamic analysis of a rigid wing with an oscillating control surface. The two sets of calculations were performed independently on different wings using different grid topologies. The control reversal simulation represents an inviscid Euler static aeroelastic analysis of a thin wing with a rectangular planform. The geometry of this wing makes it suitable for computations using more approximate, inviscid aerodynamics methods. Thus, the results of the present Euler computations are compared with numerical data generated by a validated computational aeroelasticity code which uses a simpler aerodynamic formulation. The second illustrated case involves the simulation of a significantly more complex flowfield and the static and dynamic analyses of this geometry were performed using the viscous Navier-Stokes equation option in ENS3DAE. Results of both the steady and unsteady calculations on this wing are compared with existing experimental data.

Schuster, David M.↗

Development and assessment of a reactor system prognosis model with physics-guided machine learning

Autonomous control systems provide recommendations to help operators in decision-making during plant operations ranging from normal operation to accident management. An important step of autonomous control is prognosis. In nuclear engineering domain, prognosis is the process of predicting future conditions of a system or equipment based on present signs and symptoms of a fault. The prognosis model allows predicting future reactor states for possible candidate control strategies so that the outcomes can be evaluated to determine the best control strategy. The prognosis model requires representing direct relationships between the symptoms and the predictions. In nuclear engineering, computational simulations are approximate representations of the operation of the real system. However, prognosis with computational simulations requires high computation power and time due to possible large number of scenarios. Necessary computation resources can be reduced with machine learning (ML) approach for fast predictions by building a surrogate function using the simulation data. A critical issue is, ML models are ignorant of physical knowledge, and these models approximate statistical relationships between the system variables. This ignorance can produce results that are inconsistent with physical laws, even if an optimal result is achieved from a mathematical point of view. Physics-guided machine learning (PGML) is an approach to tackle this issue. Here, this work formulates and illustrates a framework to guide development and assessment of the ML-based prognosis model for autonomous control systems. The development of the prognosis model considers the training of a ML model which consists of optimizing many aspects of the ML approach. The assessment of the prognosis model considers training data limitations and uncertainties of the ML approach. Prognosis models with standalone ML and PGML are developed and assessed on the loss-of-flow scenario of Experimental Breeder Reactor II. The results indicate that PGML based prognosis model has the best performance compared to other prognosis models.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Computational methods for optimal linear-quadratic compensators for infinite dimensional discrete-time systems

An abstract approximation theory and computational methods are developed for the determination of optimal linear-quadratic feedback control, observers and compensators for infinite dimensional discrete-time systems. Particular attention is paid to systems whose open-loop dynamics are described by semigroups of operators on Hilbert spaces. The approach taken is based on the finite dimensional approximation of the infinite dimensional operator Riccati equations which characterize the optimal feedback control and observer gains. Theoretical convergence results are presented and discussed. Numerical results for an example involving a heat equation with boundary control are presented and used to demonstrate the feasibility of the method.

Gibson, J. S.↗

Multi-fidelity Gaussian Process Bandit Optimisation

In many scientific and engineering applications, we are tasked with the maximisation of an expensive to evaluate black box function f. Traditional settings for this problem assume just the availability of this single function. However, in many cases, cheap approximations to f may be obtainable. For example, the expensive real world behaviour of a robot can be approximated by a cheap computer simulation. We can use these approximations to eliminate low function value regions cheaply and use the expensive evaluations of f in a small but promising region and speedily identify the optimum. We formalise this task as a multi-fidelity bandit problem where the target function and its approximations are sampled from a Gaussian process. We develop MF-GP-UCB, a novel method based on upper confidence bound techniques. In our theoretical analysis we demonstrate that it exhibits precisely the above behaviour and achieves better bounds on the regret than strategies which ignore multi-fidelity information. Empirically, MF-GP-UCB outperforms such naive strategies and other multi-fidelity methods on several synthetic and real experiments.

97 MATHEMATICS AND COMPUTING↗

Approximate algorithms for fast optimal attitude computation

Fast accurate algorithms are presented for computing an optimal attitude which minimizes a quadratic loss function. These algorithms compute an optimal rotation which carries a set of reference vectors into a set of corresponding observation vectors. Simplifications of these algorithms are obtained for the case of small rotation angles. Applications to the Magsat mission are discussed.

Shuster, M. D.↗

NLML: A Deep Neural Network Emulator for the Exact Nonlinear Interactions in a Wind Wave Model

Nonlinear wave interactions describe the resonant energy transfer between wave components, playing a fundamental role in the evolution of ocean wave spectra. Nonlinear wave interactions significantly influence wave growth and development, making them essential for accurate wave modeling. However, resolving the full six-dimensional Boltzmann integral of the exact nonlinear wave interactions (Webb-Resio-Tracy method, WRT) is computationally expensive, limiting its application in real-time operational wave forecasting and for research purposes. Current approximations, such as the Discrete Interaction Approximation (DIA), prioritize computational speed over accuracy, resulting in significant errors in wave mean parameters. Here, we introduce NLML, a machine learning (ML) emulator designed to approximate the exact nonlinear wave interactions within WAVEWATCH III (WW3), with the goal of achieving the accuracy of WRT while maintaining the stability and computational speed of DIA. By leveraging GPU capabilities such as half precision inference, we achieved substantial speedups, up to 136x mathematical equation faster than the WRT and only a modest 1.04x mathematical equation slowdown relative to DIA, while achieving 2x mathematical equation the accuracy of DIA in global wave spectral energy and mean wave parameters, with up to 7x mathematical equation higher accuracy in some regions. Unlike previous ML approaches, NLML maintained inherent stability throughout model integration in a standalone, year-long WW3 simulation, without requiring additional constraints. Our new ML parameterization bridges the gap between accuracy and efficiency, offering a promising alternative for improving wave modeling in operational settings and research purposes.

16 TIDAL AND WAVE POWER↗

Design of experiments to spectroscopically characterize radiation flow in stochastic media

Precise characterization of experimental radiation flow is required to validate the high energy density physics models, numerical methods, and codes that are used to simulate radiation-hydrodynamics phenomena such as thermal radiation transport in stochastic media. The Cassio code is used to simulate thermal radiation flow through inhomogeneous, stochastic-media-foam configurations containing optically thick clumps dispersed within an optically thin background aerogel. Cassio can model small inhomogeneous problems directly, but most problems require approximations to meet computer limitations on run-times and memory usage. Various examples of these approximations are methods that produce, in one calculation, an ensemble-averaged solution and associated standard deviation; reduced spatial dimensionality with approximate geometries; and full material homogenization with no geometric detail. Cassio simulations are used to design experiments at the OMEGA-60 Laser Facility that can measure the radiation flow using the spatially resolved COAX absorption spectroscopy diagnostic. The experimental platforms flow radiation through foam targets ranging from a background-only aerogel, to a single configuration of a specified stochastic medium, to a fully homogenized foam of the background and clump materials. Under constant total clump mass, larger clumps (here, larger than 10 μm diameter) will mix more slowly with the background such that the bulk radiation flow is faster than it would be in a fully homogenized material. The COAX platform can be used to infer temperature and density profiles in both the background material and clumps, simultaneously, and therefore to differentiate radiation flow in a range of stochastic and homogeneous media.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Predicting radiative heat transfer in thermochemical nonequilibrium flow fields. Theory and user's manual for the LORAN code

The theory for radiation emission, absorption, and transfer in a thermochemical nonequilibrium flow is presented. The expressions developed reduce correctly to the limit at equilibrium. To implement the theory in a practical computer code, some approximations are used, particularly the smearing of molecular radiation. Details of these approximations are presented and helpful information is included concerning the use of the computer code. This user's manual should benefit both occasional users of the Langley Optimized Radiative Nonequilibrium (LORAN) code and those who wish to use it to experiment with improved models or properties.

Chambers, Lin Hartung↗

Bounded-Degree Approximations of Stochastic Networks

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

97 MATHEMATICS AND COMPUTING↗

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↗

Spatial orientation of the vestibular system

1. A simplified three-dimensional state space model of visual vestibular interaction was formulated. Matrix and dynamical system operators representing coupling from the semicircular canals and the visual system to the velocity storage integrator were incorporated into the model. 2. It was postulated that the system matrix for a tilted position was a composition of two linear transformations of the system matrix for the upright position. One transformation modifies the eigenvalues of the system matrix while another rotates the pitch and roll eigenvectors with the head, while maintaining the yaw axis eigenvector approximately spatially invariant. Using this representation, the response characteristics of the pitch, roll, and yaw eye velocity were obtained in terms of the eigenvalues and associated eigenvectors. 3. Using OKAN data obtained from monkeys and comparing to the model predictions, the eigenvalues and eigenvectors of the system matrix were identified as a function of tilt to the side or of tilt to the prone positions, using a modification of the Marquardt algorithm. The yaw eigenvector for right-side-down tilt and for downward pitch cross-coupling was approximately 30 degrees from the spatial vertical. For the prone position, the eigenvector was computed to be approximately 20 degrees relative to the spatial vertical. For both side-down and prone positions, oblique OKN induced along eigenvector directions generated OKAN which decayed to zero along a straight line with approximately a single time constant. This was verified by a spectral analysis of the residual sequence about the straight line fit to the decaying data. The residual sequence was associated with a narrow autocorrelation function and a wide power spectrum. 4. Parameters found using the Marquardt algorithm were incorporated into the model. Diagonal matrices in a head coordinate frame were introduced to represent the direct pathway and the coupling of the visual system to the integrator. Model simulations predicted the behavior of yaw and pitch OKN and OKAN when the animal was upright, as well as the cross-coupling in the tilted position. The trajectories in velocity space were also accurately simulated. 5. There were similarities between the monkey eigenvectors and human perception of the spatial vertical. For side-down tilts and downward eye velocity cross-coupling, there was only an Aubert (A) effect. For upward eye velocity cross-coupling there were both Muller (E) and Aubert (A) effects. The mean of the eigenvectors for upward and downward eye velocities overlay human 1 x g perceptual data.(ABSTRACT TRUNCATED AT 400 WORDS).

NASA Discipline Neuroscience↗

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources: Preprint

This paper develops and compares algorithms to compute the inner approximation of Minkowski sum of convex polytopes. We consider flexibility from distributed re- sources, such as solar photovoltaic (PV) inverters, demand side resources, etc. A polytopic representation of a single inverter's feasible operating region is proposed first. The aggregate flexibility can be computed using the Minkowski sum. Homothet and Zonotope-based approaches have been explored in literature. We show that as heterogeneity increases, such approaches lead to conservative estimates. Hence, we show how to exploit union-based Minkowski sum computation through successive homothetic decomposition of polytopes. While the union-based approach can lead to dimensionality issues, we show how to limit the complexity by predefining a candidate set. Efficiency, accuracy and trade-offs have been analyzed. Numerical examples have been presented to illustrate the effectiveness of the proposed algorithm.

14 SOLAR ENERGY↗

Heats of Segregation of BCC Binaries from Ab Initio and Quantum Approximate Calculations

We compare dilute-limit segregation energies for selected BCC transition metal binaries computed using ab initio and quantum approximate energy methods. Ab initio calculations are carried out using the CASTEP plane-wave pseudopotential computer code, while quantum approximate results are computed using the Bozzolo-Ferrante-Smith (BFS) method with the most recent parameters. Quantum approximate segregation energies are computed with and without atomistic relaxation. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with full-potential quantum calculations and with available experimental results.

Good, Brian S.↗