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,567 records · Page 87
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2019

Semi-inclusive deep-inelastic scattering in Wandzura-Wilczek-type approximation

We present the complete cross-section for the production of unpolarized hadrons in semi-inclusive deep-inelastic scattering up to power-suppressed ${\cal O}(1/Q^2)$ terms in the Wandzura--Wilczek-type approximation which consists in systematically assuming that $\bar{q}gq$--terms are much smaller than $\bar{q}q$--correlators. We compute all twist-2 and twist-3 structure functions and the corresponding asymmetries, and discuss the applicability of the Wandzura--Wilczek-type approximations on the basis of available data. We make predictions which can be tested by data from Jefferson Lab, COMPASS, HERMES, and the future Electron-Ion Collider. The results of this paper can be readily used for phenomenology and for event generators, and will help to improve our understanding of the TMD theory beyond leading twist.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2014

Predicting critical temperatures of iron(II) spin crossover materials: Density functional theory plus U approach

A first-principles study of critical temperatures (T{sub c}) of spin crossover (SCO) materials requires accurate description of the strongly correlated 3d electrons as well as much computational effort. This task is still a challenge for the widely used local density or generalized gradient approximations (LDA/GGA) and hybrid functionals. One remedy, termed density functional theory plus U (DFT+U) approach, introduces a Hubbard U term to deal with the localized electrons at marginal computational cost, while treats the delocalized electrons with LDA/GGA. Here, we employ the DFT+U approach to investigate the T{sub c} of a pair of iron(II) SCO molecular crystals (α and β phase), where identical constituent molecules are packed in different ways. We first calculate the adiabatic high spin-low spin energy splitting ΔE{sub HL} and molecular vibrational frequencies in both spin states, then obtain the temperature dependent enthalpy and entropy changes (ΔH and ΔS), and finally extract T{sub c} by exploiting the ΔH/T − T and ΔS − T relationships. The results are in agreement with experiment. Analysis of geometries and electronic structures shows that the local ligand field in the α phase is slightly weakened by the H-bondings involving the ligand atoms and the specific crystal packing style. We find that this effect is largely responsible for the difference in T{sub c} of the two phases. This study shows the applicability of the DFT+U approach for predicting T{sub c} of SCO materials, and provides a clear insight into the subtle influence of the crystal packing effects on SCO behavior.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Enhancing ACPF Analysis: Integrating Newton-Raphson Method with Gradient Descent and Computational Graphs

This paper presents a new method for enhancing Alternating Current Power Flow (ACPF) analysis. The method integrates the Newton-Raphson (NR) method with Enhanced-Gradient Descent (GD) and computational graphs. The integration of renewable energy sources in power systems introduces variability and unpredictability, and this method addresses these challenges. It leverages the robustness of NR for accurate approximations and the flexibility of GD for handling variable conditions, all without requiring Jacobian matrix inversion. Furthermore, computational graphs provide a structured and visual framework that simplifies and systematizes the application of these methods. The goal of this fusion is to overcome the limitations of traditional ACPF methods and improve the resilience, adaptability, and efficiency of modern power grid analyses. We validate the effectiveness of our advanced algorithm through comprehensive testing on established IEEE benchmark systems. Furthermore, our findings demonstrate that our approach not only speeds up the convergence process but also ensures consistent performance across diverse system states, representing a significant advancement in power flow computation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Status of Multiple Channel Fuel Performance Capabilities Within the SAS4A/SASSYS-1 Safety Analysis Software

SAS4A/SASSYS-1 (SAS) is a fast-running simulation tool used to perform deterministic analysis of anticipated events as well as design basis and beyond design basis accidents for advanced liquid-metal-cooled nuclear reactors. It is a critical element of safety analysis capabilities for the U.S. Department of Energy and is utilized within industry to perform the transient safety analyses required to support the licensing of Liquid Metal-cooled Fast Reactors (LMFRs). Although SAS is exceptionally fast for most transient scenarios, fuel performance calculations, along with the associated pre-transient characterization of the fuel pin, may be required for transient scenarios where fuel pin failure is hypothesized. Both the pre-transient characterization and the transient fuel performance calculation are necessary to properly quantify margins to potential fuel failure and assess the time spent potentially exceeding such margins during events. While safety analysis calculations with fuel performance models provide a more detailed characterization of the reactor during a transient, the pre-transient characterization can be time-consuming and computationally expensive. Often, large numbers of fuel pins have been exposed to similar pre-transient irradiation conditions. Similarly, the same pre-transient fuel characterization may be applicable to numerous transient conditions. This provides an opportunity to optimize the SAS computational framework such that pre-transient fuel characterization can be shared across multiple channels (fuel pins) and across multiple simulations, thus dramatically reducing overall computational costs. This report summarizes progress toward enhancing the SAS computational framework to support shared, multiple channel fuel performance characterizations intended to significantly reduce computational costs. Preliminary testing has shown that the computational time saved by using the pre-transient sharing capability is approximately equal to the time it takes to perform the pre-transient characterization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2019

