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,711 records · Page 95

An improved multipole approximation for self-gravity and its importance for core-collapse supernova simulations

Self-gravity computation by multipole expansion is a common approach in problems such as core-collapse and Type Ia supernovae, where single large condensations of mass must be treated. The standard formulation of multipole self-gravity in arbitrary coordinate systems suffers from two significant sources of error, which we correct in the formulation presented in this article. The first source of error is due to the numerical approximation that effectively places grid cell mass at the central point of the cell, then computes the gravitational potential at that point, resulting in a convergence failure of the multipole expansion. We describe a new scheme that avoids this problem by computing gravitational potential at cell faces. The second source of error is due to sub-optimal choice of location for the expansion center, which results in angular power at high multipole l values in the gravitational field, requiring a high—and expensive—value of multipole cutoff l {sub max}. By introducing a global measure of angular power in the gravitational field, we show that the optimal coordinate for the expansion is the square-density-weighted mean location. We subject our new multipole self-gravity algorithm, implemented in the FLASH simulation framework, to two rigorous test problems: MacLaurin spheroids for which exact analytic solutions are known, and core-collapse supernovae. We show that key observables of the core-collapse simulations, particularly shock expansion, proto-neutron star motion, and momentum conservation, are extremely sensitive to the accuracy of the multipole gravity, and the accuracy of their computation is greatly improved by our reformulated solver.

79 ASTRONOMY AND ASTROPHYSICS↗

Surface hopping with a manifold of electronic states. I. Incorporating surface-leaking to capture lifetimes

We investigate the incorporation of the surface-leaking (SL) algorithm into Tully’s fewest-switches surface hopping (FSSH) algorithm to simulate some electronic relaxation induced by an electronic bath in conjunction with some electronic transitions between discrete states. The resulting SL-FSSH algorithm is benchmarked against exact quantum scattering calculations for three one-dimensional model problems. The results show excellent agreement between SL-FSSH and exact quantum dynamics in the wide band limit, suggesting the potential for a SL-FSSH algorithm. Discrepancies and failures are investigated in detail to understand the factors that will limit the reliability of SL-FSSH, especially the wide band approximation. Considering the easiness of implementation and the low computational cost, we expect this method to be useful in studying processes involving both a continuum of electronic states (where electronic dynamics are probabilistic) and processes involving only a few electronic states (where non-adiabatic processes cannot ignore short-time coherence)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic GW -GPU: Rapid Quasi-Particle Energies for Molecules beyond 10,000 Atoms

StochasticGW is a code for computing accurate quasi-particle (QP) energies of molecules and material systems in the GW approximation. StochasticGW utilizes the stochastic Resolution of the Identity (sROI) technique to enable a massively parallel implementation with computational costs that scale semilinearly with system size, allowing the method to access systems with tens of thousands of electrons. Here, we introduce a new implementation, StochasticGW-GPU, for which the main bottleneck steps have been ported to GPUs and give substantial performance improvements over previous versions of the code. We showcase the new code by computing band gaps of hydrogenated silicon clusters (Si x H y ) containing up to 10,001 atoms and 35,144 electrons, and we obtain individual QP energies with a statistical precision of better than ±0.03 eV with times-to-solution of less than 1 h.

