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,729 records · Page 96
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Explicit solutions of the radiative transport equation in the P{sub 3} approximation

Purpose: Explicit solutions of the monoenergetic radiative transport equation in the P{sub 3} approximation have been derived which can be evaluated with nearly the same computational effort as needed for solving the standard diffusion equation (DE). In detail, the authors considered the important case of a semi-infinite medium which is illuminated by a collimated beam of light. Methods: A combination of the classic spherical harmonics method and the recently developed method of rotated reference frames is used for solving the P{sub 3} equations in closed form. Results: The derived solutions are illustrated and compared to exact solutions of the radiative transport equation obtained via the Monte Carlo (MC) method as well as with other approximated analytical solutions. It is shown that for the considered cases which are relevant for biomedical optics applications, the P{sub 3} approximation is close to the exact solution of the radiative transport equation. Conclusions: The authors derived exact analytical solutions of the P{sub 3} equations under consideration of boundary conditions for defining a semi-infinite medium. The good agreement to Monte Carlo simulations in the investigated domains, for example, in the steady-state and time domains, as well as the short evaluation time needed suggests that the derived equations can replace the often applied solutions of the diffusion equation for the homogeneous semi-infinite medium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2011

Evolved QCD predictions for the meson-photon transition form factors: beyond the semiclassical AdS/QCD approximation

The QCD evolution of the pion distribution amplitude (DA) {phi}{sub {pi}} (x, Q{sup 2}) is computed for several commonly used models. Our analysis includes the nonperturbative form predicted by lightfront holographic QCD, thus combining the nonperturbative bound state dynamics of the pion with the perturbative ERBL evolution of the pion distribution amplitude. We calculate the meson-photon transition form factors for the {pi}{sup 0}, {eta} and {eta}' using the hard-scattering formalism. We point out that a widely-used approximation of replacing {phi} (x; (1 - x)Q) with {phi} (x;Q) in the calculations will unjustifiably reduce the predictions for the meson-photon transition form factors. It is found that the four models of the pion DA discussed give very different predictions for the Q{sup 2} dependence of the meson-photon transition form factors in the region of Q{sup 2} > 30 GeV{sup 2}. More accurate measurements of these transition form factors at the large Q{sup 2} region will be able to distinguish the four models of the pion DA. The rapid growth of the large Q{sup 2} data for the pion-photon transition form factor reported by the BABAR Collaboration is difficult to explain within the current framework of QCD. If the BABAR data for the meson-photon transition form factor for the {pi}{sup 0} is confirmed, it could indicate physics beyond-the-standard model, such as a weakly-coupled elementary C = + axial vector or pseudoscalar z{sup 0} in the few GeV domain, an elementary field which would provide the coupling {gamma}{sup *}{gamma} {yields} z{sup 0} {yields} {pi}{sup 0} at leading twist. Our analysis thus indicates the importance of additional measurements of the pion-photon transition form factor at large Q{sup 2}.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Error Propagation for Response Matrix Methods in the Many Node Limit

The response matrix method has been a useful solution method for radiation transport problems for decades. The method is desirable for many reasons. It can be extended to both fixed source and eigenvalue problems. In addition, a key aspect of the method is a shift of computational expense to a precomputation phase. Methods and codes employing response matrix or response matrix-like methods have enjoyed formidable computational efficiency while solving large problems. However, current applications of the method rely on large node sizes and few nodes to maximize computational efficiency. As part of a desire to make these methods more amenable to applications such as parallel computing in the future, the number of nodes in problems may increase, and node size will decrease. The effect of this change has not been well studied except for a few cases. In the past, it was determined that a poor approximation of angular dependence of flux on node interfaces could lead to large error propagation for fixed source problems, but a newer study indicates that changing node sizes as well as number of nodes poses little challenge for response methods in the eigenvalue case. This paper presents the unintuitive result that for response matrix methods increasing the spatial resolution of the problem may dramatically decrease accuracy - this effect is demonstrated on a simple analytic 1-D benchmark problem. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Characterizing magnetized plasmas with dynamic mode decomposition

