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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
DOE OSTI2013

Improved statistical models for limited datasets in uncertainty quantification using stochastic collocation

This paper presents a data-driven framework for performing uncertainty quantification (UQ) by choosing a stochastic model that accurately describes the sources of uncertainty in a system. This model is propagated through an appropriate response surface function that approximates the behavior of this system using stochastic collocation. Given a sample of data describing the uncertainty in the inputs, our goal is to estimate a probability density function (PDF) using the kernel moment matching (KMM) method so that this PDF can be used to accurately reproduce statistics like mean and variance of the response surface function. Instead of constraining the PDF to be optimal for a particular response function, we show that we can use the properties of stochastic collocation to make the estimated PDF optimal for a wide variety of response functions. We contrast this method with other traditional procedures that rely on the Maximum Likelihood approach, like kernel density estimation (KDE) and its adaptive modification (AKDE). We argue that this modified KMM method tries to preserve what is known from the given data and is the better approach when the available data is limited in quantity. We test the performance of these methods for both univariate and multivariate density estimation by sampling random datasets from known PDFs and then measuring the accuracy of the estimated PDFs, using the known PDF as a reference. Comparing the output mean and variance estimated with the empirical moments using the raw data sample as well as the actual moments using the known PDF, we show that the KMM method performs better than KDE and AKDE in predicting these moments with greater accuracy. This improvement in accuracy is also demonstrated for the case of UQ in electrostatic and electrothermomechanical microactuators. We show how our framework results in the accurate computation of statistics in micromechanical systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Characterization of high order spatial discretizations and lumping techniques for discontinuous finite element SN transport

We examine several possible methods of mass matrix lumping for discontinuous finite element discrete ordinates transport using a Lagrange interpolatory polynomial trial space. Though positive outflow angular flux is guaranteed with traditional mass matrix lumping in a purely absorbing 1-D slab cell for the linear discontinuous approximation, we show that when used with higher degree interpolatory polynomial trial spaces, traditional lumping does yield strictly positive outflows and does not increase in accuracy with an increase in trial space polynomial degree. As an alternative, we examine methods which are 'self-lumping'. Self-lumping methods yield diagonal mass matrices by using numerical quadrature restricted to the Lagrange interpolatory points. Using equally-spaced interpolatory points, self-lumping is achieved through the use of closed Newton-Cotes formulas, resulting in strictly positive outflows in pure absorbers for odd power polynomials in 1-D slab geometry. By changing interpolatory points from the traditional equally-spaced points to the quadrature points of the Gauss-Legendre or Lobatto-Gauss-Legendre quadratures, it is possible to generate solution representations with a diagonal mass matrix and a strictly positive outflow for any degree polynomial solution representation in a pure absorber medium in 1-D slab geometry. Further, there is no inherent limit to local truncation error order of accuracy when using interpolatory points that correspond to the quadrature points of high order accuracy numerical quadrature schemes. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Spontaneous Exciton Collapse in a Strongly Flattened Ellipsoidal InSb Quantum Dot

Abstract Electronic and excitonic states in an InSb strongly flattened ellipsoidal quantum dot (QD) with complicated dispersion law are theoretically investigated within the framework of the geometric adiabatic approximation in the strong, intermediate, and weak quantum confinement regimes. For the lower levels of the spectrum, the square root dependence of energy on QD sizes is revealed in the case of Kane’s dispersion law. The obtained results are compared to the case of a parabolic (standard) dispersion law of charge carriers. The possibility of the accidental exciton instability is revealed for the intermediate quantum confinement regime. For the weak quantum confinement regime, the motion of the exciton's center-of-gravity is quantized, which leads to the appearance of additional Coulomb-like sub-levels. It is revealed that in the case of the Kane dispersion law, the Coulomb levels shift into the depth of the forbidden band gap, moving away from the quantum confined level, whereas in the case of the parabolic dispersion law, the opposite picture is observed. The corresponding selection rules of quantum transitions for the interband absorption of light are obtained. New selection rules of quantum transitions between levels conditioned by 2D exciton center of mass vertical motion quantization in a QD are revealed. The absorption threshold behavior characteristics depending on the QDs geometrical sizes are also revealed.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