Thomas, Phillip S. [Lawrence Berkeley National Lab↗

Semicoherent search strategy for known continuous wave sources in binary systems

We present a method for detection of weak continuous signals from sources in binary systems via the incoherent combination of many short coherently analyzed segments. The main focus of the work is on the construction of a metric on the parameter space for such signals for use in matched-filter based searches. The metric is defined using a maximum likelihood detection statistic applied to a binary orbit phase model including eccentricity. We find that this metric can be accurately approximated by its diagonal form in the regime where the segment length is << the orbital period. Hence, correlations between parameters are effectively removed by the combination of many independent observations. We find that the ability to distinguish signal parameters is independent of the total semicoherent observation span (for the semicoherent span >> the segment length) for all but the orbital angular frequency. Increased template density for this parameter scales linearly with the observation span. We also present two example search schemes. The first use a reparametrized phase model upon which we compute the metric on individual short coherently analyzed segments. The second assumes long >> the orbital period segment lengths from which we again compute the coherent metric and find it to be approximately diagonal. In this latter case we also show that the semicoherent metric is equal to the coherent metric.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large Deviations for Gaussian Diffusions with Delay

Dynamical systems driven by nonlinear delay SDEs with small noise can exhibit important rare events on long timescales. When there is no delay, classical large deviations theory quantifies rare events such as escapes from metastable fixed points. Near such fixed points, one can approximate nonlinear delay SDEs by linear delay SDEs. Here, we develop a fully explicit large deviations framework for (necessarily Gaussian) processes X{sub t} driven by linear delay SDEs with small diffusion coefficients. Our approach enables fast numerical computation of the action functional controlling rare events for X{sub t} and of the most likely paths transiting from X{sub 0}=p to X{sub T}=q. Via linear noise local approximations, we can then compute most likely routes of escape from metastable states for nonlinear delay SDEs. We apply our methodology to the detailed dynamics of a genetic regulatory circuit, namely the co-repressive toggle switch, which may be described by a nonlinear chemical Langevin SDE with delay.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Feynman diagrams for matter wave interferometry

We introduce a new theoretical framework based on Feynman diagrams to compute phase shifts in matter wave interferometry. The method allows for analytic computation of higher order quantum corrections, beyond the traditional semi-classical approximation. These additional terms depend on the finite size of the initial matter wavefunction and/or have higher order dependence on ℏ. We apply the method to compute the response of matter wave interferometers to power law potentials and potentials with an arbitrary spatial dependence. The analytic expressions are validated by comparing to numerical simulations, and estimates are provided for the scale of the quantum corrections to the phase shift response to the gravitational field of the earth, anharmonic trapping potentials, and gravitational fields from local proof masses. We also find that for certain experimentally feasible parameters, these corrections are large enough to be measured and could lead to systematic errors if they are not mitigated. We find that to first order in a spatially dependent potential, quantum corrections vanish when the initial matter wavepacket has spherical symmetry and the potential satisfies Laplace's equation. We anticipate these quantum corrections will be especially important for trapped matter wave interferometers and for free-space matter wave interferometers in the presence of proof masses. These interferometers are becoming increasingly sensitive tools for mobile inertial sensing, gravity surveying, tests of gravity and its interplay with quantum mechanics, and searches for dark energy.

Glick, Jonah [Northwestern U.; Fermilab] (ORCID:00↗

DiaMonD: An Integrated Multifaceted Approach to Mathematics at the Interfaces of Data, Models, and Decisions

The major goal of the project was to invent, analyze, implement, and apply new algorithms to speed up the computational simulation of complex systems in settings in which multiple simulations are needed. The main efforts we undertook are as follows: 1. Develop novel reduced order methods to reduce the costs of simulations, especially in settings (e.g., UQ, inference, optimization and control) for which numerous simulation are needed and also for nonlocal problems (e.g., fractional derivative, anomalous diffusion, nonlocal mechanics) for which lack of sparsity results in more expensive full-order simulation than encountered in partial differential equations settings; rigorous analyses as well as computational tests were carried out, 2. Develop multifidelity methods based on the usage of a variety of models having different fidelities and different costs to accelerate simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, 3. Develop ensemble methods to reduced the costs of simulations again in settings where numerous simulations are needed or are especially expensive; rigorous analyses as well as computational tests were carried out, and 4. Analyze a model for Richardson pair dispersion in turbulent flows and develop discretization methods for the efficient and accurate approximations of the solution of the model; rigorous analyses as well as computational tests were carried out.

97 MATHEMATICS AND COMPUTING↗

Boltzmann-conserving classical dynamics in quantum time-correlation functions: “Matsubara dynamics”

We show that a single change in the derivation of the linearized semiclassical-initial value representation (LSC-IVR or “classical Wigner approximation”) results in a classical dynamics which conserves the quantum Boltzmann distribution. We rederive the (standard) LSC-IVR approach by writing the (exact) quantum time-correlation function in terms of the normal modes of a free ring-polymer (i.e., a discrete imaginary-time Feynman path), taking the limit that the number of polymer beads N → ∞, such that the lowest normal-mode frequencies take their “Matsubara” values. The change we propose is to truncate the quantum Liouvillian, not explicitly in powers of ħ{sup 2} at ħ{sup 0} (which gives back the standard LSC-IVR approximation), but in the normal-mode derivatives corresponding to the lowest Matsubara frequencies. The resulting “Matsubara” dynamics is inherently classical (since all terms O(ħ{sup 2}) disappear from the Matsubara Liouvillian in the limit N → ∞) and conserves the quantum Boltzmann distribution because the Matsubara Hamiltonian is symmetric with respect to imaginary-time translation. Numerical tests show that the Matsubara approximation to the quantum time-correlation function converges with respect to the number of modes and gives better agreement than LSC-IVR with the exact quantum result. Matsubara dynamics is too computationally expensive to be applied to complex systems, but its further approximation may lead to practical methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.

79 ASTRONOMY AND ASTROPHYSICS↗

Using GPU Programming for Inverse Spectroscopy

The Idaho National Laboratory (INL) has developed a detector that relies heavily on computationally expensive inverse spectroscopy algorithms to determine probabilistic three dimensional mappings of the source and its intensity. This inverse spectroscopy algorithm applies to material accountability due to the potential to determine where nuclear sources are present as a function of time and space. And yet because the novel algorithm can become prohibitively expensive on a standard desktop PC, the INL has incorporated new hardware from the commercial graphics community. General programming for graphics processing units (GPUs) is not a new concept. However, the application of GPUs to evidence theory-based inverse spectroscopy is both novel and particularly apropos. Improvements while using a (slightly upgraded) standard PC are approximately three orders of magnitude, making a ten hour computation in less than four seconds. This significantly changes the concept of prohibitively expensive calculations and makes application to materials accountability possible in near real time. Indeed, the sensor collection time is now expected to dominate the time required to determine the source and its intensity, instead of the inverse spectroscopy method.

97 MATHEMATICS AND COMPUTING↗

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.).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The asymptotic behaviour of the solution to a system of differential equations with a small parameter and singular initial point

The initial value problem for a system of nonlinear ordinary differential equations with a small parameter multiplying the highest derivative is investigated. In a neighbourhood of the initial point the asymptotic behaviour of the solution has quite a complicated structure. A uniform asymptotic approximation to the solution up to an arbitrary power of the small parameter is constructed and substantiated. Bibliography: 3 titles.

97 MATHEMATICS AND COMPUTING↗

Local Orthogonal Cutting Method for Computing Medial Curves and Its Biomedical Applications

Medial curves have a wide range of applications in geometric modeling and analysis (such as shape matching) and biomedical engineering (such as morphometry and computer assisted surgery). The computation of medial curves poses significant challenges, both in terms of theoretical analysis and practical efficiency and reliability. In this paper, we propose a definition and analysis of medial curves and also describe an efficient and robust method for computing medial curves. Our approach is based on three key concepts: a local orthogonal decomposition of objects into substructures, a differential geometry concept called the interior center of curvature (ICC), and integrated stability and consistency tests. These concepts lend themselves to robust numerical techniques including eigenvalue analysis, weighted least squares approximations, and numerical minimization, resulting in an algorithm that is efficient and noise resistant. We illustrate the effectiveness and robustness of our approach with some highly complex, large-scale, noisy biomedical geometries derived from medical images, including lung airways and blood vessels. We also present comparisons of our method with some existing methods.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

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.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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.

97 MATHEMATICS AND COMPUTING↗