Accurate and efficient plasma models are essential to understand and control experimental devices. Existing magnetohydrodynamic or kinetic models are nonlinear and computationally intensive and can be difficult to interpret, while often only approximating the true dynamics. In this work, data-driven techniques recently developed in the field of fluid dynamics are leveraged to develop interpretable reduced-order models of plasmas that strike a balance between accuracy and efficiency. In particular, dynamic mode decomposition (DMD) is used to extract spatio-temporal magnetic coherent structures from the experimental and simulation datasets of the helicity injected torus with steady inductive (HIT-SI) experiment. Three-dimensional magnetic surface probes from the HIT-SI experiment are analyzed, along with companion simulations with synthetic internal magnetic probes. A number of leading variants of the DMD algorithm are compared, including the sparsity-promoting and optimized DMD. Optimized DMD results in the highest overall prediction accuracy, while sparsity-promoting DMD yields physically interpretable models that avoid overfitting. These DMD algorithms uncover several coherent magnetic modes that provide new physical insights into the inner plasma structure. These modes were subsequently used to discover a previously unobserved three-dimensional structure in the simulation, rotating at the second injector harmonic. Finally, using data from probes at experimentally accessible locations, DMD identifies a resistive kink mode, a ubiquitous instability seen in magnetized plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2013

Electromagnetic Simulation of the Near-Field Distribution around a Wind Farm

An efficient approach to compute the near-field distribution around and within a wind farm under plane wave excitation is proposed. To make the problem computationally tractable, several simplifying assumptions are made based on the geometry problem. By comparing the approximations against full-wave simulations at 500 MHz, it is shown that the assumptions do not introduce significant errors into the resulting near-field distribution. The near fields around a 3 × 3 wind farm are computed using the developed methodology at 150 MHz, 500 MHz, and 3 GHz. Both the multipath interference patterns and the forward shadows are predicted by the proposed method.

Yang, Shang-Te↗
DOE OSTI2026

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗
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 OSTI2012

Large-scale Nanostructure Simulations from X-ray Scattering Data On Graphics Processor Clusters

X-ray scattering is a valuable tool for measuring the structural properties of materialsused in the design and fabrication of energy-relevant nanodevices (e.g., photovoltaic, energy storage, battery, fuel, and carbon capture andsequestration devices) that are key to the reduction of carbon emissions. Although today's ultra-fast X-ray scattering detectors can provide tremendousinformation on the structural properties of materials, a primary challenge remains in the analyses of the resulting data. We are developing novelhigh-performance computing algorithms, codes, and software tools for the analyses of X-ray scattering data. In this paper we describe two such HPCalgorithm advances. Firstly, we have implemented a flexible and highly efficient Grazing Incidence Small Angle Scattering (GISAXS) simulation code based on theDistorted Wave Born Approximation (DWBA) theory with C++/CUDA/MPI on a cluster of GPUs. Our code can compute the scattered light intensity from any givensample in all directions of space; thus allowing full construction of the GISAXS pattern. Preliminary tests on a single GPU show speedups over 125x compared tothe sequential code, and almost linear speedup when executing across a GPU cluster with 42 nodes, resulting in an additional 40x speedup compared to usingone GPU node. Secondly, for the structural fitting problems in inverse modeling, we have implemented a Reverse Monte Carlo simulation algorithm with C++/CUDAusing one GPU. Since there are large numbers of parameters for fitting in the in X-ray scattering simulation model, the earlier single CPU code required weeks ofruntime. Deploying the AccelerEyes Jacket/Matlab wrapper to use GPU gave around 100x speedup over the pure CPU code. Our further C++/CUDA optimization deliveredan additional 9x speedup.

36 MATERIALS SCIENCE↗
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↗