On singlet s-wave electron-hydrogen scattering.

Discussion of various zeroth-order approximations to s-wave scattering of electrons by hydrogen atoms below the first excitation threshold. The formalism previously developed by the author (1967, 1968) is applied to Feshbach operators to derive integro-differential equations, with the optical-potential set equal to zero, for the singlet and triplet cases. Phase shifts of s-wave scattering are computed in the zeroth-order approximation of the Feshbach operator method and in the static-exchange approximation. It is found that the convergence of numerical computations is faster in the former approximation than in the latter.

Madan, R. N.↗
DOE OSTI2013

Minimal multi-element stochastic collocation for uncertainty quantification of discontinuous functions

We propose a multi-element stochastic collocation method that can be applied in high-dimensional parameter space for functions with discontinuities lying along manifolds of general geometries. The key feature of the method is that the parameter space is decomposed into multiple elements defined by the discontinuities and thus only the minimal number of elements are utilized. On each of the resulting elements the function is smooth and can be approximated using high-order methods with fast convergence properties. The decomposition strategy is in direct contrast to the traditional multi-element approaches which define the sub-domains by repeated splitting of the axes in the parameter space. Such methods are more prone to the curse-of-dimensionality because of the fast growth of the number of elements caused by the axis based splitting. The present method is a two-step approach. Firstly a discontinuity detector is used to partition parameter space into disjoint elements in each of which the function is smooth. The detector uses an efficient combination of the high-order polynomial annihilation technique along with adaptive sparse grids, and this allows resolution of general discontinuities with a smaller number of points when the discontinuity manifold is low-dimensional. After partitioning, an adaptive technique based on the least orthogonal interpolant is used to construct a generalized Polynomial Chaos surrogate on each element. The adaptive technique reuses all information from the partitioning and is variance-suppressing. We present numerous numerical examples that illustrate the accuracy, efficiency, and generality of the method. When compared against standard locally-adaptive sparse grid methods, the present method uses many fewer number of collocation samples and is more accurate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A MIMO AAA Agorithm for Frequency Dependent Line Modeling

Modeling of power distribution system components that are valid for a wide range of frequencies are crucial for highly accurate modeling of electromagnetic transient (EMT) events. This has recently become of interest due to the improvements needed for the resilient operation of distribution systems. Vector fitting (VF) is a very popular and commonly used algorithm for wide band representations of power system components in EMT simulations. In this research, we present a new multi-input rational approximation algorithm (MIAAA) and illustrate its advantages with respect to VF using examples of approximations of admittance matrices discussed in the literature. We show that MIAAA not only outperforms VF in terms of achieving better accuracy using lesser number of poles, but also has no numerical issues achieving convergence. In contrast to VF, MIAAA is not sensitive to the location of input sample points and it does not require good estimates for the location of the desired approximation poles. The novelty of this research work is the use of recent mathematical results to solve existing challenges in distribution system modeling and to develop rational approximations for power system models that intend to be optimal in terms of accuracy and performance.

AAA algorithm↗
NASA NTRS1990

A review of reduced Navier-Stokes computations for compressible viscous flows

A reduced form of the Navier-Stokes equations, defined by a single composite of the Euler, boundary layer, and triple deck approximations, is considered for the computation of viscous interacting flows. Global pressure or pseudopotential relaxation methods are integrated with coupled sparse matrix direct solvers or coupled strongly implicit ILU algorithms to efficiently capture sharp shocks and regions of recirculation. Solutions are obtained for a variety of 2D and 3D geometries and for Mach numbers (M) spanning the range from incompressible (M = 0) to supersonic (M = 6) flow.

Rubin, S. G.↗
DOE OSTI2014

A stochastic reorganizational bath model for electronic energy transfer

