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 289 records · Page 16

Hidden symmetries and killing tensors on curved spaces

Higher-order symmetries corresponding to Killing tensors are investigated. The intimate relation between Killing-Yano tensors and nonstandard supersymmetries is pointed out. In the Dirac theory on curved spaces, Killing-Yano tensors generate Dirac-type operators involved in interesting algebraic structures as dynamical algebras or even infinite dimensional algebras or superalgebras. The general results are applied to space-times which appear in modern studies. One presents the infinite dimensional superalgebra of Dirac type operators on the 4-dimensional Euclidean Taub-NUT space that can be seen as a twisted loop algebra. The existence of the conformal Killing-Yano tensors is investigated for some spaces with mixed 3-Sasakian structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor magnetohydrodynamics: Quasi-kinetic description of rarefied plasma

A power-series method for solving the kinetic equation is proposed. A simple procedure for deriving equations for arbitrary moments of the distribution function is described. An analysis of wave propagation in a stationary uniform hot magnetoactive plasma shows that allowance for tensors of ranks up to n and omission of higher rank tensors in the equations of tensor magnetohydrodynamics corresponds to taking into account waves at cyclotron harmonics with numbers up to n inclusive and ignoring higher harmonics. Thus, from the standpoint of accuracy and complexity of plasma description, tensor magnetohydrodynamics occupies an intermediate position between the kinetic approach and the conventional magnetohydrodynamics with a scalar pressure.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Shifted power method for computing tensor eigenpairs.

Recent work on eigenvalues and eigenvectors for tensors of order m {>=} 3 has been motivated by applications in blind source separation, magnetic resonance imaging, molecular conformation, and more. In this paper, we consider methods for computing real symmetric-tensor eigenpairs of the form Ax{sup m-1} = {lambda}x subject to {parallel}x{parallel} = 1, which is closely related to optimal rank-1 approximation of a symmetric tensor. Our contribution is a novel shifted symmetric higher-order power method (SS-HOPM), which we showis guaranteed to converge to a tensor eigenpair. SS-HOPM can be viewed as a generalization of the power iteration method for matrices or of the symmetric higher-order power method. Additionally, using fixed point analysis, we can characterize exactly which eigenpairs can and cannot be found by the method. Numerical examples are presented, including examples from an extension of the method to fnding complex eigenpairs.

97 MATHEMATICS AND COMPUTING↗

An optimization approach for fitting canonical tensor decompositions.

Tensor decompositions are higher-order analogues of matrix decompositions and have proven to be powerful tools for data analysis. In particular, we are interested in the canonical tensor decomposition, otherwise known as the CANDECOMP/PARAFAC decomposition (CPD), which expresses a tensor as the sum of component rank-one tensors and is used in a multitude of applications such as chemometrics, signal processing, neuroscience, and web analysis. The task of computing the CPD, however, can be difficult. The typical approach is based on alternating least squares (ALS) optimization, which can be remarkably fast but is not very accurate. Previously, nonlinear least squares (NLS) methods have also been recommended; existing NLS methods are accurate but slow. In this paper, we propose the use of gradient-based optimization methods. We discuss the mathematical calculation of the derivatives and further show that they can be computed efficiently, at the same cost as one iteration of ALS. Computational experiments demonstrate that the gradient-based optimization methods are much more accurate than ALS and orders of magnitude faster than NLS.

97 MATHEMATICS AND COMPUTING↗

Cross-Feature Transfer Learning for Efficient Tensor Program Generation

Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.

97 MATHEMATICS AND COMPUTING↗

Generalized Canonical Polyadic Tensor Decomposition

Tensor decomposition is a fundamental unsupervised machine learning method in data science, with applications including network analysis and sensor data processing. This work develops a generalized canonical polyadic (GCP) low-rank tensor decomposition that allows other loss functions besides squared error. For instance, we can use logistic loss or Kullback--Leibler divergence, enabling tensor decomposition for binary or count data. We present a variety of statistically motivated loss functions for various scenarios. We provide a generalized framework for computing gradients and handling missing data that enables the use of standard optimization methods for fitting the model. Furthermore, we demonstrate the flexibility of the GCP decomposition on several real-world examples including interactions in a social network, neural activity in a mouse, and monthly rainfall measurements in India.

97 MATHEMATICS AND COMPUTING↗

A nonlinearly preconditioned conjugate gradient algorithm for rank‐ R canonical tensor approximation

