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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
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↗
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 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↗