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.
Linear-scaling time-dependent density-functional theory beyond the Tamm-Dancoff approximation: Obtaining efficiency and accuracy with in situ optimised local orbitals
We present a solution of the full time-dependent density-functional theory (TDDFT) eigenvalue equation in the linear response formalism exhibiting a linear-scaling computational complexity with system size, without relying on the simplifying Tamm-Dancoff approximation (TDA). The implementation relies on representing the occupied and unoccupied subspaces with two different sets of in situ optimised localised functions, yielding a very compact and efficient representation of the transition density matrix of the excitation with the accuracy associated with a systematic basis set. The TDDFT eigenvalue equation is solved using a preconditioned conjugate gradient algorithm that is very memory-efficient. The algorithm is validated on a small test molecule and a good agreement with results obtained from standard quantum chemistry packages is found, with the preconditioner yielding a significant improvement in convergence rates. The method developed in this work is then used to reproduce experimental results of the absorption spectrum of bacteriochlorophyll in an organic solvent, where it is demonstrated that the TDA fails to reproduce the main features of the low energy spectrum, while the full TDDFT equation yields results in good qualitative agreement with experimental data. Furthermore, the need for explicitly including parts of the solvent into the TDDFT calculations is highlighted, making the treatment of large system sizes necessary that are well within reach of the capabilities of the algorithm introduced here. Finally, the linear-scaling properties of the algorithm are demonstrated by computing the lowest excitation energy of bacteriochlorophyll in solution. The largest systems considered in this work are of the same order of magnitude as a variety of widely studied pigment-protein complexes, opening up the possibility of studying their properties without having to resort to any semiclassical approximations to parts of the protein environment.
Hybrid framework for the simulation of stochastic chemical kinetics
Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25]. While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.
Rosseland and Flux Mean Opacities for Compton Scattering
Rosseland mean opacity plays an important role in theories of stellar evolution and X-ray burst models. In the high-temperature regime, when most of the gas is completely ionized, the opacity is dominated by Compton scattering. Our aim here is to critically evaluate previous works on this subject and to compute the exact Rosseland mean opacity for Compton scattering over a broad range of temperature and electron degeneracy parameter. We use relativistic kinetic equations for Compton scattering and compute the photon mean free path as a function of photon energy by solving the corresponding integral equation in the diffusion limit. As a byproduct we also demonstrate the way to compute photon redistribution functions in the case of degenerate electrons. We then compute the Rosseland mean opacity as a function of temperature and electron degeneracy and present useful approximate expressions. We compare our results to previous calculations and find a significant difference in the low-temperature regime and strong degeneracy. We then proceed to compute the flux mean opacity in both free-streaming and diffusion approximations, and show that the latter is nearly identical to the Rosseland mean opacity. We also provide a simple way to account for the true absorption in evaluating the Rosseland and flux mean opacities.
Bayesian Monte-Carlo Evaluation Framework of Differential and Integral Data [Slides]
This presentation discusses the Bayesian Monte Carlo evaluation framework of differential and integral data, specifically in relation to two methods that are based on Bayes theorem, which assumes that all PDFs are normal (Gaussian) and that they use a linear approximation for IBEs. The presentation states that basic components of the MC evaluation framework include the computation of random MC ensemble from ENDF File 32, the simulation of IBEs and R-matrix cross section compared to experimental data, and the computation of weighted averages. It also states that the application to U-233 indicates deviation from the conventional linear approximation. In conclusion, evaluation framework will require MCMC method e.g., Metropolis-Hastings (M.-H.).
Generation and focusing of electron beams with initial transverse-longitudinal correlation
In charged particle beams, one of the roles played by space charge is to couple the transverse and longitudinal dynamics of the beam. This can lead to very complex phenomena which are generally studied using computer simulations. However, in some cases models based on phenomenological or analytic approximations can provide valuable insight into the system behavior. In this paper, we employ such approximations to investigate the conditions under which all the slices of a space charge dominated electron beam with slowly varying current could be focused to a waist with the same radius and at the same location, independent of slice current, and show that this can be accomplished approximately if the initial transverse-longitudinal correlation introduced onto the beam by the electron gun is chosen to compensate for the transverse-longitudinal correlation introduced onto the beam in the drift section. The validity of our approximations is assessed by use of progressively more realistic calculations. We also consider several design elements of electron guns that affect the initial correlations in the beams they generate.
Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms
The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. In this work, we describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.
FINITE-ELEMENT DISTORED WAVE BORN APPROXIMATION FOR SURFACE SCATTERING
FE-DWBA is a software package that computes the x-ray scattering patterns of objects that locate on a surface or buried next to a surface, such as the nano-circuits and nano-patterns of the mask used in the extreme ultraviolet lithography. It can incorporate the dynamical scattering effect (photons scattered multiple times), which is predominant in surface scattering and yield high-fidelity scattering patterns. The application includes surface imaging using x-rays, and critical dimension determination for semiconductor manufacturing.
Thermal Effects on Far-Field Distributed Acoustic Strain-Rate Sensors
Summary Fiber-optic cables cemented outside of the casing of an unconventional well measure crosswell strain changes during fracturing of neighboring wells with low-frequency distributed acoustic sensing (LF-DAS). As a hydraulic fracture intersects an observation well instrumented with fiber-optic cables, the fracture fluid injected at ambient temperatures can cool a section of the sensing fiber. Often, LF-DAS and distributed temperature sensing (DTS) cables are run in tandem, enabling the detection of such cooling events. The increasing use of LF-DAS for characterizing unconventional hydraulic fracture completions demands an investigation of the effects of temperature on the measured strain response by LF-DAS. Researchers have demonstrated that LF-DAS can be used to extract the temporal derivative of temperature for use as a differential-temperature-gradient sensor. However, differential-temperature-gradient sensing is predicated on the ability to filter strain components out of the optical signal. In this work, beginning with an equation for optical phase shift of LF-DAS signals, a model relating strain, temperature, and optical phase shift is explicitly developed. The formula provides insights into the relative strength of strain and temperature effects on the phase shift. The uncertainty in the strain-rate measurements due to thermal effects is estimated. The relationship can also be used to quantify uncertainties in differential-temperature-gradient sensors due to strain perturbations. Additionally, a workflow is presented to simulate the LF-DAS response accounting for both strain and temperature effects. Hydraulic fracture geometries are generated with a 3D fracture simulator for a multistage unconventional completion. The fracture width distributions are imported by a displacement discontinuity method (DDM) program to compute the strain rates along an observation well. An analytic model is used to approximate the temperature in the fracture. Using the derived formulae for optical phase shift, the model outputs are then used to compute the LF-DAS response at a fiber-optic cable, enabling the generation of waterfall plots including both strain and thermal effects. The model results suggest that before, during, and immediately following a fracture intersecting a well instrumented with fiber, the strain on the fiber drives the LF-DAS signal. However, at later times, as completion fluid cools the observation well, the temperature component of the LF-DAS signal can be equal to or exceed the strain component. The modeled results are compared to a published field case in an attempt to enhance the interpretation of LF-DAS waterfall plots. Finally, we propose a sensing configuration to identify the events when “wet fractures” (fractures with fluids) intersect the observation well.
Intermediate scattering functions of a rigid body monoclonal antibody protein in solution studied by dissipative particle dynamic simulation
In the past decade, there was increased research interest in studying internal motions of flexible proteins in solution using Neutron Spin Echo (NSE) as NSE can simultaneously probe the dynamics at the length and time scales comparable to protein domain motions. However, the collective intermediate scattering function (ISF) measured by NSE has the contributions from translational, rotational, and internal motions, which are rather complicated to be separated. Widely used NSE theories to interpret experimental data usually assume that the translational and rotational motions of a rigid particle are decoupled and independent to each other. To evaluate the accuracy of this approximation for monoclonal antibody (mAb) proteins in solution, dissipative particle dynamic computer simulation is used here to simulate a rigid-body mAb for up to about 200 ns. The total ISF together with the ISFs due to only the translational and rotational motions as well as their corresponding effective diffusion coefficients is calculated. The aforementioned approximation introduces appreciable errors to the calculated effective diffusion coefficients and the ISFs. For the effective diffusion coefficient, the error introduced by this approximation can be as large as about 10% even though the overall agreement is considered reasonable. Thus, we need to be cautious when interpreting the data with a small signal change. In addition, the accuracy of the calculated ISFs due to the finite computer simulation time is also discussed.
Parametric matrix models
We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.
A general moment expansion method for stochastic kinetic models
Moment approximation methods are gaining increasing attention for their use in the approximation of the stochastic kinetics of chemical reaction systems. In this paper we derive a general moment expansion method for any type of propensities and which allows expansion up to any number of moments. For some chemical reaction systems, more than two moments are necessary to describe the dynamic properties of the system, which the linear noise approximation is unable to provide. Moreover, also for systems for which the mean does not have a strong dependence on higher order moments, moment approximation methods give information about higher order moments of the underlying probability distribution. We demonstrate the method using a dimerisation reaction, Michaelis-Menten kinetics and a model of an oscillating p53 system. We show that for the dimerisation reaction and Michaelis-Menten enzyme kinetics system higher order moments have limited influence on the estimation of the mean, while for the p53 system, the solution for the mean can require several moments to converge to the average obtained from many stochastic simulations. We also find that agreement between lower order moments does not guarantee that higher moments will agree. Compared to stochastic simulations, our approach is numerically highly efficient at capturing the behaviour of stochastic systems in terms of the average and higher moments, and we provide expressions for the computational cost for different system sizes and orders of approximation. We show how the moment expansion method can be employed to efficiently quantify parameter sensitivity. Finally we investigate the effects of using too few moments on parameter estimation, and provide guidance on how to estimate if the distribution can be accurately approximated using only a few moments.
Two-Loop Four-Gluon Amplitudes from Numerical Unitarity
We present the first numerical computation of two-loop amplitudes based on the unitarity method. As a proof of principle, we compute the four-gluon process in the leading-color approximation. We discuss the new method, analyze its numerical properties, and apply it to reconstruct the analytic form of the amplitudes. The numerical method is universal, and can be automated to provide multiscale two-loop computations for phenomenologically relevant signatures at hadron colliders.
Assessment of low-scaling approximations to the equation of motion coupled-cluster singles and doubles equations
Methods for fast and reliable computation of electronic excitation energies are in short supply, and little is known about their systematic performance. This work reports a comparison of several low-scaling approximations to the equation of motion coupled cluster singles and doubles (EOM–CCSD) and linear-response coupled cluster singles and doubles (LR–CCSD) equations with other single reference methods for computing the vertical electronic transition energies of 11 small organic molecules. The methods, including second order equation-of-motion many-body perturbation theory (EOM–MBPT2) and its partitioned variant, are compared to several valence and Rydberg singlet states. We find that the EOM–MBPT2 method was rarely more than a tenth of an eV from EOM–CCSD calculated energies, yet demonstrates a performance gain of nearly 30%. The partitioned equation-of-motion approach, P–EOM–MBPT2, which is an order of magnitude faster than EOM–CCSD, outperforms the CIS(D) and CC2 in the description of Rydberg states. CC2, on the other hand, excels at describing valence states where P–EOM–MBPT2 does not. The difference between the CC2 and P–EOM–MBPT2 can ultimately be traced back to how each method approximates EOM–CCSD and LR–CCSD. The results suggest that CC2 and P–EOM–MBPT2 are complementary: CC2 is best suited for the description of valence states while P–EOM–MBPT2 proves to be a superior O(N{sup 5}) method for the description of Rydberg states.
Hedging Strategies: Electricity Investment Decisions under Policy Uncertainty
Given uncertainty in long-term carbon reduction goals, how much non-carbon generation should be developed in the near-term? This research investigates the optimal balance between the risk of overinvesting in non-carbon sources that are ultimately not needed and the risk of underinvesting in non-carbon sources and subsequently needing to reduce carbon emissions dramatically. We employ a novel framework that incorporates a computable general equilibrium (CGE) model of the U.S. into a two-stage stochastic approximate dynamic program (ADP) focused on decisions in the electric power sector. We solve the model using an ADP algorithm that is computationally tractable while exploring the decisions and sampling the uncertain carbon limits from continuous distributions. The results of the model demonstrate that an optimal hedge is in the direction of more non-carbon investment in the near-term, in the range of 20–30% of new generation. We also demonstrate that the optimal share of non-carbon generation is increasing in the variance of the uncertainty about the long-term carbon targets, and that with greater uncertainty in the future policy regime, a balanced portfolio of non-carbon, natural gas, and coal generation is desirable.
Higher-order adaptive finite-element methods for orbital-free density functional theory
In the present work, we study various numerical aspects of higher-order finite-element discretizations of the non-linear saddle-point formulation of orbital-free density-functional theory. We first investigate the robustness of viable solution schemes by analyzing the solvability conditions of the discrete problem. We find that a staggered solution procedure where the potential fields are computed consistently for every trial electron-density is a robust solution procedure for higher-order finite-element discretizations. We next study the convergence properties of higher-order finite-element discretizations of orbital-free density functional theory by considering benchmark problems that include calculations involving both pseudopotential as well as Coulomb singular potential fields. Our numerical studies suggest close to optimal rates of convergence on all benchmark problems for various orders of finite-element approximations considered in the present study. We finally investigate the computational efficiency afforded by various higher-order finite-element discretizations, which constitutes the main aspect of the present work, by measuring the CPU time for the solution of discrete equations on benchmark problems that include large Aluminum clusters. In these studies, we use mesh coarse-graining rates that are derived from error estimates and an a priori knowledge of the asymptotic solution of the far-field electronic fields. Our studies reveal a significant 100-1000 fold computational savings afforded by the use of higher-order finite-element discretization, alongside providing the desired chemical accuracy. We consider this study as a step towards developing a robust and computationally efficient discretization of electronic structure calculations using the finite-element basis.
Foreground-Immune Cosmic Microwave Background Lensing with Shear-Only Reconstruction
Cosmic microwave background (CMB) lensing from current and upcoming wide-field CMB experiments such as AdvACT, SPT-3G and Simons Observatory relies heavily on temperature (versus polarization). In this regime, foreground contamination to the temperature map produces significant lensing biases, which cannot be fully controlled by multifrequency component separation, masking, or bias hardening. Here in this Letter, we split the standard CMB lensing quadratic estimator into a new set of optimal “multipole” estimators. On large scales, these multipole estimators reduce to the known magnification and shear estimators, and a new shear B-mode estimator. We leverage the different symmetries of the lensed CMB and extragalactic foregrounds to argue that the shear-only estimator should be approximately immune to extragalactic foregrounds. We build a new method to compute, separately and without noise, the primary, secondary, and trispectrum biases to CMB lensing from foreground simulations. Using this method, we demonstrate that the shear estimator is, indeed, insensitive to extragalactic foregrounds, even when applied to a single-frequency temperature map contaminated with cosmic infrared background, thermal Sunyaev-Zel’dovich, kinematic Sunyaev-Zel’dovich, and radio point sources. This dramatic reduction in foreground biases allows us to include higher temperature multipoles than with the standard quadratic estimator, thus, increasing the total lensing signal-to-noise ratio beyond the quadratic estimator. In addition, magnification-only and shear B-mode estimators provide useful diagnostics for potential residuals.
Linear-depth quantum circuits for loading Fourier approximations of arbitrary functions
Abstract The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2 Dn -point uniform discretization of aD-dimensional function specified by aD-dimensional Fourier series. A free parameter,m, which must be less thann, determines the number of Fourier coefficients, 2 D ( m + 1 ) , used to represent the function. The FSL method uses a quantum circuit of depth at most 2 ( n − 2 ) + ⌈ log 2 ( n − m ) ⌉ + 2 D ( m + 1 ) + 2 − 2 D ( m + 1 ) , which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2 Dn ) points. The FSL circuit consists of at most D n + 2 D ( m + 1 ) + 1 − 1 single-qubit and D n ( n + 1 ) / 2 + 2 D ( m + 1 ) + 1 − 3 D ( m + 1 ) − 2 two-qubit gates; we present a classical compilation algorithm with runtime O ( 2 3 D ( m + 1 ) ) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10 −6 and 10 −3 , respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95 % , as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.