Summary Alternating least squares (ALS) is often considered the workhorse algorithm for computing the rank‐ R canonical tensor approximation, but for certain problems, its convergence can be very slow. The nonlinear conjugate gradient (NCG) method was recently proposed as an alternative to ALS, but the results indicated that NCG is usually not faster than ALS. To improve the convergence speed of NCG, we consider a nonlinearly preconditioned NCG (PNCG) algorithm for computing the rank‐ R canonical tensor decomposition. Our approach uses ALS as a nonlinear preconditioner in the NCG algorithm. Alternatively, NCG can be viewed as an acceleration process for ALS. We demonstrate numerically that the convergence acceleration mechanism in PNCG often leads to important pay‐offs for difficult tensor decomposition problems, with convergence that is significantly faster and more robust than for the stand‐alone NCG or ALS algorithms. We consider several approaches for incorporating the nonlinear preconditioner into the NCG algorithm that have been described in the literature previously and have met with success in certain application areas. However, it appears that the nonlinearly PNCG approach has received relatively little attention in the broader community and remains underexplored both theoretically and experimentally. Thus, this paper serves several additional functions, by providing in one place a concise overview of several PNCG variants and their properties that have only been described in a few places scattered throughout the literature, by systematically comparing the performance of these PNCG variants for the tensor decomposition problem, and by drawing further attention to the usefulness of nonlinearly PNCG as a general tool. In addition, we briefly discuss the convergence of the PNCG algorithm. In particular, we obtain a new convergence result for one of the PNCG variants under suitable conditions, building on known convergence results for non‐preconditioned NCG. Copyright © 2014 John Wiley & Sons, Ltd.

Sterck, Hans De↗

Supersymmetric Landau-Ginzburg tensor models

We study two dimensional N = (2, 2) Landau-Ginzburg models with tensor valued superfields with the aim of constructing large central charge superconformal field theories which are solvable using large N techniques. We demonstrate the viability of such constructions and motivate the study of anisotropic tensor models. Such theories are a novel deformation of tensor models where we break the continuous symmetries while preserving the large N solvability. Specifically, we examine theories with superpotentials involving tensor contractions chosen to pick out melonic diagrams. The anisotropy is introduced by further biasing individual terms by different coefficients, all of the same order, to retain large N scaling. We carry out a detailed analysis of the resulting low energy fixed point and comment on potential applications to holography. Along the way we also examine gauged versions of the models (with partial anisotropy) and find generically that such theories have a non-compact Higgs branch of vacua.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Random Tensor Networks with Non-trivial Links

Abstract Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that a better model consists of random tensor networks with link states that are not maximally entangled, i.e., have non-trivial spectra. In this work, we initiate a systematic study of the entanglement properties of these networks. We employ tools from free probability, random matrix theory, and one-shot quantum information theory to study random tensor networks with bounded and unbounded variation in link spectra, and in cases where a subsystem has one or multiple minimal cuts. If the link states have bounded spectral variation, the limiting entanglement spectrum of a subsystem with two minimal cuts can be expressed as a free product of the entanglement spectra of each cut, along with a Marchenko–Pastur distribution. For a class of states with unbounded spectral variation, analogous to semiclassical states in quantum gravity, we relate the limiting entanglement spectrum of a subsystem with two minimal cuts to the distribution of the minimal entanglement across the two cuts. In doing so, we draw connections to previous work on split transfer protocols, entanglement negativity in random tensor networks, and Euclidean path integrals in quantum gravity.

Physics↗

A model for soft high-energy scattering: Tensor pomeron and vector odderon

A model for soft high-energy scattering is developed. The model is formulated in terms of effective propagators and vertices for the exchange objects: the pomeron, the odderon, and the reggeons. The vertices are required to respect standard rules of QFT. The propagators are constructed taking into account the crossing properties of amplitudes in QFT and the power-law ansätze from the Regge model. We propose to describe the pomeron as an effective spin 2 exchange. This tensor pomeron gives, at high energies, the same results for the pp and pp{sup -bar} elastic amplitudes as the standard Donnachie–Landshoff pomeron. But with our tensor pomeron it is much more natural to write down effective vertices of all kinds which respect the rules of QFT. This is particularly clear for the coupling of the pomeron to particles carrying spin, for instance vector mesons. We describe the odderon as an effective vector exchange. We emphasise that with a tensor pomeron and a vector odderon the corresponding charge-conjugation relations are automatically fulfilled. We compare the model to some experimental data, in particular to data for the total cross sections, in order to determine the model parameters. The model should provide a starting point for a general framework for describing soft high-energy reactions. It should give to experimentalists an easily manageable tool for calculating amplitudes for such reactions and for obtaining predictions which can be compared in detail with data. -- Highlights: •A general model for soft high-energy hadron scattering is developed. •The pomeron is described as effective tensor exchange. •Explicit expressions for effective reggeon–particle vertices are given. •Reggeon–particle and particle–particle vertices are related. •All vertices respect the standard C parity and crossing rules of QFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A pseudospectral matrix method for time-dependent tensor fields on a spherical shell

