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 37 records · Page 2

A New Approach for Obtaining Cosmological Constraints from Type Ia Supernovae using Approximate Bayesian Computation

Cosmological parameter estimation techniques that robustly account for systematic measurement uncertainties will be crucial for the next generation of cosmological surveys. We present a new analysis method, superABC, for obtaining cosmological constraints from Type Ia supernova (SN Ia) light curves using Approximate Bayesian Computation (ABC) without any likelihood assumptions. The ABC method works by using a forward model simulation of the data where systematic uncertainties can be simulated and marginalized over. A key feature of the method presented here is the use of two distinct metrics, the `Tripp' and `Light Curve' metrics, which allow us to compare the simulated data to the observed data set. The Tripp metric takes as input the parameters of models fit to each light curve with the SALT-II method, whereas the Light Curve metric uses the measured fluxes directly without model fitting. We apply the superABC sampler to a simulated data set of $\sim$1000 SNe corresponding to the first season of the Dark Energy Survey Supernova Program. Varying $\Omega_m, w_0, \alpha$ and $\beta$ and a magnitude offset parameter, with no systematics we obtain $\Delta(w_0) = w_0^{\rm true} - w_0^{\rm best \, fit} = -0.036\pm0.109$ (a $\sim11$% 1$\sigma$ uncertainty) using the Tripp metric and $\Delta(w_0) = -0.055\pm0.068$ (a $\sim7$% 1$\sigma$ uncertainty) using the Light Curve metric. Including 1% calibration uncertainties in four passbands, adding 4 more parameters, we obtain $\Delta(w_0) = -0.062\pm0.132$ (a $\sim14$% 1$\sigma$ uncertainty) using the Tripp metric. Overall we find a $17$% increase in the uncertainty on $w_0$ with systematics compared to without. We contrast this with a MCMC approach where systematic effects are approximately included. We find that the MCMC method slightly underestimates the impact of calibration uncertainties for this simulated data set.

79 ASTRONOMY AND ASTROPHYSICS↗

Microsimulation model calibration using incremental mixture approximate Bayesian computation

Microsimulation models (MSMs) are used to inform policy by predicting population-level outcomes under different scenarios. MSMs simulate individual-level event histories that mark the disease process (such as the development of cancer) and the effect of policy actions (such as screening) on these events. MSMs often have many unknown parameters; calibration is the process of searching the parameter space to select parameters that result in accurate MSM prediction of a wide range of targets. We develop Incremental Mixture Approximate Bayesian Computation (IMABC) for MSM calibration which results in a simulated sample from the posterior distribution of model parameters given calibration targets. IMABC begins with a rejection-based ABC step, drawing a sample of points from the prior distribution of model parameters and accepting points that result in simulated targets that are near observed targets. Next, the sample is iteratively updated by drawing additional points from a mixture of multivariate normal distributions and accepting points that result in accurate predictions. Posterior estimates are obtained by weighting the final set of accepted points to account for the adaptive sampling scheme. We demonstrate IMABC by calibrating CRC-SPIN 2.0, an updated version of a MSM for colorectal cancer (CRC) that has been used to inform national CRC screening guidelines.

97 MATHEMATICS AND COMPUTING↗

Application of the Approximate Bayesian Computation Algorithm to Gamma-Ray Spectroscopy

Radioisotope identification (RIID) algorithms for gamma-ray spectroscopy aim to infer what isotopes are present and in what amounts in test items. RIID algorithms either use all energy channels in the analysis region or only energy channels in and near identified peaks. Because many RIID algorithms rely on locating peaks and estimating each peak’s net area, peak location and peak area estimation algorithms continue to be developed for gamma-ray spectroscopy. This paper shows that approximate Bayesian computation (ABC) can be effective for peak location and area estimation. Algorithms to locate peaks can be applied to raw or smoothed data, and among several smoothing options, the iterative bias reduction algorithm (IBR) is recommended; the use of IBR with ABC is shown to potentially reduce uncertainty in peak location estimation. Extracted peak locations and areas can then be used as summary statistics in a new ABC-based RIID. ABC allows for easy experimentation with candidate summary statistics such as goodness-of-fit scores and peak areas that are extracted from relatively high dimensional gamma spectra with photopeaks (1024 or more energy channels) consisting of count rates versus energy for a large number of gamma energies.

Burr, Tom↗

LIKELIHOOD-FREE COSMOLOGICAL INFERENCE WITH TYPE Ia SUPERNOVAE: APPROXIMATE BAYESIAN COMPUTATION FOR A COMPLETE TREATMENT OF UNCERTAINTY

