SEARCH · Search NASA

Results for “Approximation”

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

SourceResearch connectionFrom yearThrough year

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

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Improving the efficiency of G 0 W 0 calculations with approximate spectral decompositions of dielectric matrices

Recently, it was shown that the calculation of quasiparticle energies using the G 0 W 0 approximation can be performed without computing explicitly any virtual electronic states, by expanding the Green function and screened Coulomb interaction in terms of the eigenstates of the static dielectric matrix. Avoiding the evaluation of virtual electronic states leads to improved efficiency and ease of convergence of G 0 W 0 calculations. Here, we propose a further improvement of the efficiency of these calculations, based on an approximation of density-density response functions of molecules and solids. The approximation relies on the calculation of a subset of eigenvectors of the dielectric matrix using the kinetic operator instead of the full Hamiltonian, and it does not lead to any substantial loss of accuracy for the quasiparticle energies. The computational savings introduced by this approximation depend on the system, and they become more substantial as the number of electrons increases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Toward a systematic improvement of the fixed-node approximation in diffusion Monte Carlo for solids—A case study in diamond

While Diffusion Monte Carlo (DMC) is in principle an exact stochastic method for ab initio electronic structure calculations, in practice, the fermionic sign problem necessitates the use of the fixed-node approximation and trial wavefunctions with approximate nodes (or zeros). This approximation introduces a variational error in the energy that potentially can be tested and systematically improved. Here, we present a computational method that produces trial wavefunctions with systematically improvable nodes for DMC calculations of periodic solids. These trial wavefunctions are efficiently generated with the configuration interaction using a perturbative selection made iteratively (CIPSI) method. A simple protocol in which both exact and approximate results for finite supercells are used to extrapolate to the thermodynamic limit is introduced. This approach is illustrated in the case of the carbon diamond using Slater–Jastrow trial wavefunctions including up to one million Slater determinants. Fixed-node DMC energies obtained with such large expansions are much improved, and the fixed-node error is found to decrease monotonically and smoothly as a function of the number of determinants in the trial wavefunction, a property opening the way to a better control of this error. The cohesive energy extrapolated to the thermodynamic limit is in close agreement with the estimated experimental value. Interestingly, this is also the case at the single-determinant level, thus, indicating a very good error cancellation in carbon diamond between the bulk and atomic total fixed-node energies when using single-determinant nodes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2017

Transmutation approximations for the application of hybrid Monte Carlo/deterministic neutron transport to shutdown dose rate analysis

In fusion energy systems (FES) neutrons born from burning plasma activate system components. The photon dose rate after shutdown from resulting radionuclides must be quantified. This shutdown dose rate (SDR) is calculated by coupling neutron transport, activation analysis, and photon transport. The size, complexity, and attenuating configuration of FES motivate the use of hybrid Monte Carlo (MC)/deterministic neutron transport. The Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) method can be used to optimize MC neutron transport for coupled multiphysics problems, including SDR analysis, using deterministic estimates of adjoint flux distributions. When used for SDR analysis, MS-CADIS requires the formulation of an adjoint neutron source that approximates the transmutation process. In this work, transmutation approximations are used to derive a solution for this adjoint neutron source. It is shown that these approximations are reasonably met for typical FES neutron spectra and materials over a range of irradiation scenarios. When these approximations are met, the Groupwise Transmutation (GT)-CADIS method, proposed here, can be used effectively. GT-CADIS is an implementation of the MS-CADIS method for SDR analysis that uses a series of single-energy-group irradiations to calculate the adjoint neutron source. For a simple SDR problem, GT-CADIS provides speedups of 200 100 relative to global variance reduction with the Forward-Weighted (FW)-CADIS method and 9 ± 5 • 10 4 relative to analog. As a result, this work shows that GT-CADIS is broadly applicable to FES problems and will significantly reduce the computational resources necessary for SDR analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Enabling attractive-repulsive potentials in binary-collision-approximation monte-carlo codes for ion-surface interactions