We construct a pseudospectral method for the solution of time-dependent, non-linear partial differential equations on a three-dimensional spherical shell. The problem we address is the treatment of tensor fields on the sphere. As a test case we consider the evolution of a single black hole in numerical general relativity. A natural strategy would be the expansion in tensor spherical harmonics in spherical coordinates. Instead, we consider the simpler and potentially more efficient possibility of a double Fourier expansion on the sphere for tensors in Cartesian coordinates. As usual for the double Fourier method, we employ a filter to address time-step limitations and certain stability issues. We find that a tensor filter based on spin-weighted spherical harmonics is successful, while two simplified, non-spin-weighted filters do not lead to stable evolutions. The derivatives and the filter are implemented by matrix multiplication for efficiency. A key technical point is the construction of a matrix multiplication method for the spin-weighted spherical harmonic filter. As example for the efficient parallelization of the double Fourier, spin-weighted filter method we discuss an implementation on a GPU, which achieves a speed-up of up to a factor of 20 compared to a single core CPU implementation.

97 MATHEMATICS AND COMPUTING↗

Determination of the relative orientation between 15 N- 1 H dipolar coupling and 1 H chemical shift anisotropy tensors under fast MAS solid-state NMR

Here, in this work, we have proposed a proton-detected three-dimensional (3D) 15 N- 1 H dipolar coupling (DIP)/ 1 H chemical shift anisotropy (CSA)/ 1 H chemical shift (CS) correlation experiment to measure the relative orientation between the 15 N- 1 H dipolar coupling and the 1 H CSA tensors under fast magic angle spinning (MAS) solid-state NMR. In the 3D correlation experiment, the 15 N- 1 H dipolar coupling and 1 H CSA tensors are recoupled using our recently developed windowless C-symmetry-based $C3^{1}_{3}$-ROCSA (recoupling of chemical shift anisotropy) DIPSHIFT and $C3^{1}_{3}$-ROCSA pulse-based methods, respectively. The 2D 15 N- 1 H DIP/ 1 H CSA powder lineshapes extracted using the proposed 3D correlation method are shown to be sensitive to the sign and asymmetry of the 1 H CSA tensor, a feature that allows the determination of the relative orientation between the two correlating tensors with improved accuracy. The experimental method developed in this study is demonstrated on a powdered U- 15 N L-Histidine.HCl·H 2 O sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The energy-momentum tensor(s) in classical gauge theories

We give an introduction to, and review of, the energy-momentum tensors in classical gauge field theories in Minkowski space, and to some extent also in curved space-time. For the canonical energy-momentum tensor of non-Abelian gauge fields and of matter fields coupled to such fields, we present a new and simple improvement procedure based on gauge invariance for constructing a gauge invariant, symmetric energy-momentum tensor. In conclusion, the relationship with the Einstein-Hilbert tensor following from the coupling to a gravitational field is also discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Tensor Hypercontraction of Cluster Perturbation Theory: Quartic Scaling Perturbation Series for the Coupled Cluster Singles and Doubles Ground-State Energies

Even though Cluster Perturbation has been shown to be a robust non-iterative alternative to Coupled Cluster Theory, it is still plagued by high order polynomial computational scaling and the storage of higher order tensors. Here we present a proof-of-concept strategy for implementing Cluster Perturbation Theory ground state energy series for the coupled cluster singles and doubles energy with N 4 computational scaling using Tensor Hypercontraction (THC). The reduction in computational scaling by two orders is achieved by decomposing two electron repulsion integrals, doubles amplitudes and multipliers, as well as selected doubles intermediates to Tensor Hypercontraction format. Using the outlined strategy, we showcase that the Tensor Hypercontraction pilot implementations retain numerical accuracy to within 1 kcal/mol relative to corresponding conventional and density fitting implementations and we empirically verify the N 4 scaling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A General Sparse Tensor Framework for Electronic Structure Theory

