SEARCH · Search NASA

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2024

S U ( 2 ) principal chiral model with tensor renormalization group on a cubic lattice

We study the continuous phase transition and thermodynamic observables in the three-dimensional Euclidean S U ( 2 ) principal chiral field model with the triad tensor renormalization group and the anisotropic tensor renormalization group methods. Using these methods, we find results that are consistent with previous Monte Carlo estimates and the predicted renormalization group scaling of the magnetization close to criticality. These results bring us one step closer to studying finite-density quantum chromodynamics in four dimensions using tensor network methods. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Direct measurement of the quantum metric tensor in solids

The quantum metric tensor is a central geometric quantity in modern physics that is defined as the distance between nearby quantum states. Despite numerous studies highlighting its relevance to fundamental physical phenomena in solids, measuring the complete quantum metric tensors in real solid-state materials is challenging. In this work, we report a direct measurement of the full quantum metric tensors of Bloch electrons in solids using black phosphorus as a representative material. We extracted the momentum space distribution of the pseudospin texture of the valence band from the polarization dependence of angle-resolved photoemission spectroscopy measurement. Our approach is poised to advance our understanding of quantum geometric responses in a wide class of crystalline systems.

Kim, Sunje↗

DOE OSTI2025

Polarization options in inclusive DIS off tensor polarized deuteron

In the near future, the Jefferson Lab b 1 experiment will provide the second measurement of tensor polarized asymmetries in inclusive DIS on the deuteron. In this asymmetry, 4 independent tensor polarized structure functions contribute. This necessitates systematic approximations in the extraction of the leading twist structure function b 1 from a single tensor asymmetry measurement. Contamination from higher twist structure functions and kinematic effects is discussed here. Using a deuteron convolution model, we quantify the systematic errors from these approximations for two different choices for the target polarization direction (momentum transfer, electron beam direction). For Jefferson Lab 12 GeV kinematics, the systematic error turns out to be comparable between the two polarization options, while at higher Q 2 values the momentum transfer direction is preferred.

Cosyn, Wim [Florida International University, Miam↗

DOE OSTI2026

Code for the manuscript "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Mode

We disclose a python/pytorch implementation of the physics-informed machine learning algorithm described in "Lagrangian Attention Tensor Networks for Velocity Gradient Statistical Modeling", LA-UR-24-30678. Direct numerical simulation (DNS) of ubiquitous turbulence phenomena is computationally infeasible for realistic flows. As a result, reduced modeling for turbulent flows aim to reduce the number of resolved scales while retaining accurate representations of the small-scale physics. The dynamics of the velocity gradient tensor (VGT) is a key ingredient in reduced or subgrid turbulence models. The evolution equation for the VGT involves nonlocal terms, requiring closure modeling. This implementation of the novel methodology of Lagrangian Attention Tensor Networks (LATN), utilizes a structured representation of the history of the VGT to inform a physics-informed machine learning algorithm. This addition of structured memory terms is shown to outperform previous models when trained and evaluated on DNS data.

Livescu, Daniel [LANL]↗

DOE OSTI2026

Seismic Event Characterization Using Full Moment Tensors on the Hypersphere

Moment tensor solutions provide insights into the deformation that has occurred in the source region of a seismic event and are therefore of great value in identifying different types of seismic sources, such as when monitoring for underground nuclear tests. Despite this utility, inversion of waveforms recorded by seismometers for their full seismic moment tensor is not yet routine, and development of robust methods to classify events based on this information is in its infancy. Here, we assemble an inventory of 1405 full moment tensor solutions that include explosive, earthquake, and collapse events, and investigate the use of anisotropic probability distribution functions on the 5D hypersphere to discriminate between these sources. Using a Bayesian classifier, we obtain optimal success rates of 98.4% across all events and demonstrate that modification of the prior probabilities provides a natural way to alter the balance between not missing desirable events (such as explosions) versus misclassifying large numbers of undesired events (such as earthquakes). The approach is specifically designed to progress from traditional, bipolar event screening metrics to more generalized event identification across multiple types of seismic sources. Despite current databases containing insufficient numbers of events to definitively demonstrate at present, we also find intriguing evidence of subgroupings within individual source populations on the hypersphere, for example, between chemical and nuclear explosions, raising the potential possibility of discriminating between these event types in the future.

Geosciences↗

DOE OSTI2024

Multipartite edge modes and tensor networks

Holographic tensor networks model AdS/CFT, but so far they have been limited by involving only systems that are very different from gravity. Unfortunately, we cannot straightforwardly discretize gravity to incorporate it, because that would break diffeomorphism invariance. In this note, we explore a resolution. In low dimensions gravity can be written as a topological gauge theory, which can be discretized without breaking gauge-invariance. However, new problems arise. Foremost, we now need a qualitatively new kind of “area operator,” which has no relation to the number of links along the cut and is instead topological. Secondly, the inclusion of matter becomes trickier. We successfully construct a tensor network both including matter and with this new type of area. Notably, while this area is still related to the entanglement in “edge mode” degrees of freedom, the edge modes are no longer bipartite entangled pairs. Instead they are highly multipartite. Along the way, we calculate the entropy of novel subalgebras in a particular topological gauge theory. We also show that the multipartite nature of the edge modes gives rise to non-commuting area operators, a property that other tensor networks do not exhibit.

Akers, Chris (ORCID:0000000227929827)↗

DOE OSTI2025

Probabilistic Error Bounds for Low-Rank Tensor Decompositions Used in Large-Scale Data Analysis Applications (LDRD Final Report)

This report documents a research project on analyzing low-rank tensor models for data analysis that took place at Sandia National Laboratories from October 2023–September 2025. The focus of this work was to extend theoretical frameworks from statistics and probability theory for use with models for scalar, vector, and matrix data to models with tensor, or general multi-dimensional array, data. Through this work, we have provided a new set of tools for bounding errors on low-rank tensor models of both complete and sampled data. The remainder of this report is organized as follows. In Section 1, we describe the proposed work at the start of the project. Section 2 describes the research advances made as part of the project. Other research contributions in the form of conference presentations and software development is provided in Section 3. Workforce development at Sandia and Florida Atlantic University (via a subcontract on this project) is provided in Section 4.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Frontal Slice Approaches for Tensor Linear Systems

Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} ∗\mathcal{X} = \mathcal{B}$ where ∗ denotes the $t$-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.

