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 1,279 records · Page 71
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Implementation and Performance

Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and substrates. Methods based on many-body perturbation theory, such as the random phase approximation (RPA), have previously been limited due to their computational complexity. However, this is now a surmountable barrier due to the advances in computational power available, in particular through modern GPU-based supercomputers. In this work, we describe the implementation of RPA calculations within BerkeleyGW and show its favorable computational performance on large complex systems relevant for catalysis and electrochemistry applications. Our implementation builds off of the static subspace approximation which, by employing a compressed representation of the frequency dependent polarizability, enables the evaluation of the RPA correlation energy with significant acceleration and systematically controllable accuracy. We find that the computational cost of calculating the RPA correlation energy scales only linearly with system size for systems containing up to 50 thousand bands, and is expected to scale quadratically thereafter. We also show excellent strong scaling results across several supercomputers, demonstrating the performance and portability of this implementation.

algorithmic development↗
DOE OSTI2022

A Fast Time-Stepping Strategy for Dynamical Systems Equipped with a Surrogate Model

Simulation of complex dynamical systems arising in many applications is computationally challenging due to their size and complexity. Model order reduction, machine learning, and other types of surrogate modeling techniques offer cheaper and simpler ways to describe the dynamics of these systems but are inexact and introduce additional approximation errors. In order to overcome the computational difficulties of the full complex models, on one hand, and the limitations of surrogate models, on the other, this work proposes a new accelerated time-stepping strategy that combines information from both. This approach is based on the multirate infinitesimal general-structure additive Runge--Kutta framework. The inexpensive surrogate model is integrated with a small time step to guide the solution trajectory, and the full model is treated with a large time step to occasionally correct for the surrogate model error and ensure convergence. Here, we provide a theoretical error analysis, and several numerical experiments, to show that this approach can be significantly more efficient than using only the full or only the surrogate model for the integration.

Surrogate models↗
DOE OSTI2025

Recent Developments in DFTB+, a Software Package for Efficient Atomistic Quantum Mechanical Simulations

DFTB+ is a flexible, open-source software package developed by its community, designed for fast and efficient atomistic quantum mechanical simulations. It employs various methods that approximate density functional theory (DFT), such as density functional-based tight binding (DFTB) and the extended tight binding (xTB) approach allowing simulations of large systems over extended time scales with reasonable accuracy, while being significantly faster than traditional ab initio methods. In recent years, several new extensions of the DFTB method have been developed and implemented in the DFTB+ program package in order to improve the accuracy and generality of the available simulation results. In this paper, we review those enhancements, show several use case examples and discuss the strengths and limitations of its features.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Exact Fluctuations of Nonequilibrium Steady States from Approximate Auxiliary Dynamics

We describe a framework to reduce the computational effort to evaluate large deviation functions of time integrated observables within nonequilibrium steady states. We do this by incorporating an auxiliary dynamics into trajectory based Monte Carlo calculations, through a transformation of the system's propagator using an approximate guiding function. This procedure importance samples the trajectories that most contribute to the large deviation function, mitigating the exponential complexity of such calculations. Here, we illustrate the method by studying driven diffusion and interacting lattice models in one and two spatial dimensions. Finally, our work offers an avenue to calculate large deviation functions for high dimensional systems driven far from equilibrium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

Algebraic grid generation for wing-fuselage bodies

An algebraic procedure for the generation of boundary-fitted grids about wing-fuselage configurations is presented. A wing-fuselage configuration is specified by cross sections and mathematically represented by Coons' patches. A configuration is divided into sections so that several grid blocks that either adjoin each other or partially overlap each other can be generated, and each grid has six surfaces that map into a computational cube. Grids are first determined on the six boundary surfaces and then in the interior. Grid curves that are on the surface of the configuration are derived using plane-patch intersections, and single-valued functions relating approximate arc lengths along the curves to computational coordinates define the distribution of grid points. The two-boundary technique and transfinite interpolation are used to determine the boundary surface grids that are not on the configuration, and transfinite interpolation with linear blending functions is used to determine the interior grids.

