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 109 records · Page 6

Eliashberg theory of phonon-mediated superconductivity — When it is valid and how it breaks down

We analyze the validity of Eliashberg theory of phonon-mediated superconductivity in 2D systems in light of recent extensive Monte-Carlo studies of the Holstein model. Conventional wisdom says that Eliashberg theory is applicable as long as vertex corrections remain small. For small ratio of the phonon energy Ω 0 and the Fermi energy E F , this condition is supposed to hold even when the dimensionless electron–phonon coupling λ is larger than one, i.e., in the strong coupling regime. A comparison between various quantities computed in the Migdal approximation and those computed by Quantum Monte Carlo prove that this belief is wrong, and we identify analytically some of the ways in which this breakdown occurs for various ‘‘normal state’’ properties at λ = λ cr , where λ cr = O(1). Here, the breakdown occurs at temperatures high enough that neither superconducting nor charge–density wave correlations extend over any significant range of distances, so it cannot be associated with the onset of an instability toward any of the relevant ordered ground-states — rather it is associated with the local physics of classical bipolaron formation. Still, we show that certain properties, including the superconducting Tc and the superconducting gap structure below T c , can be accurately inferred from the strong-coupling limit of Eliashberg theory at λ ≤ λ cr .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Continuous Dependence on Translations of the Independent Variable for Solutions of Boundary-Value Problems for Differential-Difference Equations

We consider boundary-value problems for differential-difference operators with perturbations in translations of the independent variable. We prove that the family of differential-difference operators is positive definite uniformly with respect to translations of the independent variable. Solutions of such problems depend continuously on these translations. We consider the coercivity problem for differential-difference operators with incommensurable translations of the independent variable and study the approximation of such operators by rational operators.

97 MATHEMATICS AND COMPUTING↗

A Stochastic Intracellular Model of Anthrax Infection With Spore Germination Heterogeneity

We present a stochastic mathematical model of the intracellular infection dynamics of Bacillus anthracis in macrophages. Following inhalation of B. anthracis spores, these are ingested by alveolar phagocytes. Ingested spores then begin to germinate and divide intracellularly. This can lead to the eventual death of the host cell and the extracellular release of bacterial progeny. Some macrophages successfully eliminate the intracellular bacteria and will recover. Here, a stochastic birth-and-death process with catastrophe is proposed, which includes the mechanism of spore germination and maturation of B. anthracis . The resulting model is used to explore the potential for heterogeneity in the spore germination rate, with the consideration of two extreme cases for the rate distribution: continuous Gaussian and discrete Bernoulli. We make use of approximate Bayesian computation to calibrate our model using experimental measurements from in vitro infection of murine peritoneal macrophages with spores of the Sterne 34F2 strain of B. anthracis . The calibrated stochastic model allows us to compute the probability of rupture, mean time to rupture, and rupture size distribution, of a macrophage that has been infected with one spore. We also obtain the mean spore and bacterial loads over time for a population of cells, each assumed to be initially infected with a single spore. Our results support the existence of significant heterogeneity in the germination rate, with a subset of spores expected to germinate much later than the majority. Furthermore, in agreement with experimental evidence, our results suggest that most of the spores taken up by macrophages are likely to be eliminated by the host cell, but a few germinated spores may survive phagocytosis and lead to the death of the infected cell. Finally, we discuss how this stochastic modelling approach, together with dose-response data, allows us to quantify and predict individual infection risk following exposure.

59 BASIC BIOLOGICAL SCIENCES↗

Inferring pesticide toxicity to honey bees from a field‐based feeding study using a colony model and Bayesian inference

Abstract Honey bees are crucial pollinators for agricultural crops but are threatened by a multitude of stressors including exposure to pesticides. Linking our understanding of how pesticides affect individual bees to colony‐level responses is challenging because colonies show emergent properties based on complex internal processes and interactions among individual bees. Agent‐based models that simulate honey bee colony dynamics may be a tool for scaling between individual and colony effects of a pesticide. The U.S. Environmental Protection Agency (USEPA) and U.S. Department of Agriculture (USDA) are developing the VarroaPop + Pesticide model, which simulates the dynamics of honey bee colonies and how they respond to multiple stressors, including weather, Varroa mites, and pesticides. To evaluate this model, we used Approximate Bayesian Computation to fit field data from an empirical study where honey bee colonies were fed the insecticide clothianidin. This allowed us to reproduce colony feeding study data by simulating colony demography and mortality from ingestion of contaminated food. We found that VarroaPop + Pesticide was able to fit general trends in colony population size and structure and reproduce colony declines from increasing clothianidin exposure. The model underestimated adverse effects at low exposure (36 µg/kg), however, and overestimated recovery at the highest exposure level (140 µg/kg), for the adult and pupa endpoints, suggesting that mechanisms besides oral toxicity‐induced mortality may have played a role in colony declines. The VarroaPop + Pesticide model estimates an adult oral LD 50 of 18.9 ng/bee (95% CI 10.1–32.6) based on the simulated feeding study data, which falls just above the 95% confidence intervals of values observed in laboratory toxicology studies on individual bees. Overall, our results demonstrate a novel method for analyzing colony‐level data on pesticide effects on bees and making inferences on pesticide toxicity to individual bees.

