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 91 records · Page 5

Verification of the Coupled Fluid/Solid Transfer in a CASL Grid-to-Rod-Fretting Simulation: A Technical Brief on the Analysis of Convergence Behavior and Demonstration of Software Tools for Verification

For a CASL grid-to-rod fretting problem, Sandia's Percept software was used in conjunction with the Sierra Mechanics suite to analyze the convergence behavior of the data transfer from a fluid simulation to a solid mechanics simulation. An analytic function, with properties relatively close to numerically computed fluid approximations, was chosen to represent the pressure solution in the fluid domain. The analytic pressure was interpolated on a sequence of grids on the fluid domain, and transferred onto a separate sequence of grids in the solid domain. The error in the resulting pressure in the solid domain was measured with respect to the analytic pressure. The error in pressure approached zero as both the fluid and solids meshes were refined. The convergence of the transfer algorithm was limited by whether the source grid resolution was the same or finer than the target grid resolution. In addition, using a feature coverage analysis, we found gaps in the solid mechanics code verification test suite directly relevant to the prototype CASL GTRF simulations.

99 GENERAL AND MISCELLANEOUS↗

Combining Observational and Computational Uncertainty in Calibration Experiments

Traditional computer experiments using emulators have treat the emulator output as containing no error; however, this is not always feasible, as there exist computational codes which produce stochastic output, and future computations may require a balance between the time or resources to run the code and the accuracy of the output. This paper proposes a framework for incorporating both computational uncertainty and observational uncertainty into an analysis using a Gaussian process regression and calibration, and provides an example using simulated output from the one-dimensional diffusion equation. The particular values of observational and computation uncertainty which minimize a cost function are obtained.

97 MATHEMATICS AND COMPUTING↗

Tough Errors Are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes research performed under the Tough Errors Are no Match (TEAM) project. The primary focus of TEAM has been to research and develop a compilation toolbox leveraging techniques from quantum characterization and control, probabilistic programming, and approximate computing. Our goal was to develop robust protocols that can be integrated into quantum compilers to optimize and enhance the robustness of noisy computation. Here, we provide a summary of TEAM work focused on characterization and control of quantum systems.

97 MATHEMATICS AND COMPUTING↗

Immersive Digital Twins and Decision Making

This work focuses on developing and implementing immersive digital twins to support decision-making processes in construction automation and energy simulation analysis. The use of digital twins enables users to explore and interact with virtual replicas of physical systems, providing a unique and valuable perspective for problem-solving. In the context of construction automation, we present two case studies that integrate immersive visualization and worker-machine interaction. In the context of energy simulation analysis using digital twins, we describe our digital twin framework that combines interactive visualization with machine learning techniques to approximate computationally expensive simulations, allowing for faster and more efficient analysis of complex energy systems. Through these research endeavors, we demonstrate the potential of immersive digital twins in decision-making across various domains.

digital twins↗

A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets

We present a new lock-free parallel algorithm for computing betweenness centrality of massive small-world networks. With minor changes to the data structures, our algorithm also achieves better spatial cache locality compared to previous approaches. Betweenness centrality is a key algorithm kernel in the HPCS SSCA#2 Graph Analysis benchmark, which has been extensively used to evaluate the performance of emerging high-performance computing architectures for graph-theoretic computations. We design optimized implementations of betweenness centrality and the SSCA#2 benchmark for two hardware multithreaded systems: a Cray XMT system with the ThreadStorm processor, and a single-socket Sun multicore server with the UltraSparc T2 processor. For a small-world network of 134 million vertices and 1.073 billion edges, the 16-processor XMT system and the 8-core Sun Fire T5120 server achieve TEPS scores (an algorithmic performance count for the SSCA#2 benchmark) of 160 million and 90 million respectively, which corresponds to more than a 2X performance improvement over the previous parallel implementations. To better characterize the performance of these multithreaded systems, we correlate the SSCA#2 performance results with data from the memory-intensive STREAM and RandomAccess benchmarks. Finally, we demonstrate the applicability of our implementation to analyze massive real-world datasets by computing approximate betweenness centrality for a large-scale IMDb movie-actor network.

architecture comparison↗

Application of the static fluctuation approximation to the computation of the thermodynamic properties of an interacting trapped two-dimensional hard-sphere Bose gas

The static fluctuation approximation (SFA) is applied to compute the thermodynamic properties of a trapped two-dimensional (2D) interacting hard-sphere (HS) Bose gas in the weakly and strongly interacting regime. A mean-field approach involving a variational wave function is used to compute the mean-field energy as a function of temperature for each harmonic oscillator (HO) state plugged into the SFA technique. In the variational approach, a parameter {alpha} is introduced into the harmonic oscillator wave function in order to take into account the changes in the width when the repulsive interactions between the bosons are increased. In the weakly interacting regime, below the critical temperature, the total energy of all HO states (evaluated by our model) matches the noninteracting result very well. However, beyond the critical temperature, we 'fit' our energies to the classical limit for 2D bosons in a trap by using a suitably proposed weighting function. We compare our results to earlier results of mean-field theory. Further, we evaluate the density matrix arising from correlations between the HO orbitals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Noise-Resilient and Reduced Depth Approximate Adders for NISQ Quantum Computing

