Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensors”

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 73 records · Page 4

An objective method for determining the generalized transport tensor for two-dimensional Eulerian models

An objective method for deriving the components of a generalized transport tensor for a two-dimensional model is presented. Representative meridional and vertical velocities and thermodynamic scalars at a uniform grid are used to reduce the problem to the solution of two flux equations for two unknowns. One unknown is the stream-function, coefficient of an antisymmetric tensor, which corrects the Eulerian mean motions for Stokes drift; the other is a time constant, which converts the deviatory velocity tensor to a symmetric transport tensor. The complete asymmetric tensor, called a transport tensor, has a divergence which yields both advection and diffusion by the deviatory velocities. Advantages and disadvantages of Lagrangian and Eulerian averages are discussed, and meridional-vertical velocity correlations are provided.

Danielsen, E. F.↗

Turbulent fluid motion 2: Scalars, vectors, and tensors

The author shows that the sum or difference of two vectors is a vector. Similarly the sum of any two tensors of the same order is a tensor of that order. No meaning is attached to the sum of tensors of different orders, say u(sub i) + u(sub ij); that is not a tensor. In general, an equation containing tensors has meaning only if all the terms in the equation are tensors of the same order, and if the same unrepeated subscripts appear in all the terms. These facts will be used in obtaining appropriate equations for fluid turbulence. With the foregoing background, the derivation of appropriate continuum equations for turbulence should be straightforward.

Deissler, Robert G.↗

Visualization of 3-D tensor fields

Second-order tensor fields have applications in many different areas of physics, such as general relativity and fluid mechanics. The wealth of multivariate information in tensor fields makes them more complex and abstract than scalar and vector fields. Visualization is a good technique for scientists to gain new insights from them. Visualizing a 3-D continuous tensor field is equivalent to simultaneously visualizing its three eigenvector fields. In the past, research has been conducted in the area of two-dimensional tensor fields. It was shown that degenerate points, defined as points where eigenvalues are equal to each other, are the basic singularities underlying the topology of tensor fields. Moreover, it was shown that eigenvectors never cross each other except at degenerate points. Since we live in a three-dimensional world, it is important for us to understand the underlying physics of this world. In this report, we describe a new method for locating degenerate points along with the conditions for classifying them in three-dimensional space. Finally, we discuss some topological features of three-dimensional tensor fields, and interpret topological patterns in terms of physical properties.

Hesselink, L.↗

An Introduction to Tensors for Students of Physics and Engineering

Tensor analysis is the type of subject that can make even the best of students shudder. My own post-graduate instructor in the subject took away much of the fear by speaking of an implicit rhythm in the peculiar notation traditionally used, and helped us to see how this rhythm plays its way throughout the various formalisms. Prior to taking that class, I had spent many years "playing" on my own with tensors. I found the going to be tremendously difficult but was able, over time, to back out some physical and geometrical considerations that helped to make the subject a little more transparent. Today, it is sometimes hard not to think in terms of tensors and their associated concepts. This article, prompted and greatly enhanced by Marlos Jacob, whom I've met only by e-mail, is an attempt to record those early notions concerning tensors. It is intended to serve as a bridge from the point where most undergraduate students "leave off" in their studies of mathematics to the place where most texts on tensor analysis begin. A basic knowledge of vectors, matrices, and physics is assumed. A semi-intuitive approach to those notions underlying tensor analysis is given via scalars, vectors, dyads, triads, and higher vector products. The reader must be prepared to do some mathematics and to think. For those students who wish to go beyond this humble start, I can only recommend my professor's wisdom: find the rhythm in the mathematics and you will fare pretty well.

Kolecki, Joseph C.↗

Elliptically-Contoured Tensor-variate Distributions with Application to Image Learning