Experimental Implementation of a Quantum Autoencoder via Quantum Adders

Abstract Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it is proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, the experimental implementation of this proposal in the Rigetti cloud quantum computer is carried out employing up to three qubits. The experimental fidelities are in good agreement with the theoretical prediction, thus proving the feasibility to realize quantum autoencoders via quantum adders in state‐of‐the‐art superconducting quantum technologies.

Ding, Yongcheng↗
DOE OSTI2019

Computational Investigation of Aqueous Phase Effects on the Dehydrogenation and Dehydroxylation of Polyols over Pt(111)

Prediction of solvation effects on the kinetics of elementary reactions occurring at metal–water interfaces is of high importance for the rational design of catalysts for the biomass and electrocatalysis communities. A lack of knowledge of the reliability of various computational solvation schemes for processes on metal surfaces is currently a limiting factor. Using a multilevel quantum mechanical/molecular mechanical (QM/MM) description of the potential energy surface, we determined characteristic time and length scales for typical free-energy perturbation (FEP) calculations of bond cleavages in ethylene glycol, a sugar surrogate molecule, over Pt(111). Our approach is based on our explicit solvation model for metal surfaces and the repetition of FEP calculations to estimate confidence intervals. Results indicate that aqueous phase effects on the free energies of elementary processes can be determined with 95% confidence intervals from limited configuration space sampling and the fixed charge approximation used in the QM/MM-FEP methodology of smaller 0.1 eV. Next, we computed the initial O–H, C–H, and C–OH bond cleavages in ethylene glycol over Pt(111) in liquid water utilizing two different metal–water interaction potentials. Our calculations predict that aqueous phase effects are small (<0.1 eV) for the C–H bond cleavage and the activation barrier of the C–OH bond cleavage. In contrast, solvation effects are large (>0.35 eV) for the O–H bond cleavage and the reaction free energy of the C–OH bond scission. While the choice of a different Pt–water force field can lead to differences in predicted solvation effects of up to 0.2 eV, the differences are usually smaller (<0.1 eV), and the trends are always the same. In contrast, implicit solvation methods appear to currently not be able to reliably describe solvation effects originating from hydrogen bonding for metal surfaces even qualitatively.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

A time-dependent neutron transport method of characteristics formulation with time derivative propagation

A new time-dependent Method of Characteristics (MOC) formulation for nuclear reactor kinetics was developed utilizing angular flux time-derivative propagation. This method avoids the requirement of storing the angular flux at previous points in time to represent a discretized time derivative; instead, an equation for the angular flux time derivative along 1D spatial characteristics is derived and solved concurrently with the 1D transport characteristic equation. This approach allows the angular flux time derivative to be recast principally in terms of the neutron source time derivatives, which are approximated to high-order accuracy using the backward differentiation formula (BDF). This approach, called Source Derivative Propagation (SDP), drastically reduces the memory requirements of time-dependent MOC relative to methods that require storing the angular flux. An SDP method was developed for 2D and 3D applications and implemented in the computer code DeCART in 2D. DeCART was used to model two reactor transient benchmarks: a modified TWIGL problem and a C5G7 transient. The SDP method accurately and efficiently replicated the solution of the conventional time-dependent MOC method using two orders of magnitude less memory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team

Here we present an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators. The problem aims to find a sequence of targets for each robot to visit and schedule the tasks at the targets with the human operators such that each target is visited exactly once by some robot, the scheduling constraints are satisfied and the maximum mission time of any robot is minimum. This problem is a generalization of the single Traveling Salesman Problem and is NP-Hard. Given k robots and m human operators, an algorithm is developed for solving the TASSP with an approximation ratio equal to 5/2- 1/k when m ≥ k and equal to 7/2 -1/k otherwise. Computational results are also presented to corroborate the performance of the proposed algorithm.

42 ENGINEERING↗
DOE OSTI2017

