Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tensor representation”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Elliptic Relaxation of a Tensor Representation of the Pressure-Strain and Dissipation Rate

A formulation to include the effects of wall-proximity in a second moment closure model is presented that utilizes a tensor representation for the redistribution term in the Reynolds stress equations. The wall-proximity effects are modeled through an elliptic relaxation process of the tensor expansion coefficients that properly accounts for both correlation length and time scales as the wall is approached. DNS data and Reynolds stress solutions using a full differential approach at channel Reynolds number of 590 are compared to the new model.

Carlson, John R.↗
NASA NTRS2002

Elliptic Relaxation of a Tensor Representation for the Redistribution Terms in a Reynolds Stress Turbulence Model

A formulation to include the effects of wall proximity in a second-moment closure model that utilizes a tensor representation for the redistribution terms in the Reynolds stress equations is presented. The wall-proximity effects are modeled through an elliptic relaxation process of the tensor expansion coefficients that properly accounts for both correlation length and time scales as the wall is approached. Direct numerical simulation data and Reynolds stress solutions using a full differential approach are compared for the case of fully developed channel flow.

Carlson, J. R.↗
DOE OSTI2024

Tensor network representation of non-abelian gauge theory coupled to reduced staggered fermions

We show how to construct a tensor network representation of the path integral for reduced staggered fermions coupled to a non-abelian gauge field in two dimensions. The resulting formulation is both memory and computation efficient because reduced staggered fermions can be represented in terms of a minimal number of tensor indices while the gauge sector can be approximated using Gaussian quadrature with a truncation. Numerical results obtained using the Grassmann TRG algorithm are shown for the case of SU(2) lattice gauge theory and compared to Monte Carlo results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Pairwise connected tensor network representation of path integrals

It has been recently shown how the tensorial nature of real-time path integrals (PIs) involving the Feynman-Vernon influence functional can be utilized with matrix product states, taking advantage of the finite length of the bath-induced memory. Tensor networks (TNs) promise to provide a unified language to express the structure of a PI. A generalized TN specifically incorporating the pairwise interaction structure of the influence functional and its invariance with respect to the average forward-backward position or the sojourn value in the form of the blip representation is derived and implemented. This pairwise connected TNPI (PC-TNPI) is illustrated through applications to typical spin-boson problems and explorations of the differences caused by the exact form of the spectral density. The storage and performance scalings are reported, showing the compactness of the representation and the efficiency of the contraction process. Finally, taking advantage of the compressed representation, the viability of using PC-TNPI for simulating multistate problems is demonstrated. The PC-TNPI structure can be shown to yield other TN algorithms currently in use. Consequently, it should be possible to use it as a starting point for deriving other optimized procedures.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗
DOE OSTI2021

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗
DOE OSTI2022

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On gauge amplitudes first appearing at two loops

We study scattering amplitudes in massless non-abelian gauge theory where all outgoing gluons have positive helicity. It has been argued recently by Costello that for a particular fermion representation (8 fundamentals plus one antisymmetric-tensor representation in SU(N)) the one-loop amplitudes vanish identically. We show that this vanishing leads to previously-observed identities among one-loop color-ordered partial amplitudes. We then turn to two loops, where Costello has computed the all-plus amplitudes for this theory, as rational functions of the kinematics for any number of gluons using the celestial chiral algebra (CCA) bootstrap. We show that in dimensional regularization, these two-loop amplitudes are not rational, and they are not even finite as ϵ → 0. However, the finite remainder for four gluons agrees with the formula by Costello. In addition, we provide a mass regulator for the infrared-divergent loop integrals; with this regulator, the CCA bootstrap formula is recovered exactly. Finally, we use the CCA bootstrap to compute the double-trace terms in the theory at two loops for an arbitrary number of gluons.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

On gauge amplitudes first appearing at two loops

