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,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A status review on the thermal stratification modeling methods for Sodium-cooled Fast Reactors

The thermal stratification phenomenon plays a crucial role in the safety of various nuclear systems, including the Gen-III + Light Water Reactors (LWR) and the Gen-IV reactors. The phenomenon is of particular importance for the pool-type Sodium-cooled Fast Reactors (SFRs) because it may cause neutronic and thermal-hydraulic in- stabilities in the reactor core, or lead to damages of both the reactor vessel and in-vessel components due to the growth of thermal fatigue cracking. More significantly, thermal stratification could impede the establishment of the natural circulation during accidental scenarios and introduce uncertainties to the core safety of SFRs. Efforts for modeling of the thermal stratification in SFRs have been made for decades to prevent or mitigate the damage caused by the phenomenon. This paper gives a review of the advances that have been made in recent 10 years on the computational modeling methods for thermal stratification phenomenon in SFRs. These methods can be generally drawn into two categories. The first one is the system-level methods which provide fast-running but approximate calculations, and the second one is the CFD methods which provide high-resolution calculations at high computational expense. Finally, after introducing the efforts that have been made to improve the one- dimensional (1-D) models, the paper envisioned the possible research directions that could be pursued to enhance the modeling of thermal stratification in the near future.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2026

Tensor network simulations of quasi-GPDs in the massive Schwinger model

Generalized parton distribution functions (GPDs) are off-diagonal light-cone matrix elements that encode the internal structure of hadrons in terms of quark and gluon degrees of freedom. In this work, we present the first nonperturbative study of quasi-GPDs in the massive Schwinger model, quantum electrodynamics in 1+1 dimensions (QED 2 ), within the Hamiltonian formulation of lattice field theory. Quasidistributions are spatial correlation functions of boosted states, which approach the relevant light-cone distributions in the luminal limit. Using tensor networks, we prepare the first excited state in the strongly coupled regime and boost it to close to the light-cone on lattices of up to 400 lattice sites. We compute both quasiparton distribution functions and, for the first time, quasi-GPDs, and study their convergence for increasingly boosted states. In addition, we perform analytic calculations of GPDs in the two-particle Fock-space approximation and in the Reggeized limit, providing qualitative benchmarks for the tensor network results. Our analysis establishes computational benchmarks for accessing partonic observables in low-dimensional gauge theories, offering a starting point for future extensions to higher dimensions, non-Abelian theories, and quantum simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Identification and Online Updating of Dynamic Models for Demand Response of an Industrial Air Separation Unit

Demand-response operation of air separation units requires frequent changes in production rate(s), and scheduling calculations must explicitly consider process dynamics to ensure feasibility of the solutions. To this end, scale-bridging models (SBMs) approximate the scheduling-relevant dynamics of a process and its controller in a low-order representation. In contrast to previous works that have employed nonlinear SBMs, this paper proposes linear SBMs, developed using time-series analysis, to facilitate online scheduling computations. Using a year-long industrial dataset, we nd that compact linear SBMs are suitable approximations over typical scheduling horizons, but that their accuracies are unpredictable over time. We introduce a strategy for online updating of the SBMs, based on Kalman ltering schemes for online parameter estimation. The approach greatly improves the accuracy of SBM predictions and will enable the use of linear SBM-based demand-response scheduling in the future.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

MULTI-PRED: A Software Module for Predictive Modeling of Coupled Multi-Physics Systems: User's Manual

