Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparse tensor”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Einstein gravity 3-point functions from conformal field theory

We report on stress tensor correlation functions in four-dimensional conformal field theories with large N and a sparse spectrum. Theories in this class are expected to have local holographic duals, so effective field theory in anti-de Sitter implies that the stress tensor sector should exhibit universal, gravity-like behavior. At the linearized level, the hallmark of locality in the emergent geometry is that stress tensor three-point functions $\langle$T T T $\rangle$, normally specified by three constants, should approach a universal structure controlled by a single parameter as the gap to higher spin operators is increased. We demonstrate this phenomenon by a direct CFT calculation. Stress tensor exchange, by itself, violates causality and unitarity unless the three-point functions are carefully tuned, and the unique consistent choice exactly matches the prediction of Einstein gravity. Under some assumptions about the other potential contributions, we conclude that this structure is universal, and in particular, that the anomaly coefficients satisfy a ≈ c as conjectured by Camanho et al. The argument is based on causality of a four-point function, with kinematics designed to probe bulk locality, and invokes the chaos bound of Maldacena, Shenker, and Stanford.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Automatic Calibration of a Geomechanical Model from Sparse Data for Estimating Stress in Deep Geological Formations

Summary In this study, we demonstrate geomechanical modeling with fully automatic parameter calibration to estimate the full geomechanical stress fields of a prospective US carbon dioxide (CO2) storage site, based on sparse measurement data. The goal is to compute full stress tensor field estimates (principal stresses and orientations) that are maximally compatible with observations within the constraints of the model assumptions, thereby extending pointwise, incomplete partial stress measurement to a simulated full formation stress field, as well as a rough assessment of the associated error. We use the Perch site, located in Otsego County, Michigan, USA, as our case study. The input data consist of partial stress tensor information inferred from in-situ borehole tests, geophysical well logs, and processing of seismic data. A static earth model (SEM) of the site was developed, and geomechanical simulation functionality of the open-source MATLAB Reservoir Simulation Toolbox (MRST) was used to model the stress field. Adjoint-based nonlinear optimization was used to adjust boundary conditions and material properties to calibrate simulated results of observations. Results were interpreted through a Bayesian framework. The focus of this paper is to demonstrate how the fully automatic calibration procedure works and discuss the results obtained; it does not attempt a detailed analysis of the stress field in the context of the proposed CO2 storage initiatives. Our work is part of a larger effort to noninvasively determine in-situ stresses in deep formations considered for CO2 storage. Guided by previously published research on geomechanical model calibration, our work presents a novel calibration approach supporting a potentially large number of linear or nonlinear calibration parameters to produce results optimally agreeing with available measurements and thus extend partial pointwise estimates to full tensor fields compatible with the physics of the site.

Engineering↗
DOE OSTI2022

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A conformal collider for holographic CFTs

We develop a formalism to study the implications of causality on OPE coefficients in conformal field theories with large central charge and a sparse spectrum of higher spin operators. The formalism has the interpretation of a new conformal collider-type experiment for these class of CFTs and hence it has the advantage of requiring knowledge only about CFT three-point functions. This is accomplished by considering the holographic null energy operator which was introduced in [ 1 ] as a generalization of the averaged null energy operator. Analyticity properties of correlators in the Regge limit imply that the holographic null energy operator is a positive operator in a subspace of the total CFT Hilbert space. Utilizing this positivity condition, we derive bounds on three-point functions $\langle$ TO 1 O 2 $\rangle$of the stress tensor with various operators for CFTs with large central charge and a sparse spectrum. After imposing these constraints, we also find that the operator product expansions of all primary operators in the Regge limit have certain universal properties. All of these results are consistent with the expectation that CFTs in this class, irrespective of their microscopic details, admit universal gravity-like holographic dual descriptions. Furthermore, this connection enables us to constrain various inflationary observables such as the amplitude of chiral gravity waves, non-gaussanity of gravity waves and tensor-to-scalar ratio.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Adaptive Sparse Grid Construction in a Context of Local Anisotropy and Multiple Hierarchical Parents

