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

Implementation of ACTS into sPHENIX Track Reconstruction

Abstract sPHENIX is a high energy nuclear physics experiment under construction at the Relativistic Heavy Ion Collider at Brookhaven National Laboratory (BNL). The primary physics goals of sPHENIX are to study the quark-gluon-plasma, as well as the partonic structure of protons and nuclei, by measuring jets, their substructure, and heavy flavor hadrons in $$p$$ p $$+$$ + $$p$$ p , p + Au, and Au + Au collisions. sPHENIX will collect approximately 300 PB of data over three run periods, to be analyzed using available computing resources at BNL; thus, performing track reconstruction in a timely manner is a challenge due to the high occupancy of heavy ion collision events. The sPHENIX experiment has recently implemented the A Common Tracking Software (ACTS) track reconstruction toolkit with the goal of reconstructing tracks with high efficiency and within a computational budget of 5 s per minimum bias event. This paper reports the performance status of ACTS as the default track fitting tool within sPHENIX, including discussion of the first implementation of a time projection chamber geometry within ACTS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

A second-order accurate finite volume scheme with the discrete maximum principle for solving Richards’ equation on unstructured meshes

Richards’s equation describes steady-state or transient flow in a variably saturated medium. For a medium having multiple layers of soils that are not aligned with coordinate axes, a mesh fitted to these layers is no longer orthogonal and the classical two-point flux approximation finite volume scheme is no longer accurate. Here, we propose new second-order accurate nonlinear finite volume (NFV) schemes for the head and pressure formulations of Richards’ equation. We prove that the discrete maximum principles hold for both formulations at steady-state which mimics similar properties of the continuum solution. The second-order accuracy is achieved using high-order upwind algorithms for the relative permeability. Numerical simulations of water infiltration into a dry soil show significant advantage of the second-order NFV schemes over the first-order NFV schemes even on coarse meshes. Since explicit calculation of the Jacobian matrix becomes prohibitively expensive for high-order schemes due to build-in reconstruction and slope limiting algorithms, we study numerically the preconditioning strategy introduced recently in Lipnikov et al. (2016) that uses a stable approximation of the continuum Jacobian. Lastly, numerical simulations show that the new preconditioner reduces computational cost up to 2–3 times in comparison with the conventional preconditioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Water reactive polyurethane grouting for deep vadose zone contaminant immobilization

Contaminants in the deep vadose zone (DVZ) pose a long-term threat to groundwater, human health, and the environment. Polyurethane grouting is a type of chemical grouting that is potentially advantageous in immobilizing contaminants in DVZs. Polyurethane resin has low viscosity that makes it feasible to penetrate and fill the pore space between fine particles. Here, in this study a series of laboratory pressure grouting and leaching tests were conducted to simulate and assess the effectiveness of polyurethane grouting for immobilizing contaminants in DVZs. Soil with fine particles was prepared with 127 I (as iodide) that served as a non-radioactive surrogate for radioactive 129 I. After grouting and curing, leaching tests were used to measure and compare contaminant diffusivity and leachability index values. Additionally, changes in porosity and saturated hydraulic conductivity of grouted soil were measured. X-Ray Computer Tomography (XCT) results showed that the cured polyurethane was distributed nearly homogeneously and approximately half of the voids were filled with cured polyurethane. Grouting reduced the saturated hydraulic conductivity of soil by 37 %. The effective diffusivity decreased by more than 80 % as compared with the ungrouted soil. The leachability index of the grouted soil was 6.5; meeting the criteria established by the U.S. Nuclear Regulatory Commission (NRC) standard. The results obtained in this study provide a valuable assessment of polyurethane grouting for iodide immobilization in the DVZ and indicate this approach may be a viable method for contaminant remediation in DVZ soils.

Contaminant Diffusion↗
DOE OSTI2020

A generalized approximate control variate framework for multifidelity uncertainty quantification