This User’s Manual describes the code module MULTI-PRED, written in FORTRAN which implements the methodology for “predictive modeling of coupled multi-physics systems (PM-CMPS)” formulated by Cacuci (2014). This methodology fully takes into account the coupling terms between the systems but requires only the computational resources that would be needed to perform predictive modeling on each system separately. The PM-CMPS methodology uses the maximum entropy principle to construct an optimal approximation of the unknown a priori distribution based on a priori known mean values and uncertainties characterizing the experimental and computational parameters and results of interest responses, called for the multi-physics models under consideration. This “maximum entropy” a priori distribution is combined, using Bayes’ theorem, with the “likelihood” provided by the multi-physics simulation models to obtain a formal posterior distribution. Subsequently, the posterior distribution thus obtained is evaluated using the saddle-point method to obtain analytical expressions for the optimally predicted values for the multi-physics models parameters and responses along with corresponding reduced uncertainties. Noteworthy, the predictive modeling methodology for the coupled systems is constructed such that the systems can be considered sequentially rather than simultaneously, while preserving exactly the same results as if the systems were treated simultaneously. Consequently, very large coupled systems, which could perhaps exceed available computational resources if treated simultaneously, can be treated with the PM-CMPS methodology presented in this work sequentially and without any loss of generality or information, requiring just the resources that would be needed if the systems were treated sequentially. Three illustrative demonstration problems are also provided. The first problem presents the application of the PM-CMPS methodology to a simple particle diffusion problem which admits a closed-form analytical solution which facilitates a rapid understanding of this methodology and its predicted results. The second demonstration problem presents the application of the PM-CMPS methodology to the problem of inverse prediction, from detector responses in the presence of counting uncertainties, of the thickness of a homogeneous slab of material containing uniformly distributed gamma-emitting sources, for optically thin and thick slabs. This problem highlights the essential role played by the relative uncertainties (or, conversely, accuracies) of measured and computed responses. The third demonstration problem presents the application of the PM-CMPS methodology to the F-area cooling towers at the Savannah River National Lab. This problem demonstrates that the PM-CMPS methodology reduces the predicted response uncertainties not only at locations where measurements are available, but also at locations where measurements are not available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

PhILMs: Collaboratory on Mathematics and Physics-Informed Learning Machines for Multiscale and Multiphysics Problems

The landscape of computational science and engineering is continually evolving, with the challenge of high-dimensional regression problems standing as a significant hurdle in numerous scientific endeavors. Addressing this challenge, our research, funded by this award, has led to the development of an innovative computational framework known as Probabilistic Partition of Unity Networks (PPOU-Nets). This initiative represents a collaborative effort to harness the potential of mathematics and physics-informed machine learning in tackling multiscale and multiphysics problems prevalent in high-dimensional spaces. Through this work, we have proposed a novel methodology that seamlessly integrates adaptive dimensionality reduction and a mixture of experts model, thereby facilitating a more efficient and accurate approximation of complex functions. This research effort has not only advanced the state of computational science but also opened new avenues for exploration in quantum computing and beyond. This report outlines the motivation, methodology, key findings, and implications of our work, underscoring our contributions to the broader scientific community and the potential pathways for future research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗
DOE OSTI2020

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow: Preprint

We develop, in this paper, a machine learning approach to optimize the real-time operation of electric power grids. In particular, we learn feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps. The AC OPF problem aims at identifying optimal operational conditions of the power grids that minimize power losses and/or generation costs. Due to the computational challenges with solving this nonconvex problem, many efforts have focused on linearizing or approximating the problem in order to solve the AC OPF on faster timescales. However, many of these approximations can be fairly poor representations of the actual system state and still require solving an optimization problem, which can be time consuming for large networks. In this work, we learn a mapping between the system loading and optimal generation values, enabling us to find near-optimal and feasible AC OPF solutions. This allows us to bypass solving the traditionally nonconvex AC OPF problem, resulting in a significant decrease in computational burden for grid operators.

machine learning↗
DOE OSTI2021

Photoluminescence spectra of point defects in semiconductors: Validation of first-principles calculations

Optically and magnetically active point defects in semiconductors are interesting platforms for the development of solid state quantum technologies. Their optical properties are usually probed by measuring photoluminescence spectra, which provide information on excitation energies and on the interaction of electrons with lattice vibrations. We present a combined computational and experimental study of photoluminescence spectra of defects in diamond and SiC, aimed at assessing the validity of theoretical and numerical approximations used in first-principles calculations, including the use of the Franck-Condon principle and the displaced harmonic oscillator approximation. We focus on prototypical examples of solid state qubits, the divacancy centers in SiC and the nitrogen-vacancy in diamond, and we report computed photoluminescence spectra as a function of temperature that are in very good agreement with the measured ones. As expected we find that the use of hybrid functionals leads to more accurate results than semilocal functionals. Interestingly our calculations show that constrained density functional theory (CDFT) and time-dependent hybrid DFT perform equally well in describing the excited state potential energy surface of triplet states; our findings indicate that CDFT, a relatively cheap computational approach, is sufficiently accurate for the calculations of photoluminescence spectra of the defects studied here. Finally, we find that only by correcting for finite-size effects and extrapolating to the dilute limit can one obtain a good agreement between theory and experiment. Our results provide a detailed validation protocol of first-principles calculations of photoluminescence spectra, necessary both for the interpretation of experiments and for robust predictions of the electronic properties of point defects in semiconductors.

