Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor decompositions”

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 91 records · Page 5

Local reduced-order modeling for electrostatic plasmas by physics-informed solution manifold decomposition

Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.

Electrostatic plasmas↗

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↗

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↗

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↗

Sign Problem in Tensor-Network Contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower computational complexity as compared to tensor networks with general real or complex entries. This raises the question of how this transition in computational complexity manifests itself in the hardness of different tensor-network-contraction schemes. We pursue this question by studying random tensor networks with varying bias toward positive entries. First, we consider contraction via Monte Carlo sampling and find that the transition from hard to easy occurs when the tensor entries become predominantly positive; this can be understood as a tensor-network manifestation of the well-known negative-sign problem in quantum Monte Carlo. Second, we analyze the commonly used contraction based on boundary tensor networks. The performance of this scheme is governed by the number of correlations in contiguous parts of the tensor network (which by analogy can be thought of as entanglement). Remarkably, we find that the transition from hard to easy—i.e., from a volume-law to a boundary-law scaling of entanglement—already occurs for a slight bias of the tensor entries toward a positive mean, scaling inversely with the bond dimension D , and thus the problem becomes easy the earlier the larger D occurs. This is in contrast both to expectations and to the behavior found in Monte Carlo contraction, where the hardness at fixed bias increases with the bond dimension. To provide insight into this early breakdown of computational hardness and the accompanying entanglement transition, we construct an effective classical statistical-mechanical model that predicts a transition at a bias of the tensor entries of 1 / D , confirming our observations. We conclude by investigating the computational difficulty of computing expectation values of tensor-network wave functions (projected entangled-pair states, PEPSs) and find that in this setting, the complexity of entanglement-based contraction always remains low. We explain this by providing a local transformation that maps PEPS expectation values to a positive-valued tensor network. This not only provides insight into the origin of the observed boundary-law entanglement scaling but also suggests new approaches toward PEPS contraction based on positive decompositions. Published by the American Physical Society 2025

Chen, Jielun (ORCID:0000000178411545)↗

Noncausal propagation in spin-0 theories with external field interactions

The two-component Sakata-Taketani (ST) spin-0 theory and the single-component Klein-Gordon theory are obtained from the five-component Duffin-Kemmer-Petiau (DKP) theory with six types of external field interactions by means of a Peirce decomposition. Whereas the DKP equation manifests the covariance, the ST equation manifests the causal properties. In particular, the presence of noncausal wave propagation when there is coupling to a second-rank tensor field is apparent from the form of the ST equation, in which the coefficients of all the space derivatives depend on the external field. The results indicate that the causal properties of higher-spin equations should also be obvious when they are expressed in 2(2J + 1)-component Schroedinger form

Guertin, R. F.↗

Statistical analysis of near-wall structures in turbulent channel flow

The two-point correlation tensor is used to analyze near-wall structures in turbulent channel flow. Simulation results have been utilized to obtain the correlation tensor with sufficient spatial resolution to permit accurate differentiation for computing the vorticity correlation, and the resolution of sharp features such as the shear layer and its corresponding region of spanwise vorticity. Proper orthogonal decomposition and stochastic estimation were observed to yield similar results when appropriate conditions were employed for the estimation. Resulting structures were such that they would be detected by standard conditional sampling methods. The results of decomposing the vorticity field and the velocity field were significantly different, indicating that if a coherent structure is found that dominates the velocity fields, the curl of that velocity structure will not dominate the vorticity field.

Moser, Robert D.↗

Nonmonotonic-potential description of polarization effects, fusion, and nuclear rainbows in elastic scattering of 6 Li + 12 C at 4.5–600 MeV

The experimental differential cross-section (CS) and analyzing power (AP) data of the 6 Li + 12 C elastic scattering over a wide laboratory energy scale (4.5MeV≤𝐸 lab ≤600MeV) are analyzed within the framework of the optical model (OPM) using nonmonotonic (NM) nucleus–nucleus potentials. The real part of the NM potentials is derived from the Pauli-embodied energy density-functional (EDF) formalism with the sudden approximation. The real part of the noncentral spin-orbit and tensor terms, as well as the imaginary parts, are treated phenomenologically. The effect of the radius of sensitivity on the CS and AP data is found to be more important at lower energies. The diffractive and refractive scattering with Airy structures in the whole angular region of the elastic scattering across the studied energy range is successfully described within the OPM using the NM 6 Li + 12 C potential. The near- and far-side (N and F) decomposition of the total elastic-scattering amplitudes has also been studied using our NM potentials. The evolution of the Airy minima in the angular distributions, coupled with the fitting of the AP data, provides an accurate description of Airy minima of different orders. The OPM calculations with the NM potentials describe exceptionally well the CS, vector analyzing power (VAP), and tensor analyzing power data at 𝐸 lab =9.0,19.24,20,30, and 50MeV. In agreement with our past successful descriptions of CS and the opposite signs of the VAP data for the 6 Li and 7 Li elastic scattering using NM potentials in OPM, the present results appear to provide a better fit, so far, than those obtained from the coupled-channels method. The fusion cross sections of 6 Li + 12 C have been predicted in the energy range (4.5MeV≤𝐸 lab ≤20MeV), fitting the experimental data well in the range 𝐸 lab =2.97–11.77MeV. The EDF potential without any energy dependence and renormalization is also found to describe satisfactorily the experimental CS and AP data at energies up to several hundreds of MeV.

6 ≤ A ≤ 19↗

Seamlessly joining length scales: From atomistic thermal graphs to anisotropic continuum conductivity

Thermal transport in complex solids is governed by local structure, defects, and anisotropy, yet most continuum models still rely on oversimplified and homogenized conductivities. Here, we bridge atomistic and continuum descriptions by building finite element (FE) models directly from the site-projected thermal conductivity (SPTC), an atomic-level decomposition of the Green–Kubo thermal conductivity. We introduce a toolkit, the “Simulator Collection for Atomic-to-Continuum Scales (SCACS)”, which uses a graph neural network to predict SPTC on large atomic structures, coarse-grains these fields into anisotropic conductivity tensors, and embeds them into the heat-flow FE equation with a customized, anisotropy-aware adaptive mesh refinement scheme. Applied to silicon nanostructures, the resulting FE models act as representative volume elements, reproduce bulk conductivities, and capture interfacial and defect-driven anisotropy while maintaining thermodynamic consistency. Additionally, SCACS predicts experimental conductance trends and fields. This work demonstrates a general route for transferring atomistic transport information into device-scale thermal simulations with physics-based approximations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