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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,441 records · Page 80

All sources NASA NTRS DOE OSTI

DOE OSTI2013

A generalized framework for in-line energy deposition during steady-state Monte Carlo radiation transport

A rigorous treatment of energy deposition in a Monte Carlo transport calculation, including coupled transport of all secondary and tertiary radiations, increases the computational cost of a simulation dramatically, making fully-coupled heating impractical for many large calculations, such as 3-D analysis of nuclear reactor cores. However, in some cases, the added benefit from a full-fidelity energy-deposition treatment is negligible, especially considering the increased simulation run time. In this paper we present a generalized framework for the in-line calculation of energy deposition during steady-state Monte Carlo transport simulations. This framework gives users the ability to select among several energy-deposition approximations with varying levels of fidelity. The paper describes the computational framework, along with derivations of four energy-deposition treatments. Each treatment uses a unique set of self-consistent approximations, which ensure that energy balance is preserved over the entire problem. By providing several energy-deposition treatments, each with different approximations for neglecting the energy transport of certain secondary radiations, the proposed framework provides users the flexibility to choose between accuracy and computational efficiency. Numerical results are presented, comparing heating results among the four energy-deposition treatments for a simple reactor/compound shielding problem. The results illustrate the limitations and computational expense of each of the four energy-deposition treatments. (authors)

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis

Dielectrophoresis, a nonlinear electrokinetic transport mechanism, has become popular in many engineering applications including manipulation, characterization and actuation of biomaterials, particles and biological cells. In this paper, we present a hybrid immersed interface–immersed boundary method to study AC dielectrophoresis where an algorithm is developed to solve the complex Poisson equation using a real variable formulation. An immersed interface method is employed to obtain the AC electric field in a fluid media with suspended particles and an immersed boundary method is used for the fluid equations and particle transport. The convergence of the proposed algorithm as well as validation of the hybrid scheme with experimental results is presented. In this paper, the Maxwell stress tensor is used to calculate the dielectrophoretic force acting on particles by considering the physical effect of particles in the computational domain. Thus, this study eliminates the approximations used in point dipole methods for calculating dielectrophoretic force. A comparative study between Maxwell stress tensor and point dipole methods for computing dielectrophoretic forces are presented. The hybrid method is used to investigate the physics of dielectrophoresis in microfluidic devices using an AC electric field. The numerical results show that with proper design and appropriate selection of applied potential and frequency, global electric field minima can be obtained to facilitate multiple particle trapping by exploiting the mechanism of negative dielectrophoresis. Our numerical results also show that electrically neutral particles form a chain parallel to the applied electric field irrespective of their initial orientation when an AC electric field is applied. This proposed hybrid numerical scheme will help to better understand dielectrophoresis and to design and optimize microfluidic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2021

PDG: A Composite Method Based on the Resolution of the Identity

The Gaussian-3 (G3) composite approach for thermochemical properties is revisited in light of the enhanced computational efficiency and reduced memory costs by applying the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs) to the computationally demanding component methods in the G3 model: the energy and gradient computations via the second-order Møller–Plesset perturbation theory (MP2) and the energy computations using the coupled-cluster singles–doubles method augmented with noniterative triples corrections [CCSD(T)]. Efficient implementation of the RI-based methods is achieved by employing a hybrid distributed/shared memory model based on MPI and OpenMP. The new variant of the G3 composite approach based on the RI approximation is termed the RI-G3 scheme, or alternatively the PDG method. The accuracy of the new RI-G3/PDG scheme is compared to the “standard” G3 composite approach that employs the memory-expensive four-center ERIs in the MP2 and CCSD(T) calculations. Taking the computation of the heats of formation of the closed-shell molecules in the G3/99 test set as a test case, it is demonstrated that the RI approximation introduces negligible changes to the mean absolute errors relative to the standard G3 model (less than 0.1 kcal/mol), while the standard deviations remain unaltered. Furthermore, the efficiency and memory requirements for the RI-MP2 and RI-CCSD(T) methods are compared to the standard MP2 and CCSD(T) approaches, respectively. The hybrid MPI/OpenMP-based RI-MP2 energy plus gradient computation is found to attain a 7.5× speedup over the standard MP2 calculations. For the most demanding CCSD(T) calculations, the application of the RI approximation is found to nearly halve the memory demand, confer about a 4–5× speedup for the CCSD iterations, and reduce the computational time for the compute-intensive triples correction step by several hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

The use of Jacobi wavelets for constrained approximation of rational Bézier curves