We describe and analyze a variance reduction approach for Monte Carlo (MC) sampling that accelerates the estimation of statistics of computationally expensive simulation models using an ensemble of models with lower cost. These lower cost models — which are typically lower fidelity with unknown statistics — are used to reduce the variance in statistical estimators relative to a MC estimator with equivalent cost. We derive the conditions under which our proposed approximate control variate framework recovers existing multifidelity variance reduction schemes as special cases. We demonstrate that existing recursive/nested strategies are suboptimal because they use the additional low-fidelity models only to efficiently estimate the unknown mean of the first low-fidelity model. As a result, they cannot achieve variance reduction beyond that of a control variate estimator that uses a single low-fidelity model with known mean. However, there often exists about an order-of-magnitude gap between the maximum achievable variance reduction using all low-fidelity models and that achieved by a single low-fidelity model with known mean. We show that our proposed approach can exploit this gap to achieve greater variance reduction by using non-recursive sampling schemes. The proposed strategy reduces the total cost of accurately estimating statistics, especially in cases where only low-fidelity simulation models are accessible for additional evaluations. Several analytic examples and an example with a hyperbolic PDE describing elastic wave propagation in heterogeneous media are used to illustrate the main features of the methodology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Jordan–Wigner Transformation for the Description of Strong Correlation in Fermionic Systems

Seniority is a useful way of organizing Hilbert space for strongly correlated systems. The exact zero-seniority wave function, doubly occupied configuration interaction (DOCI), provides accurate results (given the right orbitals) for many strongly correlated electronic systems but has a combinatorial computational cost. In many cases, pair coupled cluster doubles provide a polynomial-cost approximation that closely reproduces the energies of DOCI, but it breaks down in some cases and, as shown herein, it does not provide particularly good density matrices. In this article, we demonstrate that by using the Jordan–Wigner transformation to turn the seniority zero problem back into a Fermionic one, we can provide mean-field variational results of DOCI quality for the Hubbard model and a few small molecular dissociation examples, with polynomial cost, both for the energies and for density matrices, all while being protected from collapse. This success is rooted in the proof we provide, showing that the Hartree–Fock wave function on the Jordan–Wigner-transformed Hamiltonian transforms back to variational coupled cluster doubles in the seniority zero representation, but restricted to have determinant rather than permanent amplitude coefficients, without compromising its overall accuracy.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

Polarizable Frozen Density Embedding with External Orthogonalization

In this work, we report a polarizable subsystem density functional theory to describe electronic properties of molecules embedded on a metal cluster. Interaction between the molecule and metal cluster is described using frozen density embedding (FDE). Substituting the nonadditive kinetic potential (NAKP) by approximate functionals is circumvented by enforcing external orthogonality (EO) through a projection operator. The computationally expensive freeze/thaw (FT) cycles are bypassed by including a polarization term in the embedding operator. Furthermore, the combination of polarization and EO permits supermolecular basis set calculations, which was not possible for strongly interacting systems with existing kinetic energy functionals. To test the method, we described the ground state density of pyridine, water, and benzene on a silver cluster. Performing FT on top of EO results in exact density embedding for this category of systems and is thus used for benchmarking the method. We find that the density is reproduced to within 0.15e, and the dipole and quadrupole moments are within 18% of the reference points for subsystem separations ranging from bonding to noninteracting distances. Additionally, our formalism allows the flexibility of incorporating different density functionals to the molecular and the metallic subsystems reducing the overall computational cost.

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

Fully consistent Eulerian Monte Carlo fields method for solving probability density function transport equations in turbulence modeling

