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 505 records · Page 28

Spectral Element Method for the Simulation of Unsteady Compressible Flows

This work uses a discontinuous-Galerkin spectral-element method (DGSEM) to solve the compressible Navier-Stokes equations [1{3]. The inviscid ux is computed using the approximate Riemann solver of Roe [4]. The viscous fluxes are computed using the second form of Bassi and Rebay (BR2) [5] in a manner consistent with the spectral-element approximation. The method of lines with the classical 4th-order explicit Runge-Kutta scheme is used for time integration. Results for polynomial orders up to p = 15 (16th order) are presented. The code is parallelized using the Message Passing Interface (MPI). The computations presented in this work are performed using the Sandy Bridge nodes of the NASA Pleiades supercomputer at NASA Ames Research Center. Each Sandy Bridge node consists of 2 eight-core Intel Xeon E5-2670 processors with a clock speed of 2.6Ghz and 2GB per core memory. On a Sandy Bridge node the Tau Benchmark [6] runs in a time of 7.6s.

Diosady, Laslo Tibor↗

Sensitivity Analysis for Coupled Aero-structural Systems

A novel method has been developed for calculating gradients of aerodynamic force and moment coefficients for an aeroelastic aircraft model. This method uses the Global Sensitivity Equations (GSE) to account for the aero-structural coupling, and a reduced-order modal analysis approach to condense the coupling bandwidth between the aerodynamic and structural models. Parallel computing is applied to reduce the computational expense of the numerous high fidelity aerodynamic analyses needed for the coupled aero-structural system. Good agreement is obtained between aerodynamic force and moment gradients computed with the GSE/modal analysis approach and the same quantities computed using brute-force, computationally expensive, finite difference approximations. A comparison between the computational expense of the GSE/modal analysis method and a pure finite difference approach is presented. These results show that the GSE/modal analysis approach is the more computationally efficient technique if sensitivity analysis is to be performed for two or more aircraft design parameters.

Giunta, Anthony A.↗

Parameterizing the Variability and Uncertainty of Wind and Solar in CEMs

We present current and improved methods for estimating the capacity value and curtailment impacts from variable generation (VG) in capacity expansion models (CEMs). The ideal calculation of these variability metrics is through an explicit co-optimized investment-dispatch model using multiple years of VG and load data. Because of data and computational limitations, existing CEMs typically approximate these metrics using a subset of all hours from a single year and/or using statistical methods, which often do not capture the tail-event impacts or the broader set of interactions between VG, storage, and conventional generators. In our proposed new methods, we use hourly generation and load values across all hours of the year to characterize the (1) contribution of VG to system capacity during high load hours, (2) the curtailment level of VG, and (3) the reduction in VG curtailment due to storage and shutdown of select thermal generators. Using CEM model outputs from a preceding model solve period, we apply these methods to exogenously calculate capacity value and curtailment metrics for the subsequent model solve period. Preliminary results suggest that these hourly methods offer improved capacity value and curtailment representations of VG in the CEM from existing approximation methods without additional computational burdens.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Surface Segregation Energies 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 method. 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 parameterization. Quantum approximate segregation energies are computed with and without atomistic relaxation. The ab initio calculations are performed without relaxation for the most part, but predicted relaxations from quantum approximate calculations are used in selected cases to compute approximate relaxed ab initio segregation energies. Results are discussed within the context of segregation models driven by strain and bond-breaking effects. We compare our results with other quantum approximate and ab initio theoretical work, and available experimental results.

Good, Brian S.↗

Reducing the Cost of CCSD Basis Set Extrapolation in Ab Initio Computational Thermochemistry

Here, a series of approximations to CCSD contributions in computational model chemistries is presented in the context of kcal mol –1 , kJ mol –1 , and 20 cm –1 theoretical predictions of total atomization energies, benchmarked within the HEAT+CH 4 test suite. A specific set of circumstances where MP2, without empirical scaling, may be used as an effective intermediate in the first two of these accuracy ranges was determined. However, SDQ-MP4, a method long used in pursuit of kcal mol –1 accuracy but relatively unstudied in the subchemical accuracy community, offers significant improvement over the quality of MP2 as a basis-set intermediate at significantly reduced cost compared to CCSD. Given this, we argue for SDQ-MP4 as the de facto CCSD basis-set intermediate in sub-chemical accuracy calculations when CCSD in a desired basis set becomes unaffordable. We additionally report on a “CBS-like” scheme, where MP2 and SDQ-MP4 are used in conjunction to create a “cheap” three-part approximation of large CCSD basis set limits. The data for the CCSD approximation schemes are organized in such a way that model chemistry developers can locate an analog of their current approach for the CCSD basis set limit and explore alternative intermediates that either decrease computational cost or increase computational accuracy. We also show, for a handful of molecules, that SDQ-MP4 shows promise as an effective basis-set intermediate for harmonic and fundamental frequency computations, allowing for zero-point corrections of nearly CCSD(T)/ANO1 quality using simple composite methods that only require CCSD(T)/ANO0.

Thorpe, James H. [Argonne National Laboratory (ANL↗

Postprocessing Mixed Finite Element Methods For Solving Cahn–Hilliard Equation: Methods and Error Analysis

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures.

97 MATHEMATICS AND COMPUTING↗

Development and Experimental Optimization of High-Temperature Modeling Tools and Methods for Concentrated Solar Power Particle - Systems

A novel, open-source radiative modeling toolset was developed to extend the functionality of particle-based modeling software (e.g. discrete element method (DEM)) to environmental conditions relevant to concentrated solar power applications. This toolset was optimized for deployment on desktop workstations instead of high-performance computing systems, to render such tools more accessible to the research community. Both particle-based modeling and radiative exchange modeling are computationally expensive and often require specialized programming expertise, making these methods cumbersome to use. Recent developments in DEM software by DCS Computing have greatly reduced these challenges, providing a graphical-user-interface based platform and modeling optimization for desktop workstations, HPCs, and cloud computing. The University of Dayton leveraged the experience of DCS Computing in developing a user-friendly, open-source radiative heat transfer expansion for DEM modeling. The University of Dayton DEM+ radiative modeling toolset was developed using a combination of fundamental experimental measurements, modeling, and simplified flow experiments over a range of temperatures and flow conditions. The toolset provides researchers with access to multiple radiative models including an accelerated Monte-Carlo Ray Tracing (application agnostic, highly computationally expensive), an expanded database of distance-based approximations (application limited, computationally light), and a weighted blending of the two methods capable of achieving over 90% reduction in computation time with equivalent accuracy compared to Monte-Carlo Ray Tracing. Through a graphical user interface, users can customize the radiative models to match their desired accuracy and available computational resources, improving access to particle based modeling for the research community. Ceramic sintered bauxite proppants were used in modeling and experimentally as a baseline. Both the radiative heat transfer and flow properties for particulate systems were investigated at elevated temperatures up to 800 °C. The major accomplishments for this work include a verified, open-source radiative modeling toolset to be distributed amongst the research community and the fabrication of three small-scale test facilities to investigate particle behavior and tune DEM flow properties for operation up to 800 °C. The findings have been shared with the research community via conference modeling workshops, deployment of the tools in DCS Computing Aspherix®, and open-source access to the developed radiative modeling tool. The development of next-generation CSP facilities and thermal energy storage systems based on ceramic particles requires providing access to computationally efficient and accurate modeling tools. Particles will experience a wide range of environments (20-800 °C) and handling conditions (dilute curtains or dense packing), requiring specially designed and optimized equipment. Optimizing solid particle physics models and establishing best-practices for particle modeling in CSP environments will assist researchers with designing optimized equipment, accelerating the deployment of more economically-competitive CSP facilities.

14 SOLAR ENERGY↗

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↗

Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match quality scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.

97 MATHEMATICS AND COMPUTING↗

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.↗