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,387 records · Page 77

Fast Katz and commuters : efficient estimation of social relatedness.

Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topological measures including the Katz score and the commute time. Existing approaches typically approximate all pairwise relationships simultaneously. In this paper, we are interested in computing: the score for a single pair of nodes, and the top-k nodes with the best scores from a given source node. For the pairwise problem, we apply an iterative algorithm that computes upper and lower bounds for the measures we seek. This algorithm exploits a relationship between the Lanczos process and a quadrature rule. For the top-k problem, we propose an algorithm that only accesses a small portion of the graph and is related to techniques used in personalized PageRank computing. To test the scalability and accuracy of our algorithms we experiment with three real-world networks and find that these algorithms run in milliseconds to seconds without any preprocessing.

99 GENERAL AND MISCELLANEOUS↗

Recoil velocity at second post-Newtonian order for spinning black hole binaries

We compute the flux of linear momentum carried by gravitational waves emitted from spinning binary black holes at second post-Newtonian (2PN) order for generic orbits. In particular we provide explicit expressions of three new types of terms, namely, next-to-leading order spin-orbit terms at 1.5 post-Newtonian (1.5PN) order, spin-orbit tail terms at 2PN order, and spin-spin terms at 2PN order. Restricting ourselves to quasicircular orbits, we integrate the linear-momentum flux over time to obtain the recoil velocity as function of orbital frequency. We find that in the so-called superkick configuration the higher-order spin corrections can increase the recoil velocity up to a factor {approx}3 with respect to the leading-order PN prediction. Whereas the recoil velocity computed in PN theory within the adiabatic approximation can accurately describe the early inspiral phase, we find that its fast increase during the late inspiral and plunge, and the arbitrariness in determining until when it should be trusted, makes the PN predictions for the total recoil not very accurate and robust. Nevertheless, the linear-momentum flux at higher PN orders can be employed to build more reliable resummed expressions aimed at capturing the nonperturbative effects until merger. Furthermore, we provide expressions valid for generic orbits, and accurate at 2PN order, for the energy and angular momentum carried by gravitational waves emitted from spinning binary black holes. Specializing to quasicircular orbits we compute the spin-spin terms at 2PN order in the expression for the evolution of the orbital frequency and found agreement with Mikoczi, Vasuth, and Gergely. We also verified that in the limit of extreme mass ratio our expressions for the energy and angular momentum fluxes match the ones of Tagoshi, Shibata, Tanaka, and Sasaki obtained in the context of black hole perturbation theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Diagonal Approximation for Holographic Rényi Entropies

Recently, Dong et al., [A modified cosmic brane proposal for holographic Renyi entropy, J. High Energy Phys. 06 (2024) 120] proposed a modified cosmic brane prescription for computing the Rényi entropy 𝑆𝛼 of a holographic system in the presence of multiple extremal surfaces. This prescription was found by assuming a diagonal approximation, where the Rényi entropy is computed after first measuring the areas of all extremal surfaces. We derive this diagonal approximation for the case of two extremal surfaces and show that it accurately computes Rényi entropies up to 𝑂⁡(log⁡𝐺) corrections. For 𝛼 <1, this allows us to derive the modified cosmic brane prescription, which differs from the original cosmic brane prescription at leading order in 𝐺. For 𝛼 >1, it leads to the original cosmic brane prescription without needing to assume that replica symmetry is unbroken in the bulk.

FOS: Physical sciences↗

A posteriori error estimators for the discrete ordinates approximation of the one-speed neutron transport equation

When calculating numerical solutions of the neutron transport equation it is important to have a measure of the accuracy of the solution. As the true solution is generally not known, a suitable estimation of the error must be made. The steady state transport equation possesses discretization errors in all its independent variables: angle, energy and space. In this work only spatial discretization errors are considered. An exact transport solution, in which the degree of regularity of the exact flux across the singular characteristic is controlled, is manufactured to determine the numerical solutions true discretization error. This solution is then projected onto a Legendre polynomial space in order to form an exact solution on the same basis space as the numerical solution, Discontinuous Galerkin Finite Element Method (DGFEM), to enable computation of the true error. Over a series of test problems the true error is compared to the error estimated by: Ragusa and Wang (RW), residual source (LER) and cell discontinuity estimators (JD). The validity and accuracy of the considered estimators are primarily assessed by considering the effectivity index and global L2 norm of the error. In general RW excels at approximating the true error distribution but usually under-estimates its magnitude; the LER estimator emulates the true error distribution but frequently over-estimates the magnitude of the true error; the JD estimator poorly captures the true error distribution and generally under-estimates the error about singular characteristics but over-estimates it elsewhere. (authors)

