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 613 records · Page 34

Multi-element stochastic spectral projection for high quantile estimation

We investigate quantile estimation by multi-element generalized Polynomial Chaos (gPC) metamodel where the exact numerical model is approximated by complementary metamodels in overlapping domains that mimic the model’s exact response. The gPC metamodel is constructed by the non-intrusive stochastic spectral projection approach and function evaluation on the gPC metamodel can be considered as essentially free. Thus, large number of Monte Carlo samples from the metamodel can be used to estimate α-quantile, for moderate values of α. As the gPC metamodel is an expansion about the means of the inputs, its accuracy may worsen away from these mean values where the extreme events may occur. By increasing the approximation accuracy of the metamodel, we may eventually improve accuracy of quantile estimation but it is very expensive. A multi-element approach is therefore proposed by combining a global metamodel in the standard normal space with supplementary local metamodels constructed in bounded domains about the design points corresponding to the extreme events. To improve the accuracy and to minimize the sampling cost, sparse-tensor and anisotropic-tensor quadratures are tested in addition to the full-tensor Gauss quadrature in the construction of local metamodels; different bounds of the gPC expansion are also examined. The global and local metamodels are combined in the multi-element gPC (MEgPC) approach and it is shown that MEgPC can be more accurate than Monte Carlo or importance sampling methods for high quantile estimations for input dimensions roughly below N=8, a limit that is very much case- and α-dependent.

97 MATHEMATICS AND COMPUTING↗

Fast mix table construction for material discretization

An effective hybrid Monte Carlo-deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a 'mix table,' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in O(number of voxels x log number of mixtures) time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation. (authors)

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Spectral neighbor analysis method for automated generation of quantum-accurate interatomic potentials

We present a new interatomic potential for solids and liquids called Spectral Neighbor Analysis Potential (SNAP). The SNAP potential has a very general form and uses machine-learning techniques to reproduce the energies, forces, and stress tensors of a large set of small configurations of atoms, which are obtained using high-accuracy quantum electronic structure (QM) calculations. The local environment of each atom is characterized by a set of bispectrum components of the local neighbor density projected onto a basis of hyperspherical harmonics in four dimensions. The bispectrum components are the same bond-orientational order parameters employed by the GAP potential [1]. The SNAP potential, unlike GAP, assumes a linear relationship between atom energy and bispectrum components. The linear SNAP coefficients are determined using weighted least-squares linear regression against the full QM training set. This allows the SNAP potential to be fit in a robust, automated manner to large QM data sets using many bispectrum components. The calculation of the bispectrum components and the SNAP potential are implemented in the LAMMPS parallel molecular dynamics code. We demonstrate that a previously unnoticed symmetry property can be exploited to reduce the computational cost of the force calculations by more than one order of magnitude. We present results for a SNAP potential for tantalum, showing that it accurately reproduces a range of commonly calculated properties of both the crystalline solid and the liquid phases. In addition, unlike simpler existing potentials, SNAP correctly predicts the energy barrier for screw dislocation migration in BCC tantalum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trajectory prediction dimensionality reduction for low-cost connected automated vehicle systems

Here, to facilitate low-cost connected automated vehicle (CAV) system development, this study proposes two interpretable dimensionality reduction techniques in vehicle trajectory prediction, i.e., the piecewise Taylor series approximation (PTA) and the piecewise Fourier series approximation (PFA), to lower computation complexity, reduce device investment, and decrease computation energy consumption. Two benchmarks are developed, the long short-term memory (LSTM)-based model without dimensionality reduction and the LSTM-based model with encoder-decoder (a widely used dimensionality reduction technique). Results show that the four predictions have similar accuracy, and the training time (proportional to computation energy consumption) of models with dimensionality reduction techniques is greatly reduced. The reduction is even more significant when PTA/PFA is used. Sensitivity analysis advises PFA/PTA parameter selections to reduce computation complexity without significant loss of prediction accuracy. Further, the robustness of the LSTM PTA/PFA is proven by the investigation of data noises.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Numerical study of variable density turbulence interaction with a normal shock wave

