Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Universal CMB 𝐵-mode spectrum from early causal tensor sources

Many early Universe scenarios predict postinflationary tensor perturbations from causality-limited, subhorizon sources. While the microphysical details may be different, as long as these sources are bounded in duration and correlation length, their tensor power spectra exhibit a universal scaling behavior at small wave number: 𝒫 ℎ ⁡(𝑘)∝𝑘 3 , corresponding to white noise on superhorizon scales at the time of production. If these early causal tensor sources (ECTs) exclusively produce gravitational waves before redshift 𝑧 ∼10 5 , this scaling is realized on all of the scales observed in the CMB, and thus yields a universal multipole distribution for the 𝐵-mode angular power spectrum. Unlike the scale-invariant distributions of inflationary 𝐵 modes, ECTs generically predict enhanced power on small scales and suppressed power on large scales, which allows these source classes to be distinguished given measurements over a sufficient range of angular scales. In this paper, we introduce a unified framework for characterizing ECTs and demonstrate how their universal infrared scaling manifests in low-frequency observables, including CMB 𝐵 modes and stochastic gravitational wave spectral densities. We illustrate this mapping with representative case studies of this universality class involving first-order phase transitions, topological defects, and enhanced scalar perturbations, which source tensor modes at second order in perturbation theory.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Stress Tensor flows, birefringence in non-linear electrodynamics and supersymmetry

We identify the unique stress tensor deformation which preserves zero-birefringence conditions in non-linear electrodynamics, which is a 4d 4 d version of the T\overline{T} T T ¯ operator. We study the flows driven by this operator in the three Lagrangian theories without birefringence - Born-Infeld, Plebanski, and reverse Born-Infeld - all of which admit ModMax-like generalizations using a root- T\overline{T} T T ¯ -like flow that we analyse in our paper. We demonstrate one way of making this root- T\overline{T} T T ¯ -like flow manifestly supersymmetric by writing the deforming operator in \mathcal{N} = 1 𝒩 = 1 superspace and exhibit two examples of superspace flows. We present scalar analogues in d = 2 d = 2 with similar properties as these theories of electrodynamics in d = 4 d = 4 . Surprisingly, the Plebanski-type theories are fixed points of the classical T\overline{T} T T ¯ -like flows, while the Born-Infeld-type examples satisfy new flow equations driven by relevant operators constructed from the stress tensor. Finally, we prove that any theory obtained from a classical stress-tensor-squared deformation of a conformal field theory gives rise to a related “subtracted” theory for which the stress-tensor-squared operator is a constant.

Physics↗
DOE OSTI2024

QSpace - An open-source tensor library for Abelian and non-Abelian symmetries

This is the documentation for the tensor library QSpace (v4.0), a toolbox to exploit ‘quan tum symmetry spaces’ in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the abelian symmetries $\mathbb{Z}_n$ and U(1), as well as all non-abelian symmetries based on the semisimple classical Lie algebras: A n , B n , C n , and D n , or respectively, the special unitary group SU(n), the odd orthogonal group SO(2n+1), the symplectic group Sp(2n), and the even orthogonal group SO(2n). The code (C++ embedded via the MEX interface into Matlab) is available open source as of QSpace v4.0 on bitbucket under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly comput ing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in the type of operations that it can perform across all symmetries. At the level of an ap plication, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-abelian symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Quantifying the effect of 3D models on moment tensor results using synthetic data

Moment tensors provide vital information on seismic source properties for seismic events. Moment tensors require seismic wavespeed models to compute Green’s functions, which measure the impulse response between a given source and receiver. Traditionally, researchers have used one-dimensional velocity models to calculate Green’s functions since 1D Green’s functions are computationally cheap to compute. Local 1D velocity models can also accurately model waveforms at short distances (< 500 km). However, 1D velocity models do not account for lateral heterogeneity, which can cause significant misfit in tectonically complex regions such as the Middle East (Covellone and Savage, 2012). Green’s functions calculated using 3D seismic wavespeed models have been shown to perform better in tectonically complex regions (Covellone and Savage, 2012; Kintner and Modrak, 2022), so we are interested in quantifying the effect of considering 3D structure on moment tensor inversion results. The Middle East is an ideal study area for a synthetic moment tensor test for two reasons. Firstly, the Middle East is a tectonically complex region that has been heavily studied. Secondly, the Middle East has significant seismic activity throughout the region, but imperfect station coverage due to limited open data through large swaths of the domain. The tectonic complexity and uneven station coverage will test real-world performance even in a synthetic experiment.

