Engineering Papers⌕ Search

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.

At least 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

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↗
DOE OSTI2025

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↗
DOE OSTI2026

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↗
DOE OSTI2022

Rank-reduced coupled-cluster. III. Tensor hypercontraction of the doubles amplitudes

In this work, we develop a quartic-scaling implementation of coupled-cluster singles and doubles (CCSD) based on low-rank tensor hypercontraction (THC) factorizations of both the electron repulsion integrals (ERIs) and the doubles amplitudes. This extends our rank-reduced (RR) coupled-cluster method to incorporate higher-order tensor factorizations. The THC factorization of the doubles amplitudes accounts for most of the gain in computational efficiency as it is sufficient, in conjunction with a Cholesky decomposition of the ERIs, to reduce the computational complexity of most contributions to the CCSD amplitude equations. Further THC factorization of the ERIs reduces the complexity of certain terms arising from nested commutators between the doubles excitation operator and the two-electron operator. We implement this new algorithm using graphical processing units and demonstrate that it enables CCSD calculations for molecules with 250 atoms and 2500 basis functions using a single computer node. Furthermore, we show that the new method computes correlation energies with comparable accuracy to the underlying RR-CCSD method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

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)↗
DOE OSTI2026

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↗
DOE OSTI2026

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↗
DOE OSTI2026

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↗
DOE OSTI2025

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↗
DOE OSTI2026

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↗
DOE OSTI2020

Calculation of the detonation state of HN 3 with quantum accuracy

HN 3 is a unique liquid energetic material that exhibits ultrafast detonation chemistry and a transition to metallic states during detonation. We combine the Chebyshev interaction model for efficient simulation (ChIMES) many-body reactive force field and the extended-Lagrangian multiscale shock technique molecular dynamics method to calculate the detonation properties of HN 3 with the accuracy of Kohn–Sham density-functional theory. ChIMES is based on a Chebyshev polynomial expansion and can accurately reproduce density-functional theory molecular dynamics (DFT-MD) simulations for a wide range of unreactive and decomposition conditions of liquid HN 3 . We show that addition of random displacement configurations and the energies of gas-phase equilibrium products in the training set allows ChIMES to efficiently explore the complex potential energy surface. Schemes for selecting force field parameters and the inclusion of stress tensor and energy data in the training set are examined. Structural and dynamical properties and chemistry predictions for the resulting models are benchmarked against DFT-MD. We demonstrate that the inclusion of explicit four-body energy terms is necessary to capture the potential energy surface across a wide range of conditions. Our results generally retain the accuracy of DFT-MD while yielding a high degree of computational efficiency, allowing simulations to approach orders of magnitude larger time and spatial scales. The techniques and recipes for MD model creation we present allow for direct simulation of nanosecond shock compression experiments and calculation of the detonation properties of materials with the accuracy of Kohn–Sham density-functional theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Geometric Interpretation of the Cluster Location Problem Part II: Application to the Pahala, Hawaii, Earthquake Sequence

In the companion “Theory” article, we presented a new framing of the seismic location problem in terms of differential geometry (Harris et al., 2025). From that viewpoint, we developed a “project and correct” approach for estimating the relative locations of earthquakes. Here, in this study, we use project and correct to estimate high-precision relative locations of events from an earthquake sequence beneath the town of Pahala, Hawaii, using high-precision correlation-derived picks. The sequence was active from 2020 through 2022 and produced many highly correlated signals at Hawaii Volcano Observatory (HVO) stations on the island of Hawaii. The data we inverted consisted of 2882 events with observations at 5 HVO stations. For comparison with the travel-time image, we also produced conventional hypocenter solutions using both the Bayesloc program (Myers et al., 2007, 2009) and a purpose-built double-difference code. There were obvious structural elements in the resulting image, the resolution of which we used to test the performance of the project and the correct algorithm. For the projection step, we first produced a 3D local basis using an singular value decomposition (SVD) of the 2882 groups of times. Projection of the travel-time vectors into this basis resulted in an image with structures similar to those produced by our conventional locators, but with distortion as predicted by theory. Removing the distortion requires an inverse operator generated from the metric tensor at the geometric centroid of the events. We compared two approaches to obtaining such an inverse operator. The first uses an estimate of the geographic centroid of the event cloud from the centroid of the travel-time data. The second approach uses the centroid of the conventionally produced locations. The first approach produces a corrected image very similar to the conventional results, but with a rotation. The corrected image produced using the conventionally derived centroid is a near-exact match to the conventional locations.