Abstract Binary Collision Approximation (BCA) codes for ion-material interactions, such as SRIM, Tridyn, F-TRIDYN, and SDtrimSP, have historically been limited to screened Coulomb potentials even at low energies due to the difficulty in numerically solving the Distance of Closest Approach (DOCA) problem for attractive-repulsive potentials. Techniques such as direct n-body simulation or modifications to Newton’s method are either prohibitively costly or not guaranteed to work for all potentials. Advanced rootfinding techniques, such as companion matrix solvers, offer a solution. For many attractive-repulsive potentials, however, a companion matrix cannot be used directly, because there is no way to put the associated functions into a monomial basis form. A complementary technique is proxy rootfinding—by finding the best-fit polynomial approximant of a function, the zeros of the approximant can be guaranteed to be close to the zeros of the function. Using the Chebyshev basis and grid offers additional guarantees with regards to the quality of the approximation, the speed of convergence, and the avoidance of Runge’s phenomenon. By finding Chebyshev interpolants and using the Chebyshev-Frobenius companion matrix, the zeros of any real function on a bounded domain can be found. Here we show that using an Adaptive Chebyshev Proxy Rootfinder with Automatic Subdivision (ACPRAS) with appropriate scaling functions, numerical issues presented by attractive-repulsive potentials, including those of scale, can be handled. Using these techniques, we show that it is possible to include any physically reasonable interatomic potential in a BCA code, and to guarantee correctness of the resulting scattering angle calculations.

Materials Science↗

DOE OSTI2021

Solving the Bethe-Salpeter equation on a subspace: Approximations and consequences for low-dimensional materials

It is well known that the ambient environment can dramatically renormalize the quasiparticle gap and exciton binding energies in low-dimensional materials, but the effect of the environment on the energy splitting of the spin-singlet and spin-triplet exciton states is less understood. A prominent effect is the renormalization of the exciton binding energy and optical strength (and hence the optical spectrum) through additional screening of the direct Coulomb term describing the attractive electron-hole interaction in the kernel of the Bethe-Salpeter equation. The repulsive exchange interaction responsible for the singlet-triplet splitting, on the other hand, is unscreened within formal many-body perturbation theory. However, Benedict argued that in practical calculations restricted to a subspace of the full Hilbert space, the exchange interaction should be appropriately screened by states outside of the subspace, the so-called S approximation [L. X. Benedict, Phys. Rev. B 66, 193105 (2002)PRBMDO0163-182910.1103/PhysRevB.66.193105]. Here, we systematically explore the accuracy of the S approximation for different confined systems, including a molecule and heterostructures of semiconducting and metallic layered materials. We show that the S approximation is actually exact in the limit of small exciton binding energies (i.e., small direct term) and can be used to significantly accelerate convergence of the exciton energies with respect to the number of empty states, provided that a particular effective screening consistent with the conventional Tamm-Dancoff approximation is employed. We further find that the singlet-triplet splitting in the energy of the excitons is largely unaffected by the external dielectric environment for most quasi-two-dimensional materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Approximate two-body generating Hamiltonian for the particle-hole Pfaffian wave function

We present two two-body Hamiltonians that approximate the exact particle-hole Pfaffian wave function with their ground states for all the system sizes where this wave function has been numerically constructed to date. The approximate wave functions have high overlap with the original and reproduce well the low-lying entanglement spectrum and structure factor. The approximate generating Hamiltonians are obtained by an optimization procedure where three to four pseudopotentials are varied in the neighbourhood of second Landau level Coulomb interaction or of a noninteracting model. They belong to a finite region in the variational space of Hamiltonians where each point approximately generates the particle-hole Pfaffian. Here we diagonalize the identified Hamiltonians for up to 20 electrons and find that for them the particle-hole Pfaffian shift appears energetically more favorable. The possibility to interpret the data in terms of composite fermions is discussed.

36 MATERIALS SCIENCE↗

DOE OSTI2021

State densities of heavy nuclei in the static-path plus random-phase approximation