The probability density function (PDF) transport equation method is a sophisticated model for the closure of turbulent mixing and turbulent reactive flows. An efficient solution approach for solving the PDF transport equation has been vital for the method to be widely used in applications. The Eulerian Monte Carlo fields (EMCF) method has been developed to solve the PDF transport equation efficiently for decades. A recent work by Wang et al. revealed a serious issue of the EMCF method for not being fully consistent with the PDF transport equation for which the method is designed to solve. This work advances the state of the art by introducing fully consistent EMCF methods for solving the PDF transport equation. The fully consistent EMCF formulations are derived for two different PDF equation forms. The consistency of the EMCF formulations is mathematically confirmed by examining the derived moment transport equations from the EMCF formulations and from the PDF transport equation. The method of manufactured solutions is employed to further verify the consistency and convergence of the different EMCF formulations numerically. The newly introduced EMCF formulations bring the EMCF method to full consistency with the PDF transport equations for the first time.

42 ENGINEERING↗
DOE OSTI2020

Spin response and neutrino mean free path in neutron matter

The longitudinal and transverse density- and spin-density response functions in pure neutron matter (PNM) are derived over a wide range of densities within the time dependent local spin density approximation. The underlying density functional was derived from an Auxiliary Field Diffusion Monte Carlo computation of the equation of state of unpolarized and fully spin polarized PNM. In order to assess the dependence of the results on the specific underlying nucleon–nucleon Hamiltonian, we used both the phenomenological Argonne AV8' + UIX force, and local chiral forces up to next-to-next-to-leading-order (N 2 LO). Finally, the resulting response function has then been applied to the study of the neutrino mean free path in PNM.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Perturbatively including inhomogeneities in axion inflation

Axion inflation, i.e. an axion-like inflaton coupled to an Abelian gauge field through a Chern-Simons interaction, comes with a rich and testable phenomenology. This is particularly true in the strong backreaction regime, where the gauge field production heavily impacts the axion dynamics. Lattice simulations have recently demonstrated the importance of accounting for inhomogeneities of the axion field in this regime. We propose a perturbative scheme to account for these inhomogeneities while maintaining high computational efficiency. Our goal is to accurately capture deviations from the homogeneous axion field approximation within the perturbative regime as well as self-consistently determine the onset of the nonperturbative regime.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Strong-field nonsequential double photoionization using virtual-detector theory with path summation

We present an ab initio study of the nonsequential strong-field ionization dynamics of a model two-electron atom with helium character. Single- and double-ionization events are characterized and displayed using detector signals extracted at different points in the two-electron two-dimensional space. The double photoelectron momentum distribution is calculated via coherent path-summation over virtual-particle trajectories. A comparison is made between the momentum distributions obtained with the virtual-detector method, the Schrödinger wave function, and the time-dependent surface flux method developed by Tao and Scrinzi [New J. Phys. 14, 013021 (2012)]. Insights into different ionization and electron recollision pathways are gained from detailed virtual-particle tracking and energy-time readouts. Furthermore, this study demonstrates the extension of virtual-detector theory to strong-field multielectron quantum dynamics and highlights the importance of the evolving quantum phase in quasiclassical electron propagation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Primitive quantum gates for dihedral gauge theories

We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$-- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to carry out such a lattice simulation, we detail the construction of efficient quantum circuits to realize basic primitives including the nonabelian Fourier transform over $D_N$, the trace operation, and the group multiplication and inversion operations. For each case the required quantum resources scale linearly or as low-degree polynomials in $n=\log N$. We experimentally benchmark our gates on the Rigetti Aspen-9 quantum processor for the case of $D_4$. The fidelity of all $D_4$ gates was found to exceed $80\%$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Symbolic pregression: Discovering physical laws from distorted video

In this work, we present a method for unsupervised learning of equations of motion for objects in raw and optionally distorted unlabeled synthetic video (or, more generally, for discovering and modeling predictable features in time-series data). We first train an autoencoder that maps each video frame into a low-dimensional latent space where the laws of motion are as simple as possible, by minimizing a combination of nonlinearity, acceleration, and prediction error. Differential equations describing the motion are then discovered using Pareto-optimal symbolic regression. We find that our pre-regression (“pregression”) step is able to rediscover Cartesian coordinates of unlabeled moving objects even when the video is distorted by a generalized lens. Using intuition from multidimensional knot theory, we find that the pregression step is facilitated by first adding extra latent space dimensions to avoid topological problems during training and then removing these extra dimensions via principal component analysis. An inertial frame is autodiscovered by minimizing the combined equation complexity for multiple experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Automated Labeling of Electron Microscopy Images Using Deep Learning

