Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied 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 415 records · Page 23

Landau Singularities Revisited: Computational Algebraic Geometry for Feynman Integrals

We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the standard model in dimensional regularization. After highlighting issues in the textbook treatment of Landau singularities, we develop an algorithm for classifying and computing them using techniques from computational algebraic geometry. We introduce an algebraic variety called the principal Landau determinant, which captures the singularities even in the presence of massless particles or UV/IR divergences. We illustrate this for 114 example diagrams, including a cutting-edge 2-loop 5-point nonplanar QCD process with multiple mass scales. Published by the American Physical Society 2024

Physics↗

Energy-efficient mapping of large-scale workflows under deadline constraints in big data computing systems

Large-scale workflows for big data analytics have become a main consumer of energy in data centers where moldable parallel computing models such as MapReduce are widely applied to meet high computational demands with time-varying computing resources. The granularity of task partitioning in each moldable job of such big data workflows has a significant impact on energy efficiency, which remains largely unexplored. In this paper, we analyze the properties of moldable jobs and formulate a workflow mapping problem to minimize the dynamic energy consumption of a given workflow request under a deadline constraint in big data systems. Since this problem is strongly NP-hard, we design a fully polynomial-time approximation scheme (FPTAS) for a special case with a pipeline-structured workflow on a homogeneous cluster and a heuristic for the generalized problem with an arbitrary workflow on a heterogeneous cluster. The performance superiority of the proposed solution in terms of dynamic energy saving and deadline missing rate is illustrated by extensive simulation results in comparison with existing algorithms, and further validated by real-life workflow implementation and experimental results in Hadoop/YARN systems.

97 MATHEMATICS AND COMPUTING↗

SPECT imaging with resolution recovery

Single-photon emission computed tomography (SPECT) is a method of choice for imaging spatial distributions of radioisotopes. Many applications of this method are found in nuclear industry, medicine, and biomedical research. We study mathematical modeling of a micro-SPECT system by using a point-spread function (PSF) and implement an OSEM-based iterative algorithm for image reconstruction with resolution recovery. Unlike other known implementations of the OSEM algorithm, we apply en efficient computation scheme based on a useful approximation of the PSF, which ensures relatively fast computations. The proposed approach can be applied with the data acquired with any type of collimators, including parallel-beam fan-beam, cone-beam and pinhole collimators. Experimental results obtained with a micro SPECT system demonstrate high efficiency of resolution recovery. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NONLINEAR SIMULATION OF TURBULENT FIELD LINES AND COMPARISON OF THEIR MEAN CROSS-FIELD DISPLACEMENT WITH THEORETICAL PREDICTION

A new method for the full nonlinear computation of turbulent field lines is presented that extends the Sums of Random Numbers Distribution method previously applied to the computation of generalized quasilinear (GQL) field lines. A study of the mean cross-field displacement confirms the theoretical prediction of a nonlinear diffusion regime, on the large scales where the mean cross-field displacement exceeds twice the perpendicular correlation length. The simulation results duplicate at all length scales the variations of the mean cross-field displacement predicted by the theoretical calculations, including the transitions from GQL supradiffusion to nonlinear diffusion. Both GQL and full nonlinear computations also reproduce, accurately, the predicted variations with turbulence level of the large-scale GQL and nonlinear diffusion coefficients, respectively.

97 MATHEMATICS AND COMPUTING↗

Accelerating Scientific Simulations with Bi-Fidelity Weighted Transfer Learning

High-fidelity modeling is an essential design tool for many engineering applications. However, for complex systems, computational cost can be a limiting factor. Analyzing parameter sensitivity, uncertainty quantification, and design optimization require many model evaluations. Surrogate models are often used to develop the relationship between model parameters and quantities of interest. However, in the case of complex systems, surrogate models require several degrees of freedom and, thus, a large number of data points to determine the correct dependencies. For many applications, this may be prohibitively expensive. The reduction of computational requirements can be achieved by leveraging low-fidelity models. Low-fidelity models represent the system at a coarser resolution with the advantage of computational efficiency. Therefore, a bi-fidelity modeling paradigm, which augments the accuracy of a low-fidelity model in a computationally efficient manner by invoking limited runs of a high-fidelity model, can be leveraged to sufficiently balance the accuracy and computational requirements. In this work, a bi-fidelity weighted transfer learning method using neural networks was applied to a computational fluid dynamics heat transfer modeling problem. The transfer learning advantage was investigated as a function of hyperparameters. Our main finding is that the use of a bi-fidelity modeling paradigm achieves accuracy close to that of a high-fidelity Gaussian process model while significantly reducing computational cost. The bi-fidelity model achieves comparable performance with 90 high-fidelity samples-that is, 60% less than the samples needed to achieve similar accuracy without the use of bi-fidelity modeling,