We report that nuclear state densities are important inputs to statistical models of compound-nucleus reactions. State densities are often calculated with self-consistent mean-field approximations that do not include important correlations and must be augmented with empirical collective enhancement factors. Here, we benchmark the static-path plus random-phase approximation (SPA + RPA) to the state density in a chain of samarium isotopes 148–155 Sm against exact results (up to statistical errors) obtained with the shell-model Monte Carlo (SMMC) method. The SPA + RPA method incorporates all static fluctuations beyond the mean field together with small-amplitude quantal fluctuations around each static fluctuation. Using a pairing plus quadrupole interaction, we show that the SPA + RPA state densities agree well with the exact SMMC densities for both the even- and odd-mass isotopes. For the even-mass isotopes, we also compare our results with mean-field state densities calculated with the finite-temperature Hartree-Fock-Bogoliubov (HFB) approximation. We find that the SPA + RPA repairs the deficiencies of the mean-field approximation associated with broken rotational symmetry in deformed nuclei and with the violation of particle-number conservation in the pairing condensate. In particular, in deformed nuclei the SPA + RPA reproduces the rotational enhancement of the state density relative to the mean-field state density.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

Validity of the Born approximation for beyond Gaussian weak lensing observables

Accurate forward modeling of weak lensing (WL) observables from cosmological parameters is necessary for upcoming galaxy surveys. Because WL probes structures in the nonlinear regime, analytical forward modeling is very challenging, if not impossible. Numerical simulations of WL features rely on ray tracing through the outputs of N-body simulations, which requires knowledge of the gravitational potential and accurate solvers for light ray trajectories. A less accurate procedure, based on the Born approximation, only requires knowledge of the density field, and can be implemented more efficiently and at a lower computational cost. In this work, we use simulations to show that deviations of the Born-approximated convergence power spectrum, skewness and kurtosis from their fully ray-traced counterparts are consistent with the smallest nontrivial O(Φ 3 ) post-Born corrections (so-called geodesic and lens-lens terms). Our results imply a cancellation among the larger O(Φ 4 ) (and higher order) terms, consistent with previous analytic work. We also find that cosmological parameter bias induced by the Born-approximated power spectrum is negligible even for a LSST-like survey, once galaxy shape noise is considered. When considering higher order statistics such as the κ skewness and kurtosis, however, we find significant bias of up to 2.5σ. Using the LensTools software suite, we show that the Born approximation saves a factor of 4 in computing time with respect to the full ray tracing in reconstructing the convergence.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗

DOE OSTI2017

Approximate Computing Techniques for Iterative Graph Algorithms

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

Panyala, Ajay R.↗

DOE OSTI2020

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Resistive-Aware Linear Approximations for Solving the Optimal Power Flow Problem for Distribution Networks

Although notable progress has been made to solve the Alternate Current (AC) Optimal Power Flow (OPF), the Direct Current (DC) and Decoupled OPF approximations are still preferable in broad scenarios of practical interest. These approximations typically assume that the resistive nature of the lines in the power system is negligible. This work discusses modifications of these assumptions and presents new approximations of the DC and Decoupled OPF in light of distribution systems, in which line resistances may not be negligible. The Enhanced DC (EDC) OPF and Coupled OPF (COPF) approximations are introduced and assessed, presenting favorable results compared to their classic counterparts.

Moutis, Panayiotis↗

DOE OSTI2024

An under-approximation of entropy for elemental multiconfigurational ground state electronic structures

A combinatorial approach has been applied to the allowable permutations of quantum electronic configurations under the constraints of Hund's rule for established ground state configurations toward an under-approximation of electronic structure entropy. Combined with a previously reported over-approximation, the approximations are used in conjunction in an attempt to bracket the upper and lower entropy limits for multiconfigurational ground state electronic structure entropy and compared to known standard molar entropies for the elements. This formality has been used for the application of a classical statistical mechanics methodology to be applied to the discrete sets of quantum mechanical states of Pu in order to calculate orbital occupancies in Pu's multiconfigurational ground state. Without consideration of the relative energies of various possible electronic configurations contributing to the multiconfigurational ground state, the calculations are performed under a general energy degeneracy assumption weighted to the number of permutations for specific configurations. The number of configurations assumed to significantly contribute is gradually constrained in order to approach a low-order approximation of orbital occupancies in Pu that are then compared to experimental and other calculated results from the literature.

Beaux, II, Miles F. (ORCID:000000032192626X)↗

DOE OSTI2022

Statistics of Green's functions on a disordered Cayley tree and the validity of forward scattering approximation

