Search NASA⌕ Search

SEARCH · Search NASA

Results for “TENSOR ANALYSIS”

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 109 records · Page 6

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↗

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↗

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗

The tensor t‐function: A definition for functions of third‐order tensors

Summary A definition for functions of multidimensional arrays is presented. The definition is valid for third‐order tensors in the tensor t‐product formalism, which regards third‐order tensors as block circulant matrices. The tensor function definition is shown to have similar properties as standard matrix function definitions in fundamental scenarios. To demonstrate the definition's potential in applications, the notion of network communicability is generalized to third‐order tensors and computed for a small‐scale example via block Krylov subspace methods for matrix functions. A complexity analysis for these methods in the context of tensors is also provided.

Lund, Kathryn↗

Failure analysis for composite laminates

A discussion of the tensor polynomial failure criterion is presented together with a description of a biaxial compression test procedure used in the evaluation of the interaction strength parameters. In addition, a formulation for predicting the fatigue life of laminates is given based on the experimental evaluation of fatigue functions which are also utilized in a form of the tensor polynomial failure criterion as well. Experimental results are provided to compare with the fatigue life predictions and to demonstrate the effect of flaws and environment. Both bond-line defects in sandwich beam construction and inter-laminar disbond flaws are studied. Up to present, compressive strength test data have been obtained for ambient and elevated temperature, moisture-saturated conditions, including results from thermal-spike cycling simulating supersonic flight.

Tennyson, R. C.↗

Unraveling the Wrinkle in Time-Variable Sources with Lunes and Synthetic Seismic Data

In this report, we describe how to estimate the time-variable components of the seismic moment tensor and compare these estimates to the more conventional analysis that incorporates an assumption of the source time function (STF) across all components of the seismic moment tensor. The advantage of our method is that we are able to independently estimate the time-evolution of each component of the seismic moment tensor, which may help to resolve the complex source phenomena associated with buried explosions. By performing an eigen decomposition of the time-evolving seismic moment tensor components, we are able to plot the seismic mechanism as a trajectory on a lune diagram. This technique enables interpretation of the seismic mechanism as a function of time, as opposed to the more conventional analysis which assumes that the seismic mechanism is time invariant. Finally, we describe the differences between the seismic moment and the seismic moment rate STFs, how to implement each one in inversion schemes, and the relative strengths/weaknesses of each. Our key take-away is that we are able to distinguish nearly-overlapping sources with highly different mechanisms, such as an explosion immediately following an earthquake, by estimating moment rate from seismic data through a STF-invariant inversion for the full time-variable moment tensor.

58 GEOSCIENCES↗

Conditions for the validity of unmagnetized-plasma theory in describing weakly magnetized plasmas

The application of the unmagnetized-plasma theory to the derivation of the expression for the dielectric tensor for weakly magnetized plasmas is examined. The analysis of Baldwin et. al. (1969) is employed to determine the conditions under which the magnetic effects on the dielectric tensor of a plasma are small. The relation between wave and plasma parameters and the plasma distribution function is studied. Axisymmetric distribution functions in magnetized plasma are considered. The derived conditions are analyzed in terms of resonance ellipses of the cyclotron maser theory. Examples are presented in which the conditions are applied to a nonrelativistic Maxwellian distribution and the dispersion and instability of Langmuir and Bernstein waves in weakly magnetized plasma. The data reveal that the conditions under which the magnetic field can be completely neglected depend on the forms of the distribution function.

Robinson, P. A.↗

Poisson-response Tensor-on-Tensor Regression and Applications

We introduce Poisson-response tensor-on-tensor regression (PToTR), a novel regression framework designed to handle tensor responses composed element-wise of random Poisson-distributed counts. Tensors, or multi-dimensional arrays, composed of counts are common data in fields such as inter national relations, social networks, epidemiology, and medical imaging, where events occur across multiple dimensions like time, location, and dyads. PToTR accommodates such tensor responses alongside tensor covariates, providing a versatile tool for multi dimensional data analysis. We propose algorithms for maximum likelihood estimation under a canonical polyadic (CP) structure on the regression coefficient tensor that satisfy the positivity of Poisson parameters and then provide an initial theoretical error analysis for PToTR estimators. We also demonstrate the utility of PToTR through three concrete applications: longitudinal data analysis of the Integrated Crisis Early Warning System database, positron emission tomography (PET) image reconstruction, and change-point detection of communication patterns in longitudinal dyadic data. These applications highlight the versatility of PToTR in addressing complex, structured count data across various domains.

97 MATHEMATICS AND COMPUTING↗

Stochastic Gradients for Large-Scale Tensor Decomposition

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Linear magnetic susceptibility of anisotropic superconductors of cuboidal shape

In this study, a simplified model of anisotropic magnetic susceptibility in the Meissner–London vortex-free state of cuboidal superconducting samples is presented. Using this model, precision measurements of the magnetic response in three perpendicular directions of a magnetic field with respect to primary crystal axes can be used to extract the components of the London penetration depth, thus enabling the evaluation of the general superfluid density tensor, which is needed in the analysis of the superconducting gap structure.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Exponential acceleration of macroscopic quantum tunneling in a Floquet Ising model

