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 235 records · Page 13

Calculated electron paramagnetic resonance g-tensor and hyperfine parameters for zinc vacancy and N related defects in ZnO

Various defects in ZnO, focused on substitutional N O and N 2 in various sites, O-site, interstitial and Zn-site are studied using first-principles calculations with the goal of understanding the electron paramagnetic resonance (EPR) center reported for N 2 in ZnO and substitutional N on the O-site. The g tensors are calculated using the gauge including projector augmented wave (GIPAW) method and compared with experiments. The g-tensor of the free $N^{+}_{2}$ and $N^{–}_{2}$ radicals and their various contributions within the GIPAW theory are analyzed first to provide a baseline reference for the accuracy of the method and for understanding the N 2 behavior in ZnO. Previous controversies on the site location of N 2 in ZnO for this EPR center and on the shallow or deep nature and donor or acceptor nature of this center are resolved. Here, we find that the N 2 on the Zn site is mostly zinc-vacancy like in its spin density and g-tensor, while for the O-site, a model with the N 2 axis lying in-the basal plane and the singly occupied π g -orbital along the c axis provides good agreement with experiment. For the interstitial location, if the N 2 is not strongly interacting with the surroundings, no levels in the gap are found and hence also no possible EPR center. The calculated g-tensors for N O and V Zn are also found to be in good agreement with experiment. The effects of different functionals affecting the localization of the spin density are shown to affect the g-tensor values.

36 MATERIALS SCIENCE↗

Precision Reconstruction of Rational Conformal Field Theory from Exact Fixed-Point Tensor Network

The novel concept of entanglement renormalization and its corresponding tensor network renormalization technique have been highly successful in developing a controlled real-space renormalization group (RG) scheme. Numerically approximate fixed-point (FP) tensors are widely used to extract the conformal data of the underlying conformal field theory (CFT) describing critical phenomena. In this paper, we present an explicit analytical construction of the FP tensor for 2D rational CFT. We define it as a correlation function between the “boundary-changing operators” (BCO) on triangles. Our construction fully captures all the real-space RG conditions. We also provide concrete examples, such as Ising, Yang-Lee, and tricritical Ising models, to compute the scaling dimensions explicitly based on the corresponding FP tensor. The BCO descendants turn out to be an optimal basis such that truncation in bond dimensions naturally produces comparable accuracies with the leading existing FP algorithms. Interestingly, our construction of FP tensors is closely related to a strange correlator, where the holographic picture naturally emerges. Our results also open a new door toward understanding CFT in higher dimensions. Published by the American Physical Society 2025

Cheng, Gong (ORCID:0009000891587404)↗

Loop series expansions for tensor networks

Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this article, we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of infinite projected entangled pair states, either representing the ground state of an Affleck-Kennedy-Lieb-Tasaki (AKLT) model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude while incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.

