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,171 records · Page 65
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Operating Hardware Impact on the Heat Transfer Properties of Windows

Despite significant advancements in fenestration technology in the last two decades, the thermal transmittance of fenestration products is still significantly higher than that of walls. This corresponds to 60% of the total energy loss of a modern building envelope through the windows. Hence, further development and improvements of fenestration products are necessary. Increasingly stringent codes and standards for fenestration stimulate industry to work on improved solutions. Thus, it is crucial that assessment techniques are able to account for innovations accurately. The thermal effects of non-continuous hardware in window frames are currently ignored by international rating procedures. A preliminary investigation conducted by our team showed significant performance degradation in two of the three out-opening casement profiles caused by the presence of operating hardware. Frames with the structure made of vinyl and fiberglass consist of many air cavities that are penetrated by operating hardware made of highly conductive materials. In these frames, in order to have an accurate assessment, it may be required to employ three-dimensional modeling due to the convective nature of heat transfer within the cavities. However, in this study, we demonstrate that the three-dimensional (3D) effects of non-continuous hardware can be approximated accurately with simpler two-dimensional (2D) simulations. We then develop a simplified model based on weighted average capable of replacing the time- and computation-intensive 3D simulations with 2D simulations and validate it against market available frames and their corresponding hardware. Validation results show that our approximation technique results in discrepancies lower than 0.05 W/(m2K), or 3% of the total thermal transmittance. Thus, we conclude that simplified 2D simulation models may be used for predicting hardware impact in window frames with reasonable accuracy. As windows and glazing structures are becoming ever better thermally insulated, it is becoming even more important to be able to model the impact of the operating hardware on the total thermal performance in order to design the best windows possible and not let the operating hardware ruin an otherwise well-proven design, which is hence addressed in this study.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

An effective numerical algorithm for intra-granular fission gas release during non-equilibrium trapping and resolution

Both fission gas release and gaseous swelling in nuclear fuel are driven by the transport of fission gas from within the fuel grains to grain boundaries (intra-granular fission gas release). The process involves gas atom diffusion in conjunction with trapping in and resolution from intra-granular bubbles, and is described mathematically by a system of two partial differential equations (PDE). Following Speight, under the assumption of equilibrium between trapping and resolution (quasi-stationary approximation) the system can be reduced to a single diffusion equation with an effective diffusion coefficient. Numerical solutions used in engineering fuel performance calculations invariably rely on this simplification. First, we investigate the validity of the quasi-stationary approximation compared to the solution of the general system of PDEs. Results demonstrate that the approximation is valid under most conditions of practical interest, but is inadequate to model intra-granular fission gas release during rapid transients to relatively high temperatures such as postulated reactivity initiated accidents (RIA). Then, we develop a novel numerical algorithm for the solution of the general problem in time-varying conditions. We verify the PolyPole-2 algorithm against a reference finite difference solution for a large number of randomly generated operation histories including prototypical RIA transients. Results demonstrate that PolyPole-2 captures the solution of the general PDE system with a high accuracy and a low computational cost. As a result, the PolyPole-2 algorithm overcomes the quasi-stationary approximation and the concept of an effective diffusion coefficient for the solution of the intra-granular fission gas release problem in nuclear fuel analysis.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2021

Numerically exact generalized Green's function cluster expansions for electron-phonon problems

We generalize the family of approximate momentum average methods to formulate a numerically exact, convergent hierarchy of equations whose solution provides an efficient algorithm to compute the Green's function of a particle dressed by bosons suitable in the entire parameter regime. We use this approach to extract ground-state properties and spectral functions. Our approximation-free framework, dubbed the generalized Green's function cluster expansion (GGCE), allows access to exact numerical results in the extreme adiabatic limit, where many standard methods struggle or completely fail. We showcase the performance of the method, specializing three important models of charge-boson coupling in solids and molecular complexes: the molecular Holstein model, which describes coupling between charge density and local distortions, the Peierls model, which describes modulation of charge hopping due to intersite distortions, and a more complex Holstein + Peierls system with couplings to two different phonon modes, paradigmatic of charge-lattice interactions in organic crystals. Furthermore, the GGCE serves as an efficient approach that can be systematically extended to different physical scenarios, thus providing a tool to model the frequency dependence of dressed particles in realistic settings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

A Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT): Part I. The clear-sky model

The solar energy industry often uses individual steps to empirically compute plane-of-array (POA) irradiance from horizontal irradiance and decompose it to narrow-wavelength bands. Conventional radiative transfer models designed for meteorological applications requires significant computing efforts in practice; however, they provide a physics-based solution of radiance and therefore are capable of computing spectral POA irradiances in a single step. In this study, we integrate the advantages of the current models and develop an innovative radiative transfer model, the Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT), to efficiently compute irradiances on inclined photovoltaics (PV) panels for 2002 narrow-wavelength bands from 0.28 to 4.0 um. This study is reported in two parts. Part I presents the methodology and performance evaluation of the new model under clear-sky conditions. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS), which was designed to compute clear-sky irradiances, is employed to rapidly provide the optical properties of a given clear-sky atmosphere. The clear-sky radiances in the narrow-wavelength bands are computed by considering three paths of photon transmission and solving the radiative transfer equation with the single-scattering approximation. The Bi-directional Transmittance Distribution Function (BTDF) of aerosols is given by their single-scattering phase function with a correction using a two-stream approximation. The validation analysis confirms that FARMS-NIT has improved accuracy compared to TMYSPEC as evaluated by both surface observations and a state-of-the-art radiative transfer model. This model substantially improves computational efficiency compared to other radiative transfer models though it uses slightly more computing time than TMYSPEC. Part II of this study addresses the model in cloud-sky conditions and will be published as a companion paper.

