Search NASA⌕ Search

SEARCH · Search NASA

Results for “Tensor compression”

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 37 records · Page 2

True Load Balancing for Matricized Tensor Times Khatri-Rao Product

MTTKRP is the bottleneck operation in algorithms used to compute the CP tensor decomposition. For sparse tensors, utilizing the compressed sparse fibers (CSF) storage format and the CSF-oriented MTTKRP algorithms is important for both memory and computational efficiency on distributed-memory architectures. Existing intelligent tensor partitioning models assume the computational cost of MTTKRP to be proportional to the total number of nonzeros in the tensor. However, this is not the case for the CSF-oriented MTTKRP on distributed-memory architectures. We outline two deficiencies of nonzero-based intelligent partitioning models when CSF-oriented MTTKRP operations are performed locally: failure to encode processors' computational loads and increase in total computation due to fiber fragmentation. We focus on existing fine-grain hypergraph model and propose a novel vertex weighting scheme that enables this model encode correct computational loads of processors. We also propose to augment the fine-grain model by fiber nets for reducing the increase in total computational load via minimizing fiber fragmentation. In this way, the proposed model encodes minimizing the load of the bottleneck processor. In conclusion, parallel experiments with real-world sparse tensors on up to 1024 processors prove the validity of the outlined deficiencies and demonstrate the merit of our proposed improvements in terms of parallel runtimes.

97 MATHEMATICS AND COMPUTING↗

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗

Implicit Large-Eddy Simulations of Compressible Mixing Layers

Implicit large-eddy simulations of the self-similar regions of two compressible mixing layers at high Reynolds number and convective Mach numbers of 0.381 and 0.690 were carried out. Experimental data was used as the input into a synthetic eddy method turbulent inflow boundary condition to initiate simulations. Computational grids with nearly isotropic cells were used and the grid counts ranged from 24 to 270 million points. Agreement with experimental velocity and Reynolds stress data was good given the simplifications of the simulation. The decrease in mixing layer growth rate with increasing compressibility compares well with the literature. Budgets for the Reynolds stress transport equation were extracted from the simulations. It was demonstrated that the grids used did not resolve the dissipation term at the experimental Reynolds number. However, low Reynolds number simulations indicate that the numerical dissipation replaces the physical dissipation and the dissipation term in the transport equation can be represented by the summation term that quantifies the imbalance in the budget. The budgets for the high Reynolds number mixing layers agree well with previous low Reynolds number studies; indicating that the primary mechanism for the reduced growth rate and increased anistropy of the Reynolds stress tensor due to compressibility is a reduction in the pressure-strain and production terms. A new scaling based on the magnitude of the Reynolds stress tensor is proposed. This scaling provides better relative comparisons between the data and shows that the decrease in pressure-strain in the shear component is the primary driver in reducing the transverse normal stress.

turbulence↗

Dependence of the Elastic Stiffness Tensors of PETN, α‐RDX, γ‐RDX, ϵ‐RDX, ϵ‐CL‐20, DAAF, FOX‐7, and β‐HMX on Hydrostatic Compression

Abstract The dependence of the components of the elastic stiffness tensors (or elastic constants) of the organic explosives PETN, RDX, CL‐20, DAAF, FOX‐7, and HMX on hydrostatic pressure up to 10 GPa have been computed using dispersion‐corrected density functional theory. We report the evolution of lattice parameters and the non‐zero stiffnesses for the tetragonal, orthorhombic, and monoclinic crystal symmetries. Linear and quadratic dependencies of the components of the elastic stiffness tensors on volumetric compression and hydrostatic pressure are tabulated for use in single crystal plasticity models.

36 MATERIALS SCIENCE↗

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗

A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity

Recent advancements have highlighted the limitations of current quantum systems, particularly the restricted number of qubits available on near-term quantum devices. This constraint greatly inhibits the range of applications that can leverage quantum computers. Moreover, as the available qubits increase, the computational complexity grows exponentially, posing additional challenges. Consequently, there is an urgent need to use qubits efficiently and mitigate both present limitations and future complexities. To address this, existing quantum applications attempt to integrate classical and quantum systems in a hybrid framework. In this study, we concentrate on quantum deep learning and introduce a collaborative classical-quantum architecture called co-TenQu. The classical component employs a tensor network for compression and feature extraction, enabling higher-dimensional data to be encoded onto logical quantum circuits with limited qubits. On the quantum side, we propose a quantum-state-fidelity-based evaluation function to iteratively train the network through a feedback loop between the two sides. co-TenQu has been implemented and evaluated with both simulators and the IBM-Q platform. Compared to state-of-the-art approaches, co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. Additionally, it outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.