We consider general strategy for hierarchical multidimensional interpolation based on sparse grids, where the interpolation nodes and locally supported basis functions are constructed from tensors of a one dimensional hierarchical rule. We consider four different hierarchies that are tailored towards general functions, high or low order polynomial approximation, or functions that satisfy homogeneous boundary conditions. The main advantage of the locally supported basis is the ability to choose a set of functions based on the observed behavior of the target function. We present an alternative to the classical surplus refinement techniques, where we exploit local anisotropy and refine using functions with not strictly decreasing support. The more flexible refinement strategy improves stability and reduces the total number of expensive simulations, resulting in significant computational saving. We demonstrate the advantages of the different hierarchies and refinement techniques by application to series of simple functions as well as a system of ordinary differential equations given by the Kermack-McKendrick SIR model.

Stoyanov, Miroslav K.↗
DOE OSTI2025

A higher-order finite-element implementation of the nonlinear Fokker–Planck collision operator for charged particle collisions in a low density plasma

Collisions between particles in a low density plasma are described by the Fokker–Planck collision operator. In applications, this nonlinear integro-differential operator is often approximated by linearised or ad-hoc model operators due to computational cost and complexity. In this work, we present an implementation of the nonlinear Fokker–Planck collision operator written in terms of Rosenbluth potentials in the Rosenbluth–MacDonald–Judd (RMJ) form. The Rosenbluth potentials may be obtained either by direct integration or by solving partial differential equations (PDEs) similar to Poisson's equation: we optimise for performance and scalability by using sparse matrices to solve the relevant PDEs. We represent the distribution function using a tensor-product continuous-Galerkin finite-element representation and we derive and describe the implementation of the weak form of the collision operator. We present tests demonstrating a successful implementation using an explicit time integrator and we comment on the speed and accuracy of the operator. Finally, we speculate on the potential for applications in the current and next generation of kinetic plasma models.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics

We study real-time operator evolution using sparse Pauli dynamics, a recently developed method for simulating expectation values of quantum circuits. On the examples of energy and charge diffusion in one-dimensional (1D) spin chains and sudden quench dynamics in the 2D transverse-field Ising model, it is shown that this approach can compete with state-of-the-art tensor network methods. We further demonstrate the flexibility of the approach by studying quench dynamics in the 3D transverse-field Ising model that is highly challenging for tensor network methods. For the simulation of expectation value dynamics starting in a computational basis state, we introduce an extension of sparse Pauli dynamics that truncates the growing sum of Pauli operators by discarding terms with a large number of X and Y matrices. This is validated by our 2D and 3D simulations. Finally, we argue that sparse Pauli dynamics is not only capable of converging challenging observables to high accuracy, but can also serve as a reliable approximate approach even when given only limited computational resources. Published by the American Physical Society 2025

Begušić, Tomislav (ORCID:0000000279424134)↗
DOE OSTI2021

Sparsity of Radiating Characteristic Modes on Infinite Periodic Structures

Characteristic modes on infinite periodic structures are studied using spectral dyadic Green’s functions. This formulation demonstrates that, in contrast to the modal analysis of finite structures, the number of radiating characteristic modes is limited by unit cell size and incident wave vector (i.e., scan angle or phase shift per unit cell). Here, the reflection tensor is decomposed into modal contributions from radiating modes, indicating that characteristic modes are a predictably sparse basis in which to study reflection phenomena.

42 ENGINEERING↗
DOE OSTI2026

Scalable Quantum Monte Carlo Method for Polariton Chemistry via Mixed Block Sparsity and Tensor Hypercontraction Method

We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of the Cholesky decomposition (CD) of electron repulsion integrals in molecular ensembles and employs tensor hypercontraction (THC) to efficiently compress low-rank Cholesky blocks. By representing the Cholesky vectors in a mixed format, keeping high-rank blocks in block-sparse form and compressing low-rank blocks with THC, we reduce the scaling of exchange-energy evaluation from quartic to robust cubic in the number of molecular orbitals N, while lowering memory from cubic toward quadratic. Benchmark analyses on one-, two-, and three-dimensional molecular ensembles (up to ∼1,200 orbitals) show that (a) the number of nonzeros in Cholesky tensors grows linearly with system size across dimensions; (b) the average numerical rank increases sublinearly and does not saturate at these sizes; and (c) rank heterogeneity─some blocks nearly full rank and many low rank, naturally motivates the proposed mixed block sparsity and THC scheme for efficient calculation of exchange energy. In conclusion, we demonstrate that the mixed scheme yields cubic wall-time scaling with favorable prefactors and preserves AFQMC accuracy.

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

Tensor Extraction of Latent Features (TELF)