59 BASIC BIOLOGICAL SCIENCES↗

Improved uncertainty quantification in nondestructive assay for nonproliferation

This paper illustrates methods to improve uncertainty quantification (UQ) for non-destructive assay (NDA) measurements used in nuclear nonproliferation. First, it is shown that current bottom-up UQ applied to calibration data is not always adequate, for three main reasons: (1) Because there are errors in both the predictors and the response, calibration involves a ratio of random quantities, and calibration data sets in NDA usually consist of only a modest number of samples (3–10); therefore, asymptotic approximations involving quantities needed for UQ such as means and variances are often not sufficiently accurate; (2) Common practice overlooks that calibration implies a partitioning of total error into random and systematic error, and (3) In many NDA applications, test items exhibit non-negligible departures in physical properties from calibration items, so model-based adjustments are used, but item-specific bias remains in some data. Therefore, improved bottom-up UQ using calibration data should predict the typical magnitude of item-specific bias, and the suggestion is to do so by including sources of item-specific bias in synthetic calibration data that is generated using a combination of modeling and real calibration data. Second, for measurements of the same nuclear material item by both the facility operator and international inspectors, current empirical (top-down) UQ is described for estimating operator and inspector systematic and random error variance components. A Bayesian alternative is introduced that easily accommodates constraints on variance components, and is more robust than current top-down methods to the underlying measurement error distributions.

97 MATHEMATICS AND COMPUTING↗

MISO - Mixed Integer Surrogate Optimization

MISO is an optimization framework for solving computationally expensive mixed-integer, black-box, global optimization problems. MISO uses surrogate models to approximate the computationally expensive objective function. Hence, derivative information, which is generally unavailable for black-box simulation objective functions, is not needed. MISO allows the user to choose the initial experimental design strategy, the type of surrogate model, and the sampling strategy.

Mueller, Juliane↗

Big Data Meets Quantum Chemistry Approximations: The Δ-Machine Learning Approach

Chemically accurate and comprehensive studies of the virtual space of all possible molecules are severely limited by the computational cost of quantum chemistry. Here we introduce a composite strategy that adds machine learning corrections to computationally inexpensive approximate legacy quantum methods. After training, highly accurate predictions of enthalpies, free energies, entropies, and electron correlation energies are possible, for significantly larger molecular sets than used for training. For thermochemical properties of up to 16k isomers of C 7 H 10 O 2 we present numerical evidence that chemical accuracy can be reached. We also predict electron correlation energy in post Hartree-Fock methods, at the computational cost of HartreeFock, and we establish a qualitative relationship between molecular entropy and electron correlation. The transferability of our approach is demonstrated, using semiempirical quantum chemistry and machine learning models trained on 1 and 10% of 134k organic molecules, to reproduce enthalpies of all remaining molecules at density functional theory level of accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

QUBO formulations for training machine learning models

Abstract Training machine learning models on classical computers is usually a time and compute intensive process. With Moore’s law nearing its inevitable end and an ever-increasing demand for large-scale data analysis using machine learning, we must leverage non-conventional computing paradigms like quantum computing to train machine learning models efficiently. Adiabatic quantum computers can approximately solve NP-hard problems, such as the quadratic unconstrained binary optimization (QUBO), faster than classical computers. Since many machine learning problems are also NP-hard, we believe adiabatic quantum computers might be instrumental in training machine learning models efficiently in the post Moore’s law era. In order to solve problems on adiabatic quantum computers, they must be formulated as QUBO problems, which is very challenging. In this paper, we formulate the training problems of three machine learning models—linear regression, support vector machine (SVM) and balanced k-means clustering—as QUBO problems, making them conducive to be trained on adiabatic quantum computers. We also analyze the computational complexities of our formulations and compare them to corresponding state-of-the-art classical approaches. We show that the time and space complexities of our formulations are better (in case of SVM and balanced k-means clustering) or equivalent (in case of linear regression) to their classical counterparts.