Statistical analysis of tensor-valued data has largely used the tensor-variate normal (TVN) distribution that may be inadequate for data arising from distributions with heavier or lighter tails. We study a general family of elliptically contoured (EC) TV distributions and derive its characterizations, moments, marginal, and conditional distributions. We describe procedures for maximum likelihood estimation from data that are (1) uncorrelated draws from an EC distribution, (2) from a scale mixture of the TVN distribution, and (3) from an underlying but unknown EC distribution, for which we extend Tyler’s robust estimator. A detailed simulation study highlights the benefits of choosing an EC distribution over the TVN for heavier-tailed data. We develop TV classification rules using discriminant analysis and EC errors and show that they better predict cats and dogs from images in the Animal Faces-HQ dataset than the TVN-based rules. A novel tensor-on-tensor regression and TV analysis of variance (TANOVA) framework under EC errors is also demonstrated to better characterize gender, age, and ethnic origin than the usual TVN-based TANOVA in the celebrated labeled faces of the wild dataset.

97 MATHEMATICS AND COMPUTING↗

TTDFT: A GPU accelerated Tucker tensor DFT code for large-scale Kohn-Sham DFT calculations

We present the Tucker tensor DFT (TTDFT) code which uses a tensor-structured algorithm with graphic processing unit (GPU) acceleration for conducting ground-state DFT calculations on large-scale systems. The Tucker tensor DFT algorithm uses a localized Tucker tensor basis computed from an additive separable approximation to the Kohn-Sham Hamiltonian. The discrete Kohn-Sham problem is solved using Chebyshev filtered subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. In conclusion, the computational performance of the TTDFT code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms.

97 MATHEMATICS AND COMPUTING↗

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↗

Tree tensor network hierarchical equations of motion based on time-dependent variational principle for efficient open quantum dynamics in structured thermal environments

In this work, we introduce an efficient method, TTN-HEOM, for exactly calculating the open quantum dynamics for driven quantum systems interacting with highly structured bosonic baths by combining the tree tensor network (TTN) decomposition scheme with the bexcitonic generalization of the numerically exact hierarchical equations of motion (HEOM). The method yields a series of quantum master equations for all core tensors in the TTN that efficiently and accurately capture the open quantum dynamics for non-Markovian environments to all orders in the system–bath interaction. These master equations are constructed based on the time-dependent Dirac–Frenkel variational principle, which isolates the optimal dynamics for the core tensors given the TTN ansatz. The dynamics converges to the HEOM when increasing the rank of the core tensors, a limit in which the TTN ansatz becomes exact. We introduce TENSO, tensor equations for non-Markovian structured open systems, as a general-purpose Python code to propagate the TTN-HEOM dynamics. We implement three general propagators for the coupled master equations: two fixed-rank methods that require a constant memory footprint during the dynamics and one adaptive-rank method with a variable memory footprint controlled by the target level of computational error. We exemplify the utility of these methods by simulating a two-level system coupled to a structured bath containing one Drude–Lorentz component and eight Brownian oscillators, which is beyond what can presently be computed using the standard HEOM. Our results show that the TTN-HEOM is capable of simulating both dephasing and relaxation dynamics of driven quantum systems interacting with structured baths, even those of chemical complexity, with an affordable computational cost.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Neuralized fermionic tensor networks for quantum many-body systems

In this work, we describe a class of neuralized fermionic tensor network states (NN-fTNSs) that introduce nonlinearity into fermionic tensor networks through configuration-dependent neural network transformations of the local tensors. The construction uses the fTNS algebra to implement a natural fermionic sign structure and is compatible with standard tensor network algorithms but gains enhanced expressivity through the neural network parametrization. Using the 1D and 2D Fermi-Hubbard models as benchmarks, we demonstrate that NN-fTNSs achieve order of magnitude improvements in the ground-state energy compared to pure fTNSs with the same bond dimension and can be systematically improved through both the tensor network bond dimension and the neural network parametrization. Compared to existing fermionic neural quantum states based on Slater determinants and Pfaffians, NN-fTNSs offer a physically motivated alternative fermionic structure. Furthermore, compared to such states, NN-fTNSs naturally exhibit improved computational scaling and we demonstrate a construction that achieves linear scaling with the lattice size.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Computing Sparse Tensor Decompositions via Chapel and C++/MPI Interoperability without Intermediate I/O