Tensor ELF is a user-friendly parallel tensor decomposition Python toolbox that includes a suite of machine learning algorithms for CPU and GPU architectures for the analysis of sparse and dense data including utility tools for pre-processing and post-processing.

Eren, Maksim↗
DOE OSTI2022

Exploring the Use of Novel Spatial Accelerators in Scientific Applications

Driven by the need to find alternative accelerators which can viably replace GPUs in next-generation Supercomputing systems, this paper proposes a methodology to enable agile application/hardware co-design. The application-first methodology provides the ability to come up with design of accelerators while working with real-world workloads, available accelerators, and system software. The iterative design process targets a set of kernels in a workload for performance estimates that can prune the design space for later phases of detailed architectural evaluations. To this effect, in this paper, a novel data-parallel device model is introduced that simulates the latency of performance-sensitive operations in an accelerator including data transfers and kernel computation using multi-core CPUs. The use of off-the-shelf simulators, such as pre-RTL simulator Aladdin or multiple tools available for exploring the design of deep neural network accelerators (e.g., Timeloop) is demonstrated for evaluation of various accelerator designs using applications with realistic inputs. Examples of multiple device configurations that are instantiable in a system are explored to evaluate the performance benefit of deploying novel accelerators. The proposed device is integrated with a programming model and system software to potentially explore the impacts of high-level programming languages/compilers and low-level effects such as task scheduling on multiple accelerators. We analyze our methodology for a set of applications that represent high-performance computing (HPC) and graph analytics. The applications include a computational chemistry kernel realized using tensor contractions, triangle counting, GraphSAGE and Breadth-first Search. These applications include kernels such as dense matrix-dense matrix multiplication, sparse matrix-spare matrix multiplication, and sparse matrix-dense vector multiplication. Our results indicate potential performance benefits and insights for system design by including accelerators that realize these kernels along-side general purpose accelerators.

AI, codesign, Accelerated Computing, Modeling and ↗
DOE OSTI2021

Regional Moment Tensor Inversion Using Rotational Observations

There are benefits from the addition of rotational motions to translational displacements for moment tensor (MT) inversions. The rotational radiation pattern is orthogonal to the shear radiation pattern, thus incorporating rotations is equivalent to gaining another observation point on the focal sphere. We demonstrated this by simulating curl and displacement wavefields for a regional distance station. Thus, one 6-C station (3-Component translational + 3-Component rotational) gathers the same information on radiation pattern as two 3-C stations at 90° azimuth from one another along the focal plane axis, which is sometimes difficult to obtain when restricted to surface sensors. We added rotational Green's functions to a regional MT inversion scheme (long-period, time-domain, and linear inversion) by computing spatial gradients from f-κ reflectivity synthetics. For rotational data, we used Array Derived Rotations (ADR) from Piñon Flats Observatory Array and Golay array deployed during IRIS Community Wavefield Demonstration Experiment. The hope is to ultimately use compact and field deployable broadband rotational seismometers instead of ADRs. Rotational motions were predicted from well-constrained deviatoric MT solutions of nine earthquakes recorded by the arrays and other seismic networks. Additionally, we formed three station sparse datasets with (3-C and 6-C) and without rotational ground motions (3-C only) for eight earthquakes testing the benefits of including rotational waveforms in MT inversions when they are equally weighted with translational waveforms. Adding rotational motions improved the double-couple components and reduced compensated-linear-vector-dipole and isotropic components in full-MT solutions using sparse datasets with poor coverage.

58 GEOSCIENCES↗
DOE OSTI2021

COVID-19 dynamics across the US: A deep learning study of human mobility and social behavior

This paper presents a deep learning framework for epidemiology system identification from noisy and sparse observations with quantified uncertainty. The proposed approach employs an ensemble of deep neural networks to infer the time-dependent reproduction number of an infectious disease by formulating a tensor-based multi-step loss function that allows us to efficiently calibrate the model on multiple observed trajectories. The method is applied to a mobility and social behavior-based SEIR model of COVID-19 spread. The model is trained on Google and Unacast mobility data spanning a period of 66 days, and is able to yield accurate future forecasts of COVID-19 spread in 203 US counties within a time-window of 15 days. Interestingly, a sensitivity analysis that assesses the importance of different mobility and social behavior parameters reveals that attendance of close places, including workplaces, residential, and retail and recreational locations, has the largest impact on the effective reproduction number. Furthermore, the model enables us to rapidly probe and quantify the effects of government interventions, such as lock-down and re-opening strategies. Taken together, the proposed framework provides a robust workflow for data-driven epidemiology model discovery under uncertainty and produces probabilistic forecasts for the evolution of a pandemic that can judiciously provide information for policy and decision making. All codes and data accompanying this manuscript are available at https://github.com/PredictiveIntelligenceLab/DeepCOVID19.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Adjoint Waveform Tomography for Crustal and Upper Mantle Structure the Middle East and Southwest Asia for Improved Waveform Simulations Using Openly Available Broadband Data