Smith, R. E.↗
DOE OSTI2023

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗
NASA NTRS2009

The Principle of Energetic Consistency

A basic result in estimation theory is that the minimum variance estimate of the dynamical state, given the observations, is the conditional mean estimate. This result holds independently of the specifics of any dynamical or observation nonlinearity or stochasticity, requiring only that the probability density function of the state, conditioned on the observations, has two moments. For nonlinear dynamics that conserve a total energy, this general result implies the principle of energetic consistency: if the dynamical variables are taken to be the natural energy variables, then the sum of the total energy of the conditional mean and the trace of the conditional covariance matrix (the total variance) is constant between observations. Ensemble Kalman filtering methods are designed to approximate the evolution of the conditional mean and covariance matrix. For them the principle of energetic consistency holds independently of ensemble size, even with covariance localization. However, full Kalman filter experiments with advection dynamics have shown that a small amount of numerical dissipation can cause a large, state-dependent loss of total variance, to the detriment of filter performance. The principle of energetic consistency offers a simple way to test whether this spurious loss of variance limits ensemble filter performance in full-blown applications. The classical second-moment closure (third-moment discard) equations also satisfy the principle of energetic consistency, independently of the rank of the conditional covariance matrix. Low-rank approximation of these equations offers an energetically consistent, computationally viable alternative to ensemble filtering. Current formulations of long-window, weak-constraint, four-dimensional variational methods are designed to approximate the conditional mode rather than the conditional mean. Thus they neglect the nonlinear bias term in the second-moment closure equation for the conditional mean. The principle of energetic consistency implies that, to precisely the extent that growing modes are important in data assimilation, this term is also important.

Cohn, Stephen E.↗
DOE OSTI2022

Assessing the theory-data tension in neutrino-induced charged pion production: the effect of final-state nucleon distortion

Pion production on nuclei constitutes a significant part of the total cross section in experiments involving few-GeV neutrinos. Combined analyses of data on deuterium and heavier nuclei points to tensions between the bubble chamber data and the data of the MINER$\nu$A experiment, which are often ascribed to unspecified nuclear effects. To understand the origin of these tensions, a microscopic quantum mechanical framework is needed to compute nuclear matrix elements. We use the local approximation to the relativistic distorted wave impulse approximation (RDWIA) to assess the role of final-state nucleon distortion. To perform this comparison under conditions relevant to neutrino experiments, we compute cross sections for the MINER$\nu$A and T2K charged pion production datasets. The inclusion of nucleon distortion leads to a reduction of the cross section up to 10%, but to no significant change in shape of the flux-averaged cross sections. Results with and without distortion compare favorably to experimental data, with the exception of the low-$Q^2$ MINER$\nu$A $\pi^+$ data. We point out that hydrogen target data from BEBC is also overpredicted at low-$Q^2$, and that the discrepancy is similar in shape and magnitude to what is found in comparison to MINER$\nu$A data. Including nucleon distortion alone cannot explain the overprediction of low-$Q^2$ cross sections measured by MINER$\nu$A. The similar overprediction of BEBC data on hydrogen means that it is impossible to ascribe this discrepancy solely to a nuclear effect. Axial couplings and their $Q^2$ dependence should ideally be derived from more precise data on hydrogen and deuterium.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Transport error estimation using residual Monte Carlo

The residual Monte Carlo (RMC) method is also known in the literature as sequential Monte Carlo and reduced-source Monte Carlo. Given a Monte Carlo method for solving a linear equation and an approximate solution to that system, the residual method enables use of essentially the same Monte Carlo algorithm to directly compute the additive error or “defect” associated with the approximate solution. As the size of the defect decreases relative to the size of the solution, the residual Monte Carlo method becomes increasingly efficient relative to the standard Monte Carlo (SMC) method. Here we present a new RMC algorithm for evaluating the space-angle error in S n radiation transport solutions, and provide computational examples demonstrating that it can be far more efficient than SMC for this purpose. Herein we also describe a particular pitfall that must be avoided if RMC is to be efficient, and explain why the performance of RMC can significantly differ between different transport problems and different quantities of interest for the same problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