We extend an existing approach for efficient use of shared mapped memory across Chapel and C++ for graph data stored as 1-D arrays to sparse tensor data stored using a combination of 2-D and 1-D arrays. We describe the specific extensions that provide use of shared mapped memory tensor data for a particular C++ tensor decomposition tool called GentenMPI. We then demonstrate our approach on several real-world datasets, providing timing results that illustrate minimal overhead incurred using this approach. Finally, we extend our work to improve memory usage and provide convenient random access to sparse shared mapped memory tensor elements in Chapel, while still being capable of leveraging high performance implementations of tensor algorithms in C++.

97 MATHEMATICS AND COMPUTING↗

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗

A Local Macroscopic Conservative (LoMaC) Low Rank Tensor Method for the Vlasov Dynamics

Abstract In this paper, we propose a novel Local Macroscopic Conservative (LoMaC) low rank tensor method for simulating the Vlasov-Poisson (VP) system. The LoMaC property refers to the exact local conservation of macroscopic mass, momentum and energy at the discrete level. This is a follow-up work of our previous development of a conservative low rank tensor approach for Vlasov dynamics ( arXiv:2201.10397 ). In that work, we applied a low rank tensor method with a conservative singular value decomposition to the high dimensional VP system to mitigate the curse of dimensionality, while maintaining the local conservation of mass and momentum. However, energy conservation is not guaranteed, which is a critical property to avoid unphysical plasma self-heating or cooling. The new ingredient in the LoMaC low rank tensor algorithm is that we simultaneously evolve the macroscopic conservation laws of mass, momentum and energy using a flux-difference form with kinetic flux vector splitting; then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables by a conservative orthogonal projection. The algorithm is extended to the high dimensional problems by hierarchical Tuck decomposition of solution tensors and a corresponding conservative projection algorithm. Extensive numerical tests on the VP system are showcased for the algorithm’s efficacy.

Guo, Wei↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

Robust Tensor Hypercontraction of the Particle–Particle Ladder Term in Equation-of-Motion Coupled Cluster Theory

One method of representing a high-rank tensor as a (hyper-)product of lower-rank tensors is the tensor hypercontraction (THC) method of Hohenstein et al. This strategy has been found to be useful for reducing the polynomial scaling of coupled-cluster methods by representation of a four-dimensional tensor of electron-repulsion integrals in terms of five two-dimensional matrices. Pierce et al. have already shown that the application of a robust form of THC to the particle–particle ladder (PPL) term reduces the cost of this term in couple-cluster singles and doubles (CCSD) from O(N 6 ) to O(N 5 ) with negligible errors in energy with respect to the density-fitted variant. In this work, we have implemented the least-squares variant of THC (LS-THC) which does not require a nonlinear tensor factorization, including the robust form (R-LS-THC), for the calculation of the excitation and electron attachment energies using equation-of-motion coupled cluster methods EOMEE-CCSD and EOMEA-CCSD, respectively. We have benchmarked the effect of the R-LS-THC-PPL approximation on excitation energies using the comprehensive QUEST database and the accuracy of electron attachment energies using the NAB22 database. Here, we find that errors on the order of 1 meV are achievable with a reduction in total calculation time of approximately 5x.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantifying the dislocation content of atomically resolved grain boundary line defects using the Nye tensor