Borowiec, Katarzyna↗

Cloud droplet diffusional growth in homogeneous isotropic turbulence: bin microphysics versus Lagrangian super-droplet simulations

The increase in the spectral width of an initially monodisperse population of cloud droplets in homogeneous isotropic turbulence is investigated by applying a finite-difference fluid flow model combined with either Eulerian bin microphysics or a Lagrangian particle-based scheme. The turbulence is forced applying a variant of the so-called linear forcing method that maintains the mean turbulent kinetic energy (TKE) and the TKE partitioning between velocity components. The latter is important for maintaining the quasi-steady forcing of the supersaturation fluctuations that drive the increase in the spectral width. We apply a large computational domain (64 3 m 3 ), one of the domains considered in Thomas et al. (2020). The simulations apply 1 m grid length and are in the spirit of the implicit large eddy simulation (ILES), that is, with small-scale dissipation provided by the model numerics. This is in contrast to the scaled-up direct numerical simulation (DNS) applied in Thomas et al. (2020). Two TKE intensities and three different droplet concentrations are considered. Analytic solutions derived in Sardina et al. (2015), valid for the case when the turbulence integral timescale is much larger than the droplet phase relaxation timescale, are used to guide the comparison between the two microphysics simulation techniques. The Lagrangian approach reproduces the scalings relatively well. Representing the spectral width increase in time is more challenging for the bin microphysics because appropriately high resolution in the bin space is needed. The bin width of 0.5 µm is only sufficient for the lowest droplet concentration (26 cm -3 ). For the highest droplet concentration (650 cm -3 ), an order of magnitude smaller bin size is barely sufficient. The scalings are not expected to be valid for the lowest droplet concentration and the high-TKE case, and the two microphysics schemes represent similar departures. Finally, because the fluid flow is the same for all simulations featuring either low or high TKE, one can compare point-by-point simulation results. Such a comparison shows very close temperature and water vapor point-by-point values across the computational domain and larger differences between simulated mean droplet radii and spectral width. The latter are explained by fundamental differences in the two simulation methodologies, numerical diffusion in the Eulerian bin approach and a relatively small number of Lagrangian particles that are used in the particle-based microphysics.

54 ENVIRONMENTAL SCIENCES↗

Melter Modeling over a Range of Scales to Support Vitrification at the WTP

Computational modeling is a powerful complement to laboratory experiments and testing of systems at various scales. When properly applied and validated, computational fluid dynamics (CFD) can provide information not readily obtainable by physical testing, especially in cases where the operating environment does not permit visual observation or the insertion of typical data acquisition instrumentation as in the case of waste glass vitrification. A series of CFD and heat transfer models over a range of scales are being developed to support melter operations at the Hanford Waste Treatment and Immobilization Plant. This paper provides a description of the models and the resulting information they provide that can be used to improve melter throughput, as well as aid in evaluating and resolving operating plant issues or upsets. This work is important for the WTP operation by providing a potential for model-predictive control of the melter operation. Increases in the rate of glass production and avoiding idling can significantly decrease the duration and cost of the vitrification campaign, potentially saving billions of dollars.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Melter Modeling over a Range of Scales to Support Vitrification at the WTP - 19664

Computational modeling is a powerful complement to laboratory experiments and testing of systems at various scales. When properly applied and validated, computational fluid dynamics (CFD) can provide information not readily obtainable by physical testing, especially in cases where the operating environment does not permit visual observation or the insertion of typical data acquisition instrumentation as in the case of waste glass vitrification. A series of CFD and heat transfer models over a range of scales are being developed to support melter operations at the Hanford Waste Treatment and Immobilization Plant. This paper provides a description of the models and the resulting information they provide that can be used to improve melter throughput, as well as aid in evaluating and resolving operating plant issues or upsets. This work is important for the WTP operation by providing a potential for model-predictive control of the melter operation. Increases in the rate of glass production and avoiding idling can significantly decrease the duration and cost of the vitrification campaign, potentially saving billions of dollars. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Reduced scaling formulation of CASPT2 analytical gradients using the supporting subspace method