The exponential suppression of macroscopic quantum tunneling (MQT) in the number of elements to be reconfigured is an essential element of broken symmetry phases. This suppression is also a core bottleneck in quantum algorithms, such as traversing an energy landscape in optimization, and adiabatic state preparation more generally. In this work, we demonstrate exponential acceleration of MQT through Floquet engineering with the application of a uniform, high frequency transverse drive field. Using the ferromagnetic phase of the transverse field Ising model in one and two dimensions as a prototypical example, we identify three phenomenological regimes as a function of drive strength. For weak drives, the system exhibits exponentially decaying tunneling rates but robust magnetic order; in the crossover regime at intermediate drive strength, we find polynomial decay of tunnelling alongside vanishing magnetic order; and at very strong drive strengths both the Rabi frequency and time-averaged magnetic order are approximately constant with increasing system size. We support these claims with extensive full wavefunction and tensor network numerical simulations, and theoretical analysis. An experimental test of these results presents a technologically important and novel scientific question accessible on NISQ-era quantum computers.

Grattan, George↗

Virial theorem analysis of the structure and stability of magnetized clouds

The tensor virial theorem is used to analyze the structure and stability of self-gravitating, magnetized spheroids surrounded by a low-density medium with pressure and magnetic field. Analytical expressions are developed for the effect of a weak field and calculate critical states when the effect of the field is arbitrarily strong, comparing the results with full magnetohydrostatic calculations. This analysis suggests that a magnetic field may prevent gravitational collapse but may also be destabilizing, depending on its degree of concentration within the cloud.

Zweibel, Ellen G.↗

Virial theorem analysis of the structure and stability of magnetized clouds

The tensor virial theorem is used to analyze the structure and stability of self-gravitating, magnetized spheroids surrounded by a low-density medium with pressure and magnetic field. Analytical expressions are developed for the effect of a weak field and calculate critical states when the effect of the field is arbitrarily strong, comparing the results with full magnetohydrostatic calculations. This analysis suggests that a magnetic field may prevent gravitational collapse but may also be destabilizing, depending on its degree of concentration within the cloud.

Zweibel, Ellen G.↗

Scalar and tensor resonances in $J/\psi $ radiative decays

We perform a systematic analysis of the J/ψ → γπ 0 π 0 and → γ$K$$^{0}_{S}$$K$$^{0}_{S}$ partial waves measured by BESIII. We use a large set of amplitude parametrizations to reduce the model bias. We determine the physical properties of seven scalar and tensor resonances in the 1–2.5GeV mass range. These include the well known f 0 (1500) and f 0 (1710), that are considered to be the primary glueball candidates. The hierarchy of resonance couplings determined from this analysis favors the latter as the one with the largest glueball component.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

New constraints on cosmological modified gravity theories from anisotropic three-point correlation functions of BOSS DR12 galaxies

Here we report a new test of modified gravity theories using the large-scale structure of the Universe. This paper is the first attempt to (1) apply a joint analysis of the anisotropic components of galaxy two- and three-point correlation functions (2 and 3PCFs) to actual galaxy data and (2) constrain the non-linear effects of degenerate higher-order scalar-tensor (DHOST) theories on cosmological scales. Applying this analysis to the Baryon Oscillation Spectroscopic Survey (BOSS) data release 12, we obtain the lower bounds of –1.655 < ξ t and –0.504 < ξ s at the $95{{\ \rm per\ cent}}$ confidence level on the parameters characterizing the time evolution of the tidal and shift terms of the second-order velocity field. These constraints are consistent with GR predictions of ξ t = 15/1144 and ξs = 0. Moreover, they represent a 35-fold and 20-fold improvement, respectively, over the joint analysis with only the isotropic 3PCF. We ensure the validity of our results by investigating various quantities, including theoretical models of the 3PCF, window function corrections, cumulative S/N, Fisher matrices, and statistical scattering effects of mock simulation data. We also find statistically significant discrepancies between the BOSS data and the Patchy mocks for the 3PCF measurement. Finally, we package all of our 3PCF analysis codes under the name hitomi and make them publicly available so that readers can reproduce all the results of this paper and easily apply them to ongoing future galaxy surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

Tensor Fields for Use in Fractional-Order Viscoelasticity

To be able to construct viscoelastic material models from fractional0order differentegral equations that are applicable for 3D finite-strain analysis requires definitions for fractional derivatives and integrals for symmetric tensor fields, like stress and strain. We define these fields in the body manifold. We then map them ito spatial fields expressed in terms of an Eulerian or Lagrangian reference frame where most analysts prefer to solve boundary problems.

Freed, Alan D.↗

Tensor Text-Mining Methods for Malware Identification and Detection, Malware Dynamics Characterization, and Hosts Ranking

Malware is one of the most persistent and costly cyber threats endangering reputation, confidentiality, integrity, and availability for organizations and national security. Consequently, many of the incident detection and prevention systems, and incident responders have begun to utilize machine learning as a helper in the fight against malware and other cyber threats. However, cyber defenders rely on interpretability and generalizability, yet the popular machine learning methods are black-box and often use traditional supervised solutions that do not generalize to novel malware. Therefore, there is a need to improve the existing solutions. At the same time, the majority of the prior research ignored essential evaluation criteria when reporting the results of their methods, which disables the safe reproducibility of the methods in a production environment. Tensor decomposition, on the other hand, enables interpretable unsupervised analysis of the large-scale data for the discovery of hidden patterns. Our findings, performed on real-world and large-scale experiments, show that tensor factorization-based methods yield performance results that surpasses or competes with existing supervised solutions with the added benefit of interpretability and generalizability. With the ability to analyze complex and large-scale data using tensors, we report results that reflect real-world production environments. We propose to develop new game- changing tools for malware identification and characterization that can trace malware evolution, rank the infected or malicious hosts, and streamline the work of incident response teams, malware analysts, and incident detection and prevention systems.

97 MATHEMATICS AND COMPUTING↗