Flavor structure of the energy-momentum tensor form factors of the proton
Not Available
$\overline{c}$ form factors↗
SEARCH · Engineering Papers
Results for “tensor decomposition”
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.
Eulerian finite element implementations of a dislocation density-based continuum model
In Eulerian finite element simulations, the mesh moves relative to the material. After every change of position between the mesh and the material, the state variables are interpolated to the new mesh position, which is referred to as advection. Large strain crystal plasticity models are based on the multiplicative decomposition of the total deformation gradient. Further, the stress is evaluated as a function of the thermoelastic strain, temperature, and other state variables. Advection of tensor quantities, such as the strain, is coupled with possibly significant advection errors. In an effort to reduce the advection errors, we develop two rate forms of an established dislocation density-based continuum model. To that end, we replace the multiplicative decomposition of the deformation gradient with the additive decomposition of the velocity gradient, and define the stress rate instead of the total stress. The Eulerian implementation is compared with Lagrangian calculations, and two numerical examples with severe deformation levels are presented.
36 MATERIALS SCIENCE↗
Glueballs at physical pion mass
Glueballs are investigated through gluonic operators on two $ N_f=2+1 $ RBC/UKQCD gauge ensembles at the physical pion mass. The statistical errors of glueball correlation functions are considerably reduced through the cluster decomposition error reduction (CDER) method. The Bethe-Salpeter wave functions are obtained for the scalar, tensor, and pseudoscalar glueballs by using spatially extended glueball operators defined through the gauge potential $ A_\mu(x) $ in the Coulomb gauge. These wave functions exhibit similar features of non-relativistic two-gluon systems and are used to optimize the signals of the related correlation functions at the early time regions, where the ground state masses are extracted. These masses are close to those from the quenched approximation and indicate the possible existence of glueballs at the physical point. The resonance feature of glueballs and the mixing with conventional mesons and multi-hadron systems should be considered in a more systematic lattice study.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Quantum Fourier transform revisited
Summary The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix. In this paper, we show that the quantum Fourier transform (QFT) can be derived by further decomposing the diagonal factors of the FFT matrix decomposition into products of matrices with Kronecker product structure. We analyze the implication of this Kronecker product structure on the discrete Fourier transform of rank‐1 tensors on a classical computer. We also explain why such a structure can take advantage of an important quantum computer feature that enables the QFT algorithm to attain an exponential speedup on a quantum computer over the FFT algorithm on a classical computer. Further, the connection between the matrix decomposition of the DFT matrix and a quantum circuit is made. We also discuss a natural extension of a radix‐2 QFT decomposition to a radix‐ d QFT decomposition. No prior knowledge of quantum computing is required to understand what is presented in this paper. Yet, we believe this paper may help readers to gain some rudimentary understanding of the nature of quantum computing from a matrix computation point of view.
Camps, Daan↗
A finite element tensor approach to plate buckling and postbuckling.
A practical finite element method is presented for geometrically nonlinear (von Karman) plate problems. Symmetric strain energy tensors provide an efficient formulation and solution, and allow the effects of initial imperfections to be considered. An unbalanced force iteration is employed, with the advantage that the time consuming Gauss decomposition needs to be performed only once. The convergence is controlled by an automatically computed relaxation factor, and this makes the method applicable in advanced stages of non-linearity. Several different triangular elements are used in explicitly deriving the required tensors.
Vos, R. G.↗
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↗
Five-dimensional spinor helicity for all masses and spins
We develop a spinor helicity formalism for five-dimensional scattering amplitudes of any mass and spin configuration. While five-dimensional spinor helicity variables have been previously studied in the context of $\mathcal{N}$ = 2, 4 supersymmetric Yang-Mills scattering amplitudes with spin less than two [1], we propose an alternative viewpoint that stems from d-dimensional spinor helicity variables avoiding the decomposition of a massive momentum into the sum of two massless momenta. By enumerating all possible independent little group tensors, we systematically build the full space of five-dimensional three-point tree-level scattering amplitudes for any configuration of spins and masses. Furthermore, we provide a prescription for computing the high energy limit of scattering amplitudes written in our spinor helicity variables. We also expect that our formalism will be applicable to effective field theories with higher spin, in particular, the scattering of highly spinning black holes in five dimensions.
Field Theories in Higher Dimensions↗
Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients
Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.
97 MATHEMATICS AND COMPUTING↗
Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics
We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into “system” and “environment.” Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. Furthermore, this formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Determination of latent dimensionality in international trade flow
Currently, high-dimensional data is ubiquitous in data science, which necessitates the development of techniques to decompose and interpret such multidimensional (aka tensor) datasets. Finding a low dimensional representation of the data, that is, its inherent structure, is one of the approaches that can serve to understand the dynamics of low dimensional latent features hidden in the data. Moreover, decomposition methods with non-negative constraints are shown to extract more insightful factors. Nonnegative RESCAL is one such technique, particularly well suited to analyze self-relational data, such as dynamic networks found in international trade flows. Particularly, non-negative RESCAL computes a low dimensional tensor representation by finding the latent space containing multiple modalities. Furthermore, estimating the dimensionality of this latent space is crucial for extracting meaningful latent features. Here, to determine the dimensionality of the latent space with non-negative RESCAL, we propose a latent dimension determination method which is based on clustering of the solutions of multiple realizations of non-negative RESCAL decompositions. We demonstrate the performance of our model selection method on synthetic data. We then apply our method to decompose a network of international trade flows data from International Monetary Fund and shows that with a correct latent dimension determination, the resulting features are able to capture relevant empirical facts from economic literature.
97 MATHEMATICS AND COMPUTING↗
Reduced order models for thermal radiative transfer problems based on moment equations and data-driven approximations of the Eddington tensor
Here a new group of structure and asymptotic preserving reduced-order models (ROMs) for multidimensional nonlinear thermal radiative transfer (TRT) problems is presented. They are formulated by means of the nonlinear projective approach and data compression techniques. The nonlinear projection is applied to the Boltzmann transport equation (BTE) to derive a hierarchy of low-order moment equations. Approximation of the Eddington tensor that provides exact closure for the system of moment equations is found with projection-based data-driven methodologies. These include the (i) proper orthogonal decomposition (POD), (ii) dynamic mode decomposition (DMD) and (iii) a variant of the DMD. A parameterization is derived for this ROM for the temperature of radiation incoming to the problem domain (the radiation drive temperature). This parameterization is informed from results of a dimensionless study of the TRT problem. Analysis of the ROMs is performed on the classical Fleck-Cummings TRT multigroup test problem in 2D geometry with a radiation-driven Marshak wave. Numerical results are presented to demonstrate the performance of these ROMs for the simulation of evolving radiation and heat waves. Results show these models to be sufficiently accurate for practical computations with rather low-rank representations of the Eddington tensor. As the rank of the approximation is increased, the errors of solutions generated by the ROMs gradually decreases.
42 ENGINEERING↗
GPU acceleration of rank-reduced coupled-cluster singles and doubles
Here, we have developed a graphical processing unit (GPU) accelerated implementation of our recently introduced rank-reduced coupled-cluster singles and doubles (RR-CCSD) method. RR-CCSD introduces a low-rank approximation of the doubles amplitudes. This is combined with a low-rank approximation of the electron repulsion integrals via Cholesky decomposition. The result of these two low-rank approximations is the replacement of the usual fourth-order CCSD tensors with products of second- and third-order tensors. In our implementation, only a single fourth-order tensor must be constructed as an intermediate during the solution of the amplitude equations. Owing in large part to the compression of the doubles amplitudes, the GPU-accelerated implementation shows excellent parallel efficiency (95% on eight GPUs). Our implementation can solve the RR-CCSD equations for up to 400 electrons and 1550 basis functions—roughly 50% larger than the largest canonical CCSD computations that have been performed on any hardware. In addition to increased scalability, the RR-CCSD computations are faster than the corresponding CCSD computations for all but the smallest molecules. We test the accuracy of RR-CCSD for a variety of chemical systems including up to 1000 basis functions and determine that accuracy to better than 0.1% error in the correlation energy can be achieved with roughly 95% compression of the ov space for the largest systems considered. We also demonstrate that conformational energies can be predicted to be within 0.1 kcal mol -1 with efficient compression applied to the wavefunction. Finally, we find that low-rank approximations of the CCSD doubles amplitudes used in the similarity transformation of the Hamiltonian prior to a conventional equation-of-motion CCSD computation will not introduce significant errors (on the order of a few hundredths of an electronvolt) into the resulting excitation energies.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Velocity-space Origins of the Pressure–Strain Interaction in Multipopulation Distributions and Its Application to Magnetic Reconnection
A forefront research question is how energy evolves in weakly collisional plasmas for which departures from local thermodynamic equilibrium (LTE) are significant. The standard approach is studying the terms in the non-LTE energy evolution equation derived by taking the second moment of the Boltzmann equation, but the resultant fluid metrics do not retain information about which particles at which velocities drive energy evolution. A widely studied channel for internal energy density evolution is the pressure–strain interaction. Here, we employ the kinetic pressure–strain, a phase-space diagnostic whose velocity-space integral recovers the pressure–strain interaction to disambiguate the contributions to the pressure–strain interaction from disparate particle populations in composite phase-space densities. We develop phase-space analogs of the pressure–strain interaction decompositions to provide the phase-space origins of normal versus sheared flow. We introduce the “kinetic strain-rate” tensor, the phase-space analog of the strain-rate tensor, which we argue is needed to interpret the phase-space origins of the pressure–strain interaction. To demonstrate the utility of these quantities, we investigate them for composite electron distributions near the electron diffusion region in two-dimensional particle-in-cell simulations of antiparallel symmetric magnetic reconnection. We find that the phase-space-based diagnostics isolate the roles of distinct populations. These results contribute to a growing body of work providing new methods for quantifying phase-space energy evolution for a broad array of processes, from magnetic reconnection to collisionless shocks and turbulence, opening new pathways for answering longstanding problems of particle energization in weakly collisional plasmas.
79 ASTRONOMY AND ASTROPHYSICS↗
Low rank approximation in simulations of quantum algorithms
Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low rank tensor and all intermediate states of the quantum algorithm can be represented or approximated by low rank tensors. Here, in this paper, we examine the possibility of simulating a few quantum algorithms by using low-rank canonical polyadic (CP) decomposition to represent the input and all intermediate states of these algorithms. Two rank reduction algorithms are used to enable efficient simulation. We show that some of the algorithms preserve the low rank structure of the input state and can thus be efficiently simulated on a classical computer. However, the rank of the intermediate states in other quantum algorithms can increase rapidly, making efficient simulation more difficult. To some extent, such difficulty reflects the advantage or superiority of a quantum computer over a classical computer. As a result, understanding the low rank structure of a quantum algorithm allows us to identify algorithms that can benefit significantly from quantum computers.
97 MATHEMATICS AND COMPUTING↗
Efficient CP Rounding Using Alternating Least Squares with QR Decomposition
The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Here, our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox's NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution.
CANDECOMP/PARAFAC↗
Numerical simulation of a compressible homogeneous, turbulent shear flow
A direct, low Reynolds number, numerical simulation was performed on a homogeneous turbulent shear flow. The full compressible Navier-Stokes equations were used in a simulation on the ILLIAC IV computer with a 64,000 mesh. The flow fields generated by the code are used as an experimental data base, to examine the behavior of the Reynols stresses in this simple, compressible flow. The variation of the structure of the stresses and their dynamic equations as the character of the flow changed is emphasized. The structure of the tress tensor is more heavily dependent on the shear number and less on the fluctuating Mach number. The pressure-strain correlation tensor in the dynamic uations is directly calculated in this simulation. These correlations are decomposed into several parts, as contrasted with the traditional incompressible decomposition into two parts. The performance of existing models for the conventional terms is examined, and a model is proposed for the 'mean fluctuating' part.
Feiereisen, W. J.↗
A Unified Perspective on Poincaré and Galilei Relativity: II. General Relativity: A. Kinematics
Building on the first paper in this series (Paper I), a unified perspective on Poincaré and Galilei physics in a 5-dimensional spacetime setting is further pursued through a consideration of the kinematics of general relativity, with the gravitational dynamics to be addressed separately. The metric of the 5-dimensional affine spacetimes governed by the Bargmann groups considered in Paper I (central extensions of the Poincaré and Galilei groups) is generalized to curved spacetime by extending the usual 1 + 3 (traditionally ‘3 + 1’) formalism of general relativity on 4-dimensional spacetime to a 1 + 3 + 1 formalism, whose spacetime kinematics is shown to be consistent with that of the usual 1 + 3 formalism. Spacetime tensor laws governing the motion of an elementary classical material particle and the dynamics of a simple fluid are presented, along with their 1 + 3 + 1 decompositions; these reference the foliation of spacetime in a manner that partially reverts the Einstein perspective (accelerated fiducial observers, and geodesic material particles and fluid elements) to a Newton-like perspective (geodesic fiducial observers, and accelerated material particles and fluid elements subject to a gravitational force). These spacetime laws of motion for particles and fluids also suggest that a strong-field Galilei general relativity would involve a limit in which not only 𝑐 → ∞ but also 𝐺 → ∞ , such that 𝐺/𝑐 2 remains constant.
Bargmann group↗
Comparison between explicit and implicit discretization strategies for a dissipative thermal environment
We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