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,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Position-Dependency of Fuel Assembly Homogenization in a Pressurized Water Reactor

2-step nuclear reactor core analysis has long been established as the conventional calculational procedure for the pressurized water reactor (PWR) due to its efficiency. This is because the procedure significantly avoids the potentially huge computational burden arising from an explicit geometrical modeling and consideration of over ∼ 500 energy groups. It instead approaches the problem with spatial homogenization and group condensation: a 2-D lattice transport calculation to homogenize the fuel assembly cross-sections and a 3-D whole core nodal diffusion. One notes that the few-group constant generation using deterministic method could be complicated due to its limited flexibilities in geometrical modeling and inherent drawbacks of the multi-group approximation. Furthermore, accuracy of the deterministic few-group constant generation can especially be compromised during the resonance treatment calculation. As such, an alternative lattice calculation using the Monte Carlo (MC) approach, in place of the deterministic fuel assembly homogenization (few-group constant generation), has previously been proposed. During the assembly homogenization, directions and magnitudes of the current at boundaries are unknowns. Therefore, zero net current boundary conditions (infinite lattice) are instead used as the assembly node. The assumption is quite reasonable considering heterogeneities inside the node are more dominant than heterogeneities due to nodal location in the core. In fact, this approximation has successfully been applied to many LWR core analyses to reasonable accuracy. It should nonetheless be noted that the net current zero boundary assumption effectively ignores position-dependency of the fuel assembly homogenization in the general 2-step method. As such, there are a number of well-known researches on the extended assembly homogenization techniques, which introduce correction factors to compensate effects of the assembly environment, such as Generalized Equivalence Theory (GET), Super-homogenization method (SPH), and color set calculation method. Even though the assembly environment effect has long been acknowledged, its effect has not properly been investigated due to the limited computing power in the past and due to the reasonable accuracy of the extended assembly homogenization techniques. Nonetheless, quantification of position-dependency of the assembly homogenization in the core could still potentially offer additional value in terms of calculation accuracy to the 2-step reactor analysis. It is upon this motivation that the paper is prepared. In this research, position-dependent few-group constants were calculated and compared against those of infinite lattices. All calculations were completed using the MC Serpent2 code with ENDF/B7.0 nuclear data library. In this study, position-dependency of the fuel assembly homogenized cross sections in a PWR core has been investigated through comparison of the conventional 2-step reactor analysis with the reference high fidelity Monte Carlo simulation. It was found that the homogenized two-group constants are clearly position-dependent as the discrepancies between infinite lattice and whole-core calculations are quite significant especially in a rodded assembly. As such, the corresponding correction required due to the assembly environment effect is not negligible compared to the correction required due to assembly heterogeneity itself. It is therefore quite clear that position-dependency of the group cross sections should be considered in the 2-step procedure for a more accurate PWR core analysis. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
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 OSTI2015

Two-component hybrid time-dependent density functional theory within the Tamm-Dancoff approximation

We report the implementation of a two-component variant of time-dependent density functional theory (TDDFT) for hybrid functionals that accounts for spin-orbit effects within the Tamm-Dancoff approximation (TDA) for closed-shell systems. The influence of the admixture of Hartree-Fock exchange on excitation energies is investigated for several atoms and diatomic molecules by comparison to numbers for pure density functionals obtained previously [M. Kühn and F. Weigend, J. Chem. Theory Comput. 9, 5341 (2013)]. It is further related to changes upon switching to the local density approximation or using the full TDDFT formalism instead of TDA. Efficiency is demonstrated for a comparably large system, Ir(ppy){sub 3} (61 atoms, 1501 basis functions, lowest 10 excited states), which is a prototype molecule for organic light-emitting diodes, due to its “spin-forbidden” triplet-singlet transition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗
DOE OSTI2016

Orbital-selective Mott phases of a one-dimensional three-orbital Hubbard model studied using computational techniques

A recently introduced one-dimensional three-orbital Hubbard model displays orbital-selective Mott phases with exotic spin arrangements such as spin block states [J. Rincón et al., Phys. Rev. Lett. 112, 106405 (2014)]. In this paper we show that the constrained-path quantum Monte Carlo (CPQMC) technique can accurately reproduce the phase diagram of this multiorbital one-dimensional model, paving the way to future CPQMC studies in systems with more challenging geometries, such as ladders and planes. The success of this approach relies on using the Hartree-Fock technique to prepare the trial states needed in CPQMC. In addition, we study a simplified version of the model where the pair-hopping term is neglected and the Hund coupling is restricted to its Ising component. The corresponding phase diagrams are shown to be only mildly affected by the absence of these technically difficult-to-implement terms. This is confirmed by additional density matrix renormalization group and determinant quantum Monte Carlo calculations carried out for the same simplified model, with the latter displaying only mild fermion sign problems. Lastly, we conclude that these methods are able to capture quantitatively the rich physics of the several orbital-selective Mott phases (OSMP) displayed by this model, thus enabling computational studies of the OSMP regime in higher dimensions, beyond static or dynamic mean-field approximations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Fock-Space Schrieffer–Wolff Transformation: Classically-Assisted Rank-Reduced Quantum Phase Estimation Algorithm

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer–Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity-transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Optimizing wind farm siting to reduce power system impacts of wind variability