We present a reduced scaling and exact reformulation of state specific complete active space second-order perturbation (CASPT2) analytical gradients in terms of the MP2 and Fock derivatives using the supporting subspace method. This work follows naturally from the supporting subspace formulation of the CASPT2 energy in terms of the MP2 energy using dressed orbitals and Fock builds. For a given active space configuration, the terms corresponding to the MP2-gradient can be evaluated with O(N5) operations, while the rest of the calculations can be computed with O(N3) operations using Fock builds, Fock gradients, and linear algebra. When tensor-hyper-contraction is applied simultaneously, the computational cost can be further reduced to O(N4) for a fixed active space size. The new formulation enables efficient implementation of CASPT2 analytical gradients by leveraging the existing graphical processing unit (GPU)-based MP2 and Fock routines. We present benchmark results that demonstrate the accuracy and performance of the new method. Example applications of the new method in ab initio molecular dynamics simulation and constrained geometry optimization are given.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation

Algorithmic differentiation (AD) is a tool for generating discrete adjoint solvers, which efficiently compute gradients of functions with many inputs, for example for use in gradient-based optimization. AD is often applied to large computations such as stencil operators, which are an important part of most structured-mesh PDE solvers. Stencil computations are often parallelized, for example by using OpenMP, and optimized by using techniques such as cache-blocking and tiling to fully utilize multicore CPUs and many-core accelerators and GPUs. Differentiating these codes with conventional reverse-mode AD results in adjoint codes that cannot be expressed as stencil operations and may not be easily parallelizable. They thus leave most of the compute power of modern architectures unused. We present a method that combines forward-mode AD and loop transformation to generate adjoint solvers that use the same memory access pattern as the original computation that they are derived from and can benefit from the same optimization techniques. The effectiveness of this method is demonstrated by generating a scalable adjoint CFD solver for multicore CPUs and Xeon Phi accelerators.

algorithmic differentiation↗

NONLINEAR SIMULATION OF TURBULENT FIELD LINES: DISPERSAL STATISTICS

A new method for the full nonlinear computation of sets of turbulent field lines is introduced that extends the sums of random numbers distribution method previously applied to the computation of individual field lines. With a multiscale variation of the phases consistent with in situ observations of intermittent solar wind (SW) turbulence, the new method allows inclusion of the equivalent of more than four decades of turbulent scales with a fully three-dimensional distribution of wavevectors. As a first application, pairs of magnetic field lines are computed in independent realizations of the turbulence, for spectra typical of the quiet slow SW near 1 AU. The statistics of field-line dispersal are then studied from the simulated pairs of magnetic field lines and compared to earlier theoretical predictions. It appears that while the earlier theoretical picture remains relatively accurate as long as the mean variation of separation logarithm {Lambda} is less than one, the qualitative picture is quickly altered as {Lambda} grows past one.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Implementation of Many-body Quantum Chemical Methods on the Intel Xeon Phi Coprocessor

This paper presents the implementation and performance of the highly accurate CCSD(T) quantum chemistry method on the Intel Xeon Phi coprocessor within the context of the NWChem computational chemistry package. The widespread use of highly correlated methods in electronic structure calculations is contingent upon the interplay between advances in theory and the possibility of utilizing the ever-growing computer power of emerging heterogeneous architectures. We discuss the design decisions of our implementation as well as the optimizations applied to the compute kernels and data transfers between host and coprocessor. We show the feasibility of adopting the Intel Many Integrated Core Architecture and the Intel Xeon Phi coprocessor for developing efficient computational chemistry modeling tools. Remarkable scalability is demonstrated by benchmarks. Our solution scales up to a total of 62560 cores with the concurrent utilization of Intel Xeon processors and Intel Xeon Phi coprocessors.

Environmental Molecular Sciences Laboratory↗