97 MATHEMATICS AND COMPUTING↗

A multilevel method for coupling the neutron kinetics and heat transfer equations

We present a computational method for adequate and efficient coupling the neutron transport equation with the precursor and heat transfer equations. It is based on the multilevel nonlinear quasidiffusion (QD) method for solving the multigroup transport equation. The system of equations includes the time-dependent high-order transport equation and time-dependent multigroup and effective one-group low-order QD equations. We also formulate a method applying the {alpha}-approximation for the time-dependent high-order transport equation. This approach enables one to avoid storing the angular flux from the previous time step. Numerical results for a model transient problem are presented. (authors)

97 MATHEMATICS AND COMPUTING↗

Validity of the Born approximation for beyond Gaussian weak lensing observables

Accurate forward modeling of weak lensing (WL) observables from cosmological parameters is necessary for upcoming galaxy surveys. Because WL probes structures in the nonlinear regime, analytical forward modeling is very challenging, if not impossible. Numerical simulations of WL features rely on ray tracing through the outputs of N-body simulations, which requires knowledge of the gravitational potential and accurate solvers for light ray trajectories. A less accurate procedure, based on the Born approximation, only requires knowledge of the density field, and can be implemented more efficiently and at a lower computational cost. In this work, we use simulations to show that deviations of the Born-approximated convergence power spectrum, skewness and kurtosis from their fully ray-traced counterparts are consistent with the smallest nontrivial O(Φ 3 ) post-Born corrections (so-called geodesic and lens-lens terms). Our results imply a cancellation among the larger O(Φ 4 ) (and higher order) terms, consistent with previous analytic work. We also find that cosmological parameter bias induced by the Born-approximated power spectrum is negligible even for a LSST-like survey, once galaxy shape noise is considered. When considering higher order statistics such as the κ skewness and kurtosis, however, we find significant bias of up to 2.5σ. Using the LensTools software suite, we show that the Born approximation saves a factor of 4 in computing time with respect to the full ray tracing in reconstructing the convergence.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparison of 1D and 2D CSR Models with Application to the FERMI@ELETTRA Bunch Compressors

We compare our 2D mean field (Vlasov-Maxwell) treatment of coherent synchrotron radiation (CSR) effects with 1D approximations of the CSR force which are commonly implemented in CSR codes. In our model we track particles in 4D phase space and calculate 2D forces [1]. The major cost in our calculation is the computation of the 2D force. To speed up the computation and improve 1D models we also investigate approximations to our exact 2D force. As an application, we present numerical results for the Fermi{at}Elettra first bunch compressor with the configuration described in [1].

2D↗

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗

Early experiences evaluating the HPE/Cray ecosystem for AMD GPUs

Summary The Oak Ridge Leadership Computing Facility (OLCF) has a long history of supporting and promoting GPU‐accelerated computing starting with the deployment of the Titan supercomputer in 2021 and continuing with the Summit supercomputer which has a theoretical peak performance of approximately 200 petaflops. Because the majority of Summit's computational power comes from its 27,972 GPUs, users must port their applications to one of the supported programming models in order to make efficient use of the system. To prepare the transition to Frontier, the OLCF's exascale supercomputer, users will need to adapt to an entirely new ecosystem which will include new hardware and software technologies. First, users will need to familiarize themselves with the AMD Radeon GPU architecture. Furthermore, users who have been previously relying on CUDA will need to transition to the Heterogeneous‐Computing Interface for Portability (HIP) or one of the other supported programming models (e.g., OpenMP, OpenACC). In this work, we describe our initial experiences and lessons learned in porting three applications or proxy apps currently running on Summit to the HPE/Cray ecosystem to leverage the compute power from AMD GPUs: minisweep, GenASiS, and Sparkler. Each one is representative of current production workloads utilized at the OLCF, different programming languages, and different programming models.