This paper presents an efficient method to solve the approximation problem of the rational Bézier curve by continuous piecewise polynomial curve in L{sub 2}-norm. For this purpose, extended Jacobi wavelets together with the Gauss–Jacobi quadrature rules are employed. The proposed technique has some advantages such as: simplicity, high accuracy and fast computation. Also, the method in the paper performs multi-degree reduction at one time and does not need the stepwise computing. Several examples are given to illustrate the effectiveness of the algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

HPC Annual Report 2017

Sandia National Laboratories has a long history of significant contributions to the high performance community and industry. Our innovative computer architectures allowed the United States to become the first to break the teraFLOP barrier—propelling us to the international spotlight. Our advanced simulation and modeling capabilities have been integral in high consequence US operations such as Operation Burnt Frost. Strong partnerships with industry leaders, such as Cray, Inc. and Goodyear, have enabled them to leverage our high performance computing (HPC) capabilities to gain a tremendous competitive edge in the marketplace. As part of our continuing commitment to providing modern computing infrastructure and systems in support of Sandia missions, we made a major investment in expanding Building 725 to serve as the new home of HPC systems at Sandia. Work is expected to be completed in 2018 and will result in a modern facility of approximately 15,000 square feet of computer center space. The facility will be ready to house the newest National Nuclear Security Administration/Advanced Simulation and Computing (NNSA/ASC) Prototype platform being acquired by Sandia, with delivery in late 2019 or early 2020. This new system will enable continuing advances by Sandia science and engineering staff in the areas of operating system R&D, operation cost effectiveness (power and innovative cooling technologies), user environment and application code performance.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2019

Multilevel Monte Carlo Estimation of Unbiased Expectation via Sample Reuse and the Low Variance Estimation of Asymptotic Rates

A new variant of the multilevel Monte Carlo estimator [5, 3, 9, 12] is presented for the estimation of expectation statistics that utilizes sample reuse in specified levels, explicitly removes approximation error bias associated with numerically computed output quantities of interest that have an asymptotic limit behavior, and permits a low variance estimate of the asymptotic rate of convergence to that limit. In addition, it is shown that this new multilevel Monte Carlo variant can yield a computational cost savings. A review of Monte Carlo and multilevel Monte Carlo estimators is presented that includes analysis of expected value, expected mean squared error, and the calculation of optimized multilevel sample size parameters. The multilevel Monte Carlo estimator produces estimates of expectation for numerically approximated output quantities of interest that are biased by approximation error. When the quantity of interest can be modeled as the asymptotic limit of numerically approximated output quantities of interest, it is theoretically possible to remove this approximation error bias in the multilevel Monte Carlo estimator. In actual implementations, however, this procedure is unreliable due to statistical variability and inaccuracy in estimating the needed asymptotic limit. Analysis and numerical experiment show that the proposed variant of the multilevel Monte Carlo method greatly reduces (in some cases eliminates) the statistical variability in this limit estimation.

Barth, Timothy↗

DOE OSTI2013

Monte Carlo methods and their analysis for Coulomb collisions in multicomponent plasmas

Highlights: •A general approach to Monte Carlo methods for multicomponent plasmas is proposed. •We show numerical tests for the two-component (electrons and ions) case. •An optimal choice of parameters for speeding up the computations is discussed. •A rigorous estimate of the error of approximation is proved. -- Abstract: A general approach to Monte Carlo methods for Coulomb collisions is proposed. Its key idea is an approximation of Landau–Fokker–Planck equations by Boltzmann equations of quasi-Maxwellian kind. It means that the total collision frequency for the corresponding Boltzmann equation does not depend on the velocities. This allows to make the simulation process very simple since the collision pairs can be chosen arbitrarily, without restriction. It is shown that this approach includes the well-known methods of Takizuka and Abe (1977) [12] and Nanbu (1997) as particular cases, and generalizes the approach of Bobylev and Nanbu (2000). The numerical scheme of this paper is simpler than the schemes by Takizuka and Abe [12] and by Nanbu. We derive it for the general case of multicomponent plasmas and show some numerical tests for the two-component (electrons and ions) case. An optimal choice of parameters for speeding up the computations is also discussed. It is also proved that the order of approximation is not worse than O(√(ε)), where ε is a parameter of approximation being equivalent to the time step Δt in earlier methods. A similar estimate is obtained for the methods of Takizuka and Abe and Nanbu.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2015

Optimization and large scale computation of an entropy-based moment closure

