Search NASA⌕ Search

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.

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

At least 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The Poisson tensor completion parametric estimator

We introduce the Poisson tensor completion (PTC) estimator that exploits inter-sample relationships to compute a low-rank Poisson tensor decomposition of the frequency histogram for samples of a multivariate distribution. Our crucial observation is that the histogram bins are an instance of a space partitioning of counts and thus can be identified with a spatial non-homogeneous Poisson process. The Poisson tensor decomposition leads to a completion of the mean measure over all bins—including those containing few to no samples—and leads to our proposed estimator. A Poisson tensor decomposition models the underlying distribution of the count data and guarantees non-negative estimated values obviating the need for additional constraints to ensure non-negativity. Furthermore, we demonstrate that our PTC estimator is a substantial improvement over standard histogram-based estimators for sub-Gaussian probability distributions because of the concentration of norm phenomenon.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
NASA NTRS1980

The structure of correlation tensors in homogeneous anisotropic turbulence

The study of turbulence with spatially homogeneous but anisotropic statistical properties has applications in space physics and laboratory plasma physics. The first step in the systematic study of such fluctuations is the elucidation of the kinematic properties of the relevant statistical objects, which are the correlation tensors. The theory of isotropic tensors, developed by Robertson, Chandrasekhar and others, is reviewed and extended to cover the general case of turbulence with a pseudo-vector preferred direction, without assuming mirror reflection invariance. Attention is focused on two point correlation functions and it is shown that the form of the decomposition into proper and pseudo-tensor contributions is restricted by the homogeneity requirement. It is also shown that the vector and pseudo-vector preferred direction cases yield different results. An explicit form of the two point correlation tensor is presented which is appropriate for analyzing interplanetary magnetic fluctuations. A procedure for determining the magnetic helicity from experimental data is presented.

Matthaeus, W. H.↗
NASA NTRS1994

Particle localization, spinor two-valuedness, and Fermi quantization of tensor systems

Recent studies of particle localization shows that square-integrable positive energy bispinor fields in a Minkowski space-time cannot be physically distinguished from constrained tensor fields. In this paper we generalize this result by characterizing all classical tensor systems, which admit Fermi quantization, as those having unitary Lie-Poisson brackets. Examples include Euler's tensor equation for a rigid body and Dirac's equation in tensor form.

Reifler, Frank↗
NASA NTRS1995

Visualization of 2-D and 3-D Tensor Fields

In previous work we have developed a novel approach to visualizing second order symmetric 2-D tensor fields based on degenerate point analysis. At degenerate points the eigenvalues are either zero or equal to each other, and the hyperstreamlines about these points give rise to trisector or wedge points. These singularities and their connecting hyperstreamlines determine the topology of the tensor field. In this study we are developing new methods for analyzing and displaying 3-D tensor fields. This problem is considerably more difficult than the 2-D one, as the richness of the data set is much larger. Here we report on our progress and a novel method to find, analyze and display 3-D degenerate points. First we discuss the theory, then an application involving a 3-D tensor field, the Boussinesq problem with two forces.

Hesselink, Lambertus↗
NASA NTRS1996

Study of the velocity gradient tensor in turbulent flow

The behavior of the velocity gradient tensor, A(ij)=delta u(i)/delta x(j), was studied using three turbulent flows obtained from direct numerical simulation The flows studies were: an inviscid calculation of the interaction between two vortex tubes, a homogeneous isotropic flow, and a temporally evolving planar wake. Self-similar behavior for each flow was obtained when A(ij) was normalized with the mean strain rate. The case of the interaction between two vortex tubes revealed a finite sized coherent structure with topological characteristics predictable by a restricted Euler model. This structure was found to evolve with the peak vorticity as the flow approached singularity. Invariants of A(ij) within this structure followed a straight line relationship of the form: gamma(sup 3)+gammaQ+R=0, where Q and R are the second and third invariants of A(ij), and the eigenvalue gamma is nearly constant over the volume of this structure. Data within this structure have local strain topology of unstable-node/saddle/saddle. The characteristics of the velocity gradient tensor and the anisotropic part of a related acceleration gradient tensor H(ij) were also studied for a homogeneous isotropic flow and a temporally evolving planar wake. It was found that the intermediate principal eigenvalue of the rate-of-strain tensor of H(ij) tended to be negative, with local strain topology of the type stable-node/saddle/saddle. There was also a preferential eigenvalue direction. The magnitude of H(ij) in the wake flow was found to be very small when data were conditioned at high local dissipation regions. This result was not observed in the relatively low Reynolds number simulation of homogeneous isotropic flow. A restricted Euler model of the evolution of A(ij) was found to reproduce many of the topological features identified in the simulations.

Cheng, Wei-Ping↗
NASA NTRS1997

Visualization of 2-D and 3-D Tensor Fields

In previous work we have developed a novel approach to visualizing second order symmetric 2-D tensor fields based on degenerate point analysis. At degenerate points the eigenvalues are either zero or equal to each other, and the hyper-streamlines about these points give rise to tri-sector or wedge points. These singularities and their connecting hyper-streamlines determine the topology of the tensor field. In this study we are developing new methods for analyzing and displaying 3-D tensor fields. This problem is considerably more difficult than the 2-D one, as the richness of the data set is much larger. Here we report on our progress and a novel method to find , analyze and display 3-D degenerate points. First we discuss the theory, then an application involving a 3-D tensor field, the Boussinesq problem with two forces.

Hesselink, Lambertus↗
NASA NTRS1994

The Topology of Three-Dimensional Symmetric Tensor Fields