Melesse Vergara, Verónica G.↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Similarity-transformed equation-of-motion vibrational coupled-cluster theory

A similarity-transformed equation-of-motion vibrational coupled-cluster (STEOM-XVCC) method is introduced as a one-mode theory with an effective vibrational Hamiltonian, which is similarity transformed twice so that its lower-order operators are dressed with higher-order anharmonic effects. The first transformation uses an exponential excitation operator, defining the equation-of-motion vibrational coupled-cluster (EOM-XVCC) method, and the second uses an exponential excitation-deexcitation operator. From diagonalization of this doubly similarity-transformed Hamiltonian in the small one-mode excitation space, the method simultaneously computes accurate anharmonic vibrational frequencies of all fundamentals, which have unique significance in vibrational analyses. We establish a diagrammatic method of deriving the working equations of STEOM-XVCC and prove their connectedness and thus size-consistency as well as the exact equality of its frequencies with the corresponding roots of EOM-XVCC. We furthermore elucidate the similarities and differences between electronic and vibrational STEOM methods and between STEOM-XVCC and vibrational many-body Green’s function theory based on the Dyson equation, which is also an anharmonic one-mode theory. The latter comparison inspires three approximate STEOM-XVCC methods utilizing the common approximations made in the Dyson equation: the diagonal approximation, a perturbative expansion of the Dyson self-energy, and the frequency-independent approximation. The STEOM-XVCC method including up to the simultaneous four-mode excitation operator in a quartic force field and its three approximate variants are formulated and implemented in computer codes with the aid of computer algebra, and they are applied to small test cases with varied degrees of anharmonicit

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Sub-Grid Model Improving Shrinking Core Simulations of Redox-Sensitive Technetium Release From Slag Cement Waste Forms - 17295

Numerical simulation of Tc transport in reducing cementitious materials undergoing oxidation is challenging because the effective solid-solute partition coefficient (K{sub d}) varies greatly between the reduced and oxidized states, assuming the Tc mass loading far exceeds that required to reach solubility in the aqueous phase, as is typical in waste disposal. In a conventional finite-volume formulation, the local aqueous concentration increases orders of magnitude when a computational cell switches from a reducing to oxidizing condition, which is an artifact of numerical discretization. In principal such artifacts can be reduced to an insignificant level by refining the computational grid. However, this approach is not feasible in typical facility scale applications due to computer runtime and storage limitations. In this paper an alternative sub-grid Tc release model is derived to approximately capture redox processes occurring at scales smaller than the computational mesh. This alternative approach introduces minimal additional computational expense, while significantly reducing numerical artifacts in the form of Tc concentration / flux spikes. The method is illustrated for two simple geometries and the Savannah River Site Saltstone waste Disposal Facility. The sub-grid model is shown to significantly reduce artificial spikes in Tc-99 release, resulting in more physically realistic numerical simulations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Reduced Order Model Implementation in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC project aims to develop new advanced simulation-based tools to perform Probabilistic Risk Analysis (PRA) for the existing fleet of U.S. nuclear power plants (NPPs). These tools numerically model not only the thermo-hydraulic behavior of the reactor primary and secondary systems but also external events temporal evolution and components/system ageing. Thus, this is not only a multi-physics problem but also a multi-scale problem (both spatial, µm-mm-m, and temporal, ms-s-minutes-years). As part of the RISMC PRA approach, a large amount of computationally expensive simulation runs are required. An important aspect is that even though computational power is regularly growing, the overall computational cost of a RISMC analysis may be not viable for certain cases. A solution that is being evaluated is the use of reduce order modeling techniques. During the FY2015, we investigated and applied reduced order modeling techniques to decrease the RICM analysis computational cost by decreasing the number of simulations runs to perform and employ surrogate models instead of the actual simulation codes. This report focuses on the use of reduced order modeling techniques that can be applied to any RISMC analysis to generate, analyze and visualize data. In particular, we focus on surrogate models that approximate the simulation results but in a much faster time (µs instead of hours/days). We apply reduced order and surrogate modeling techniques to several RISMC types of analyses using RAVEN and RELAP-7 and show the advantages that can be gained.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Normal and resonant Auger spectroscopy of isocyanic acid, HNCO