© 2018 IEEE. Searching for scientific data requires metadata providing a relevant context. Today, generating metadata is a time and labor intensive manual process that is often neglected, and important datasets are not accessible through search. We investigate the use of machine learning to generalize metadata from a subset of labeled data, thus increasing the availability of meaningful metadata for search. Specifically, we consider electron microscopy images collected at the National Center for Electron Microscopy (NCEM) at the Lawrence Berkeley National Laboratory (LBNL) and use deep learning to discern characteristics from a small subset of labeled images and transfer labels to the entire image corpus. Relatively small training set sizes and a minimum resolution of 512\times 512 pixels required by the application domain pose unique challenges. We overcome these challenges by using a simple yet powerful convolutional network architecture that limits the number of free parameters to lower the required amount of computational power and reduce the risk of overfitting. We achieve a classification accuracy of approximately 80% in discerning between images recorded in two operating modes of the electron microscope-transmission electron microscopy (TEM) and scanning transmission electron microscopy (STEM). We use transfer learning-i.e., re-using the pre-trained convolution layers from the TEM vs. STEM classification problem-to generalize labels and achieve an accuracy of approximately 70 % despite current experiments being limited to small training data sets. We present these predictions as suggestions to domain scientists through a web-based tool to accelerate the labeling process with the goal of further validating our approach and improving the accuracy of automatically created labels.

Weber, Gunther H↗
DOE OSTI2019

BSTC: A Novel Binarized-Soft-Tensor-Core Design for Accelerating Bit-Based Approximated Neural Nets

Binarized neural network (or BNN) promises tremendous performance improvement over traditional DNNs through simplified bit-level computation and significantly reduced memory access/storage cost. In addition, it has other advantages of low-cost, low-energy and high-robustness, showing great utilization potential in resources-constrained, volatile and latency-critical applications, which are critical for future HPC execution. However, the promised significant performance gain of BNN inference has never been fully demonstrated on general-purpose processors, particularly on GPUs, due to: (i) the challenge to extract and leverage sufficient fine-grained bit-level-parallelism to saturate GPU cores when batch is small; (ii) the fundamental design conflict between bit-based BNN algorithm and underlying word-based architecture; (iii) architecture \& performance unfriendly BNN network design. To address (i) and (ii), we propose binarized-soft-tensor-core as a software-hardware codesign approach to construct bit-manipulation capability for modern GPUs to effectively harvest the emerging bit-level-parallelism. To tackle (iii), we propose intra- and inter-layer fusion techniques so that the entire BNN inference can be packed into a single GPU kernel, to avoid high-cost frequent launching. Experiments demonstrate that our design can achieve over 1000x speedup for raw inference latency and 10x for inference throughput over the state-of-the-art full-precision simulated BNN inference for AlexNet on ImageNet.

Li, Ang↗
DOE OSTI2025

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗
DOE OSTI2021

Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

The metaplectic transform (MT), a generalization of the Fourier transform sometimes called the linear canonical transform, is a tool used ubiquitously in modern optics, for example, when calculating the transformations of light beams in paraxial optical systems. The MT is also an essential ingredient of the geometrical-optics modeling of caustics that we recently proposed. In particular, this application relies on the near-identity MT (NIMT); however, the NIMT approximation used so far is not exactly unitary and leads to numerical instability. Here, we develop a discrete MT that is exactly unitary, and approximate it to obtain a discrete NIMT that is also unitary and can be computed in linear time. We prove that the discrete NIMT converges to the discrete MT when iterated, thereby allowing the NIMT to compute MTs that are not necessarily near-identity. Finally, we then demonstrate the new algorithms with a series of examples.

47 OTHER INSTRUMENTATION↗