Environmentally induced fluctuations of the optical gap play a crucial role in electronic energy transfer dynamics. One of the simplest approaches to incorporate such fluctuations in energy transfer dynamics is the well known Haken-Strobl-Reineker (HSR) model, in which the energy-gap fluctuation is approximated as white noise. Recently, several groups have employed molecular dynamics simulations and excited-state calculations in conjunction to account for excitation energies’ thermal fluctuations. On the other hand, since the original work of HSR, many groups have employed stochastic models to simulate the same transfer dynamics. Here, we discuss a rigorous connection between the stochastic and the atomistic bath models. If the phonon bath is treated classically, time evolution of the exciton-phonon system can be described by Ehrenfest dynamics. To establish the relationship between the stochastic and atomistic bath models, we employ a projection operator technique to derive the generalized Langevin equations for the energy-gap fluctuations. The stochastic bath model can be obtained as an approximation of the atomistic Ehrenfest equations via the generalized Langevin approach. Based on this connection, we propose a novel scheme to take account of reorganization effects within the framework of stochastic models. The proposed scheme provides a better description of the population dynamics especially in the regime of strong exciton-phonon coupling. Finally, we discuss the effect of the bath reorganization in the absorption and fluorescence spectra of ideal J-aggregates in terms of the Stokes shifts. We find a simple expression that relates the reorganization contribution to the Stokes shifts – the reorganization shift – to the ideal or non-ideal exciton delocalization in a J-aggregate. The reorganization shift can be described by three parameters: the monomer reorganization energy, the relaxation time of the optical gap, and the exciton delocalization length. This simple relationship allows one to understand the physical origin of the Stokes shifts in molecular aggregates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1982

Development of a locally mass flux conservative computer code for calculating 3-D viscous flow in turbomachines

The VANS successive approximation numerical method was extended to the computation of three dimensional, viscous, transonic flows in turbomachines. A cross-sectional computer code, which conserves mass flux at each point of the cross-sectional surface of computation was developed. In the VANS numerical method, the cross-sectional computation follows a blade-to-blade calculation. Numerical calculations were made for an axial annular turbine cascade and a transonic, centrifugal impeller with splitter vanes. The subsonic turbine cascade computation was generated in blade-to-blade surface to evaluate the accuracy of the blade-to-blade mode of marching. Calculated blade pressures at the hub, mid, and tip radii of the cascade agreed with corresponding measurements. The transonic impeller computation was conducted to test the newly developed locally mass flux conservative cross-sectional computer code. Both blade-to-blade and cross sectional modes of calculation were implemented for this problem. A triplet point shock structure was computed in the inducer region of the impeller. In addition, time-averaged shroud static pressures generally agreed with measured shroud pressures. It is concluded that the blade-to-blade computation produces a useful engineering flow field in regions of subsonic relative flow; and cross-sectional computation, with a locally mass flux conservative continuity equation, is required to compute the shock waves in regions of supersonic relative flow.

Walitt, L.↗
NASA NTRS1986

Three-dimensional computation of mixing of transverse injector in a ducted supersonic airstream

Numerical solutions of the three-dimensional mass-averaged elliptic Navier-Stokes equations, including species transport, are obtained for nonreacting, turbulent, mixing flow fields for the case of transverse sonic injection of a secondary gas into a supersonic airstream through a circular orifice injector. Results are presented for flow through a constant area duct and through a duct with a rearward-facing step upstream of the injector. The equations are numerically integrated using MacCormack's explicit method and turbulence is included using the Baldwin-Lomax algebraic eddy viscosity model. In the species transport and energy equations, diffusion coefficients based on Fick's law and an assumption of unit Lewis number are applied. The computations were performed on a CDC-VPS-32 (extended version of Cyber-205) using a grid consisting of approximately 200,000 points. The computed results are compared with experimentally observed penetration and spreading boundaries for an injected gas at two dynamic pressure ratios. Three-dimensional flow field structures are dipicted in terms of static pressure, mass fractions of species and velocity vectors.

Uenishi, K.↗
NASA NTRS1986

Applications of computer-graphics animation for motion-perception research