An Accurate Method for Computing the Absorption of Solar Radiation by Water Vapor

The method is based upon molecular line parameters and makes use of a far wing scaling approximation and k distribution approach previously applied to the computation of the infrared cooling rate due to water vapor. Taking into account the wave number dependence of the incident solar flux, the solar heating rate is computed for the entire water vapor spectrum and for individual absorption bands. The accuracy of the method is tested against line by line calculations. The method introduces a maximum error of 0.06 C/day. The method has the additional advantage over previous methods in that it can be applied to any portion of the spectral region containing the water vapor bands. The integrated absorptances and line intensities computed from the molecular line parameters were compared with laboratory measurements. The comparison reveals that, among the three different sources, absorptance is the largest for the laboratory measurements.

Chou, M. D.↗
NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; One for producing an approximately optimal Steiner Tree, and one for producing an exact Minimum Directed Spanning tree. These use O(n1/4) rounds of communication and O(n9/4) messages, leading to a quantum speedup in round and message complexity compared to any known algorithms in the classical CONGEST-CLIQUE model (vs O(n1/3) and O(n7/3)). At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Further, these problems can not be sped up in the CONGEST (non-clique) setting, and we characterize the constants involved.

Phillip Kerger↗
DOE OSTI2022

Simulations of frustrated Ising Hamiltonians using quantum approximate optimization

Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Analysis of sparse recovery for Legendre expansions using envelope bound

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using ℓ 1 minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form m ≳ Θ 2 s x log factors have been relied on to determine the minimum number of samples m that guarantees successful reconstruction of s-sparse vectors when the measurement matrix is associated to an orthonormal system. However, in case of sparse Legendre expansions, the uniform bound Θ of Legendre systems is so high that these conditions are unable to provide meaningful guarantees. Here, in this paper, we present an analysis which employs the envelop bound of all Legendre polynomials instead, and prove a new recovery guarantee for s-sparse Legendre expansions, m ≳ Θs 2 x log factors, which is independent of Θ. Arguably, this is the first recovery condition established for orthonormal systems without assuming the uniform boundedness of the sampling matrix. The key ingredient of our analysis is an extension of chaining arguments, recently developed in Bourgain and Chkifa et al., to handle the envelope bound. Furthermore, our recovery condition is proved via restricted eigenvalue property, a less demanding replacement of restricted isometry property which is perfectly suited to the considered scenario. Along the way, we derive simple criteria to detect good sample sets. Our numerical tests show that sets of uniformly sampled points that meet these criteria will perform better recovery on average.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The evaporation of black holes in supergravity

In supergravity, charged rotating black holes are generically driven towards becoming extremal and supersymmetric through the emission of Hawking radiation. Eventually, as the black hole approaches the BPS bound and is close to becoming supersymmetric, quantum gravity corrections become critical to describing the emission of Hawking radiation, making the QFT in curved spacetime approximation inaccurate. In this paper, we compute how such quantum gravity corrections affect the spectrum of Hawking radiation for black holes in $\mathcal{N}$ = 2 supergravity in flatspace. We show that due to such corrections, the spectrum of emitted Hawking radiation for both spin-0 and spin-1/2 particles deviates drastically at low temperatures from the naively expected black-body spectrum. Rather remarkably, the spectrum exhibits a discrete emission line from direct transitions from near-BPS to BPS states, providing the first controlled example where the discreteness of the black hole energies is visible in the emitted Hawking radiation. Similar quantum gravity effects drastically modify the absorption cross-section: BPS black holes are transparent to certain frequencies, while near-BPS black holes appear much larger than the semi-classical prediction.

AdS-CFT Correspondence↗
DOE OSTI2018

First-Principles Investigation of Ferromagnetic, Thermodynamic, Elastic, and Half-Metallic Behavior of ReCrTe and RuCrTe Half-Heusler Alloys

