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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗
DOE OSTI2022

A Framework for Error-Bounded Approximate Computing, with an Application to Dot Products

Approximate computing techniques, which trade off the computation accuracy of an algorithm for better performance and energy efficiency, have been successful in reducing computation and power costs in several domains. However, error sensitive applications in high-performance computing are unable to benefit from existing approximate computing strategies that are not developed with guaranteed error bounds. While approximate computing techniques can be developed for individual high-performance computing applications by domain specialists, this often requires additional theoretical analysis and potentially extensive software modification. Hence, the development of low-level error-bounded approximate computing strategies that can be introduced into any high-performance computing application without requiring additional analysis or significant software alterations is desirable. In this paper, we provide a contribution in this direction by proposing a general framework for designing error-bounded approximate computing strategies and apply it to the dot product kernel to develop \bf qdot---an error-bounded approximate dot product kernel. Following the introduction of qdot, here we perform a theoretical analysis that yields a deterministic bound on the relative approximation error introduced by qdot. Empirical tests are performed to illustrate the tightness of the derived error bound and to demonstrate the effectiveness of qdot on a synthetic dataset, as well as two scientific benchmarks---the conjugate gradient (CG) and power methods. In some instances, using qdot for the dot products in CG can result in many components being quantized to half precision without increasing the iteration count required for convergence to the same solution as CG using a double precision dot product.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

High Performance Approximate Computing

This code repository contains the implementation of the "High-Performance Approximate Computing" (HPAC) toolkit. The toolkit allows you to approximate your own C/C++. The developer uses "pragma's" to annotate code regions as approximate. The compiler extensions lower these pragmas to either compiletime approximate techniques or runtime approximation techniques. At execution time, the implemented runtime system decides which annotated regions it should approximate. HPAC also provides a set of script utilities. The utilities perform a grid search within approximation parameters and performance. The user can analyze the raw data to identify optimal approximation techniques for the application.

Parasyris, Konstantinos↗
NASA NTRS1984

Computing approximate random Delta v magnitude probability densities

This paper describes the development and use of an algorithm to compute approximate statistics of the magnitude of a single random trajectory correction maneuver (TCM) Delta v vector. The TCM Delta v vector is modeled as a three component Cartesian vector each of whose components is a random variable having a normal (Gaussian) distribution with zero mean and possibly unequal standard deviations. The algorithm uses these standard deviations as input to produce approximations to (1) the mean and standard deviation of the magnitude of Delta v, (2) points of the probability density function of the magnitude of Delta v, and (3) points of the cumulative and inverse cumulative distribution functions of Delta v. The approximates are based on Monte Carlo techniques developed in a previous paper by the author and extended here. The algorithm described is expected to be useful in both pre-flight planning and in-flight analysis of maneuver propellant requirements for space missions.

Chadwick, C.↗
NASA NTRS1975

The effect of measurement errors and computational approximations on a perspective ILM radar image

The effect was examined of aircraft position and attitude, of measurement errors, and of computational approximations on the size, shape, and position of a perspective radar image of an airport runway as might be displayed by an independent landing monitor in transport aircraft. The effect on runway image geometry was examined for different aircraft attitudes and different aircraft positions relative to a standard three degree glide slope. Measurement errors investigated were errors in radar azimuth angle and range, and errors in those aircraft parameters supplied to the radar for use in converting the radar image into a perspective format (namely pitch, roll, and altitude). Also investigated were the effects of using certain mathematical approximations, such as small angle, in the coordinate transformation which converts the image to a perspective format.

Bundick, W. T.↗
NASA NTRS1991

Using trees to compute approximate solutions to ordinary differential equations exactly

Some recent work is reviewed which relates families of trees to symbolic algorithms for the exact computation of series which approximate solutions of ordinary differential equations. It turns out that the vector space whose basis is the set of finite, rooted trees carries a natural multiplication related to the composition of differential operators, making the space of trees an algebra. This algebraic structure can be exploited to yield a variety of algorithms for manipulating vector fields and the series and algebras they generate.

Grossman, Robert↗
NASA NTRS1991

Dynamo magnetic field modes in thin astrophysical disks - An adiabatic computational approximation

An adiabatic approximation is applied to the calculation of turbulent MHD dynamo magnetic fields in thin disks. The adiabatic method is employed to investigate conditions under which magnetic fields generated by disk dynamos permeate the entire disk or are localized to restricted regions of a disk. Two specific cases of Keplerian disks are considered. In the first, magnetic field diffusion is assumed to be dominated by turbulent mixing leading to a dynamo number independent of distance from the center of the disk. In the second, the dynamo number is allowed to vary with distance from the disk's center. Localization of dynamo magnetic field structures is found to be a general feature of disk dynamos, except in the special case of stationary modes in dynamos with constant dynamo number. The implications for the dynamical behavior of dynamo magnetized accretion disks are discussed and the results of these exploratory calculations are examined in the context of the protosolar nebula and accretion disks around compact objects.

Stepinski, T. F.↗
NASA NTRS1993

Comparative accuracy of diffuse radiative properties computed using selected multiple scattering approximations

Computational results have been obtained for the spherical albedo, global transmission, and global absorption of plane-parallel layers composed of cloud droplets. These computations, obtained using the doubling method for the entire range of single scattering albedos and for optical depths between 0.1 and 100, are compared with corresponding results obtained using selected multiple scattering approximations. The spherical albedo and global absorption computed using asymptotic theory are found to be accurate to better than 5 percent for all values of the single scattering albedo, provided the optical thickness exceeds about 2. The diffuse two-stream approximations have relative accuracies that are much worse than 5 percent for the spherical albedo over most of the parameter space, yet are accurate to within 5 percent in the global absorption when the absorption is significant. The integrated delta-Eddington scheme appears to be the most suitable model over the entire range of variables, generally producing relative errors of less than 5 percent in both the spherical albedo and global absorption.