The advantages and limitations of using computer animated stimuli in studying motion perception are presented and discussed. Most current programs of motion perception research could not be pursued without the use of computer graphics animation. Computer generated displays afford latitudes of freedom and control that are almost impossible to attain through conventional methods. There are, however, limitations to this presentational medium. At present, computer generated displays present simplified approximations of the dynamics in natural events. Very little is known about how the differences between natural events and computer simulations influence perceptual processing. In practice, the differences are assumed to be irrelevant to the questions under study, and that findings with computer generated stimuli will generalize to natural events.

Proffitt, D. R.↗
NASA NTRS1992

Inference in infinite-dimensional inverse problems - Discretization and duality

Many techniques for solving inverse problems involve approximating the unknown model, a function, by a finite-dimensional 'discretization' or parametric representation. The uncertainty in the computed solution is sometimes taken to be the uncertainty within the parametrization; this can result in unwarranted confidence. The theory of conjugate duality can overcome the limitations of discretization within the 'strict bounds' formalism, a technique for constructing confidence intervals for functionals of the unknown model incorporating certain types of prior information. The usual computational approach to strict bounds approximates the 'primal' problem in a way that the resulting confidence intervals are at most long enough to have the nominal coverage probability. There is another approach based on 'dual' optimization problems that gives confidence intervals with at least the nominal coverage probability. The pair of intervals derived by the two approaches bracket a correct confidence interval. The theory is illustrated with gravimetric, seismic, geomagnetic, and helioseismic problems and a numerical example in seismology.

Stark, Philip B.↗
NASA NTRS1995

Computed Tomography Measuring Inside Machines

Computed tomography applied to obtain approximate measurements of radial distances from centerline of turbopump to leading edges of diffuser vanes in turbopump. Use of computed tomography has significance beyond turbopump application: example of general concept of measuring internal dimensions of assembly of parts without having to perform time-consuming task of taking assembly apart and measuring internal parts on coordinate-measuring machine.

Wozniak, James F.↗
DOE OSTI2015

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set of $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $100\times$ for over $100$ instances, and from $100$ to $1000\times$ for $15$ instances. We also demonstrate up to $20\times$ speedup relative to $2$ threads, and up to $5\times$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.

GPU↗
NASA NTRS1975

Spline function approximation techniques for image geometric distortion representation

Least squares approximation techniques were developed for use in computer aided correction of spatial image distortions for registration of multitemporal remote sensor imagery. Polynomials were first used to define image distortion over the entire two dimensional image space. Spline functions were then investigated to determine if the combination of lower order polynomials could approximate a higher order distortion with less computational difficulty. Algorithms for generating approximating functions were developed and applied to the description of image distortion in aircraft multispectral scanner imagery. Other applications of the techniques were suggested for earth resources data processing areas other than geometric distortion representation.

Anuta, P. E.↗
DOE OSTI2022

hPIC2: A hardware-accelerated, hybrid particle-in-cell code for dynamic plasma-material interactions

The exascale era of high performance computing promises to bring the field of computational plasma physics ever closer to the goal of accurate multiscale modeling. Such computers will rely on hardware acceleration to offload work to dedicated components, notably general-purpose graphics processing units (GPUs). However, devices from different manufacturers require software to be written with different parallel programming models, greatly increasing the code maintenance burden of applications designed to perform on more than one such device. hPIC2 is a hybrid plasma simulation code developed with the Kokkos performance portability framework to target the architectures that will drive exascale computing for the foreseeable future. As a hybrid simulation code, hPIC2 investigates the simultaneous use of various plasma models on the same domain, at the same time. hPIC2 also optionally couples to RustBCA, which accurately models ion-material interactions using the binary collision approximation (BCA) method. In conclusion, hPIC2 therefore achieves scalable performance on a variety of computing architectures when simulating complex and diverse plasmas, particularly near plasma-material interfaces.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Exponential Synthesis in the Kernel of a Symmetric Convolution

The paper describes a certain class of homogeneous equations of convolution type in spaces of analytic functions on convex domains. We obtain sufficient conditions under which every solution of an equation from this class is approximated by its elementary solutions.

97 MATHEMATICS AND COMPUTING↗