Evenbly, Glen [AWS Center for Quantum Computing, P↗

Low-rank Tensor Completion for PMU Data Recovery

This paper proposes a tensor completion method for the recovery of missing phasor measurement unit (PMU) measurements. Tensor completion as the general case of matrix completion has attracted increasing attention in recent years. The imputation accuracy for the existing matrix completion methods may be significantly reduced when there are consecutive data losses across multiple data channels. To tackle this issue, we explore the multi-way characteristics of PMU measurements by using a tensor model. We leverage the low-rank property of the PMU measurements and formulate the missing PMU data recovery problem as a low-rank tensor completion problem. An efficient algorithm based on alternating direction method of multipliers (ADMM) is developed to solve the tensor completion problem. The experiments using the real PMU dataset show that the proposed method exhibits better imputation accuracy compared with the conventional data recovery methods.

Ghasemkhani, Amir↗

On the energy-momentum tensor in Moyal space

We study the properties of the energy-momentum tensor of gauge fields coupled to matter in non-commutative (Moyal) space. In general, the non-commutativity affects the usual conservation law of the tensor as well as its transformation properties (gauge covariance instead of gauge invariance). It is known that the conservation of the energy-momentum tensor can be achieved by a redefinition involving another starproduct. Furthermore, for a pure gauge theory it is always possible to define a gauge invariant energy-momentum tensor by means of a Wilson line. We show that the latter two procedures are incompatible with each other if couplings of gauge fields to matter fields (scalars or fermions) are considered: The gauge invariant tensor (constructed via Wilson line) does not allow for a redefinition assuring its conservation, and vice-versa the introduction of another star-product does not allow for gauge invariance by means of a Wilson line.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Toward Generalized Tensor Algebra for ab initio Quantum Chemistry Methods

The widespread use of tensor operations in describing electronic structure calculations has motivated the design of software frameworks for productive development of scalable optimized tensor-based electronic structure methods. Whereas prior work focused on Cartesian abstractions for dense tensors, we present an algebra to specify and perform tensor operations on a larger class of block-sparse tensors. We illustrate the use of this framework in expressing real-world computational chemistry calculations beyond the reach of existing frameworks.

Mutlu, Erdal↗

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗

Tensor Toolbox for MATLAB v. 3.0

Tensors (also known as multidimensional arrays or N-way arrays) are used in a variety of applications ranging from chemometrics to network analysis. The Tensor Toolbox provides classes for manipulating dense, sparse, and structured tensors using MATLAB's object-oriented features. It also provides algorithms for tensor decomposition and factorization, algorithms for computing tensor eigenvalues, and methods for visualization of results.

Kolda, Tamara↗

Genten: Software for Generalized Tensor Decompositions v. 1.0.0

Tensors, or multidimensional arrays, are a powerful mathematical means of describing multiway data. This software provides computational means for decomposing or approximating a given tensor in terms of smaller tensors of lower dimension, focusing on decomposition of large, sparse tensors. These techniques have applications in many scientific areas, including signal processing, linear algebra, computer vision, numerical analysis, data mining, graph analysis, neuroscience and more. The software is designed to take advantage of parallelism present emerging computer architectures such has multi-core CPUs, many-core accelerators such as the Intel Xeon Phi, and computation-oriented GPUs to enable efficient processing of large tensors.

Phipps, EricT.↗

Moment Tensor Inversion Toolkit

The MTINV toolkit (2002-present) is a collection of computer codes and applications written to invert for the moment tensor of a seismic source given the three components of ground motion recorded at regional seismic stations (e.g., Ichinose et al., 2003). The computer codes and workflow are organized to generate moment tensor solutions for a range of source depths and origin times because of the trade-off between these two quantities. The metric used is the variance reduction and variance reduction modulated by the percent double-couple to determine the best-fit moment-tensor solution. We can solve for a deviatoric moment tensor with a constraint added for no isotropic component although this constraint can be lifted for estimating the full moment tensor like mining collapses or explosion sources.

Ichinose, GeneA↗

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗

Fast tensor disentangling algorithm

Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.

Slagle, Kevin↗

Bound-Preserving Reconstruction of Tensor Quantities for Remap in ALE Fluid Dynamics

We analyze several new and existing approaches for limiting tensor quantities in the context of deviatoric stress remapping in an ALE numerical simulation of elastic flow. Remapping and limiting of the tensor component-by-component is shown to violate radial symmetry of derived variables such as elastic energy or force. Therefore, we have extended the symmetry-preserving Vector Image Polygon algorithm, originally designed for limiting vector variables. This limiter constrains the vector (in our case a vector of independent tensor components) within the convex hull formed by the vectors from surrounding cells – an equivalent of the discrete maximum principle in scalar variables. We compare this method with a limiter designed specifically for deviatoric stress limiting which aims to constrain the J 2 invariant that is proportional to the specific elastic energy and scale the tensor accordingly. We also propose a method which involves remapping and limiting the J 2 invariant independently using known scalar techniques. The deviatoric stress tensor is then scaled to match this remapped invariant, which guarantees conservation in terms of elastic energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Effects of Stochastic Velocity Variations on Estimating Time Dependent Seismic Moment Tensors: Applications to the Blue Mountain Well Perforation Data

Resolving the time dependent terms in the seismic moment tensor provides important information that can be used to interpret the source process of an explosion, including the separation of isotropic explosion terms from shear forces and potentially isolated force couples. In this report, we detail our method of inverting three component seismic data for the seismic moment tensor. We review possible seismic source models from the simplest isotropic explosion type source to those incorporating the six independent moment tensor terms. The inversion we describe is formulated in the frequency domain, and results in estimates of time dependent moment tensor components. The inversion relies on an accurate estimate of the Green's functions of the Earth. However, given the complexity of the Earth, we explore the effects of inaccuracies in the presumed Earth model used to estimate the Green's functions needed for the inversion. Specifically, we explore the effects of stochastic variations in the Earth models on the inversion results. These tests are synthetic throughout, and show that adding stochastic density/velocity heterogeneity in the presumed Earth model results in reduced amplitude seismic moment tensor estimates, as well as degrading the data misfit. We suggest two mitigation strategies. First, produce a suite of Green's functions using different realizations of the stochastic field within the Earth Model. Secondly, perform the in- version in the power spectral domain, eliminating all phase information. Finally, we analyze actual seismic data collected in winter 2017/2018. The seismic data was collected at in active geothermal well site outside of Winnimucca, NV, and was produced during well stimulation operations. In general, the inversion results were poor, with a high degree of data misfit. We hypothesize that the poor results are a function of a poorly constrained Earth model as well as noisy, high-frequency data being used in the inversion.

58 GEOSCIENCES↗

Bayesian inference for the seismic moment tensor using regional waveforms and a data-derived distribution of velocity models

The largest source of uncertainty in any source inversion is the velocity model used to construct the transfer function employed in the forward model that relates observed ground motion to the seismic moment tensor. However, standard inverse procedures often does not quantify uncertainty in the seismic moment tensor due to error in the Green’s functions from uncertain event location and Earth structure. We attempt to incorporate this uncertainty into an estimation of the seismic moment tensor using a distribution of velocity models calculated in a prior effort based on different and complementary data sets. The posterior distribution of velocity models is then used to construct Green’s functions for use in Bayesian inference of an unknown seismic moment tensor using regional waveform data. The combined likelihood is estimated using data-specific error models and the posterior of the seismic moment tensor is estimated and can be interpreted in terms of most-probable source-type.

58 GEOSCIENCES↗

Journey to Time-Variable Moment Tensors through Inversion of Acoustic and Seismoacoustic Data

We explore the capability of acoustic and seismoacoustic datasets to directly resolve a complex, time-variable source consisting of a buried mechanism, represented as a moment tensor, and a spall mechanism, represented as a vertical force at the surface. Traditionally, each component of a resolved moment tensor assumes one underlying source time function, which likely fails to capture the full evolution of a dynamic source, such as an explosion followed by slip on near-source joints or development of spallation. Specifically, we expand previous work to resolve a time-variable moment tensor using single-modality and joint-modality inversion frameworks through analysis of infrasound and seismoacoustic data recorded as part of the Source Physics Experiment Phase II: Dry Alluvium Geology (DAG). We investigate the impact of including signals from seismic-to-air coupling that are local to each infrasound sensor in comparison to mainly atmosphere-propagating acoustic signals, which occur from coupling of the wavefield from the subsurface to the atmosphere directly above the source. Additionally, we assess the ability of our inversion algorithm to fit observed infrasound data using a variety of time-variable source mechanisms. First, we consider the buried moment tensor source alone, which assumes that the determined Green’s functions incorporate effects from spallation or that the impact from spallation is minimal. Second, we examine the estimated buried moment tensor and vertical surface spallation as terms that must both be resolved in the inversion. Third, we assess the ability for an estimated vertical surface spallation source to fit the acoustic data on its own. Finally, we compare results from the joint inversion of both seismic geophone and infrasound acoustic data for the buried-only source compared to buried and spallation sources. Our results are a preliminary investigation into the applications of the inversion technique to recorded datasets and show the technique has limited capabilities using acoustic data alone. Instead, this method shows promise for seismic and seismoacoustic datasets to resolve the time-variable mechanisms of a buried source.

47 OTHER INSTRUMENTATION↗

QuadSync: Quadrifocal tensor synchronization via Tucker decomposition

In structure from motion, quadrifocal tensors capture more information than their pairwise counterparts (essential matrices), yet they have often been thought of as impractical and only of theoretical interest. In this work, we challenge such beliefs by providing a new framework to recover n cameras from the corresponding collection of quadrifocal tensors. We form the block quadrifocal tensor and show that it admits a Tucker decomposition whose factor matrices are the stacked camera matrices, and which thus has a multilinear rank of (4,4,4,4) independent of n. We develop the first synchronization algorithm for quadrifocal tensors, using Tucker decomposition, alternating direction method of multipliers, and iteratively reweighted least squares. We further establish relationships between the block quadrifocal, trifocal, and bifocal tensors, and introduce an algorithm that jointly synchronizes these three entities. Numerical experiments demonstrate the effectiveness of our methods on modern datasets, indicating the potential and importance of using higher-order information in synchronization.

Miao, Daniel [University of Minnesota]↗

Critique of Burnett-Frind dispersion tensor for axisymmetric porous media

This technical note provides a critique of the Burnett and Frind (1987) dispersion tensor for porous media with axial symmetry based on a previous publication by the authors (Lichtner et aI., 2002). In this work a new approach is used based on unit eigenvectors which simplifies the analysis. It is demonstrated that the Burnett-Frind dispersion tensor, although acceptable for small values of the vertical velocity, produces the incorrect behavior for both longitudinal and transverse dispersivity as the flow velocity varies from parallel to perpendicular to the axis of symmetry. A new form of the dispersion tensor is derived for axially symmetric porous media involving four dispersivity coefficients corresponding to longitudinal and transverse dispersion in horizontal and vertical directions, defined as perpendicular and parallel to the axis of symmetry, respectively. This new dispersion tensor corrects two fundamental problems with the dispersion tensor proposed by Burnett and Frind (1987) for axial symmetric media.

97 MATHEMATICS AND COMPUTING↗