Dodge, Douglas A. [Lawrence Livermore National Lab↗
DOE OSTI2023

Analysis of Needlet Internal Linear Combination performance on B -mode data from sub-orbital experiments

The observation of primordial B modes in cosmic microwave background (CMB) polarisation data represents the main scientific goal of most of the future CMB experiments. This signal is predicted to be much lower than polarised Galactic emission (foregrounds) in any region of the sky, pointing to the need for effective component separation methods. Aims. Among all the techniques, the blind Needlet Internal Linear Combination (NILC) is of great relevance given our current limited knowledge of the B-mode foregrounds. In this work, we explore the possibility of employing NILC for the analysis of B modes reconstructed from partial-sky data, specifically addressing the complications that such an application yields such as E–B leakage, needlet filtering, and beam convolution. We consider two complementary simulated datasets of future experiments: the balloon-borne Short Wavelength Instrument for the Polarisation Explorer (SWIPE) of the Large Scale Polarisation Explorer, which targets the observation of both reionisation and recombination peaks of the primordial CMB B-mode angular power spectrum, and the ground-based Small Aperture Telescope of Simons Observatory, which, instead, is designed to observe only the recombination bump at ℓ ~ 80. We assessed the performance of the following two alternative techniques to correct for the CMB E–B leakage: the recycling technique and the Zhao-Baskaran method. We find that both techniques reduce the E–B leakage residuals at a negligible level given the sensitivity of the considered experiments, except for the recycling method in the SWIPE footprint at ℓ < 20. Thus, we implemented two extensions of the pipeline, the iterative B decomposition and the diffusive inpainting, which enabled us to recover the input CMB B-mode power for ℓ ≥ 5. For the considered experiments, we demonstrate that needlet filtering and beam convolution do not affect the CMB B-mode reconstruction. Finally, with an appropriate masking strategy, we find that NILC foregrounds subtraction allows one to achieve sensitivities on the tensor-to-scalar ratio in agreement with the targets of the considered CMB experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Sparsity of Radiating Characteristic Modes on Infinite Periodic Structures

Characteristic modes on infinite periodic structures are studied using spectral dyadic Green’s functions. This formulation demonstrates that, in contrast to the modal analysis of finite structures, the number of radiating characteristic modes is limited by unit cell size and incident wave vector (i.e., scan angle or phase shift per unit cell). Here, the reflection tensor is decomposed into modal contributions from radiating modes, indicating that characteristic modes are a predictably sparse basis in which to study reflection phenomena.

42 ENGINEERING↗
DOE OSTI2021

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗
DOE OSTI2025

Flavor diagonal nucleon charges using clover fermions on MILC HISQ ensembles

We present lattice results for the flavor diagonal charges of the proton from the analysis of eight ensembles generated using 2+1+1-flavors of highly improved staggered quarks by the MILC Collaboration. The calculation includes all the needed connected and disconnected contributions to nucleon three-point function. For extracting matrix elements using fits to the spectral decomposition of these correlation functions, two strategies to remove excited state contributions are employed and compared. To renormalize these charges, the 2+1-flavor mixing matrix is calculated in the regularization independent symmetric momentum subtraction intermediate scheme on the lattice. The final results are presented in the $\overline{MS}$ scheme at scale 2 GeV. The axial charges for the proton are $𝑔$$^{𝑢}_{𝐴}$ = 0.781⁢(25), $𝑔$$^{𝑑}_{𝐴}$ =−0.440⁢(39), and $𝑔$$^{𝑠}_{𝐴}$ = −0.055⁢(9); the tensor charges are $𝑔$$^{𝑢}_{𝑇}$ = 0.782⁢(28), $𝑔$$^{𝑑}_{𝑇}$ = −0.195⁢(16), and $𝑔$$^{𝑠}_{𝑇}$ = −0.0016⁢(12); and the scalar charges are $𝑔$$^{𝑢}_{𝑆}$ = 9.39⁢(88), $𝑔$$^{𝑑}_{𝑆}$ = 8.84⁢(93), and $𝑔$$^{𝑠}_{𝑆}$ = 0.37⁢(14). Results for the neutron are given by the 𝑢 ↔ 𝑑 interchange. Results for the sigma terms are 𝜎 𝜋⁢𝑁 | standard = 42⁢(6) MeV from a “standard” analysis and 𝜎 𝜋⁢𝑁 | 𝑁⁢𝜋 = 61⁢(6) MeV from an “𝑁⁢𝜋” analysis that includes the contributions of multihadron 𝑁⁢𝜋 excited states as motivated by chiral perturbation theory. Our preferred value 𝜎 𝜋⁢𝑁 | 𝑁⁢𝜋 is consistent with the phenomenological extraction from 𝜋 −𝑁 scattering data. The strangeness content of the proton, for which the standard analysis is appropriate, is 𝜎 𝑠 | standard = 35⁢(13) MeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods

Studying QCD and other gauge theories on quantum hardware requires the preparation of physically interesting states. The variational quantum eigensolver provides a way of performing vacuum state preparation on quantum hardware. Here in this work, variational quantum eigensolver is applied to pure SU(3) lattice Yang-Mills on a single plaquette and one dimensional plaquette chains. Bayesian optimization and gradient descent were investigated for performing the classical optimization. Ansatz states for plaquette chains are constructed in a scalable manner from smaller systems using domain decomposition and a stitching procedure analogous to the density matrix renormalization group. Small examples are performed on IBM’s superconducting Manila processor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