Linear-scaling algorithms must be developed in order to extend the domain of applicability of electronic structure theory to molecules of any desired size. But, the increasing complexity of modern linear-scaling methods makes code development and maintenance a significant challenge. A major contributor to this difficulty is the lack of robust software abstractions for handling block-sparse tensor operations. We therefore report the development of a highly efficient symbolic block-sparse tensor library in order to provide access to high-level software constructs to treat such problems. Our implementation supports arbitrary multi-dimensional sparsity in all input and output tensors. We then avoid cumbersome machine-generated code by implementing all functionality as a high-level symbolic C++ language library and demonstrate that our implementation attains very high performance for linear-scaling sparse tensor contractions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

E(n)-Equivariant cartesian tensor message passing interatomic potential

Machine learning potential (MLP) has been a popular topic in recent years for its capability to replace expensive first-principles calculations in some large systems. Meanwhile, message passing networks have gained significant attention due to their remarkable accuracy, and a wave of message passing networks based on Cartesian coordinates has emerged. However, the information of the node in these models is usually limited to scalars, and vectors. In this work, we propose High-order Tensor message Passing interatomic Potential (HotPP), an E(n) equivariant message passing neural network that extends the node embedding and message to an arbitrary order tensor. By performing some basic equivariant operations, high order tensors can be coupled very simply and thus the model can make direct predictions of high-order tensors such as dipole moments and polarizabilities without any modifications. The tests in several datasets show that HotPP not only achieves high accuracy in predicting target properties, but also successfully performs tasks such as calculating phonon spectra, infrared spectra, and Raman spectra, demonstrating its potential as a tool for future research.

97 MATHEMATICS AND COMPUTING↗

Tensor products of U{sub q}{sup Prime }sl-caret(2)-modules and the big q{sup 2}-Jacobi function transform

Four tensor products of evaluation modules of the quantum affine algebra U{sub q}{sup Prime }sl-caret(2) obtained from the negative and positive series, the complementary and the strange series representations are investigated. Linear operators R(z) satisfying the intertwining property on finite linear combinations of the canonical basis elements of the tensor products are described in terms of two sets of infinite sums {l_brace}{tau}{sup (r,t)}{r_brace}{sub r,t Element-Of Z{sub {>=}{sub 0}}} and {l_brace}{tau}{sup (r,t)}{r_brace}{sub r,t Element-Of Z{sub {>=}{sub 0}}} involving big q{sup 2}-Jacobi functions or related nonterminating basic hypergeometric series. Inhomogeneous recurrence relations can be derived for both sets. Evaluations of the simplest sums provide the corresponding initial conditions. For the first set of sums the relations entail a big q{sup 2}-Jacobi function transform pair. An integral decomposition is obtained for the sum {tau}{sup (r,t)}. A partial description of the relation between the decompositions of the tensor products with respect to U{sub q}sl(2) or with respect to its complement in U{sub q}{sup Prime }sl-caret(2) can be formulated in terms of Askey-Wilson function transforms. For a particular combination of two tensor products, the occurrence of proper U{sub q}{sup Prime }sl-caret(2)-submodules is discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparsity of the electron repulsion integral tensor using different localized virtual orbital representations in local second-order Møller–Plesset theory

Utilizing localized orbitals, local correlation theory can reduce the unphysically high system-size scaling of post-Hartree–Fock (post-HF) methods to linear scaling in insulating molecules. The sparsity of the four-index electron repulsion integral (ERI) tensor is central to achieving this reduction. For second-order Møller–Plesset theory (MP2), one of the simplest post-HF methods, only the (ia|jb) ERIs are needed, coupling occupied orbitals i, j and virtuals a, b. In this paper, we compare the numerical sparsity (called the “ragged list”) and two other approaches revealing the low-rank sparsity of the ERI. The ragged list requires only one set of (localized) virtual orbitals, and we find that the orthogonal valence virtual-hard virtual set of virtuals originally proposed by Subotnik et al. gives the sparsest ERI tensor. To further compress the ERI tensor, the pair natural orbital (PNO) type representation uses different sets of virtual orbitals for different occupied orbital pairs, while the occupied-specific virtual (OSV) approach uses different virtuals for each occupied orbital. Here, our results indicate that while the low-rank PNO representation achieves significant rank reduction, it also requires more memory than the ragged list. The OSV approach requires similar memory to that of the ragged list, but it involves greater algorithmic complexity. An approximation (called the “fixed sparsity pattern”) for solving the local MP2 equations using the numerically sparse ERI tensor is proposed and tested to be sufficiently accurate and to have highly controllable error. A low-scaling local MP2 algorithm based on the ragged list and the fixed sparsity pattern is therefore promising.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