In this study, we investigate HNCO by resonant and nonresonant Auger electron spectroscopy at the K-edges of carbon, nitrogen, and oxygen, employing soft X-ray synchrotron radiation. In comparison with the isosteric but linear CO 2 molecule, spectra of the bent HNCO molecule are similar but more complex due to its reduced symmetry, wherein the degeneracy of the π-orbitals is lifted. Resonant Auger electron spectra are presented at different photon energies over the first core-excited 1s → 10a' resonance. All Auger electron spectra are assigned based on ab initio configuration interaction computations combined with the one-center approximation for Auger intensities and moment theory to consider vibrational motion. The calculated spectra were scaled by a newly introduced energy scaling factor, and generally, good agreement is found between experiment and theory for normal as well as resonant Auger electron spectra. A comparison of resonant Auger spectra with nonresonant Auger structures shows a slight broadening as well as a shift of the former spectra between –8 and –9 eV due to the spectating electron. Since HNCO is a small molecule and contains the four most abundant atoms of organic molecules, the reported Auger electron decay spectra will provide a benchmark for further theoretical approaches in the computation of core electron spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bayesian analysis of inflation: Parameter estimation for single field models

Future astrophysical data sets promise to strengthen constraints on models of inflation, and extracting these constraints requires methods and tools commensurate with the quality of the data. In this paper we describe ModeCode, a new, publicly available code that computes the primordial scalar and tensor power spectra for single-field inflationary models. ModeCode solves the inflationary mode equations numerically, avoiding the slow roll approximation. It is interfaced with CAMB and CosmoMC to compute cosmic microwave background angular power spectra and perform likelihood analysis and parameter estimation. ModeCode is easily extendable to additional models of inflation, and future updates will include Bayesian model comparison. Errors from ModeCode contribute negligibly to the error budget for analyses of data from Planck or other next generation experiments. We constrain representative single-field models ({phi}{sup n} with n=2/3, 1, 2, and 4, natural inflation, and 'hilltop' inflation) using current data, and provide forecasts for Planck. From current data, we obtain weak but nontrivial limits on the post-inflationary physics, which is a significant source of uncertainty in the predictions of inflationary models, while we find that Planck will dramatically improve these constraints. In particular, Planck will link the inflationary dynamics with the post-inflationary growth of the horizon, and thus begin to probe the ''primordial dark ages'' between TeV and grand unified theory scale energies.

79 ASTRONOMY AND ASTROPHYSICS↗

Sublinear scaling for time-dependent stochastic density functional theory

A stochastic approach to time-dependent density functional theory is developed for computing the absorption cross section and the random phase approximation (RPA) correlation energy. The core idea of the approach involves time-propagation of a small set of stochastic orbitals which are first projected on the occupied space and then propagated in time according to the time-dependent Kohn-Sham equations. The evolving electron density is exactly represented when the number of random orbitals is infinite, but even a small number (≈16) of such orbitals is enough to obtain meaningful results for absorption spectrum and the RPA correlation energy per electron. We implement the approach for silicon nanocrystals using real-space grids and find that the overall scaling of the algorithm is sublinear with computational time and memory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks: Preprint

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous–enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Brain Connectomics: Opportunities for High-Performance Computing (Final Report)

The human brain is estimated to contain approximately 100 trillion neural connections. This complex map of connectivity (human connectome) underlies cognitive processes and informs disease states, but until recently, studying the human connectome has been hampered by the difficulty of collecting and processing suitable data for analysis. In this context, an initiative denominated The Human Connectome Project (HCP) was created to acquire and collect the largest, most cohesive set of brain data to accelerate neuroscience research. Recently the HCP released a magnetic resonance (MR) dataset of brain imagery with unprecedented scale and organization, together with high quality spatial and temporal resolution; however, fully taking advantage of this high-resolution brain imagery to estimate neurological connectivity networks requires high-performance computing (HPC). In this project, we explored the feasibility of using HPC resources at Lawrence Livermore to effectively estimate brain connectivity networks from this large set of imagery. Specifically, we addressed one of the main current challenges in brain connectomics, which is to advance the computation of individual structural and functional connectomes.

42 ENGINEERING↗