14 SOLAR ENERGY↗
DOE OSTI2023

Scalable computations for nonstationary Gaussian processes

Nonstationary Gaussian process models can capture complex spatially varying dependence structures in spatial datasets. However, the large number of observations in modern datasets makes fitting such models computationally intractable with conventional dense linear algebra. In addition, derivative-free or even first-order optimization methods can be very slow to converge when estimating many spatially varying parameters. In this paper, we present a computational framework which couples an algebraic block diagonal plus low-rank covariance matrix approximation with stochastic trace estimation to facilitate the efficient use of second-order solvers for maximum likelihood estimation of Gaussian process models with many parameters. We demonstrate the effectiveness of these methods by simultaneously fitting 192 parameters in the popular nonstationary model of Paciorek and Schervish using 107,600 sea surface temperature anomaly measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Exascale Computing Facility Modification (ECFM) Project Requirements Document

The objective of the project is to modify and upgrade the civil, structural, architectural, mechanical, and electrical systems of B453 and an adjacent approximately 3.5 acres of previously developed site. These modifications and upgrades would allow for continued use of B453 to support the increasing demands of the next generation high-performance computers. These modifications and upgrades would also provide enhanced power and cooling for the current and future ATS computers.

42 ENGINEERING↗
DOE OSTI2025

Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems

Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Automatic Differentiation in MetaPhysicL and Its Applications in MOOSE

Efficient solution via Newton’s method of nonlinear systems of equations requires an accurate representation of the Jacobian, corresponding to the derivatives of the component residual equations with respect to the degrees of freedom. In practice these systems of equations often arise from spatial discretization of partial differential equations used to model physical phenomena. These equations may involve domain motion or material equations that are complex functions of the systems’ degrees of freedom. Computing the Jacobian by hand in these situations is arduous and prone to error. Finite difference approximations of the Jacobian or its action are prone to truncation error, especially in multiphysics settings. Symbolic differentiation packages may be used, but often result in an excessive number of terms in realistic model scenarios. An alternative to symbolic and numerical differentiation is automatic differentiation (AD), which propagates derivatives with every elementary operation of a computer program, corresponding to continual application of the chain rule. Automatic differentiation offers the guarantee of an exact Jacobian at a relatively small overhead cost. In this work, we outline the adoption of AD in the Multiphysics Object Oriented Simulation Environment (MOOSE) via the MetaPhysicL package. We describe the application of MOOSE’s AD capability to several sets of physics that were previously infeasible to model via hand-coded or Jacobian-free simulation techniques, including arbitrary Lagrangian-Eulerian and level-set simulations of laser melt pools, phase-field simulations with free energies provided through neural networks, and metallic nuclear fuel simulations that require inner Newton loop calculation of nonlinear material properties.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2023

Right band gaps for the right reason at low computational cost with a meta-GGA

In density functional theory, traditional explicit density functionals such as the local density approximation and generalized gradient approximations cannot accurately predict the band gap of solids for a fundamental reason: They lack the exchange-correlation derivative discontinuity. By comparing Kohn-Sham and generalized Kohn-Sham calculations, we here show that the nonempirical meta-generalized-gradient-approximation (meta-GGA) TASK from Aschebrock and Kümmel [Phys. Rev. Res. 1, 033082 (2019)] predicts the right gaps for the right reason, i.e., as a combination of a proper Kohn-Sham gap and a substantial derivative discontinuity contribution. For many materials from small-gap semiconductors to large-gap insulators, the proper band gap is thus obtained. Here we further study a group of metal-halide perovskites for which the band gap is notoriously hard to predict. For these materials, TASK yields band gaps very similar to the nonlocal screened hybrid Heyd-Scuseria-Ernzerhof functional, yet at a fraction of the hybrid functional’s computational cost. We discuss the influence of correlation functionals, and open questions in the comparison of calculated band gaps with experimental ones.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Natively Periodic Fast Multipole Method: Approximating the Optimal Green’s Function

The fast multipole method (FMM) obeys periodic boundary conditions "natively" if it uses a periodic Green's function for computing the multipole expansion in the interaction zone of each FMM oct-tree node. One can define the "optimal" Green's function for such a method that results in the numerical solution that converges to the equivalent particle-mesh (PM) solution in the limit of sufficiently high order of multipoles. A discrete functional equation for the optimal Green's function can be derived, but is not practically useful as methods for its solution are not known. Instead, this paper presents an approximation for the optimal Green's function that is accurate to better than 10 -3 in ${L}_{\mathrm{MAX}}$ norm and 10 -4 in L 2 norm for practically useful multipole counts. Such an approximately optimal Green's function offers a practical way for implementing the FMM with periodic boundary conditions natively, without the need to compute lattice sums or to rely on hybrid FMM-PM approaches.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
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 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 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 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 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 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↗