Unifying Combinatorial and Graphical Methods in Artificial Intelligence

Recently, a new graph Laplacian, called the inner product Laplacian, was introduced which generalizes many existing Laplacians, including the normalized and combinatorial Laplacian and their weighted variants. The key observation behind the inner product Laplacian is that by defining appropriate inner product spaces on the vertices and edges, the standard Laplacians can be recovered as Hodge Laplacians over the simplicial complex formed by the edges and vertices. These inner product spaces form a natural way to incorporate non-combinatorial information into the definition of a domain-specific Laplacian. In particular, in contrast to current domain-specific weighting schemes which rely solely on edge weights, information regarding the similarity of non-adjacent vertices and arbitrary pairs of edges can be effectively incorporated into the Laplacian. In order to illustrate this approach we consider the problem of calculating the potential energy of an atomistic configuration using Graph Neural Networks. In comparison with start-of-the-art approaches, such as SchNet, our approach replaces a learned (via auto-encoder) representation of the atom types with an inner product space on atoms based on scientific knowledge (e.g., electronegativity). We will illustrate how this approach captures key chemical properties of the molecules and compare the energy calculations with state-of-the-art neural network approaches. However, to compute the resulting Laplacian involves a mixture of sparse and dense matrix computation and yields a dense matrix as the basis for the graph convolution. This dense convolutional kernel necessitates moving away from the standard message passing framework for graph neural networks and increases the computational cost of applying the kernel. In order to mitigate these costs we investigate means of leveraging the mixed sparse and dense computations to reduce the overall computational cost and how these approaches can be automatically transferred to energy efficient hardware (e.g., field programmable gate arrays (FPGAs)).

97 MATHEMATICS AND COMPUTING↗

CICART Center For Integrated Computation And Analysis Of Reconnection And Turbulence

CICART is a partnership between the University of New Hampshire (UNH) and Dartmouth College. CICART addresses two important science needs of the DoE: the basic understanding of magnetic reconnection and turbulence that strongly impacts the performance of fusion plasmas, and the development of new mathematical and computational tools that enable the modeling and control of these phenomena. The principal participants of CICART constitute an interdisciplinary group, drawn from the communities of applied mathematics, astrophysics, computational physics, fluid dynamics, and fusion physics. It is a main premise of CICART that fundamental aspects of magnetic reconnection and turbulence in fusion devices, smaller-scale laboratory experiments, and space and astrophysical plasmas can be viewed from a common perspective, and that progress in understanding in any of these interconnected fields is likely to lead to progress in others. The establishment of CICART has strongly impacted the education and research mission of a new Program in Integrated Applied Mathematics in the College of Engineering and Applied Sciences at UNH by enabling the recruitment of a tenure-track faculty member, supported equally by UNH and CICART, and the establishment of an IBM-UNH Computing Alliance. The proposed areas of research in magnetic reconnection and turbulence in astrophysical, space, and laboratory plasmas include the following topics: (A) Reconnection and secondary instabilities in large high-Lundquist-number plasmas, (B) Particle acceleration in the presence of multiple magnetic islands, (C) Gyrokinetic reconnection: comparison with fluid and particle-in-cell models, (D) Imbalanced turbulence, (E) Ion heating, and (F) Turbulence in laboratory (including fusion-relevant) experiments. These theoretical studies make active use of three high-performance computer simulation codes: (1) The Magnetic Reconnection Code, based on extended two-fluid (or Hall MHD) equations, in an Adaptive Mesh Refinement (AMR) framework, (2) the Particle Simulation Code, a fully electromagnetic 3D Particle-In-Cell (PIC) code that includes a collision operator, and (3) GS2, an Eulerian, electromagnetic, kinetic code that is widely used in the fusion program, and simulates the nonlinear gyrokinetic equations, together with a self-consistent set of Maxwell’s equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

(U) A General-Purpose Code for Correlated Sampling Using Batch Statistics with MCNP6 for Fixed-Source Problems