Calculations are realized within the full-potential linearized augmented plane wave (FP-LAPW) computational approach with the generalized gradient approximation (GGA) for the exchange-correlation potential. In this work, we present investigation of structural, electronic, ferromagnetic, elastic, and thermodynamic properties and half-metallic behavior of ReCrTe and RuCrTe compounds. Analysis of band structures and densities of states show the half-metallic ferromagnetic behavior of these compounds. The values of total magnetic moments µ{sub tot} are 1 µ{sub B} per unit cell for ReCrTe and 3 µ{sub B} per unit cell for RuCrTe. The contribution of Cr is the most important. The calculated values of a total magnetic moment nicely follow the rule µ{sub tot} = Z{sub t}− 18. The study of the impacts of strains on the magnetic moment reveals that the two compounds are stable ferromagnetic compounds. RuCrTe compound preserves the half-metallic behavior when the unit cell volume is changed in the range of [ − 4%, 4%], whereas, weak strain destroys the half metallic nature for ReCrTe compound. Using the quasi-harmonic Debye model, the effects of pressure P and temperature T on thermal expansion coefficient, Debye temperature, heat capacity and Grüneisen parameter for these two compounds are investigated for the first time. The study of the elastic constants shows that ReCrTe and RuCrTe are mechanically stable. RuCrTe is stiffer than ReCrTe compounds. The obtained values of Pugh’s ratio B/G and Cauchy pressure (C{sub 12} − C{sub 44}) reveal that ReCrTe and RuCrTe are brittle. The study of the electron charge density and Poisson’s ratio proves that the ionic character dominates the atomic bonding for the two compounds.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

Investigation of Electronic, Magnetic, Thermodynamic, and Thermoelectric Properties of Half-Metallic XLiSn (X = Ce, Nd) Alloys

We have investigated the electronic, magnetic, thermodynamic, and thermoelectric properties of half-Heusler CeLiSn and NdLiSn using density functional theory. The materials crystallize in F 4-bar 3mstructure with ferromagnetic state at optimized lattice parameter of 6.73 Å for CeLiSn and 6.74 Å for NdLiSn. The modified Becke-Johnson potential (mBJ) and generalized gradient approximation (GGA) have been used for computation of band structure, where mBJ shows a perfect half-metallic nature of the bands in both the alloys. The calculated magnetic moment of 1.0 μ{sub B} for CeLiSn and 3.0 μ{sub B} for NdLiSn follow Slater-Pauling rule, with ferromagnetic interactions. The temperature variation of the Seebeck coefficient shows the p-type behavior with room temperature values of 27 μV/K (43 μV/K) for CeLiSn (NdLiSn). Pressure-dependent variation of specific heat, Debye temperature, and Gruneisen parameter were calculated to infer the nature of lattice vibration and stability at high pressures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Localized Pisot Matrices and Joint Approximations of Algebraic Numbers

A development of the simplex-module algorithm for expansion of algebraic numbers in multidimensional continued fractions is proposed. To this end, localized Pisot matrices are constructed, whose eigenvalues with moduli less than one are contained in an interval of small length. Such Pisot matrices generate continued fractions whose convergents are arbitrarily close to the best approximations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

High-Accuracy Mesh-Free Quadrature for Trimmed Parametric Surfaces and Volumes

This work presents a high-accuracy, mesh-free, generalized Stokes theorem-based numerical quadrature scheme for integrating functions over trimmed parametric surfaces and volumes. The algorithm relies on two fundamental steps: (1) We iteratively reduce the dimensionality of integration using the generalized Stokes theorem to line integrals over trimming curves, and (2) we employ numerical antidifferentiation in the generalized Stokes theorem using high-order quadrature rules. Additionally, the scheme achieves exponential convergence up to trimming curve approximation error and has applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order curvilinear meshes, and initialization of multi-material simulations. We compare the quadrature scheme to commonly-used quadrature schemes in the literature and show that our scheme is much more efficient in terms of number of quadrature points used. We provide an open-source implementation of the scheme in MATLAB as part of QuaHOG, a software package for Quadrature of High-Order Geometries.

97 MATHEMATICS AND COMPUTING↗