Cosmological inference becomes increasingly difficult when complex data-generating processes cannot be modeled by simple probability distributions. With the ever-increasing size of data sets in cosmology, there is an increasing burden placed on adequate modeling; systematic errors in the model will dominate where previously these were swamped by statistical errors. For example, Gaussian distributions are an insufficient representation for errors in quantities like photometric redshifts. Likewise, it can be difficult to quantify analytically the distribution of errors that are introduced in complex fitting codes. Without a simple form for these distributions, it becomes difficult to accurately construct a likelihood function for the data as a function of parameters of interest. Approximate Bayesian computation (ABC) provides a means of probing the posterior distribution when direct calculation of a sufficiently accurate likelihood is intractable. ABC allows one to bypass direct calculation of the likelihood but instead relies upon the ability to simulate the forward process that generated the data. These simulations can naturally incorporate priors placed on nuisance parameters, and hence these can be marginalized in a natural way. We present and discuss ABC methods in the context of supernova cosmology using data from the SDSS-II Supernova Survey. Assuming a flat cosmology and constant dark energy equation of state, we demonstrate that ABC can recover an accurate posterior distribution. Finally, we show that ABC can still produce an accurate posterior distribution when we contaminate the sample with Type IIP supernovae.

79 ASTRONOMY AND ASTROPHYSICS↗

Calibration of the Diffusivity Predictions of Centipede Using Approximate Bayesian Computation and Applications in Nyx (Engineering Scale) and Xolotl-MARMOT (Meso-Scale) Simulations

Fission gas evolution and release in UO 2 nuclear fuel are important fuel performance metrics and occur in several distinct stages: 1) nucleation, growth and resolution of intra-granular bubbles, 2) diffusion to grain boundaries and 3) nucleation and growth of bubbles at grain boundaries, which eventually form a connected network (percolation) enabling release of gas from grain boundaries through connections to triple junctions, grain edges or free surfaces. The NE-SciDAC project is developing several computational tools to model this problem, which are connected in a hierarchical multi-scale framework. The information transfer in the multi-scale framework is a critical step that, in addition to best-estimates, should include uncertainty quantification. Despite taking a first-principles multi-scale approach, there is a need to perform parameter calibration to ensure consistency with available experimental data. In the present study, uncertainty quantification (UQ) and parameter calibration is demonstrated for one of the lower length scale codes in the multi-scale framework (Centipede) and then the results, including instances of the propagated uncertainties, are used in other codes within the framework, specifically Nyx and Xolotl-MARMOT. We calibrated the model parameters in Centipede, a computer code used to predict diffusivities of uranium (U) and xenon (Xe) in the context of the simulation of fission gas in uranium oxide (UO 2 ) nuclear fuel. The Centipede code depends on 183 parameters, all of which are subject to uncertainty. The three data sets used in our calibration effort are taken from the literature. This data is available as a set of measurements, including measurement errors. Our goal is to calibrate a statistical model that predicts both the value of the measurement and the uncertainty associated with the measurement. We perform a Bayesian calibration of the model parameters using a dedicated approximate Bayesian computation (ABC) likelihood function. To avoid excessive computational costs, we replace the expensive Centipede simulation code by a higher-order surrogate model, constructed using only the 9 most important parameters. These important parameters are identified by a preliminary global sensitivity analysis (GSA) study. Among the important parameters are T0 (the temperature at which UO 2 is perfectly stoichiometric) and Hf_pO2 (the temperature dependence of the oxygen (O) partial pressure) that should be considered as operating conditions to be estimated along with the other parameters. We consider two different cases: one where we define one set of these operating conditions for all data sets, and one where we define distinct operating condition parameters for each data set. The Xe diffusivities predicted by the latter case show distinct features that could not be observed in the former. Next, we use the diffusivity predictions by Centipede as input to Nyx, a reduced order fuel performance code focused on gas behavior alone, in order to estimate quantities associated with inter-granular bubble formation at conditions specified by the experiments. Finally, the diffusivities obtained from the calibrated Centipede runs were used in coupled Xolotl-MARMOT simulations of intra- and inter-granular gas evolution. The results are compared to simulations using the baseline diffusivities from Turnbull et al.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

From Bethe–Salpeter Wave functions to Generalised Parton Distributions