We study the topology of 3-D symmetric tensor fields. The goal is to represent their complex structure by a simple set of carefully chosen points and lines analogous to vector field topology. The basic constituents of tensor topology are the degenerate points, or points where eigenvalues are equal to each other. First, we introduce a new method for locating 3-D degenerate points. We then extract the topological skeletons of the eigenvector fields and use them for a compact, comprehensive description of the tensor field. Finally, we demonstrate the use of tensor field topology for the interpretation of the two-force Boussinesq problem.

Lavin, Yingmei↗
NASA NTRS2005

Foundations of Tensor Analysis for Students of Physics and Engineering With an Introduction to the Theory of Relativity

Tensor analysis is one of the more abstruse, even if one of the more useful, higher math subjects enjoined by students of physics and engineering. It is abstruse because of the intellectual gap that exists between where most physics and engineering mathematics leave off and where tensor analysis traditionally begins. It is useful because of its great generality, computational power, and compact, easy to use, notation. This paper bridges the intellectual gap. It is divided into three parts: algebra, calculus, and relativity. Algebra: In tensor analysis, coordinate independent quantities are sought for applications in physics and engineering. Coordinate independence means that the quantities have such coordinate transformations as to leave them invariant relative to a particular observer s coordinate system. Calculus: Non-zero base vector derivatives contribute terms to dynamical equations that correspond to pseudoaccelerations in accelerated coordinate systems and to curvature or gravity in relativity. These derivatives have a specific general form in tensor analysis. Relativity: Spacetime has an intrinsic geometry. Light is the tool for investigating that geometry. Since the observed geometry of spacetime cannot be made to match the classical geometry of Euclid, Einstein applied another more general geometry differential geometry. The merger of differential geometry and cosmology was accomplished in the theory of relativity. In relativity, gravity is equivalent to curvature.

Kolecki, Joseph C.↗
DOE OSTI2024

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

The Average Spectrum Norm and Near-Optimal Tensor Completion

We propose the average spectrum norm to study the minimum number of measurements required to approximate a multidimensional array (i.e., sample complexity) via low-rank tensor recovery. Our focus is on the tensor completion problem, where the aim is to estimate a multiway array using a subset of tensor entries corrupted by noise. Our average spectrum norm-based analysis provides near-optimal sample complexities, exhibiting dependence on the ambient dimensions and rank that do not suffer from exponential scaling as the order increases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The tensor-train stochastic finite volume method for uncertainty quantification

The stochastic finite volume method offers an efficient one-pass approach for assessing uncertainty in hyperbolic conservation laws. Still, it struggles with the curse of dimensionality when dealing with multiple stochastic variables. Here, we introduce the stochastic finite volume method within the tensor-train framework to counteract this limitation. This integration, however, comes with its own set of difficulties, mainly due to the propensity for shock formation in hyperbolic systems. To overcome these issues, we have developed a tensor-train-adapted stochastic finite volume method that employs a global WENO reconstruction, making it suitable for such complex systems. This approach represents the first step in designing tensor-train techniques for hyperbolic systems and conservation laws involving shocks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Diagonal isometric form for tensor network states in two dimensions

Isometric tensor network states (isoTNS) generalize the isometric form of the one-dimensional matrix product states to tensor networks in two and higher dimensions. Here, we introduce an alternative isometric form for isoTNS by incorporating auxiliary tensors to represent the orthogonality hypersurface. We implement the time evolving block decimation algorithm on this new isometric form and benchmark the method by computing ground states and the real time evolution of the transverse field Ising model in two dimensions on large square lattices of up to 1250 sites. Our results demonstrate that isoTNS can efficiently capture the entanglement structure of two-dimensional area law states. The short-time dynamics is also accurately reproduced even at the critical point. Our isoTNS formulation further allows for a natural extension to different lattice geometries, such as the honeycomb or kagome lattice.

2-dimensional systems↗
NASA NTRS2018

Change of Inertia Tensor Due to a Severed Radial Boom for Spinning Spacecraft

Many spinning spacecraft have long, flexible, radial booms to carry science instrumentation. These radial booms often have low mass but contribute significantly to the spacecraft moment of inertia due to their length. There are historical cases where radial booms have been severed or have failed to deploy. This paper presents models for the center of mass (CM) and inertia tensor that account for variable boom geometry and investigates how the CM and inertia tensor change when a radial boom is severed.The CM and inertia tensor models presented here will be included in the Attitude Ground System (AGS) for the Magnetospheric Multiscale (MMS) mission. This work prepares the AGS to provide uninterrupted support in the event of a radial boom anomaly. These models will improve the AGS computations for spin-axis precession prediction, Kalman filter propagation for the definitive attitude, and mass property generation needed for the onboard control system. As an additional application, a method is developed for approximating the location on the boom where the break occurred based on the new models and readily observable attitude parameters.

Inertia↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
DOE OSTI2026

Coarse-grained fixed-point tensor networks and holographic reflected entropy in 3D gravity

We use the framework of fixed-point BCFT tensor networks to present a microscopic CFT derivation of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS 3 /CFT 2 , for both bipartite and multipartite settings. These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification via cutting-and-gluing CFT path integrals. Employing modular flow in the large-c limit, we demonstrate that these intrinsic CFT manipulations reproduce bulk geometric prescriptions, without assuming the AdS/CFT dictionary. The emergence of bulk geometry is traced to coarse-graining over heavy states in the large-c limit. Universal coarse-grained BCFT data for compact 2D CFTs, through the relation to Liouville theory with ZZ boundary conditions, yields hyperbolic geometry on the Cauchy slice. The corresponding averaged replica partition functions reproduce all candidate EWs, arising from different averaging patterns, with the dominant one providing the correct RE and EW. In this way, many heuristic tensor-network intuitions in toy models are made precise and established directly from intrinsic CFT data.

AdS-CFT correspondence↗