36 MATERIALS SCIENCE↗
DOE OSTI2019

The addition of methanol to Criegee intermediates

Bimolecular reactions involving stabilized Criegee intermediates (SCI) have been the target of many studies due to the role these molecules play in atmospheric chemistry. Recently, kinetic rates for the addition reaction of the simplest SCI (formaldehyde oxide) and its methylated analogue (acetone oxide) with methanol were reported both experimentally and theoretically. We re-examine the energy profile of these reactions by employing rigorous ab initio methods. Optimized CCSD(T)/ANO1 geometries are reported for the stationary points along the reaction path. Energies are obtained at the CCSD(T)/CBS level of theory. Contributions of full triple and quadruple excitations are computed to assess the convergence of this method. Rate constants are obtained using conventional canonical transition state theory under the rigid rotor harmonic oscillator approximation and with the inclusion of a one-dimensional hindered rotor treatment. These corrections for internal rotations have a significant impact on computed kinetic rate constants. With this approach, we compute rate constants for the addition of methanol to formaldehyde oxide (H 2 COO) and acetone oxide [(CH 3 ) 2 COO] at 298.15 K as (1.2 ± 0.8) × 10 -13 and (2.8 ± 1.3) × 10 -15 cm 3 s -1 , respectively. Additionally, we investigate the temperature dependence of the rate constant, concluding that the transition state barrier height and tunneling contributions shape the qualitative behaviour of these reactions.

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

Multilevel Spectral Coarsening for Graph Laplacian Problems with Application to Reservoir Simulation

We extend previously developed two-level coarsening procedures for graph Laplacian problems written in a mixed saddle point form to the fully recursive multilevel case. The resulting hierarchy of discretizations gives rise to a hierarchy of upscaled models, in the sense that they provide approximation in the natural norms (in the mixed setting). This property enables us to utilize them in three applications: (i) as an accurate reduced model, (ii) as a tool in multilevel Monte Carlo simulations (in application to finite volume discretizations), and (iii) for providing a sequence of nonlinear operators in a full approximation scheme for solving nonlinear pressure equations discretized by the conservative two-point flux approximation. Finally, we illustrate the potential of the proposed multilevel technique in all three applications on a number of popular benchmark problems used in reservoir simulation.

multilevel Monte Carlo↗
DOE OSTI2024

Galaxy bispectrum in the spherical Fourier-Bessel basis

The bispectrum, the three-point correlation in Fourier space, is a crucial statistic for studying many effects targeted by the next-generation galaxy surveys, such as primordial non-Gaussianity (PNG) and general relativistic (GR) effects on large scales. In this work we develop a formalism for the bispectrum in the spherical Fourier-Bessel (SFB) basis—a natural basis for computing correlation functions on the curved sky, as it diagonalizes the Laplacian operator in spherical coordinates. Working in the SFB basis allows for line-of-sight effects such as redshift space distortions and GR to be accounted for exactly, i.e., without having to resort to perturbative expansions to go beyond the plane-parallel approximation. Only analytic results for the SFB bispectrum exist in the literature given the intensive computations needed. We numerically calculate the SFB bispectrum for the first time, enabled by a few techniques: We implement a template decomposition of the redshift-space kernel Z 2 into Legendre polynomials, and separately treat the PNG and velocity-divergence terms. We derive an identity to integrate a product of three spherical harmonics connected by a Dirac delta function as a simple sum and use it to investigate the limit of a homogeneous and isotropic Universe. Furthermore, we present a formalism for convolving the signal with separable window functions and use a toy spherically symmetric window to demonstrate the computation and give insights into the properties of the observed bispectrum signal. While our implementation remains computationally challenging, it is a step toward a feasible full extraction of information on large scales via a SFB bispectrum analysis.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence.