Accurate numerical simulations of shock–turbulence interaction (STI) are conducted with a hybrid monotonicity-preserving–compact-finite-difference scheme for a detailed study of STI in variable density flows. Theoretical and numerical assessments of data confirm that all turbulence scales as well as the STI are well captured by the computational method. Linear interaction approximation (LIA) convergence tests conducted with the shock-capturing simulations exhibit a similar trend of converging to LIA predictions to shock-resolving direct numerical simulations (DNS). The effects of density variations on STI are studied by comparing the results corresponding to an upstream multi-fluid mixture with the single-fluid case. Here the results show that for the current parameter ranges, the turbulence amplification by the normal shock wave is much higher and the reduction in turbulence length scales is more significant when strong density variations exist. Turbulent mixing enhancement by the shock is also increased and stronger mixing asymmetry in the postshock region is observed when there is significant density variation. The turbulence structure is strongly modified by the shock wave, with a differential distribution of turbulent statistics in regions having different densities. The dominant mechanisms behind the variable density STI are identified by analysing the transport equations for the Reynolds stresses, vorticity, normalized mass flux and density specific volume covariance.

42 ENGINEERING↗

How Accurate Are Approximate Density Functionals for Noncovalent Interaction of Very Large Molecular Systems?

Noncovalent intermolecular interactions are very important in many research areas. Therefore, it is vital to understand the extent to which approximate density functionals give a proper description of noncovalent interactions. Previous research has demonstrated that some approximate density functionals can predict usefully accurate interaction energies for many noncovalent systems; however, most of that work is limited to small and moderate-sized molecules. Very recently though, accurate benchmarks have become available for some very large molecules. Here, the present work applies 21 approximate density functionals to compute the binding energies of seven large molecular systems that have a number of atoms ranging from 200 to 910. The results are judged by comparison to the recently published CIM-DLPNO-CCSD(T) results, which are assumed to provide a reliable benchmark. The five most accurate methods among those tested are found to be PW6B95-D4, PW6B95-D3(BJ), revM11, M06-L, and MN15.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SchrödingerNet: A Universal Neural Network Solver for the Schrödinger Equation

Recent advances in machine learning have facilitated numerically accurate solution of the electronic Schrödinger equation (SE) by integrating various neural network (NN)-based wave function ansatzes with variational Monte Carlo methods. Nevertheless, such NN-based methods are all based on the Born–Oppenheimer approximation (BOA) and require computationally expensive training for each nuclear configuration. In this work, we propose a novel NN architecture, SchrödingerNet, to solve the full electronic-nuclear SE by defining a loss function designed to equalize local energies across the system. This approach is based on a translationally, rotationally and permutationally symmetry-adapted total wave function ansatz that includes both nuclear and electronic coordinates. Furthermore, this strategy not only allows for an efficient and accurate generation of a continuous potential energy surface at any geometry within the well-sampled nuclear configuration space, but also incorporates non-BOA corrections, through a single training process. Comparison with benchmarks of atomic and small molecular systems demonstrates its accuracy and efficiency.

Chemical calculations↗

Neural Network Sampling of the Free Energy Landscape for Nitrogen Dissociation on Ruthenium

In heterogeneous catalysis, free energy profiles of reactions govern the mechanisms, rates, and equilibria. Energetics are conventionally computed using the harmonic approximation (HA), which requires determination of critical states a priori. Here, we use neural networks to efficiently sample and directly calculate the free energy surface (FES) of a prototypical heterogeneous catalysis reaction—the dissociation of molecular nitrogen on ruthenium—at density-functional-theory-level accuracy. We find that the vibrational entropy of surface atoms, often neglected in HA for transition metal catalysts, contributes significantly to the reaction barrier. The minimum free energy path for dissociation reveals an “on-top” adsorbed molecular state prior to the transition state. While a previously reported flat-lying molecular metastable state can be identified in the potential energy surface, it is absent in the FES at relevant reaction temperatures. Finally, these findings demonstrate the importance of identifying critical points self-consistently on the FES for reactions that involve considerable entropic effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