97 MATHEMATICS AND COMPUTING↗

The Thermophysical Properties of TcO2

Technetium-99 is a highly radioactive isotope with a long half-life that is common in nuclear waste. It volatizes at a low temperature, which poses a significant challenge to the clean-up and containment processes. Due to difficulties in purifying technetium compounds, their thermophysical properties have not been measured or calculated. Here, first principle methods are used along with the quasi quasi-harmonic harmonic approximation to compute the Debye temperature, volumetric thermal expansion coefficient, bulk modulus, and heat capacity of rutile TcO2 for temperatures ranging from 0 to 1500 K and applied pressures ranging from 0 to 255 GPa. The computed atomic structures agree well with the results from diffraction measurements. The computed thermophysical properties are in the neighborhood of other rutile metal oxides and, in particular, are within approximately 10–13% of rutile ReO2, which is frequently used as a substitute for TcO2 in experimental studies.

Zhong, Hong↗

TWST Cloud Properties (COD, droplet effective radius, and thermodynamic phase). SAIL, AMF2, 2022-2023.

The dataset consists of calibrated zenith shortwave spectral radiances (440-1700 nm) and cloud optical depth (COD) retrievals approximately every second. Retrievals of cloud droplet effective radius and thermodynamic phase are currently done offline, but some of these retrievals are included in the dataset. Effective radius and phase are included for days with periods of sufficiently high COD. Effective radius and phase retrievals in the data set were computed at approximately 5-10 second intervals to reduce computation time. The retrievals can be performed at the full sample rate. The field of view is 0.5 degree.

54 ENVIRONMENTAL SCIENCES↗

Thorium and Rare Earth Monoxides and Related Phases

Thorium was a part of energy infrastructure in the 19th century due to the refractory and electronic properties of its dioxide. It will be a part of future energy infrastructure as the most abundant energy reserve based on nuclear fission. This paper discusses the solid-state chemistry of the monoxides and related rocksalt phases of thorium and the rare earths, both at atmospheric and at high pressure. The existence of solid thorium monoxide was first suggested more than 100 years ago; however, it was never obtained in bulk and has been studied mostly theoretically. Monoxides of lanthanides from Eu to Ho are ferromagnetic semiconductors sought for spintronics and were studied in thin films. La to Sm metallic monoxides were synthesized in bulk at pressures below 5 GPa. Recently, ThO formation in thin films has been reported and the stability of bulk ThO at high pressure was theoretically predicted based on first principles computations at 0 K. New ab initio computations were performed accounting for temperature effects up to 1000 K using lattice dynamics in the quasi-harmonic approximation. New computational results confirm the stabilization of pure ThO above 30 GPa and suggest the possibility of high-pressure synthesis of (Th,Nd)O at 1000 K and 5 GPa.

36 MATERIALS SCIENCE↗

Regularity of Solutions to Quasilinear Parabolic Systems with Time-Nonsmooth Principal Matrix and the Neumann Boundary Condition

We consider a quasilinear parabolic system of equations with nondiagonal principal matrix in a model parabolic cylinder with the Neumann condition on the plane part Γ of the lateral surface of the cylinder. We prove the partial regularity (the Hölder continuity) of the weak solution in a neighborhood of Γ by the method of A(t)-caloric approximations adapted to the problem with the Neumann boundary condition.

97 MATHEMATICS AND COMPUTING↗

Polynomial solutions of the Monge-Ampère equation

The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.

97 MATHEMATICS AND COMPUTING↗

Singularly Perturbed Lie Bracket Approximation

Here, we consider the interconnection of two dynamical systems where one has an input-affine vector field. We show that by employing a singular perturbation analysis and the Lie bracket approximation technique, the stability of the overall system can be analyzed by regarding the stability properties of two reduced, uncoupled systems.

97 MATHEMATICS AND COMPUTING↗

Incomplete Sparse Approximate Inverses for Parallel Preconditioning

In this study, we propose a new preconditioning method that can be seen as a generalization of block-Jacobi methods, or as a simplification of the sparse approximate inverse (SAI) preconditioners. The “Incomplete Sparse Approximate Inverses” (ISAI) is in particular efficient in the solution of sparse triangular linear systems of equations. Those arise, for example, in the context of incomplete factorization preconditioning. ISAI preconditioners can be generated via an algorithm providing fine-grained parallelism, which makes them attractive for hardware with a high concurrency level. Finally, in a study covering a large number of matrices, we identify the ISAI preconditioner as an attractive alternative to exact triangular solves in the context of incomplete factorization preconditioning.

97 MATHEMATICS AND COMPUTING↗