Efficiently performing predictive studies of irradiated particle-laden turbulent flows has the potential of providing significant contributions towards better understanding and optimizing, for example, concentrated solar power systems. As there are many uncertainties inherent in such flows, conducting uncertainty quantification analyses is fundamental to improve the predictive capabilities of the numerical simulations. For largescale, multi-physics problems exhibiting high-dimensional uncertainty, characterizing the stochastic solution presents a significant computational challenge as many methods require a large number of high-fidelity, forward model solves. This requirement results in the need for a possibly infeasible number of simulations when a typical converged high-fidelity simulation requires intensive computational resources. To reduce the cost of quantifying high-dimensional uncertainties, we investigate the application of a non-intrusive, bi-fidelity approximation to estimate statistics of quantities of interest associated with an irradiated particle-laden turbulent flow. This method relies on exploiting the low-rank structure of the solution to accelerate the stochastic sampling and approximation processes by means of cheaper-to-run, lower fidelity representations. The application of this bi-fidelity approximation results in accurate estimates of the QoI statistics while requiring a small number of high-fidelity model evaluations. It also enables efficient computation of sensitivity analyses which highlight that epistemic uncertainty plays an important role in the solution of irradiated, particle-laden turbulent flow.

42 ENGINEERING↗
DOE OSTI2021

Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs

This paper considers structures of systems beyond dyadic (pairwise) interactions and investigates mathematical modeling of multi-way interactions and connections as hypergraphs, where captured relationships among system entities are set-valued. To date, in most situations, entities in a hypergraph are considered connected as long as there is at least one common ``neighbor''. However, minimal commonality sometimes discards the ``strength'' of connections and interactions among groups. To this end, considering the ``width'' of a connection, referred to as the \emph{$s$-overlap} of neighbors, provides more meaningful insights into how closely the communities or entities interact with each other. In addition, $s$-overlap computation is the fundamental kernel to construct the line graph of a hypergraph, a low-order approximation of the hypergraph which can carry significant information about the original hypergraph. Subsequent stages of a data analytics pipeline then can apply highly-tuned graph algorithms on the line graph to reveal important features. Given a hypergraph, computing the $s$-overlaps by exhaustively considering all pairwise entities can be computationally prohibitive. To tackle this challenge, we develop efficient algorithms to compute $s$-overlaps and the corresponding line graph of a hypergraph. We propose several heuristics to avoid execution of redundant work and improve performance of the $s$-overlap computation. Our parallel algorithm, combined with these heuristics, is orders of magnitude (more than $10\times$) faster than the naive algorithm in all cases and the SpGEMM algorithm with filtration in most cases (especially with large $s$ value).

hypergraph algorithms, graph algorithms, parallel ↗
DOE OSTI2024

Density scaling approximation for Monte-Carlo simulations of radioactive plumes

The release of radioactive gas into the atmosphere can diffuse into large volumes of air downwind from the point of release. The extent of radioactivity can cover thousands of cubic meters of air. For such large volumes, the weather models used to predict the down-wind distribution of the plume and the radiation transport models used to predict the radiation reaching ground-level from the plume can take tens of hours of computer time on multi-node institutional High-Performance Computing facilities. In this paper we focus on the radiation transport aspect of plume modeling. Here, we describe a phenomenological method for approximating the amounts of radiation that reach ground level from large volumes of a static radioactive plume that can be calculated on a stand-alone personal computer in much shorter computation times than those usually needed for such large volume evaluations. We refer to this method as the Density Scaling Approximation (DSA). Its ability to approximate ground-level count rates of large plumes comes from using a small-plume volume with a scaled-up value of air density to simulate the same number of scatterings that occur during transport in larger plume volumes at normal air density. We demonstrate the DSA by using a 100 m-diameter air-filled hemispherical dome geometry with a uniform volumetric activity of 135 Xe gas throughout the air-filled volume. The DSA for a larger dome diameter is obtained by evaluating the 100 m dome with an air density scaled up by the linear ratio of the larger diameter to the 100 m diameter. We find that this approximation works well for dome diameters up to 1200 m – the largest diameter studied and a size more than sufficient for accounting for all the radiation from 135 Xe. Moreover, most of our DSA results can be calculated over 500 times faster than corresponding full-sized geometry with normal air density. To help evaluate the accuracy of the DSA and gain insight into how well it can reproduce different regions of the spectra, we use three, easily understood regions of interest to compare the DSA results to the full-sized geometry at normal air density results. These regions are the full-energy peak, the region of single-Compton scattering, and the region of multiple-Compton scattering. We show how the dominance of the Compton scattering mechanism determines this division and thus provides insight into how Compton scattering is manifested in spectra from photon scattering through air in general, and how well the DSA approximation works.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