42 ENGINEERING↗

Strongly Anisotropic Thermomechanical Response to Shock Wave Loading in Oriented Samples of the Triclinic Molecular Crystal 1,3,5-Triamino-2,4,6-trinitrobenzene

All-atom molecular dynamics (MD) simulations were used to study shock wave loading in oriented single crystals of the highly anisotropic triclinic molecular crystal 1,3,5-triamino-2,4,6-trinitrobenzene (TATB). The crystal structure consists of planar hydrogen-bonded sheets of individually planar TATB molecules that stack into graphitic-like layers. Shocks were studied for seven systematically prepared crystal orientations with limiting cases that correspond to shock propagation exactly perpendicular and exactly parallel to the graphitic-like layers. The simulations were performed for initially defect-free crystals using a reverse-ballistic configuration that generates explicit, supported shocks. Final longitudinal stress components are between ≈8.5 and ≈10.5 GPa for the 1.0 km s –1 impact speed studied. Orientation-dependent properties are reported including shock speeds, stresses, temperatures, compression ratios, and local material strain rates. Spatiotemporal maps of the temperature, stress tensor, material flow, and molecular orientations reveal complicated processes that arise for specific shock directions. Furthermore, the results indicate that TATB shock response is highly sensitive to crystal orientation, with significant qualitative differences for the time evolution of the stress tensor and temperature, elastic/inelastic compression response, defect formation and growth, critical von Mises stress, and strain rates during shock rise that span nearly an order of magnitude. A variety of inelastic deformation mechanisms are identified, ranging from crumpling of graphitic-like layers to dislocation-mediated plasticity to intense shear strain localization. To our knowledge, these are the first systematic MD simulations and analysis of explicit shock wave propagation along nontrivial crystal directions in a triclinic molecular crystal.

36 MATERIALS SCIENCE↗

Goated: goal-oriented tensor decompositions in python

SAND2026-20464O Goated performs goal-oriented tensor decompositions in Python, enabling efficient compression of multi-dimensional simulation data. It extends common tensor decomposition methods by incorporating domain-specific knowledge, such as conservation laws in physics, through a penalty term in the optimization process. This approach improves data compression and modeling accuracy across various applications, including physics simulations, by using specialized algorithms and structure-aware subroutines to accelerate solver performance. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

Taking control of compressible modes: bulk viscosity and the turbulent dynamo

Many polyatomic astrophysical plasmas are compressible and out of chemical and thermal equilibrium, introducing a bulk viscosity into the plasma via the internal degrees of freedom of the molecular composition, directly impacting the decay of compressible modes, $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$. This is especially important for small-scale, turbulent dynamo processes in the interstellar medium (ISM), which are known to be sensitive to the effects of compression. To control the viscous properties of $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$, we perform trans-sonic, visco-resistive dynamo simulations with additional bulk viscosity $\nu _{\text{bulk}}$, deriving a new $\nu _{\text{bulk}}$ Reynolds number $\text{Re}_{\text{bulk}}$, and viscous Prandtl number $\text{P}\nu \equiv \text{Re}_{\text{bulk}}/ \text{Re}_{\text{shear}}$, where $\text{Re}_{\text{shear}}$ is the shear viscosity Reynolds number. We derive a framework for decomposing $E_{\rm mag}$ growth rates into incompressible and compressible terms via orthogonal tensor decompositions of $\boldsymbol {\nabla }\otimes \mathrm{{\boldsymbol {\mathit {v}}}}$, where $\mathrm{{\boldsymbol {\mathit {v}}}}$ is the fluid velocity. We find that $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ play a dual role, growing and decaying $E_{\rm mag}$, and that field-line stretching is the main driver of growth, even in compressible dynamos. In the absence of $\nu _{\text{bulk}}$ ($\text{P}\nu \rightarrow \infty$), $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ pile up on small-scales, creating a spectral bottleneck, which disappears for $\text{P}\nu \approx 1$. As $\text{P}\nu$ decreases, $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ are dissipated at increasingly larger scales, in turn suppressing incompressible modes through a coupling between high-k modes. We emphasize the importance of further understanding the role of $\nu _{\text{bulk}}$ in compressible astrophysical plasmas, which we estimate could be as strong as the shear viscosity in the cold ISM, and highlight that compressible direct numerical simulations without bulk viscosity have unresolved compressible mode dissipation scales.