We study scattering amplitudes in massless non-abelian gauge theory where all outgoing gluons have positive helicity. It has been argued recently by Costello that for a particular fermion representation (8 fundamentals plus one antisymmetric-tensor representation in SU(N)) the one-loop amplitudes vanish identically. We show that this vanishing leads to previously-observed identities among one-loop color-ordered partial amplitudes. We then turn to two loops, where Costello has computed the all-plus amplitudes for this theory, as rational functions of the kinematics for any number of gluons using the celestial chiral algebra (CCA) bootstrap. We show that in dimensional regularization, these two-loop amplitudes are not rational, and they are not even finite as ϵ → 0. However, the finite remainder for four gluons agrees with the formula by Costello. In addition, we provide a mass regulator for the infrared-divergent loop integrals; with this regulator, the CCA bootstrap formula is recovered exactly. Finally, we use the CCA bootstrap to compute the double-trace terms in the theory at two loops for an arbitrary number of gluons.

Dixon, Lance J↗
NASA NTRS1997

Time Evolution of Modeled Reynolds Stresses in Planar Homogeneous Flows

The analytic expression of the time evolution of the Reynolds stress anisotropy tensor in all planar homogeneous flows is obtained by exact integration of the modeled differential Reynolds stress equations. The procedure is based on results of tensor representation theory, is applicable for general pressure-strain correlation tensors, and can account for any additional turbulence anisotropy effects included in the closure. An explicit solution of the resulting system of scalar ordinary differential equations is obtained for the case of a linear pressure-strain correlation tensor. The properties of this solution are discussed, and the dynamic behavior of the Reynolds stresses is studied, including limit cycles and sensitivity to initial anisotropies.

Jongen, T.↗
DOE OSTI2025

Physics-constrained superresolution diffusion for six-dimensional phase space diagnostics

Adaptive physics-constrained superresolution diffusion is developed for noninvasive virtual diagnostics of the six-dimensional (6D) phase space density of charged particle beams. An adaptive variational autoencoder embeds initial beam condition images and scalar measurements to a low-dimensional latent space from which a 32 6 pixel 6D tensor representation of the beam's 6D phase space density is generated. Projecting from a 6D tensor generates physically consistent two-dimensional projections. Physics-guided superresolution diffusion transforms low-resolution images of the 6D density to high resolution 256 × 256 pixel images. Unsupervised adaptive latent space tuning enables tracking of time-varying beams without knowledge of time-varying initial conditions. The method is demonstrated with experimental data and multiparticle simulations at the HiRES UED. The general approach is applicable to a wide range of complex dynamic systems evolving in high-dimensional phase space. The method is shown to be robust to distribution shift without retraining. Published by the American Physical Society 2025

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

GPU-Accelerated Analytic Simulation of Sparse Ionization Signal Formation in Pixelated Projection Detector

This paper presents a GPU-accelerated simulation package, TRED, for next-generation neutrino detectors with pixelated charge readout, leveraging community-driven software ecosystems to ensure adaptability and extensibility. We introduce two generic contributions: (i) an effective-charge representation based on Gaussian quadrature rules, in which the linear- interpolation factors for the field response inside each voxel are absorbed into the effective charge, and (ii) a sparse, block- binned tensor representation that enables efficient FFT-based computation of induced signals on readout electrodes for sparsely activated detector volumes. The former captures structure inside a voxel without dense sampling, while the latter achieves low memory usage and scalable runtime, as demonstrated in bench- mark studies. The underlying data representation is applicable to large-scale detectors and to other computational problems involving sparse activity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Long-Range Fit: A Software Package for the Representation and Study of Long-Range Molecular Interactions

Describing intermolecular forces is fundamental to modeling and predicting the behavior of molecular systems. In particular, long-range molecular interactions─with electrostatic, induction, and dispersion as the main components─play a critical role, especially for low-temperature and low-density regimes. Long-range interactions are often described through perturbation theory, representing the electronic charge distribution via a multipolar series of the moments and polarizability tensors corresponding to each molecule. However, while the theory is well established, obtaining the resulting analytical expressions (and their practical implementation) constitutes a highly complex and system-dependent task. To address this challenge, we developed long-range-fit (LRF), an interactive and user-friendly software package designed to automate the generation and fitting of long-range interaction terms for arbitrary molecules in nondegenerate (ground or excited) electronic states. We have derived and implemented all terms up to 15th order, without approximations, via a spherical tensor representation, with symmetry adaptation to all molecular point-group symmetries. The resulting potential energy surface is compatible with most representations of the close interaction region.

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

A low-rank solver for the stochastic unsteady Navier–Stokes problem

Here we study a low-rank iterative solver for the unsteady Navier–Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard’s method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.

97 MATHEMATICS AND COMPUTING↗