We present a new model of radially anisotropic seismic wavespeeds for the crust and upper mantle of a broad region of the Middle East and Southwest Asia (MESWA) derived from adjoint waveform tomography. We inverted waveforms from 192 Global Centroid Moment Tensor earthquakes (MW 5.5-7.0) recorded by over 1000 openly available broadband seismic stations from permanent and temporary networks in the region. Spatial coverage of the available data is highly uneven due to earthquakes clustered along plate boundaries and sparse coverage of open seismic networks in the region. We considered three possible starting models: the SPiRaL global model (Simmons et al., 2021); MEC-1 (Kaviani et al., 2020); and CSEM2.0 (Noe et al., 2023). Because the SPiRaL model provides good fits to the observed waveforms measured by the time-bandwidth product of selected windows in several period bands, provides all the necessary parameters and covers the entire domain we used it for the starting model with the period band 50-100 seconds. Inversion iterations proceeded using time-frequency phase misfits in six stages and 54 total iterations reducing the minimum period to 30 seconds. Our final model, MESWA, provides improved waveform fits compared to the starting model for both the data used in the inversion and an independent validation data set of 66 events. Two metrics of waveform fit (the time-frequency phase misfit used in the optimization and normalized L2 misfit) were both reduced by nearly 60% for both data sets and MESWA provides significantly larger misfit reductions relative to the SPiRaL model than the MEC-1 or CSEM models. We also find that MESWA provides a larger time-bandwidth product of selected windows indicating that more information content of the observed waveforms is explained by MESWA than the other models. Our new model reveals tectonic features imaged by other studies and methods but in a new holistic model of shear and compressional wavespeeds (v S and v P , respectively) with anisotropy covering the crust and uppermost mantle of a larger domain. MESWA has smaller scale-length features and tends to sharpen some features relative to the SPiRaL starting model. Examples include: low crustal v S in the TurkishIranian Plateau, Zagros Mountains, Afghan Central Blocks and Sulaiman Fold Belt; low mantle vSfollowing divergent (Gulf of Aden, Red Sea) and transform (Dead Sea Fault) margins of the Arabian Plate; low and high v S in the mantle beneath the Arabian Shield and Platform, respectively. Low vS is imaged below Cenozoic volcanic centers of the Arabian Peninsula, the so-called Mecca-Madina-Nafud (MMN) Line. Positive anisotropy (v SH > v SV ) is inferred for asthenospheric depths across the region except where up/downwelling may influence fabric alignment (e.g. Afar, Red Sea, Arabian Shield). Elevated vS tracks Makran subduction under southeast Iran. MESWA resembles the SPiRaL model in its long-wavelength structure, but enhances shorter wavelengths features on the order of 200 km and smaller. The resulting model could be used for as a starting model for further improvements, say using waveforms from in-country seismic networks that are not openly available or smaller-scale studies targeting shorter period waveforms. The model also could be used for source characterization and moment tensor inversion to improve earthquake hazard studies and nuclear explosion monitoring.

58 GEOSCIENCES↗
DOE OSTI2022

The stranger things of symmetric product orbifold CFTs

Symmetric product orbifold theories are valuable due to their universal features at large N. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within their moduli space. To this end, we consider the symmetric product orbifold of tensor products of N = 2 super-Virasoro minimal models, and classify them according to two criteria. The first criterion is the existence of a single-trace twisted exactly marginal operator that triggers the deformation. The second criterion is a sparseness condition on the growth of light states in the elliptic genera. In this context we encounter a strange variety: theories that obey the first criterion but the second criterion falls into a Hagedorn-like growth. We explain why this may be counter-intuitive and discuss how it might be accounted for in conformal perturbation theory. We also find a new infinite class of theories that obey both criteria, which are necessary conditions for each moduli space to contain a supergravity point.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