We introduce and solve two variants of a biobjective optimization model to reduce the negative impact of wind variability on the power system by strategically locating wind farms. The first model variant considers average changes in wind power over time; the second captures extreme fluctuations in wind power. A complementary set of wind sites is selected with the aim of minimizing both residual demand and the variability in residual demand. Because exact optimization is computationally intensive, we develop two heuristics—forward and backward greedy algorithms—to find approximate solutions. The results are compared with the exact optimization results for a well-selected subset of the data as well as to the results from selecting sites based on average wind alone. The two models are solved using demand data and potential wind sites for the Southwest Power Pool. Though both objectives can be improved by adding more sites, for a fixed number of sites, minimizing residual demand and variability in residual demand are competing objectives. Here, we find an approximate efficient frontier to compare trade-offs between the two objectives. We also vary the parameter in the heuristic that controls how the two objectives are prioritized. For the case study, the backward greedy algorithm is more effective at reducing the wind power variability than the forward greedy algorithm. Furthermore, using the backward algorithm for the full dataset is more effective than solving the exact optimization on a subset of the data when the results are evaluated using the full dataset.

17 WIND ENERGY↗
DOE OSTI2018

Time-parallel solutions to differential equations via functional optimization

We describe an approach to solving a generic time-dependent differential equation (DE) that recasts the problem as a functional optimization one. The techniques employed to solve for the functional minimum, which we relate to the Sobolev Gradient method, allow for large-scale parallelization in time, and therefore potential faster “wall-clock” time computing on machines with significant parallel computing capacity. We are able to come up with numerous different discretizations and approximations for our optimization-derived equations, each of which either puts an existing approach, the Parareal method, in an optimization context, or provides a new time-parallel (TP) scheme with potentially faster convergence to the DE solution. We describe how the approach is particularly effective for solving multiscale DEs and present TP schemes that incorporate two different solution scales. Sample results are provided for three differential equations, solved with TP schemes, and we discuss how the choice of TP scheme can have an orders of magnitude effect on the accuracy or convergence rate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A comparison of Gaussian processes and neural networks for computer model emulation and calibration

The Department of Energy relies on complex physics simulations for prediction in domains like cosmology, nuclear theory, and materials science. These simulations are often extremely computationally intensive, with some requiring days or weeks for a single simulation. In order to assure their accuracy, these models are calibrated against observational data in order to estimate inputs and systematic biases. Because of their great computational complexity, this process typically requires the construction of an emulator, a fast approximation to the simulation. In this paper, two emulator approaches are compared: Gaussian process regression and neural networks. Their emulation accuracy and calibration performance on three real problems of Department of Energy interest is considered. On these problems, the Gaussian process emulator tends to be more accurate with narrower, but still well-calibrated uncertainty estimates. The neural network emulator is accurate, but tends to have large uncertainty on its predictions. Finally, as a result, calibration with the Gaussian process emulator produces more constrained posteriors that still perform well in prediction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

NLO QCD corrections to full off-shell production of $t\overline{t}Z$ including leptonic decays

Motivated by ongoing new physics searches in the top-quark sector at the Large Hadron Collider we report on the calculation of NLO QCD corrections to the Standard Model $pp$→$t\overline{t}Z + X$ process in the tetra-lepton decay channel. This calculation is based on the matrix elements for the $e^+v_eμ^-\bar v_μb\bar bτ^+τ^-$ final state and includes all resonant and non-resonant Feynman diagrams, interferences and off-shell effects of the top quark as well as the W and Z gauge bosons. Also incorporated are photon-induced contributions. As it is customary for such studies, we show theoretical predictions for both fixed and dynamical factorisation and renormalisation scale choices and different PDF sets. Furthermore, we study the main theoretical uncertainties that are associated with neglected higher-order terms in the perturbative expansion and with the parameterisation of the PDF sets. In order to investigate the size of off-shell effects and higher-order corrections in top-quark decays, we perform a second computation for this process, which is based on the narrow-width-approximation where the top quarks, W and Z gauge bosons are kept on-shell. Results are given for the integrated and differential fiducial cross sections for the LHC Run II center-of-mass energy of 13 TeV.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Study of the Electronic Structure, Magnetic and Elastic Properties and Half-Metallic Stability on Variation of Lattice Constants for CoFeCrZ (Z = P, As, Sb) Heusler Alloys

Structural, elastic, magnetic and electronic properties of CoFeCrZ (Z = P, As, Sb) Heusler alloys in their YI-type structure have been computed by density functional theory-based WIEN2k code within generalized gradient approximation for exchange correlation functions. Values of formation energy and elastic constants verify the stability of these alloys. True half metallic ferromagnetic behaviour with 100% spin polarization and good band gap in the minority spin are obtained for all the alloys. Magnetic moment of these alloys is 4.00 μ{sub B}, which matches well with the value predicted from Slater-Pauling rule. Half-metallicity is maintained over a wide range of lattice constants making these alloys promising for spintronics device applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2018

Boundaries of Stability Domains for Equilibrium Points of Differential Equations with Parameters

We consider autonomous and periodic differential equations containing two scalar parameters and analyze the construction of boundaries of stability domains of equilibrium points for such equations in the plane of parameters. We indicate conditions under which a unique smooth boundary curve passes through a given point. We propose a scheme of approximate construction of this curve.

97 MATHEMATICS AND COMPUTING↗