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,765 records · Page 98
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Holographic pseudoentanglement and the complexity of the AdS/CFT dictionary

The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the duality map (the `dictionary') is efficient to compute. In this work, we show that the complexity of the AdS/CFT dictionary is surprisingly subtle: there might be cases in which one can efficiently apply operators to the CFT state (a task we call 'operator reconstruction') without being able to extract basic properties of the dual bulk state such as its geometry (which we call 'geometry reconstruction'). Geometry reconstruction corresponds to the setting where we want to extract properties of a completely unknown bulk dual from a simulated CFT boundary state. We demonstrate that geometry reconstruction may be generically hard due to the connection between geometry and entanglement in holography. In particular we construct ensembles of states whose entanglement approximately obey the Ryu-Takayanagi formula for arbitrary geometries, but which are nevertheless computationally indistinguishable. This suggests that even for states with the special entanglement structure of holographic CFT states, geometry reconstruction might be hard. This result should be compared with existing evidence that operator reconstruction is generically easy in AdS/CFT. A useful analogy for the difference between these two tasks is quantum fully homomorphic encryption (FHE): this encrypts quantum states in such a way that no efficient adversary can learn properties of the state, but operators can be applied efficiently to the encrypted state. We show that quantum FHE can separate the complexity of geometry reconstruction vs operator reconstruction, which raises the question whether FHE could be a useful lens through which to view AdS/CFT.

FOS: Physical sciences↗
DOE OSTI2019

Fast nonadiabatic dynamics of many-body quantum systems

Modeling many-body quantum systems with strong interactions is one of the core challenges of modern physics. A range of methods has been developed to approach this task, each with its own idiosyncrasies, approximations, and realm of applicability. However, there remain many problems that are intractable for existing methods. In particular, many approaches face a huge computational barrier when modeling large numbers of coupled electrons and ions at finite temperature. Here, we address this shortfall with a new approach to modeling many-body quantum systems. On the basis of the Bohmian trajectory formalism, our new method treats the full particle dynamics with a considerable increase in computational speed. As a result, we are able to perform large-scale simulations of coupled electron-ion systems without using the adiabatic Born-Oppenheimer approximation.

Science & Technology - Other Topics↗
DOE OSTI2013

HipGISAXS : a high-performance computing code for simulating grazing-incidence X-ray scattering data

This article describes the development of a flexible grazing-incidence small-angle X-ray scattering (GISAXS) simulation code in the framework of the distorted wave Born approximation that effectively utilizes the parallel processing power provided by graphics processors and multicore processors. The code, entitled High-Performance GISAXS , computes the GISAXS image for any given superposition of user-defined custom shapes or morphologies in a material and for various grazing-incidence angles and sample orientations. These capabilities permit treatment of a wide range of possible sample structures, including multilayered polymer films and nanoparticles on top of or embedded in a substrate or polymer film layers. In cases where the material displays regions of significant refractive index contrast, an algorithm has been implemented to perform a slicing of the sample and compute the averaged refractive index profile to be used as the reference geometry of the unperturbed system. A number of case studies are presented, which demonstrate good agreement with the experimental data for a variety of polymer and hybrid polymer/nanoparticle composite materials. The parallelized simulation code is well suited for addressing the analysis efforts required by the increasing amounts of GISAXS data being produced by high-speed detectors and ultrafast light sources.

Chemistry↗
DOE OSTI2020

Assessing Uncertainties and Approximations in Solar Heating of the Climate System

In calculating solar radiation, climate models make many simplifications, in part to reduce computational cost and enable climate modeling, and in part from lack of understanding of critical atmospheric information. Whether known errors or unknown errors, the community's concern is how these could impact the modeled climate. The simplifications are well known and most have published studies evaluating them, but with individual studies it is difficult to compare. Here, we collect a wide range of such simplifications in either radiative transfer modeling or atmospheric conditions and assess potential errors within a consistent framework on climate-relevant scales. We build benchmarking capability around a solar heating code (Solar-J) that doubles as a photolysis code for chemistry and can be readily adapted to consider other errors and uncertainties. The broad classes here include: use of broad wavelength bands to integrate over spectral features; scattering approximations that alter phase function and optical depths for clouds and gases; uncertainty in ice-cloud optics; treatment of fractional cloud cover including overlap; and variability of ocean surface albedo. We geographically map the errors in W m -2 using a full climate re-creation for January 2015 from a weather forecasting model. For many approximations assessed here, mean errors are ~2 W m -2 with greater latitudinal biases and are likely to affect a model’s ability to match the current climate state. Combining this work with previous studies, we make priority recommendations for fixing these simplifications based on both the magnitude of error and the ease or computational cost of the fix.

58 GEOSCIENCES↗
DOE OSTI2025

hdsullivan/ResSR

This is the official implementation of ResSR [1]. ResSR is a computationally efficient MSI-SR method that achieves high-quality reconstructions by using a closed-form spectral decomposition along with a spatial residual correction. ResSR applies singular value decomposition to identify correlations across spectral bands, uses pixel-wise computation to upsample the MSI, and then applies a residual correction process to correct the high-spatial frequency components of the upsampled bands. While ResSR is formulated as the solution to a spatially-coupled optimization problem, we use pixel-wise regularization and derive an approximate closed-form solution, resulting in a pixel-wise algorithm with a dramatic reduction in computation that achieves state-of-the-art reconstructions. [1] Duba-Sullivan, H., Reid, E. J., Voisin, S., Bouman, C. A., & Buzzard, G. T. (2024). ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images. arXiv preprint arXiv:2408.13225.

Duba-Sullivan, Haley [Oak Ridge National Laborator↗
DOE OSTI2014

Traveling waves in 2D hexagonal granular crystal lattices

This study describes the dynamic response of a two-dimensional hexagonal packing of uncompressed stainless steel spheres excited by localized impulsive loadings. The dynamics of the system are modeled using the Hertzian normal contact law. After the initial impact strikes the system, a characteristic wave structure emerges and continuously decays as it propagates through the lattice. Using an extension of the binary collision approximation for onedimensional chains, we predict its decay rate, which compares well with numerical simulations and experimental data. While the hexagonal lattice does not support constant speed traveling waves, we provide scaling relations that characterize the directional power law decay of the wave velocity for various angles of impact. Lastly, we discuss the effects of weak disorder on the directional amplitude decay rates.

2D Hexagonal↗
DOE OSTI2018

PyFly: A fast, portable aerodynamics simulator

Here, we present a fast, user-friendly implementation of a potential flow solver based on the unsteady vortex lattice method (UVLM), namely PyFly. UVLM computes the aerodynamic loads applied on lifting surfaces while capturing the unsteady effects such as the added mass forces, the growth of bound circulation, and the wake while assuming that the flow separation location is known a priori. This method is based on discretizing the body surface into a lattice of vortex rings and relies on the Biot–Savart law to construct the velocity field at every point in the simulated domain. We introduce the pointwise approximation approach to simulate the interactions of the far-field vortices to overcome the computational burden associated with the classical implementation of UVLM. The computational framework uses the Python programming language to provide an easy to handle user interface while the computational kernels are written in Fortran. The mixed language approach enables high performance regarding solution time and great flexibility concerning easiness of code adaptation to different system configurations and applications. The computational tool predicts the unsteady aerodynamic behavior of multiple moving bodies (e.g., flapping wings, rotating blades, suspension bridges) subject to incoming air. The aerodynamic simulator can also deal with enclosure effects, multi-body interactions, and B-spline representation of body shapes. Finally, we simulate different aerodynamic problems to illustrate the usefulness and effectiveness of PyFly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Accelerating solidification process simulation for large-sized system of liquid metal atoms using GPU with CUDA

Molecular dynamics simulation is a powerful tool to simulate and analyze complex physical processes and phenomena at atomic characteristic for predicting the natural time-evolution of a system of atoms. Precise simulation of physical processes has strong requirements both in the simulation size and computing timescale. Therefore, finding available computing resources is crucial to accelerate computation. However, a tremendous computational resource (GPGPU) are recently being utilized for general purpose computing due to its high performance of floating-point arithmetic operation, wide memory bandwidth and enhanced programmability. As for the most time-consuming component in MD simulation calculation during the case of studying liquid metal solidification processes, this paper presents a fine-grained spatial decomposition method to accelerate the computation of update of neighbor lists and interaction force calculation by take advantage of modern graphics processors units (GPU), enlarging the scale of the simulation system to a simulation system involving 10 000 000 atoms. In addition, a number of evaluations and tests, ranging from executions on different precision enabled-CUDA versions, over various types of GPU (NVIDIA 480GTX, 580GTX and M2050) to CPU clusters with different number of CPU cores are discussed. The experimental results demonstrate that GPU-based calculations are typically 9∼11 times faster than the corresponding sequential execution and approximately 1.5∼2 times faster than 16 CPU cores clusters implementations. On the basis of the simulated results, the comparisons between the theoretical results and the experimental ones are executed, and the good agreement between the two and more complete and larger cluster structures in the actual macroscopic materials are observed. Moreover, different nucleation and evolution mechanism of nano-clusters and nano-crystals formed in the processes of metal solidification is observed with large-sized system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Characterization of 3D Cirrus Cloud and Radiation Fields Using ARS/AIRS/MODIS data and its Application to Climate Model

During the report period, we have made the following research accomplishments. First, we performed analysis for a number of MODIS scenes comprising of heavy dust events and ice clouds, covering regions of frequent dust outbreaks in East Asia, Middle East, and West Africa, as well as areas associated with long-range dust transports over the Equatorial Tropical Atlantic Ocean. These scenes contain both dust/aerosols and clouds. We collected suitable aerosol/ice-cloud data, correlated ice cloud and aerosol parameters by means of statistical analysis, and interpreted resulting correlation trends based on the physical principles governing cloud microphysics. Aerosol and cloud optical depths and cloud effective particle size inferred from MODIS for selected domains were analyzed from which the parameters including dust aerosol number concentration, ice cloud water path, and ice particle number concentration were subsequently derived. We illustrated that the Twomey (solar albedo) effect can be statistically quantified based on the slope of best-fit straight lines in the correlation study. Analysis of aerosol and cloud retrieval products revealed that for all cases, the region with a larger dust aerosol optical depth is always characterized by a smaller cloud particle size, consistent with the Twomey hypothesis for aerosol-cloud interactions. Second, we developed mean correlation curves with uncertainties associated with small ice-crystal concentration observations for the mean effective ice crystal size (De) and ice water content (IWC) by dividing the atmosphere into three characteristic regions: Tropics cirrus, Midlatitude cirrus, including a temperature classification to improve correlation, and Arctic ice clouds. We illustrated that De has a high correlation with IWC based on theoretical consideration and analysis of thousands of observed ice crystal data obtained from a number of ARM-DOE field campaigns and other experiments. The correlation has the form: ln(De) = a + b ln(IWC) + c ((ln(IWC))2, where a, b, and c are fitting coefficients and are functions of three regions. We demonstrated that this correlation can be effectively incorporated in GCMs and climate models that predict IWC - a significant advance in ice microphysics parameterization for interactive cloud-radiation analysis and feedback. Substantial July mean differences are shown in the OLR (W/m2) and precipitation (mm/day) patterns between UCLA GCM simulations based on Des determined from the De-IWC correlations and the control run using a fixed ice crystal size. Third, in order to improve the computation of spectral radiative transfer processes in the WRF model, we developed a consistent and efficient radiation scheme that can better resolve the spectral bands, determine the cloud optical properties, and provide more reliable and accurate radiative heating fields. In the newly developed radiation module, we have implemented in WRF a modified and improved version referred to as the Fu-Liou-Gu scheme, which includes a combination of delta-four-stream and delta-two-stream approximations for solar and IR flux calculations, respectively. This combination has been proven to be computationally efficient and at the same time to produce a high degree of accuracy. The incorporation of nongray gaseous absorption in multiple scattering atmospheres was based on the correlated k-distribution method. The solar and IR spectra are divided into 6 and 12 bands, respectively, according to the location of absorption bands of H2O, CO2, O3, CH4, N2O, and CFCs. We further included absorption by the water vapor continuum and a number of minor absorbers in the solar spectrum leading to an additional absorption of solar flux in a clear atmosphere on the order of 1-3 W/m2. Additionally, we incorporated the ice microphysics parameterization that includes an interactive mean effective ice crystal size in association with radiation parameterizations. The Fu-Liou-Gu scheme is an ideal tool for the simulation of radiative transfer and ice microphysics within the domain of WRF. It is particularly useful for studying direct and indirect aerosol radiative effects associated with ice cloud formation. The newly implemented radiation module has been demonstrated to work well in WRF and can be effectively used for studies related to cirrus cloud formation and evolution as well as aerosol-cloud-radiation interactions. With the newly implemented radiation scheme, the simulations of cloud cover and ice water path have been improved for cirrus clouds, with a more consistent comparison with the corresponding MODIS observations, especially for optically thin cirrus with an improvement of about 20% in the simulated mean ice water path.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Iterative spectral method for solving electrostatic or magnetostatic problems in complex and evolving heterostructures

Electrostatic or magnetostatic problems involving complex heterogeneity are nontrivial for modeling and simulation. Most existing numerical methods focus on sharp interface models and the computational cost increases with increasing complexity of the geometry. Here we develop an iterative spectral method, the bound charge successive approximation algorithm, to solve electrostatic or magnetostatic heterogeneity problems in the context of diffuse-interface modeling. As tests and verifications, this algorithm is applied to calculation of the depolarization factor of an ellipsoid, and simulation of random dielectric mixtures and the dielectophoretic motion of multiple particles. The algorithm shows excellent efficiency and the computational cost mainly depends on the permittivity or permeability contrast in the whole system, regardless of the complexity of the geometry. Specifically, for evolving heterostructures the solution of bound charge in one time step can be used as input for the next, which could further significantly shorten the iteration (approximation) process, making it practical to simulate the long-range electrostatic or magnetostatic interaction in complex and evolving heterostructures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Correction of the near threshold behavior of electron collisional excitation cross-sections in the plane-wave Born approximation

The modeling of NLTE plasmas requires the solution of population rate equations to determine the populations of the various atomic levels relevant to a particular problem. The equations require many cross sections for excitation, de-excitation, ionization and recombination. Additionally, a simple and computational fast way to calculate electron collisional excitation cross-sections for ions is by using the plane-wave Born approximation. This is essentially a high-energy approximation and the cross section suffers from the unphysical problem of going to zero near threshold. Various remedies for this problem have been employed with varying degrees of success. We present a correction procedure for the Born cross-sections that employs the Elwert–Sommerfeld factor to correct for the use of plane waves instead of Coulomb waves in an attempt to produce a cross-section similar to that from using the more time consuming Coulomb Born approximation. We compare this new approximation with other, often employed correction procedures. Furthermore, we also look at some further modifications to our Born Elwert procedure and its combination with Y.K. Kim's correction of the Coulomb Born approximation for singly charged ions that more accurately approximate convergent close coupling calculations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

Accelerating DCA++ (Dynamical Cluster Approximation) Scientific Application on the Summit supercomputer

Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.

Balduzzi, Giovanni↗
DOE OSTI2015

Nuclear reactor transient analysis via a quasi-static kinetics Monte Carlo method

The predictor-corrector quasi-static (PCQS) method is applied to the Monte Carlo (MC) calculation for reactor transient analysis. To solve the transient fixed-source problem of the PCQS method, fission source iteration is used and a linear approximation of fission source distributions during a macro-time step is introduced to provide delayed neutron source. The conventional particle-tracking procedure is modified to solve the transient fixed-source problem via MC calculation. The PCQS method with MC calculation is compared with the direct time-dependent method of characteristics (MOC) on a TWIGL two-group problem for verification of the computer code. Then, the results on a continuous-energy problem are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Constructing tensor network influence functionals for general quantum dynamics

Here, we describe an iterative formalism to compute influence functionals that describe the general quantum dynamics of a subsystem beyond the assumption of linear coupling to a quadratic bath. We use a space-time tensor network representation of the influence functional and investigate its approximability in terms of its bond dimension and time-like entanglement in the tensor network description. We study two numerical models, the spin-boson model and a model of interacting hard-core bosons in a 1D harmonic trap. We find that the influence functional and the intermediates involved in its construction can be efficiently approximated by low bond dimension tensor networks in certain dynamical regimes, which allows the quantum dynamics to be accurately computed for longer times than with direct time evolution methods. However, as one iteratively integrates out the bath, the correlations in the influence functional can first increase before decreasing, indicating that the final compressibility of the influence functional is achieved via non-trivial cancellation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

DEM simulation of the compression of crushable sand: does the initial particle shape matter?

Advances in DEM modeling, combined with high-resolution X-ray tomography, opened the way for computer models based on virtual replicas of the particles which preserve nearly all facets of their geometry. This leads to simulation advantages, but also high computational costs. Here we tackle a question stemming from this trend: how accurate should particle models be to ensure accuracy? We address this question for the case of the compression of crushable sand. LS-DEM was used to generate three models of Ottawa sand (exact replicas, ellipsoids, and spheres) from digital images of its grains. Compression-induced crushing was simulated for all sets by tracking evolving size and shape distribution. The results confirm that exact replicas provide the closest match of the measurements. However, intermediate degrees of rendering (e.g. ellipsoids preserving volume and aspect ratio of the real grains) led to satisfactory results only marginally different from those of exact replicas. In conclusion, these findings provide an example of the protocols that may be followed to identify the optimal degree of particle approximation which should be regarded as mandatory to achieve a conscious, sustainable use of computational resources.

58 GEOSCIENCES↗
DOE OSTI2023

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

COMPARISON OF IMPLICIT SCHEMES TO SOLVE EQUATIONS OF RADIATION HYDRODYNAMICS WITH A FLUX-LIMITED DIFFUSION APPROXIMATION: NEWTON–RAPHSON, OPERATOR SPLITTING, AND LINEARIZATION

Radiation is an important process of energy transport, a force, and a basis for synthetic observations, so radiation hydrodynamics (RHD) calculations have occupied an important place in astrophysics. However, although the progress in computational technology is remarkable, their high numerical cost is still a persistent problem. In this work, we compare the following schemes used to solve the nonlinear simultaneous equations of an RHD algorithm with the flux-limited diffusion approximation: the Newton–Raphson (NR) method, operator splitting, and linearization (LIN), from the perspective of the computational cost involved. For operator splitting, in addition to the traditional simple operator splitting (SOS) scheme, we examined the scheme developed by Douglas and Rachford (DROS). We solve three test problems (the thermal relaxation mode, the relaxation and the propagation of linear waves, and radiating shock) using these schemes and then compare their dependence on the time step size. As a result, we find the conditions of the time step size necessary for adopting each scheme. The LIN scheme is superior to other schemes if the ratio of radiation pressure to gas pressure is sufficiently low. On the other hand, DROS can be the most efficient scheme if the ratio is high. Although the NR scheme can be adopted independently of the regime, especially in a problem that involves optically thin regions, the convergence tends to be worse. In all cases, SOS is not practical.

79 ASTRONOMY AND ASTROPHYSICS↗