The Nye tensor, which quantifies the density of Burgers vector for a given dislocation line direction, can be effectively used to characterize dislocation content in bulk crystals from atomic-resolution transmission electron microscopy images. The Nye tensor can be calculated from these images, in part because the reference state is simply defined by the lattice of the perfect crystal. The application of the Nye tensor to interfacial line defects, for which the natural reference state is the dichromatic pattern of the two grains in their reference orientation, poses additional challenges. In this work, we present a method that employs the Nye tensor to characterize the edge dislocation content of line defects at grain boundaries from atomic-resolution images. This approach enables us to rapidly characterize all edge dislocation content along a grain boundary. Additionally, the Nye tensor provides information about line defect core structure. Finally, we demonstrate this method on two exemplar defects: a twin boundary disconnection and a facet junction in face-centered cubic Au.

Crystallographic defects↗

Monomer-dimer tensor-network basis for qubit-regularized lattice gauge theories

Traditional SU⁡(𝑁) lattice gauge theories (LGTs) can be formulated using an orthonormal basis constructed from the irreducible representations (irreps) 𝑉 𝜆 of the SU⁡(𝑁) gauge symmetry. On a lattice, the elements of this basis are tensor networks comprising dimer tensors on the links labeled by a set of irreps {𝜆 ℓ } and monomer tensors on sites labeled by {𝜆 𝑠 }. These tensors naturally define a local site Hilbert space, ℋ$^𝑔_𝑠$, on which gauge transformations act. Gauss’s law introduces an additional index 𝛼 𝑠 =1,2,…,𝒟⁡(ℋ$^𝑔_𝑠$) that labels an orthonormal basis of the gauge-invariant subspace of ℋ$^𝑔_𝑠$. This monomer-dimer tensor-network (MDTN) basis, |{𝜆 𝑠 },{𝜆 ℓ },{𝛼 𝑠 }⟩, of the physical Hilbert space enables the construction of new qubit-regularized SU⁡(𝑁) gauge theories that are free of sign problems while preserving key features of traditional LGTs. Here, we investigate finite-temperature confinement-deconfinement transitions in a simple qubit-regularized SU(2) and SU(3) gauge theory in 𝑑 =2 and 𝑑 =3 spatial dimensions, formulated using the MDTN basis, and show that they reproduce the universal results of traditional LGTs at these transitions. Additionally, in 𝑑 =1, we demonstrate using a plaquette chain that the string tension at zero temperature can be continuously tuned to zero by adjusting a model parameter that plays the role of the gauge coupling in traditional LGTs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Gauge-symmetrization method for energy-momentum tensors in high-order electromagnetic field theories

For electromagnetic field theories, canonical energy-momentum conservation laws can be derived from the underpinning spacetime translation symmetry according to the Noether procedure. However, the canonical energy-momentum tensors (EMTs) are neither symmetric nor gauge-symmetric (gauge invariant). The Belinfante-Rosenfeld (BR) method is a well-known procedure to symmetrize the EMTs, which also renders them gauge symmetric for first-order field theories. High-order electromagnetic field theories appear in the study of gyrokinetic systems for magnetized plasmas and the Podolsky system for the radiation reaction of classical charged particles. For these high-order field theories, gauge-symmetric EMTs are not necessarily symmetric and vice versa. In the present study, we develop a new gauge-symmetrization method for EMTs in high-order electromagnetic field theories. The Noether procedure is carried out using the Faraday tensor $F_{μν}$, instead of the 4-potential $A_{μ}$, to derive a canonical EMT $T^{μν}_{N}$. We show that the gauge-dependent part of $T^{μν}_{N}$ can be removed using the displacement-potential tensor $F^{σμν}$ ≡ $D^{σμ}A^{ν}/4π$, where $D^{σμ}$ is the antisymmetric electric displacement tensor. This method gauge-symmetrizes the EMT without necessarily making it symmetric, which is adequate for applications not involving general relativity. For first-order electromagnetic field theories, such as the standard Maxwell system, $F^{σμν}$ reduces to the familiar BR superpotential $S^{σμν}$, and the method developed can be used as a simpler procedure to calculate $S^{σμν}$ without employing the angular momentum tensor in 4D spacetime. When the electromagnetic system is coupled to classical charged particles, the gauge-symmetrization method for EMTs is shown to be effective as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