We present computational advances and results in the implementation of an entropy-based moment closure, M N , in the context of linear kinetic equations, with an emphasis on heterogeneous and large-scale computing platforms. Entropy-based closures are known in several cases to yield more accurate results than closures based on standard spectral approximations, such as P N , but the computational cost is generally much higher and often prohibitive. Several optimizations are introduced to improve the performance of entropy-based algorithms over previous implementations. These optimizations include the use of GPU acceleration and the exploitation of the mathematical properties of spherical harmonics, which are used as test functions in the moment formulation. To test the emerging high-performance computing paradigm of communication bound simulations, we present timing results at the largest computational scales currently available. Lastly, these results show, in particular, load balancing issues in scaling the M N algorithm that do not appear for the P N algorithm. We also observe that in weak scaling tests, the ratio in time to solution of M N to P N decreases.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1983

Space shuttle propulsion parameter estimation using optional estimation techniques

A regression analyses on tabular aerodynamic data provided. A representative aerodynamic model for coefficient estimation. It also reduced the storage requirements for the "normal' model used to check out the estimation algorithms. The results of the regression analyses are presented. The computer routines for the filter portion of the estimation algorithm and the :"bringing-up' of the SRB predictive program on the computer was developed. For the filter program, approximately 54 routines were developed. The routines were highly subsegmented to facilitate overlaying program segments within the partitioned storage space on the computer.

Source record↗

NASA NTRS2018

Using Adaptive Mesh Refinement to Study Grid Resolution Effects for Shock-Boundary Layer Interactions

Adaptive Mesh Refinement (AMR) promises a much more computationally efficient means to obtain a discrete approximation to a continuous boundary value problem of a specified accuracy than classic isotropic grid refinement. The AMR capability of OVERFLOW (a computational fluid dynamics (CFD) code) is utilized to provide estimates of the exact analytical solutions to problems of interest to turbulence modeling. Predictions of surface pressure and skin friction, essentially the state of stress at the surface, shows little difference with grids believed to be "grid resolved." Velocity profiles, on the other hand, show marked differences in flows with shocks. The AMR method, as implemented in OVERFLOW 2.2k, appears to provide the ability to produce arbitrarily accurate solutions at a predictable cost much smaller than classic uniform mesh refinement.

Turbulence Modeling↗

NASA NTRS1989

Application of Newton's method to the postbuckling of rings under pressure loadings

The postbuckling response of circular rings (or long cylinders) is examined. The rings are subjected to four types of external pressure loadings; each type of pressure is defined by its magnitude and direction at points on the buckled ring. Newton's method is applied to the nonlinear differential equations of the exact inextensional theory for the ring problem. A zeroth approximation for the solution of the nonlinear equations, based on the mode shape corresponding to the first buckling pressure, is derived in closed form for each of the four types of pressure. The zeroth approximation is used to start the iteration cycle in Newton's method to compute numerical solutions of the nonlinear equations. The zeroth approximations for the postbuckling pressure-deflection curves are compared with the converged solutions from Newton's method and with similar results reported in the literature.

Thurston, Gaylen A.↗

NASA NTRS1977

Digital overlaying of the universal transverse Mercator grid with LANDSAT data derived products

Picture elements of data from the LANDSAT multispectral scanner are correlated with the universal tranverse Mercator grid. In the procedure, a series of computer modules was used to make approximations of universal transverse Mercator grid locations for all picture elements from the grid locations of a limited number of known control points and to provide display and digital storage of the data. The software has been written in FORTRAN 4 language for a Varian 70-series computer.

Graham, M. H.↗

DOE OSTI2016

The phenomenology of trapped inflation

Trapped inflation is a mechanism in which particle production from the moving inflaton is the main source of friction in the inflaton equation of motion. The produced fields source inflaton perturbations, which dominate over the vacuum ones. We review the computation of the perturbations performed in the original work and in a successive analysis that makes use of the effective field theory (EFT) of inflation. This second paper employs the power spectrum of the inflaton perturbations obtained in the original work, and obtains a bispectrum which parametrically agrees with that of the original work, even if it originates from a different operator. We show that one approximation used in the original work to compute the correlators of the produced quanta is invalid. We replace this approximation with an exact solution of the system of equations developed in the original work and obtain a different amplitude for the power spectrum of the inflaton perturbations, which has a significant consequence for the allowed region of parameter space in this mechanism. We then show that the operator responsible for the bispectrum in the EFT computation does not arise from the computational scheme developed in the original paper and that the agreement between the bispectra of the two works is also caused by the invalid approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Differentiable Earth mover’s distance for data compression at the high-luminosity LHC