A geometric initial guess for localized electronic orbitals in modular biological systems

Recent first-principles molecular dynamics algorithms using localized electronic orbitals have achieved O(N) complexity and controlled accuracy in simulating systems with finite band gaps. However, accurately deter- mining the centers of these localized orbitals during simulation setup may require O(N 3 ) operations, which is computationally infeasible for many biological systems. We present an O(N) approach for approximating orbital centers in proteins, DNA, and RNA which uses non-localized solutions for a set of fixed-size subproblems to create a set of geometric maps applicable to larger systems. This scalable approach, used as an initial guess in the O(N) first-principles molecular dynamics code MGmol, facilitates first-principles simulations in biological systems of sizes which were previously impossible.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Fourier-informed knot placement schemes for B-spline approximation

Fitting B-splines to scientific data is especially challenging when the given data contain noise, jumps, or corners. Here, we describe how periodic data sets with these features can be efficiently approximated with B-splines by analyzing the Fourier spectrum of the data. Our method uses a collection of spectral filters to compute high-order derivatives, smoothed versions of noisy data, and the locations of jump discontinuities. Further, these quantities are then combined to choose knots that capture the qualitative features of the data, leading to accurate B-spline approximations with few knots. The method we introduce is direct and does not require any intermediate B-spline fitting before choosing the final knot distribution. Aside from fast Fourier transforms to transfer to and from Fourier space, the method runs in linear time with very little communication. We assess performance on several test cases in one and two dimensions, including data sets with jump discontinuities and noise. These tests show the method fits discontinuous data without spurious oscillations and remains effective in the presence of noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications

Physics-informed deep operator networks (DeepONets) have emerged as a promising approach toward numerically approximating the solution of partial differential equations (PDEs). In this work, we aim to develop further understanding of what is being learned by physics-informed DeepONets by assessing the universality of the extracted basis functions and demonstrating their potential toward model reduction with spectral methods. Results provide clarity about measuring the performance of a physics-informed DeepONet through the decays of singular values and expansion coefficients. In addition, we propose a transfer learning approach for improving training for physics-informed DeepONets between parameters of the same PDE as well as across different, but related, PDEs where these models struggle to train well. This approach results in significant error reduction and learned basis functions that are more effective in representing the solution of a PDE.

Deep operator networks↗
DOE OSTI2018

Non-additive non-interacting kinetic energy of rare gas dimers

We show approximations of the non-additive non-interacting kinetic energy (NAKE) as an explicit functional of the density are the basis of several electronic structure methods that provide improved computational efficiency over standard Kohn-Sham calculations. However, within most fragment-based formalisms, there is no unique exact NAKE, making it difficult to develop general, robust approximations for it. When adjustments are made to the embedding formalisms to guarantee uniqueness, approximate functionals may be more meaningfully compared to the exact unique NAKE. We use numerically accurate inversions to study the exact NAKE of several rare-gas dimers within partition density functional theory, a method that provides the uniqueness for the exact NAKE. We find that the NAKE decreases nearly exponentially with atomic separation for the rare-gas dimers. We compute the logarithmic derivative of the NAKE with respect to the bond length for our numerically accurate inversions as well as for several approximate NAKE functionals. We show that standard approximate NAKE functionals do not reproduce the correct behavior for this logarithmic derivative and propose two new NAKE functionals that do. The first of these is based on a re-parametrization of a conjoint Perdew-Burke-Ernzerhof (PBE) functional. The second is a simple, physically motivated non-decomposable NAKE functional that matches the asymptotic decay constant without fitting.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