The "Noisy intermediate-scale quantum" NISQ machine era primarily focuses on mitigating noise, controlling errors, and executing high-fidelity operations, hence requiring shallow circuit depth and noise robustness. Approximate computing is a novel computing paradigm that produces imprecise results by relaxing the need for fully precise output for error-tolerant applications including multimedia, data mining, and image processing. We investigate how approximate computing can improve the noise resilience of quantum adder circuits in NISQ quantum computing. We propose five designs of approximate quantum adders to reduce depth while making them noise-resilient, in which three designs are with carryout, while two are without carryout. We have used novel design approaches that include approximating the Sum only from the inputs (pass-through designs) and having zero depth, as they need no quantum gates. The second design style uses a single CNOT gate to approximate the SUM with a constant depth of O(1). We performed our experimentation on IBM Qiskit on noise models including thermal, depolarizing, amplitude damping, phase damping, and bitflip: (i) Compared to exact quantum ripple carry adder without carryout the proposed approximate adders without carryout have improved fidelity ranging from 8.34% to 219.22%, and (ii) Compared to exact quantum ripple carry adder with carryout the proposed approximate adders with carryout have improved fidelity ranging from 8.23% to 371%. Further, the proposed approximate quantum adders are evaluated in terms of various error metrics.

Gaur, Bhaskar↗

Computing quality scores and uncertainty for approximate pattern matching in geospatial semantic graphs

Geospatial semantic graphs provide a robust foundation for representing and analyzing remote sensor data. In particular, they support a variety of pattern search operations that capture the spatial and temporal relationships among the objects and events in the data. However, in the presence of large data corpora, even a carefully constructed search query may return a large number of unintended matches. This work considers the problem of calculating a quality score for each match to the query, given that the underlying data are uncertain. As a result, we present a preliminary evaluation of three methods for determining both match quality scores and associated uncertainty bounds, illustrated in the context of an example based on overhead imagery data.

97 MATHEMATICS AND COMPUTING↗

Development of highly accurate approximate scheme for computing the charge transfer integral

The charge transfer integral is a key parameter required by various theoretical models to describe charge transport properties, e.g., in organic semiconductors. The accuracy of this important property depends on several factors, which include the level of electronic structure theory and internal simplifications of the applied formalism. The goal of this paper is to identify the performance of various approximate approaches of the latter category, while using the high level equation-of-motion coupled cluster theory for the electronic structure. The calculations have been performed on the ethylene dimer as one of the simplest model systems. By studying different spatial perturbations, it was shown that while both energy split in dimer and fragment charge difference methods are equivalent with the exact formulation for symmetrical displacements, they are less efficient when describing transfer integral along the asymmetric alteration coordinate. Since the “exact” scheme was found computationally expensive, we examine the possibility to obtain the asymmetric fluctuation of the transfer integral by a Taylor expansion along the coordinate space. By exploring the efficiency of this novel approach, we show that the Taylor expansion scheme represents an attractive alternative to the “exact” calculations due to a substantial reduction of computational costs, when a considerably large region of the potential energy surface is of interest. Moreover, we show that the Taylor expansion scheme, irrespective of the dimer symmetry, is very accurate for the entire range of geometry fluctuations that cover the space the molecule accesses at room temperature.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Approximation algorithms in combinatorial scientific computing

We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$ -matching, and minimization versions of weighted edge cover and $b$ -edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.

Mathematics↗

Job Management with mpi_jm

About this book: This book constitutes the refereed post-conference proceedings of 13 workshops held at the 33rd International ISC High Performance 2018 Conference, in Frankfurt, Germany, in June 2018: HPC I/O in the Data Center, HPC-IODC 2018; Workshop on Performance and Scalability of Storage Systems, WOPSSS 2018; 13th Workshop on Virtualization in High­-Performance Cloud Computing, VHPC 2018; Third International Workshop on In Situ Visualization, WOIV 2018; 4th International Workshop on Communication Architectures for HPC, Big Data, Deep Learning and Clouds at Extreme Scale, ExaComm 2018; International Workshop on OpenPOWER for HPC, IWOPH 2018; IXPUG Workshop: Many-Core Computing on Intel Processors; Workshop on Sustainable Ultrascale Computing Systems; Approximate and Transprecision Computing on Emerging Technologies, ATCET 2018; First Workshop on the Convergence of Large-Scale Simulation and Artificial Intelligence; Third Workshop for Open Source Supercomputing, OpenSuCo 2018; First Workshop on Interactive High-Performance Computing; Workshop on Performance Portable Programming Models for Accelerators, P^3MA 2018. The 53 full papers included in this volume were carefully reviewed and selected from 80 submissions. They cover all aspects of research, development, and application of large-scale, high performance experimental and commercial systems. Topics include HPC computer architecture and hardware; programming models, system software, and applications; solutions for heterogeneity, reliability, power efficiency of systems; virtualization and containerized environments; big data and cloud computing; and artificial intelligence.

Berkowitz, Evan↗