Abstract The Earth mover’s distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms via gradient descent. In this paper, we train a convolutional neural network (CNN) to learn a differentiable, fast approximation of the EMD and demonstrate that it can be used as a substitute for computing-intensive EMD implementations. We apply this differentiable approximation in the training of an autoencoder-inspired neural network (encoder NN) for data compression at the high-luminosity LHC at CERN The goal of this encoder NN is to compress the data while preserving the information related to the distribution of energy deposits in particle detectors. We demonstrate that the performance of our encoder NN trained using the differentiable EMD CNN surpasses that of training with loss functions based on mean squared error.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

Rapid Assessment of Autoignition Propensity in Novel Fuels and Blends

We developed a computational strategy to correlate bulk combustion metrics of novel fuels and blends in the low-temperature autoignition regime with measurements of key combustion intermediates in a small-volume, dilute, high-pressure reactor. We used neural net analysis of a large simulation dataset to obtain an approximate correlation and proposed experimental and computational steps needed to refine such a predictive correlation. We also designed and constructed a high-pressure laboratory apparatus to conduct the proposed measurements and demonstrated its performance on three canonical fuels: n-heptane, i-octane, and dimethyl ether.

10 SYNTHETIC FUELS↗

DOE OSTI2013

System and method for implementing periodic early discard in on-chip buffer memories of network elements

An advance is made over the prior art in accordance with the principles of the present invention that is directed to a new approach for a system and method for a buffer management scheme called Periodic Early Discard (PED). The invention builds on the observation that, in presence of TCP traffic, the length of a queue can be stabilized by selection of an appropriate frequency for packet dropping. For any combination of number of TCP connections and distribution of the respective RTT values, there exists an ideal packet drop frequency that prevents the queue from over-flowing or under-flowing. While the value of the ideal packet drop frequency may quickly change over time and is sensitive to the series of TCP connections affected by past packet losses, and most of all is impossible to compute inline, it is possible to approximate it with a margin of error that allows keeping the queue occupancy within a pre-defined range for extended periods of time. The PED scheme aims at tracking the (unknown) ideal packet drop frequency, adjusting the approximated value based on the evolution of the queue occupancy, with corrections of the approximated packet drop frequency that occur at a timescale that is comparable to the aggregate time constant of the set of TCP connections that traverse the queue.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Single particle spectral function in iron pnictide superconductors within two band model

The newly discovered iron based superconductors have shown a great deal of interest in the condensed matter physics community around the world to explore the experimental and theoretical aspects of electronic properties of these materials to underline the technological potential. These materials have a layered tetragonal crystal structure and generally show small anisotropy. Based on ARPES data to understand the band structure of these systems, we present a theoretical tight binding model and numerical computation of the single particle spectral function within two orbital per site for iron pnictide superconductors. The two band tight binding model Hamiltonian containing various orbitals hopping energies, intra- and inter- band electronic correlations and Hund’s coupling energy in Fe 3d orbitals has been used. The expressions of single particle spectral function have been obtained by employing the Green’s function equation of motion approach within BCS-mean-field approximation. The spectral function is numerically computed at different k-points of Brillouin zone in extended s-wave paring symmetry. It is noticed that the behavior of electronic states is different at different k-points of Brillouin zone and highly influenced by onsite Coulomb interactions. Further, It is predicted that the presence of onsite coulomb correlation suppress the spectral weight close to Fermi level in iron pnictide systems. On the basis of numerical computation we have compared our theoretical results with recent angle resolved photoemission spectroscopic ARPES data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Off-shell vertices in heavy particle effective theories and B → Dπℓν

We study the modifications to decay amplitudes in heavy to heavy semileptonic decays with multiple hadrons in the final state due to intermediate heavy hadrons being off-shell or having a finite width. Combining Heavy Hadron Chiral Perturbation Theory (HHχPT) with a BCFW on-shell factorization formula, we show that these effects induce O (1/M) corrections to the standard results computed in the narrow-width approximation and therefore are important in extracting form factors from data. A combination of perturbative unitarity, analyticity, and reparameterization invariance fully determine these corrections in terms of known Isgur-Wise functions without the need to introduce new form factors. In doing so, we develop a novel technique to compute the boundary term at complex infinity in the BCFW formula for theories with derivatively coupled scalars. While we have used the $\overline{B}$ → Dπℓν decay as an example, these techniques can generally be applied to effective field theories with (multiple) distinct reference vectors. Article PDF

Chiral Lagrangian↗