Search NASA⌕ Search

SEARCH · Search NASA

Results for “Approximate computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 505 records · Page 28

Fermi–Löwdin orbital self-interaction correction of adsorption energies on transition metal ions

Density functional theory (DFT)-based descriptions of the adsorption of small molecules on transition metal ions are prone to self-interaction errors. Here, we show that such errors lead to a large over-estimation of adsorption energies of small molecules on Cu + , Zn + , Zn 2+ , and Mn + in local spin density approximation (LSDA) and Perdew, Burke, Ernzerhof (PBE) generalized gradient approximation calculations compared to reference values computed using the coupled-cluster with single, doubles, and perturbative triple excitations method. These errors are significantly reduced by removing self-interaction using the Perdew–Zunger self-interaction correction (PZ-SIC) in the Fermi–Löwdin Orbital (FLO) SIC framework. In the case of FLO-PBE, typical errors are reduced to less than 0.1 eV. Furthermore, analysis of the results using DFT energies evaluated on self-interaction-corrected densities [DFT(@FLO)] indicates that the density-driven contributions to the FLO-DFT adsorption energy corrections are roughly the same size in DFT = LSDA and PBE, but the total corrections due to removing self-interaction are larger in LSDA.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast explicit solutions for neutrino-electron scattering: Explicit asymptotic methods

Here, we present results of explicit asymptotic approximations applied to neutrino-electron scattering in a representative model of neutrino population evolution under conditions characteristic of core-collapse supernova explosions or binary neutron star mergers. It is shown that this approach provides stable solutions of these stiff systems of equations, with accuracy and time stepping comparable to that for standard implicit treatments such as backward Euler, fixed point iteration, and Anderson-accelerated fixed point iteration. Because each time step can be computed more rapidly with the explicit asymptotic approximation than with implicit methods, this suggests that algebraically stabilized explicit integration methods could be used to compute neutrino evolution coupled to hydrodynamics more efficiently in stellar explosions and mergers than the methods currently in use.

79 ASTRONOMY AND ASTROPHYSICS↗

Incorporating Flexibility Effects into Metal–Organic Framework Adsorption Simulations Using Different Models

High-throughput calculations based on molecular simulations to predict the adsorption of molecules inside metal–organic frameworks (MOFs) have become a useful complement to experimental efforts to identify promising adsorbents for chemical separations and storage. For computational convenience, all existing efforts of this kind have relied on simulations in which the MOF is approximated as rigid. In this paper, we use extensive adsorption–relaxation simulations that fully include MOF flexibility effects to explore the validity of the rigid framework approximation. We also examine the accuracy of several approximate methods to incorporate framework flexibility that are more computationally efficient than adsorption–relaxation calculations. We first benchmark various models of MOF flexibility for four MOFs with well-established CO 2 experimental consensus isotherms. We then consider a range of adsorption properties, including Henry’s constants, nondilute loadings, and adsorption selectivity, for seven adsorbates in 15 MOFs randomly selected from the CoRE MOF database. Our results indicate that in many MOFs adsorption–relaxation simulations are necessary to make quantitative predictions of adsorption, particularly for adsorption at dilute concentrations, although more standard calculations based on rigid structures can provide useful information. Finally, we investigate whether a correlation exists between the elastic properties of empty MOFs and the importance of including framework flexibility in making accurate predictions of molecular adsorption. Our results did not identify a simple correlation of this type.

36 MATERIALS SCIENCE↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Learning for the Mori--Zwanzig Formalism: A Generalization of the Koopman Learning Framework

A theoretical framework which unifies the conventional Mori--Zwanzig formalism and the approximate Koopman learning of deterministic dynamical systems from noiseless observation is presented. In this framework, the Mori--Zwanzig formalism, developed in statistical mechanics to tackle the hard problem of construction of reduced-order dynamics for high-dimensional dynamical systems, can be considered as a natural generalization of the Koopman description of the dynamical system. We next show that, similar to the approximate Koopman learning methods, data-driven methods can be developed for the Mori--Zwanzig formalism with Mori's linear projection operator. We have developed two algorithms to extract the key operators, the Markov and the memory kernel, using time series of a reduced set of observables in a dynamical system. We have adopted the Lorenz `96 system as a test problem and solved for the above operators. These operators exhibit complex behaviors, which are unlikely to be captured by traditional modeling approaches in Mori--Zwanzig analysis. The nontrivial generalized fluctuation-dissipation relationship, which relates the memory kernel with the two-time correlation statistics of the orthogonal dynamics, was numerically verified as a validation of the solved operators. Here we present numerical evidence that the generalized Langevin equation, a key construct in the Mori--Zwanzig formalism, is more advantageous in predicting the evolution of the reduced set of observables than the conventional approximate Koopman operators.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