Luo, Hengrui↗

DOE OSTI2026

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗

DOE OSTI2025

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗

DOE OSTI2025

A generalized and adaptable tensor-contraction-based cluster expansion formalism for multicomponent solids

Density functional theory (DFT)-based simulations of materials have first-principles accuracy, but are very computationally expensive. For simulating various properties of multi-component alloys, the cluster expansion (CE) technique has served as the standard workaround to improve computational efficiency. However, the standard CE technique is difficult to extend to exotic and/or low-symmetry lattices, often implemented via iteration over particular cluster types, which must be enumerated per lattice structure. In this work, we introduce the tensor cluster expansion (TCE), implemented in the open-source code tce-lib, which maps correlation functions to mixed tensor contractions, eliminating the need to iterate over cluster types and additionally making the calculation of correlation functions well-suited for massively parallel architectures like GPUs. We show that local interaction energies are an immediate consequence of the TCE formalism, yielding nearly $\mathcal{O}$(1) energy difference calculations. We then use this formalism to fit CE models for the TaW and CoNiCrFeMn systems, and use these models to respectively compute the enthalpy of mixing curve and Cowley short-range order parameters, showing excellent agreement with ground truth data.

Cluster expansion↗

DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗

DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

DOE OSTI2025

On infinite tensor networks, complementary recovery and type II factors

We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with complementary recovery, a property that features prominently in the bulk-to-boundary maps intrinsic to holographic quantum error-correcting codes. In this case, we decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network. As a specific example, we describe this inductive limit for the holographic Harlow-Pastawski-Preskill-Yoshida code model and relate its algebraic and error-correction features. We find that the local algebras in this model are given by the hyperfinite type II$_\infty$ factor. Next, we discuss other networks that build upon this framework and comment on a connection between type II factors and stabilizer circuits. We conclude with a discussion of multiscale entanglement renormalization ansatz networks in which complementary recovery is broken. We argue that this breaking possibly permits a limiting type III von Neumann algebra, making them more suitable ansätze for approximating subregions of quantum field theories.

holographic dualities↗

DOE OSTI2025

Quantum real-time evolution using tensor renormalization group methods

We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1⁢D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.

lattice gauge theory↗

DOE OSTI2024

Tensor Network Space-Time Spectral Collocation Method for Time-Dependent Convection-Diffusion-Reaction Equations

Emerging tensor network techniques for solutions of partial differential equations (PDEs), known for their ability to break the curse of dimensionality, deliver new mathematical methods for ultra-fast numerical solutions of high-dimensional problems. Here, we introduce a Tensor Train (TT) Chebyshev spectral collocation method, in both space and time, for the solution of the time-dependent convection-diffusion-reaction (CDR) equation with inhomogeneous boundary conditions, in Cartesian geometry. Previous methods for numerical solution of time-dependent PDEs often used finite difference for time, and a spectral scheme for the spatial dimensions, which led to a slow linear convergence. Spectral collocation space-time methods show exponential convergence; however, for realistic problems they need to solve large four-dimensional systems. We overcome this difficulty by using a TT approach, as its complexity only grows linearly with the number of dimensions. We show that our TT space-time Chebyshev spectral collocation method converges exponentially, when the solution of the CDR is smooth, and demonstrate that it leads to a very high compression of linear operators from terabytes to kilobytes in TT-format, and a speedup of tens of thousands of times when compared to a full-grid space-time spectral method. These advantages allow us to obtain the solutions at much higher resolutions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Failure of the large-N expansion in a bosonic tensor model

We study the tensor model generalization of the quantum p-spherical model in the large-N limit. While the tensor model has the same large-N expansion as the disordered quantum p-spherical model, its ground state is superextensive, in contradiction with large-N perturbation theory. Therefore, the large-N expansion of this model catastrophically fails at arbitrarily large-N, without any obvious signal in perturbation theory.

1/N Expansion↗

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↗