HARSHVARDHAN↗
DOE OSTI2021

A weighted Shifted Boundary Method for free surface flow problems

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods and was recently introduced for the Poisson, linear advection/diffusion, Stokes, Navier-Stokes, acoustics, and shallow-water equations. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we extend the SBM to the simulation of incompressible Navier-Stokes flows with moving free-surfaces, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach prevents spurious pressure oscillations in time, which would otherwise be produced if the total active fluid volume were to change abruptly over a time step. In fact, the proposed weighted SBM method induces small mass (i.e., volume) conservation errors, which converge quadratically in the case of piecewise-linear finite element interpolations, as the grid is refined. Finally, we present an extensive set of two- and three-dimensional tests to demonstrate the robustness and accuracy of the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A weighted shifted boundary method for immersed moving boundary simulations of Stokes' flow

The Shifted Boundary Method (SBM) belongs to the class of unfitted (or immersed, or embedded) finite element methods, and relies on reformulating the original boundary value problem over a surrogate (approximate) computational domain. The surrogate domain is constructed so as to avoid cut cells and the associated problematic implementation and numerical integration issues. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions: hence the name of the method, that shifts the location and values of the boundary conditions. Here, in this article, we extend the SBM to the simulation of incompressible Stokes flow, by appropriately weighting its variational form with the elemental volume fraction of active fluid. This approach allows to drastically reduce spurious pressure oscillations in time, which are produced if the total volume of active fluid were to change abruptly over a time step. The proposed Weighted SBM (W-SBM) exactly preserves states of hydrostatic equilibrium, and induces small mass and momentum conservation errors, which converge as the grid is refined. This is in analogy to cutFEMs and related unfitted approaches, which rely on an affine representation of cut boundaries. We demonstrate the robustness and accuracy of the proposed method with an extensive suite of two-dimensional tests.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2001

Gamma-Weighted Discrete Ordinate Two-Stream Approximation for Computation of Domain Averaged Solar Irradiance

An algorithm is developed for the gamma-weighted discrete ordinate two-stream approximation that computes profiles of domain-averaged shortwave irradiances for horizontally inhomogeneous cloudy atmospheres. The algorithm assumes that frequency distributions of cloud optical depth at unresolved scales can be represented by a gamma distribution though it neglects net horizontal transport of radiation. This algorithm is an alternative to the one used in earlier studies that adopted the adding method. At present, only overcast cloudy layers are permitted.

Kato, S.↗
DOE OSTI2022

Approximate Bayesian Computation applied to the Diffuse Gamma-Ray Sky

ABSTRACT Many sources contribute to the diffuse gamma-ray background (DGRB), including star forming galaxies, active galactic nuclei, and cosmic ray interactions in the Milky Way. Exotic sources, such as dark matter annihilation, may also make some contribution. The photon counts-in-pixels distribution is a powerful tool for analysing the DGRB and determining the relative contributions of different sources. However, including photon energy information in a likelihood analysis of the counts-in-pixels distribution quickly becomes computationally intractable as the number of source types and energy bins increase. Here, we apply the likelihood-free method of approximate Bayesian computation (ABC) to the problem. We consider a mock analysis that includes contributions from dark matter annihilation in Galactic subhaloes as well as astrophysical backgrounds. We show that our results using ABC are consistent with the exact likelihood when energy information is discarded, and that significantly tighter parameter constraints can be obtained with ABC when energy information is included. ABC presents a powerful tool for analysing the DGRB and understanding its varied origins.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

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↗
DOE OSTI2020

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↗
NASA NTRS2018

Variability Timescale and Spectral Index of Sgr A* in the Near Infrared: Approximate Bayesian Computation Analysis of the Variability of the Closest Supermassive Black Hole

Sagittarius A* (Sgr A* ) is the variable radio, near-infrared (NIR), and X-ray source associated with accretion onto the Galactic center black hole. We present an analysis of the most comprehensive NIR variability data set of Sgr A* to date: eight 24 hr epochs of continuous monitoring of Sgr A* at 4.5 μm with the IRAC instrument on the Spitzer Space Telescope, 93 epochs of 2.18 μm data from Naos Conica at the Very Large Telescope, and 30 epochs of 2.12 μm data from the NIRC2 camera at the Keck Observatory, in total 94,929 measurements. A new approximate Bayesian computation method for fitting the first-order structure function extracts information beyond current fast Fourier transformation (FFT) methods of power spectral density (PSD) estimation. With a combined fit of the data of all three observatories, the characteristic coherence timescale of Sgr A* is b 243 57 82 t = - + minutes (90% credible interval). The PSD has no detectable features on timescales down to 8.5 minutes (95% credible level), which is the ISCO orbital frequency for a dimensionless spin parameter a = 0.92. One light curve measured simultaneously at 2.12 and 4.5 μm during a low flux-density phase gave a spectral index αs = 1.6 ± 0.1 (F µ n s n -a ). This value implies that the Sgr A* NIR color becomes bluer during higher flux-density phases. The probability densities of flux densities of the combined data sets are best fit by log-normal distributions. Based on these distributions, the Sgr A* spectral energy distribution is consistent with synchrotron radiation from a nonthermal electron population from below 20 GHz through the NIR.

accretion↗