We review recent works on the modelling of Generalised Parton Distributions within the Dyson-Schwinger formalism. We highlight how covariant computations, using the impulse approximation, allows one to fulfil most of the theoretical constraints of the GPDs. A specific attention is brought to chiral properties and especially the so-called soft pion theorem, and its link with the Axial-Vector Ward-Takahashi identity. The limitation of the impulse approximation are also explained. Beyond impulse approximation computations are reviewed in the forward case. Finally, we stress the advantages of the overlap of lightcone wave functions, and possible ways to construct covariant GPD models within this framework, in a two-body approximation

97 MATHEMATICS AND COMPUTING↗

Using Lagrangian perturbation theory for precision cosmology

We explore the Lagrangian perturbation theory (LPT) at one-loop order with Gaussian initial conditions. We present an expansion method to approximately compute the power spectrum LPT. Our approximate solution has good convergence in the series expansion and enables us to compute the power spectrum in LPT accurately and quickly. Non-linear corrections in this theory naturally satisfy the law of conservation of mass because the relation between matter density and the displacement vector of dark matter corresponds to the conservation of mass. By matching the one-loop solution in LPT to the two-loop solution in standard perturbation theory, we present an approximate solution of the power spectrum which has higher order corrections than the two-loop order in standard perturbation theory with the conservation of mass satisfied. With this approximation, we can use LPT to compute a non-linear power spectrum without any free parameters, and this solution agrees with numerical simulations at k = 0.2 h Mpc{sup –1} and z = 0.35 to better than 2%.

79 ASTRONOMY AND ASTROPHYSICS↗

Accelerated solution of discrete ordinates approximation to the Boltzmann transport equation via model reduction

Radiation heat transfer is an important phenomenon in many physical systems of practical interest. When participating media is important, the radiative transfer equation (RTE) must be solved for the radiative intensity as a function of location, time, direction, and wavelength. In many heat-transfer applications, a quasi-steady assumption is valid, thereby removing time dependence. The dependence on wavelength is often treated through a weighted sum of gray gases (WSGG) approach. The discrete ordinates method (DOM) is one of the most common methods for approximating the angular (i.e., directional) dependence. The DOM exactly solves for the radiative intensity for a finite number of discrete ordinate directions and computes approximations to integrals over the angular space using a quadrature rule; the chosen ordinate directions correspond to the nodes of this quadrature rule. This paper applies a projection-based model-reduction approach to make high-order quadrature computationally feasible for the DOM for purely absorbing applications. First, the proposed approach constructs a reduced basis from (high-fidelity) solutions of the radiative intensity computed at a relatively small number of ordinate directions. Then, the method computes inexpensive approximations of the radiative intensity at the (remaining) quadrature points of a high-order quadrature using a reduced-order model constructed from the reduced basis. Finally, this results in a much more accurate solution than might have been achieved using only the ordinate directions used to compute the reduced basis. One- and three-dimensional test problems highlight the efficiency of the proposed method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamic Inversion for Hydrological Process Monitoring with Electrical Resistance Tomography Under Model Uncertainty

We propose an approach for imaging the dynamics of complex hydrological processes. The evolution of electrically conductive fluids in porous media is imaged using time-lapse electrical resistance tomography. The related dynamic inversion problem is solved using Bayesian filtering techniques, that is, it is formulated as a sequential state estimation problem in which the target is an evolving posterior probability density of the system state. The dynamical inversion framework is based on the state space representation of the system, which involves the construction of a stochastic evolution model and an observation model. The observation model used in this paper consists of the complete electrode model for ERT, with Archie's law relating saturations to electrical conductivity. The evolution model is an approximate model for simulating flow through partially saturated porous media. Unavoidable modeling and approximation errors in both the observation and evolution models are considered by computing approximate statistics for these errors. These models are then included in the construction of the posterior probability density of the estimated system state. This approximation error method allows the use of approximate - and therefore computationally efficient - observation and evolution models in the Bayesian filtering. We consider a synthetic example and show that the incorporation of an explicit model for the model uncertainties in the state space representation can yield better estimates than a frame-by-frame imaging approach.

54 ENVIRONMENTAL SCIENCES↗

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↗

SFU-Driven Transparent Approximation Acceleration on GPUs

Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for substantial performance boost or power reduction, is one of the most promising solutions to enable power control and performance scaling towards exascale. Although most existing approximation designs target the emerging data-intensive applications that are comparatively more error-tolerable, there is still high demand for the acceleration of traditional scientific applications (e.g., weather and nuclear simulation), which often comprise intensive transcendental function calls and are very sensitive to accuracy loss. To address this challenge, we focus on a very important but often ignored approximation unit on GPUs.