The accuracy of the forward scattering approximation for two-point Green's functions of the Anderson localization model on the Cayley tree is studied. A relationship between the moments of the Green's function and the largest eigenvalue of the linearized transfer-matrix equation is proved in the framework of the supersymmetric functional-integral method. The new large-disorder approximation for this eigenvalue is derived and its accuracy is established. Using this approximation the probability distribution of the two-point Green's function is found and compared with that in the forward scattering approximation (FSA). It is shown that FSA overestimates the role of resonances and thus the probability for the Green's function to be significantly larger than its typical value. The error of FSA increases with increasing the distance between points in a two-point Green's function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2018

Quantum Optimization and Approximation Algorithms

Shor's groundbreaking quantum algorithm for integer factoring provides an exponential speedup over the best-known classical algorithms. In the 20 years since Shor's algorithm was conceived, only a handful of fundamental quantum algorithmic kernels, generally providing modest polynomial speedups over classical algorithms, have been invented. To better understand the potential advantage quantum resources provide over their classical counterparts, one may consider other resources than execution time of algorithms. Quantum Approximation Algorithms direct the power of quantum computing towards optimization problems where quantum resources provide higher-quality solutions instead of faster execution times. We provide a new rigorous analysis of the recent Quantum Approximate Optimization Algorithm, demonstrating that it provably outperforms the best known classical approximation algorithm for special hard cases of the fundamental Maximum Cut graph-partitioning problem. We also develop new types of classical approximation algorithms for finding near-optimal low-energy states of physical systems arising in condensed matter by extending seminal discrete optimization techniques. Our interdisciplinary work seeks to unearth new connections between discrete optimization and quantum information science.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Approximating Joint Chance Constraints in Two-Stage Stochastic Programs

We present various approximations to joint chance constraints arising in two-stage stochastic programming models. Our approximations are derived from three classical inequalities: Markov's inequality, Chebysev's inequality, and Chernoff's bound. We provide preliminary computational results illustrating the quality of our approximation using a two-stage joint-chance-constrained stochastic program from the literature. We also briefly introduce other alternatives for constructing approximations for joint-chance-constrained two-stage programs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Fourier Analysis of the Multilevel QD Method with {alpha}-Approximation For Time-Dependent Radiative Transfer Problems

Thermal radiation transfer (TRT) problems describe interaction of photon radiation with matter. They are defined by the time-dependent radiative transfer (RT) equation for the specific intensity I coupled with the energy balance (EB) equation. This class of problems is characterised by high dimensionality, multiple scales and strong nonlinearity. In this paper we analyze the multilevel quasi-diffusion (QD) method for solving TRT problems. This is a nonlinear method of moments with exact closures. The QD method enables one to reduce dimensionality of the original radiative transfer problem. It is formulated by a nonlinear system of equations consisting of (i) the high-order RT (HORT) equation for the intensity of photon radiation and (ii) low-order equations for the angular and energy moments of the intensity. The nonlinear closures are formulated by means of stable factors. The low-order problem brings the radiative transfer model to the level of multi-physics equations. The multilevel QD (MLQD) method possesses attractive features for efficient multi-physics coupling. To calculate the high-order RT solution we apply the {alpha}-approximation which assumes that the intensity changes exponentially in time over a time step. The {alpha}-approximation leads to the steady-state RT equation with a modified opacity and enables one to avoid storing the high-dimensional solution from the previous time step. The rate of change is evaluated by the solution of the time-dependent low-order QD (LOQD) equations for moments. We note that the HORT equation in the {alpha}-approximation contains an extra nonlinear term. It affects the iterative behaviour of the MLQD method. The obtained computational results indicated that the rate of convergence is slower compared to the rate when the time-dependent HORT is used to calculate the intensity. In this paper we perform an iterative stability analysis of the MLQD method in a discretized form and analyze convergence of outer (transport) iterations on a time step. We consider multigroup TRT problems in 1D slab geometry. The fully implicit scheme is used to discretize equations in time. The HORT equation is approximated with the method of step characteristics. A finite volume method is applied for spatial discretization of multigroup LOQD equations. The grey (one-group) LOQD equations are algebraically consistent with the multigroup LOQD equations. To perform Fourier analysis a model TRT problem in an infinite homogeneous medium is considered. The system of nonlinear equations of the MLQD method is linearized near an equilibrium solution at some given temperature. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