Magnetic Helicities and Dynamo Action in Magneto-rotational Turbulence

We examine the relationship between magnetic flux generation, taken as an indicator of large-scale dynamo action, and magnetic helicity, computed as an integral over the dynamo volume, in a simple dynamo. We consider dynamo action driven by magneto-rotational turbulence (MRT) within the shearing-box approximation. We consider magnetically open boundary conditions that allow a flux of helicity in or out of the computational domain. We circumvent the problem of the lack of gauge invariance in open domains by choosing a particular gauge—the winding gauge—that provides a natural interpretation in terms of the average winding number of pairwise field lines. We use this gauge precisely to define and measure the helicity and the helicity flux for several realizations of dynamo action. We find in these cases that the system as a whole does not break reflectional symmetry and that the total helicity remains small even in cases when substantial magnetic flux is generated. We find no particular connection between the generation of magnetic flux and the helicity or the helicity flux through the boundaries. We suggest that this result may be due to the essentially nonlinear nature of the dynamo processes in MRT.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Uncertainty-aware molecular dynamics from Bayesian active learning for phase transformations and thermal transport in SiC

Abstract Machine learning interatomic force fields are promising for combining high computational efficiency and accuracy in modeling quantum interactions and simulating atomistic dynamics. Active learning methods have been recently developed to train force fields efficiently and automatically. Among them, Bayesian active learning utilizes principled uncertainty quantification to make data acquisition decisions. In this work, we present a general Bayesian active learning workflow, where the force field is constructed from a sparse Gaussian process regression model based on atomic cluster expansion descriptors. To circumvent the high computational cost of the sparse Gaussian process uncertainty calculation, we formulate a high-performance approximate mapping of the uncertainty and demonstrate a speedup of several orders of magnitude. We demonstrate the autonomous active learning workflow by training a Bayesian force field model for silicon carbide (SiC) polymorphs in only a few days of computer time and show that pressure-induced phase transformations are accurately captured. The resulting model exhibits close agreement with both ab initio calculations and experimental measurements, and outperforms existing empirical models on vibrational and thermal properties. The active learning workflow readily generalizes to a wide range of material systems and accelerates their computational understanding.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Efficient surrogate modeling methods for large-scale Earth system models based on machine-learning techniques

Abstract. Improving predictive understanding of Earth system variability and change requires data–model integration. Efficient data–model integration for complex models requires surrogate modeling to reduce model evaluation time. However, building a surrogate of a large-scale Earth system model (ESM) with many output variables is computationally intensive because it involves a large number of expensive ESM simulations. In this effort, we propose an efficient surrogate method capable of using a few ESM runs to build an accurate and fast-to-evaluate surrogate system of model outputs over large spatial and temporal domains. We first use singular value decomposition to reduce the output dimensions and then use Bayesian optimization techniques to generate an accurate neural network surrogate model based on limited ESM simulation samples. Our machine-learning-based surrogate methods can build and evaluate a large surrogate system of many variables quickly. Thus, whenever the quantities of interest change, such as a different objective function, a new site, and a longer simulation time, we can simply extract the information of interest from the surrogate system without rebuilding new surrogates, which significantly reduces computational efforts. We apply the proposed method to a regional ecosystem model to approximate the relationship between eight model parameters and 42 660 carbon flux outputs. Results indicate that using only 20 model simulations, we can build an accurate surrogate system of the 42 660 variables, wherein the consistency between the surrogate prediction and actual model simulation is 0.93 and the mean squared error is 0.02. This highly accurate and fast-to-evaluate surrogate system will greatly enhance the computational efficiency of data–model integration to improve predictions and advance our understanding of the Earth system.

58 GEOSCIENCES↗
DOE OSTI2021

SGD-Net: Efficient Model-Based Deep Learning with Theoretical Guarantees

Deep unfolding networks have recently gained popularity for solving imaging inverse problems. However, the computational and memory complexity of data-consistency layers within traditional deep unfolding networks scales with the number of measurements, limiting their applicability to large-scale imaging inverse problems. We propose SGD-Net as a new methodology for improving the efficiency of deep unfolding through stochastic approximations of the data-consistency layers. Our theoretical analysis shows that SGD-Net can be trained to approximate batch deep unfolding networks to an arbitrary precision. Our simulations on intensity diffraction tomography and sparse-view computed tomography show that SGD-Net can match the performance of the traditional batch network at a fraction of training and testing complexity.Deep unfolding networks have recently gained popularity for solving imaging inverse problems. However, the computational and memory complexity of data-consistency layers within traditional deep unfolding networks scales with the number of measurements, limiting their applicability to large-scale imaging inverse problems. We propose SGD-Net as a new methodology for improving the efficiency of deep unfolding through stochastic approximations of the data-consistency layers. Our theoretical analysis shows that SGD-Net can be trained to approximate batch deep unfolding networks to an arbitrary precision. Our simulations on intensity diffraction tomography and sparse-view computed tomography show that SGD-Net can match the performance of the traditional batch network at a fraction of training and testing complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Likelihood-informed dimension reduction for nonlinear inverse problems