Approximate computing↗

APPRENTICE

SF-19-096 In this software, there are multiple approaches to compute approximations to multivariate functions. This includes: (a) an approach that builds on Stieltjes process to efficiently compute the coefficients of the rational approximation, (b) an approach that is based on an optimization formulation to get pole-free coefficients of the rational approximation and (c) approaches that finds the coefficients of rational and polynomial approximations by finding the linear least-squares solution using singular value decomposition.

KRISNAMOORTHY, MOHAN↗

First-principles calculations and experimental studies of: XYZ 2 thermoelectric compounds: Detailed analysis of van der Waals interactions

First-principles calculations can accelerate the search for novel high-performance thermoelectric materials. However, the prediction of the thermoelectric properties is strongly dependent on the approximations used for the calculations. Here, thermoelectric properties were calculated with different computational approximations ( i.e. , PBE-GGA, HSE06, spin–orbit coupling and DFT-D3) for three layered XYZ 2 compounds (TmAgTe 2 , YAgTe 2 , and YCuTe 2 ). In addition to the computations, the structural, electrical and thermal properties of these compounds were measured experimentally and compared to the computations. Furthermore, an enhanced prediction of the crystal structure and heat capacity was achieved with the inclusion of van der Waals interactions due to more accurate modeling of the interatomic forces. In particular, a large shift of the acoustic phonons and low-frequency optical phonons to lower frequencies was observed from the dispersion-optimized structure. From the phonon dispersion curves of these compounds, the ultralow thermal conductivity in the investigated XYZ 2 compounds could be described by a recent developed minimum thermal conductivity model. Additionally, for the prediction of the electrical conductivity, a temperature-dependent relaxation time was used, and it was limited by acoustic phonons. While HSE06 has only a small influence on the electrical properties due to a computed band gap energy of >0.25 eV, the inclusion of both van der Waals interactions and spin–orbit coupling leads to a more accurate band structure, resulting in better prediction of electrical properties. Furthermore, the experimental thermoelectric properties of YAgTe 2 , TmAg 0.95 Zn 0.05 Te 2 and TmAg 0.95 Mg 0.05 Te 2 were measured, showing an increase in zT of TmAg 0.95 Zn 0.05 Te 2 by more than 35% ( zT = 0.47 ± 0.12) compared to TmAgTe 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Scalable O(N) Algorithm for Large-Scale Parallel First-Principles Molecular Dynamics Simulations

Traditional algorithms for first-principles molecular dynamics (FPMD) simulations only gain a modest capability increase from current petascale computers, due to their O(N 3 ) complexity and their heavy use of global communications. To address this issue, we are developing a truly scalable O(N) complexity FPMD algorithm, based on density functional theory (DFT), which avoids global communications. The computational model uses a general nonorthogonal orbital formulation for the DFT energy functional, which requires knowledge of selected elements of the inverse of the associated overlap matrix. We present a scalable algorithm for approximately computing selected entries of the inverse of the overlap matrix, based on an approximate inverse technique, by inverting local blocks corresponding to principal submatrices of the global overlap matrix. The new FPMD algorithm exploits sparsity and uses nearest neighbor communication to provide a computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic orbitals are confined, and a cutoff beyond which the entries of the overlap matrix can be omitted when computing selected entries of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to O(100K) atoms on O(100K) processors, with a wall-clock time of O(1) minute per molecular dynamics time step.

36 MATERIALS SCIENCE↗

Verifying quantitative reliability for programs that execute on unreliable hardware

Emerging high-performance architectures are expected to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and masking of soft errors is challenging, expensive, and, for some applications, unnecessary. For example, approximate computing applications (such as multimedia processing, machine learning, and big data analytics) can often naturally tolerate soft errors. We introduce Rely, a programming language that enables developers to reason about the quantitative reliability of an application—namely, the probability that it produces the correct result when executed on unreliable hardware. Rely allows developers to specify the reliability requirements for each value that a function produces. We perform a static quantitative reliability analysis that verifies quantitative requirements on the reliability of an application, enabling a developer to perform sound and verified reliability engineering. The analysis takes a Rely program with a reliability specification and a hardware specification that characterizes the reliability of the underlying hardware components and verifies that the program satisfies its reliability specification when executed on the underlying unreliable hardware platform. We demonstrate the application of quantitative reliability analysis on six computations implemented in Rely.

97 MATHEMATICS AND COMPUTING↗