MHD↗

Georgia Tech Accelerated, Compressed, and Regularized Compute of Kinetic-based PDEs (Final Report)

This report summarizes the collaborative effort between Lawrence Livermore National Laboratory and Georgia Tech to enhance the BoBa library for tensor train computation in PDE solvers, with a target on kinetic equations and their continuum limits. We aimed to reduce computational cost and memory usage by replacing traditional array-based computations with tensor trains. We examined the compressibility of time-evolving solutions to the Euler equations with discontinuities. We also explored using the first invsicid and linear regularization of the compressible flow equations via the information geometric regularization (IGR). We explored this in a tensor train formulation. To identify that inverse terms in the IGR equations pose problems for tensor train formulations and investigate efficient methods for batched inversion of tensor trains.

97 MATHEMATICS AND COMPUTING↗

Crystallographic Texture, Structure, and Stress Transmission in Nugget Sandstone Examined With X‐Ray Tomography and Diffraction Microscopy

Subsurface processes in sandstones are controlled by porosity, permeability, and deformation mechanisms, all of which are controlled by a complex interplay of crystallographic rock texture, structure, and micromechanics. Texture, structure, and micromechanics have historically been studied using optical and electron microscopy of thin-sections. Here, we employed a new combination of in situ X-ray tomography and ray diffraction microscopy to study crystallographic texture, structure, and grain stresses in 3D. We examined these features in a sample of Nugget sandstone, a sandstone constituting hydrocarbon reservoirs across the American West. Our aims are threefold. First, we demonstrate the utility of X-ray diffraction microscopy probes for revealing texture, structure, and stress transmission in 3D. Second, we apply these techniques to Nugget sandstone and discuss findings in the context of prior work. Third, we study grain stress tensor evolution during mechanical compression to examine whether their heterogeneity and orientation evolution reflect that of inter-particle forces in granular materials. Our results show: (a) larger grains featured higher intra-granular misorientations, possibly from an increased prevalence of cements; (b) pores closed parallel to the loading direction and opened normal to loading; (c) grain stresses featured heterogeneity and orientations similar to inter-particle forces in non-cohesive granular materials; (d) grains featured compressive stresses in the loading direction and tensile stresses orthogonal to the loading direction, the latter resisting sample dilation and grain separation. Our work demonstrates the first known application of multi-modal X-ray tomography and diffraction microscopy to sandstone, providing new 3D insight into the nature of quartz cement and stress evolution.

high energy diffraction microscopy↗

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↗

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↗

Numerically exact configuration interaction at quadrillion-determinant scale

The combinatorial growth of configuration interaction (CI) has long limited this formally exact quantum chemistry method to only the smallest molecules. Here, we report a numerically exact CI calculation exceeding one quadrillion (10 15 ) determinants, made possible by a lossless categorical compression strategy within the small-tensor-product distributed active space (STP-DAS) framework. This approach overcomes the traditional memory bottlenecks of CI by a numerically exact compression of the wavefunction representation and reformulating the most computationally demanding matrix–vector operations. Using this method, we performed a fully relativistic CI calculation of the ground state of HBrTe with over 10 15 complex-valued determinants in just 34.5 h on 1000 computing nodes—the largest CI calculation ever reported. We further achieved fast computation for systems with hundreds of billions of determinants on only a few compute nodes. Extensive benchmarks confirm that the method retains full numerical exactness while cutting memory and computational cost by orders of magnitude. Compared to previous state-of-the-art CI calculations, this work achieves a 1000 times increase in CI space, a 10 6 -fold increase in floating-point operations performed, and a 10 6 -fold improvement in computational speed.

Computational chemistry↗

Tidal disruption of solid bodies

The problem of stress, strain, and breakup in solid satellites and stray bodies subject to tidal perturbations is presently addressed in view of three novel considerations. After presenting a new analytic solution for the stress tensor in a homogeneous and compressible elastic sphere, where the inclusion of compressibility alters stresses by several percent, realistic failure criteria are noted to demonstrate the general failure of such ductile bodies as iron meteoroids by plastic shear, while brittle ice bodies fail by either tensile or shear fracture. A reexamination of crack propagation after initial failure allows the diverse breakup criteria to be reconciled.

Dobrovolskis, Anthony R.↗

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↗