The intrinsic dimensionality of an inverse problem is affected by prior information, the accuracy and number of observations, and the smoothing properties of the forward operator. From a Bayesian perspective, changes from the prior to the posterior may, in many problems, be confined to a relatively low-dimensional subspace of the parameter space. We present a dimension reduction approach that defines and identifies such a subspace, called the 'likelihood-informed subspace' (LIS), by characterizing the relative influences of the prior and the likelihood over the support of the posterior distribution. This identification enables new and more efficient computational methods for Bayesian inference with nonlinear forward models and Gaussian priors. In particular, we approximate the posterior distribution as the product of a lower-dimensional posterior defined on the LIS and the prior distribution marginalized onto the complementary subspace. Markov chain Monte Carlo sampling can then proceed in lower dimensions, with significant gains in computational efficiency. We also introduce a Rao–Blackwellization strategy that de-randomizes Monte Carlo estimates of posterior expectations for additional variance reduction. We demonstrate the efficiency of our methods using two numerical examples: inference of permeability in a groundwater system governed by an elliptic PDE, and an atmospheric remote sensing problem based on Global Ozone Monitoring System (GOMOS) observations.

42 ENGINEERING↗
DOE OSTI2022

Mapping Thermoelectric Transport in a Multicomponent Alloy Space

Abstract Interest in high entropy alloy thermoelectric materials is predicated on achieving ultralow lattice thermal conductivity κ L through large compositional disorder. However, here it is shown that for a given mechanism, such as mass contrast phonon scattering, κ L will be minimized along the binary alloy with highest mass contrast, such that adding an intermediate mass atom to increase atomic disorder can increase thermal conductivity. Only when each component adds an independent scattering mechanism (such as adding strain fluctuation to an existing mass fluctuation) is there a benefit. In addition, both charge carriers and heat‐carrying phonons are known to experience scattering due to alloying effects, leading to a trade‐off in thermoelectric performance. Analytic transport models are applied, based on perturbation and effective medium theories, to predict how alloy scattering will affect the thermal and electronic transport across the full compositional range of several pseudo‐ternary and pseudo‐quaternary alloy systems. To do so, a multicomponent extension is demonstrated to both thermal and electronic binary alloy scattering models based on the virtual crystal approximation. Finally, it is shown that common functional forms used in computational thermodynamics can be applied to this problem to further generalize the scattering behavior that is modeled.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Sm 2 Ru 3 Sn 5 : A Noncentrosymmetric Cubic Member of the Ln 2 M 3 X 5 Family

An optimized synthetic method is presented for Sm 2 Ru 3 Sn 5 and investigate its physical properties and electronic structure. Sm 2 Ru 3 Sn 5 is prepared by arc-melting stoichiometric ratios of the elements and is confirmed by single crystal and powder X-ray diffraction. An antiferromagnetic transition is observed at T N = 3.8 K. A modified Curie-Weiss fit to the data in the range 50–150 K yields a Curie-Weiss temperature: θ CW = −36.6 K and an effective magnetic moment: μ eff = 0.83 μ B , in agreement with a Sm 3+ oxidation state. Field-dependent magnetization up to H = 7 T at 2 K shows a maximum response of 0.06 μ B , which is significantly lower than the expected Sm 3+ saturation moment (0.71 μ B ). Resistivity measurements indicate metallic behavior, and analysis of the magnetic entropy from the heat capacity reveals a doublet ground state due to crystal electric field splitting. The electronic structure and density of states are calculated with density function theory and further supported by the local density approximation with dynamical mean-field theory. Finally, the experimental and computational results highlight localized Sm 3+ moments and suggest a possible interplay between Ruddelman–Kitel–Kasuya–Yosida and Kondo interactions, positioning Sm 2 Ru 3 Sn 5 as a promising material for studying topology and complex physical phenomena.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