58 GEOSCIENCES↗
DOE OSTI2024

A tensor density measure of topological charge in three dimensional nematic phases

A path independent measure in order parameter space is introduced such that, when integrated along any closed contour in a three dimensional nematic phase, it yields the topological charge of any line defects encircled by the contour. A related measure, when integrated over either closed or open surfaces, reduces to known results for the charge associated with point defects (hedgehogs) or Skyrmions. We further define a tensor density, the disclination density tensor D, from which the location of a disclination line can be determined. This tensor density has a dyadic decomposition near the line into its tangent and its rotation vector, allowing a convenient determination of both. The tensor D may be nonzero in special configurations in which there are no defects (double-splay or double-twist configurations), and its behavior there is provided. The special cases of Skyrmions and hedgehog defects are also examined, including the computation of their topological charge from D.

36 MATERIALS SCIENCE↗
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 OSTI2023

Tensor renormalization group study of 3D principal chiral model

We study the three-dimensional SU(2) principal chiral model using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based on the character expansion of the Boltzmann weight. We compare the average action obtained using these two tensor network algorithms and confirm that the resulting critical coupling and exponent are comparable with the recent estimations from the Monte Carlo methods.

Unmuth-Yockey, Judah↗
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↗
DOE OSTI2023

Tensor renormalization group study of 3D principal chiral model

We study the three-dimensional $SU(2)$ principal chiral model (PCM) using different tensor renormalization group methods based on the triad and anisotropic decomposition of the tensor. The tensor network representation is formulated based on the character expansion of the Boltzmann weight. We compare the average action obtained using these two tensor network algorithms and confirm that the resulting critical coupling and exponent are comparable with the recent estimations from the Monte Carlo methods.

Akiyama, Shinichiro↗
DOE OSTI2023

CP decomposition for tensors via alternating least squares with QR decomposition

The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.

97 MATHEMATICS AND COMPUTING↗
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 OSTI2023

Two-dimensional isometric tensor networks on an infinite strip

The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an “orthogonality column” of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Lastly, we introduce an infinite time-evolving block decimation algorithm (iTEBD 2 ) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 OSTI2020

Enhanced tensor polarization in solid-state targets

In this work, we report measurements of enhanced tensor polarization on solid-state targets. The results here represent an increase in tensor polarization over that previously achieved in high energy and nuclear scattering experiments that focused on the measurement of tensor polarized observables. Enhancement techniques are used which require RF produced close to the Larmor frequency of the target spins and use selective semi-saturation resulting from two sources of irradiation, microwave for the DNP process and the additional RF used to manipulate the population of the energy levels in the target material. The spin dynamics of the solid target are used to align the spins enhancing the ensemble average to improve the figure of merit of the scattering experiment. Target rotation at an optimized rate can lead to additional enhancement by applying selective semi-saturation in polycrystalline materials that possess a Pake doublet in their NMR signal.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Systematic Generation of Moment Invariant Bases for 2D and 3D Tensor Fields

Moment invariants have been successfully applied to pattern detection tasks in 2D and 3D scalar, vector, and matrix valued data. However so far no flexible basis of invariants exists, i.e., no set that is optimal in the sense that it is complete and independent for every input pattern. Here, we prove that a basis of moment invariants can be generated that consists of tensor contractions of not more than two different moment tensors each under the conjecture of the set of all possible tensor contractions to be complete. This result allows us to derive the first generator algorithm that produces flexible bases of moment invariants with respect to orthogonal transformations by selecting a single non-zero moment to pair with all others in these two-factor products. Since at least one non-zero moment can be found in every non-zero pattern, this approach always generates a complete set of descriptors.

97 MATHEMATICS AND COMPUTING↗