Practical algorithms for multivariate rational approximation

We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process to efficiently and robustly compute the coefficients of the rational approximation. Our second approach is based on an optimization formulation that allows us to include structural constraints on the rational approximation (in particular, constraints demanding the absence of singularities), resulting in a semi-infinite optimization problem that we solve using an outer approximation approach. We present results for synthetic and real-life HEP data, and we compare the approximation quality of our approaches with that of traditional polynomial approximations.

97 MATHEMATICS AND COMPUTING↗

Optical conductivity of the two-dimensional Hubbard model: Vertex corrections, emergent Galilean invariance, and the accuracy of the single-site dynamical mean field approximation

We compute the frequency-dependent conductivity of the two-dimensional square lattice Hubbard model at zero temperature as a function of density to second order in the interaction strength, and compare the results to the predictions of single-site dynamical mean field theory computed at the same order. We find that despite the neglect of vertex corrections, the single-site dynamical mean field approximation produces semiquantitatively accurate results for most carrier concentrations, but fails qualitatively for the nearly empty or nearly filled band cases where the model exhibits an emergent Galilean invariance. The DMFT approximation also becomes qualitatively inaccurate very near half filling if nesting is important.

2-dimensional systems↗

A crust and upper mantle model of Eurasia and North Africa for Pn travel time calculation

We develop a Regional Seismic Travel Time (RSTT) model and methods to account for the first-order effect of the three-dimensional crust and upper mantle on travel times. The model parameterization is a global tessellation of nodes with a velocity profile at each node. Interpolation of the velocity profiles generates a 3-dimensional crust and laterally variable upper mantle velocity. The upper mantle velocity profile at each node is represented as a linear velocity gradient, which enables travel time computation in approximately 1 millisecond. This computational speed allows the model to be used in routine analyses in operational monitoring systems. We refine the model using a tomographic formulation that adjusts the average crustal velocity, mantle velocity at the Moho, and the mantle velocity gradient at each node. While the RSTT model is inherently global and our ultimate goal is to produce a model that provides accurate travel time predictions over the globe, our first RSTT tomography effort covers Eurasia and North Africa, where we have compiled a data set of approximately 600,000 Pn arrivals that provide path coverage over this vast area. Ten percent of the tomography data are randomly selected and set aside for testing purposes. Travel time residual variance for the validation data is reduced by 32%. Based on a geographically distributed set of validation events with epicenter accuracy of 5 km or better, epicenter error using 16 Pn arrivals is reduced by 46% from 17.3 km (ak135 model) to 9.3 km after tomography. Relative to the ak135 model, the median uncertainty ellipse area is reduced by 68% from 3070 km{sup 2} to 994 km{sup 2}, and the number of ellipses with area less than 1000 km{sup 2}, which is the area allowed for onsite inspection under the Comprehensive Nuclear Test Ban Treaty, is increased from 0% to 51%.

58 GEOSCIENCES↗

Stage-local partitioned two-step runge-kutta methods for large systems of ordinary differential equations

We introduce stage-local partitioned two-step Runge-Kutta methods are an extension of standard two-step Runge-Kutta methods, which are an alternative to the standard additive two-step Runge-Kutta methods currently existing in the literature. Furthermore, these new schemes are designed with an eye towards truly N-partitioned systems and leverage local stage approximations to make several computationally interesting approximations viable. Specifically, the focus on local stage approximations makes possible the construction of truly asynchronous schemes, in the parallel sense, possible. In addition, we show that an implicit-explicit approach to these schemes can lead to methods that require the inversion of only local nonlinear systems.

Applied Dynamical Systems↗

Calculating uncertainty on K-effective with MONK10 - 14583

Criticality safety assessments require a demonstration that a particular configuration of fissile material has an adequate sub-critical margin (k-effective sufficiently below unity) to ensure that the risk of criticality under normal operation and accident conditions is acceptable. The required sub-critical margin depends upon the uncertainty in the estimated value of k-effective. The uncertainty in the calculated value of k-effective arises from a number of sources, including: manufacturing tolerances on input data to the code (affecting geometry, compositions and densities), uncertainty in the nuclear data used by the code, stochastic uncertainty resulting from Monte Carlo simulation and modelling approximations/errors, including the inevitable bugs in the software. The ANSWERS Software Service, in collaboration with industrial partners, is developing a number of techniques to better understand and quantify uncertainty on predicted values of k-effective, using MONK. The SPRUCE utility code has been developed to allow uncertainty to be estimated using sampling methods. This can include the sampling of input parameters (including dimensions, compositions and densities) from statistical distributions. It can also include sampling different nuclear data libraries. A set of nuclear data libraries has been generated for this purpose by sampling from statistical distributions that represent the uncertainties in the published nuclear data evaluated files; a set of libraries has been produced for Latin Hypercube Sampling. By varying the input data and nuclear data, separate and combined uncertainties due to manufacturing tolerances and nuclear data can be derived. By performing least squares fitting on the results it is also possible to estimate the contribution of each of the uncertain inputs and a sensitivity method in MONK can break down the nuclear data uncertainty. (authors)

42 ENGINEERING↗