Correlated sampling can be used to reduce the uncertainty of a difference of tallies by taking advantage of the negative covariance term in the sandwich formula. Booth first showed how correlated sampling can be applied with batch statistics using MCNP’s tally fluctuation chart (TFC) to reduce the uncertainty of a difference of tallies in fixed-source problems. Booth presented a problem in which a 1273% uncertainty in a difference was reduced to 8% by accounting for correlations. Researchers He and Su recently studied correlated sampling using the TFC in MCNP version 5. They determined that the code did not print enough digits in the TFC tally means for accurate batch statistics in some cases. After modifying the source code, they concluded that “correlated sampling can yield a standard deviation of about one magnitude smaller than that predicted by the direct, un-correlated simulation when the changes in system response are small (say about 1%), which is equivalent to saving in CPU time by a factor of 100. Such saving [sic] becomes less significant as the change in system response becomes larger.” He and Su provided the formulas needed to apply batch statistics to compute the correlated uncertainty of a difference of tallies. In this report, we follow up on their work by providing the formulas needed to apply batch statistics to compute the correlated uncertainty of a ratio of tallies and of a difference of two tallies divided by a third tally. We extend these formulas to differences and ratios of ratios. These formulas are applied to reduce the uncertainty associated with calculating a relative sensitivity. He and Su did not investigate the accuracy of their correlated sampling uncertainty estimates. We use their test problems and evaluate the accuracy of the uncertainty estimates by comparing with results obtained from random sampling, and, in simple cases, with theoretical values of the “exact” uncertainties. We find that the uncertainties obtained from batch statistics are accurate as long as at least 100 batches are used. We present a new computer code, COSUBS (COrrelated Sampling Using Batch Statistics), that reads MCNP6 TFCs and applies correlated sampling using batch statistics for the tally combinations that the user specifies. COSUBS is a very general tool that compares all TFCs for a base case and one or two perturbed cases. It computes uncertainties for ratios if given only a base case. This report is organized as follows. The equations to apply batch statistics to the difference of random tallies are reviewed in Sec. II. Section III presents the equations for applying batch statistics to a ratio of random tallies; this is useful for computing relative sensitivities using a one-sided finite difference and the relative sensitivity using the differential operator method. Section IV presents the equations for applying batch statistics to a difference of two random tallies divided by a third; this is useful for computing a relative sensitivities using a central difference. Section V presents the equations for applying batch statistics to a difference of two ratios with four random tallies. Section VI presents the equations for applying batch statistics to a one-sided finite difference estimate of the relative sensitivity of a ratio (this uses four random tallies). Section VII presents the equations for applying batch statistics to a central difference estimate of the relative sensitivity of a ratio (this uses six random tallies). Section VIII presents the equations for applying batch statistics to a sum of random tallies. Section IX discusses how to apply batch statistics using MCNP6. Section X presents COSUBS, describing its command-line options and logic. Sections XI through XVI present numerical results for various test problems. Section XVII is a summary and conclusions. Appendix A derives the theoretical Monte Carlo tally variance given certain assumptions; these variances are used to verify the batch statistics for some of the problems. Appendix B lists the MCNP6 input for the unperturbed example problem. Appendix C presents modifications made to MCNP6.3 to support this work.

97 MATHEMATICS AND COMPUTING↗

Computational study of runaway electrons in MST tokamak discharges with applied resonant magnetic perturbation

A numerical study of magnetohydrodynamics (MHD) and tracer-particle evolution investigates the effects of resonant magnetic perturbations (RMPs) on the confinement of runaway electrons (REs) in tokamak discharges conducted in the Madison Symmetric Torus. In computational results of applying RMPs having a broad toroidal spectrum but a single poloidal harmonic, m = 1 RMP does not suppress REs, whereas m = 3 RMP achieves significant deconfinement but not the complete suppression obtained in the experiment. MHD simulations with the NIMROD code produce sawtooth oscillations, and the associated magnetic reconnection can affect the trajectory of REs starting in the core region. Simulations with m = 3 RMP produce chaotic magnetic topology over the outer region, but the m = 1 RMP produces negligible changes in field topology, relative to applying no RMP. Using snapshots of the MHD simulation fields, full-orbit relativistic electron test particle computations with KORC show ≈50% loss from the m = 3 RMP compared to the 10%–15% loss from the m = 1 RMP. Here, test particle computations of the m = 3 RMP in the time-evolving MHD simulation fields show correlation between MHD activity and late-time particle losses, but total electron confinement is similar to computations using magnetic-field snapshots.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