Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensor”

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 181 records · Page 10

Interpreting strain tensor data to characterize and monitor reservoirs for CO2 storage and other applications

Recent advances in instrumentation have made it feasible to measure the transient strain tensor caused by small changes in fluid volume or pressure in the subsurface and this has opened the door to new opportunities for characterization and monitoring. We have deployed strainmeters and then conducted injection well tests in an underlying reservoir at 530m depth. The resulting data indicated that the horizontal strain at shallow strainmeters (30 to 40m depth) was tensile and the vertical strain was compressive. The radial strain was less than the horizontal strain, and the strain rates decreased from 100 nanostrain/day to roughly 10 n/d over a few days. The signal at two strainmeters at shallow depth were consistent, although the magnitude of the horizontal strains were different reflecting the different radial directions from the well. The signal at a deep strainmeter deployed at reservoir depth was much different, with tensile vertical strains and compressive horizontal strains. These data can be interpreted by inverting poroelastic forward models developed using numerical and analytical methods. The average horizontal strain in the caprock resembles the transient pressure in the underlying reservoir and classic type-curve methods from transient well testing can be used for preliminary interpretations of strain data. We have developed closed-form analytical solutions to a pressurized poroelastic inclusion and inhomogeneity in a half-space. This model is fast and can be inverted to estimate reservoir stiffness and geometry. Numerical models developed using finite element methods allow more details of the subsurface to be included in the inversion, but they require much longer run times and this makes inversion cumbersome using standard methods. We have developed an inversion approach that uses a proxy model created using machine learning to do most of the forward calculations. The proxy model is periodically updated and refined using the finite element model to ensure accuracy. This approach significantly reduces the computational requirements and makes it feasible to use Bayesian inversion with large numerical models. We have shown that the strain tensor in the caprock is sensitive to pressure in the reservoir, boundaries in the reservoir, and pressure in the caprock caused by leaks. These results indicate that coupling strain tensor data with inversion has the potential to help evaluate reservoirs during initial characterization, and to monitor them during the CO2 injection and storage process.

Murdoch, Larry↗

Field Results from New Tensor Borehole Optical Fiber Strainmeter Installations in Oklahoma and Utah

The time evolving strain field contains a wealth of information that can be used to interpret subsurface behavior. For example, injecting or removing fluids from reservoirs or aquifers causes deformation that can be used as a diagnostic signal in some cases, while it can interfere with geodetic interpretations in other cases. We've previously demonstrated the feasibility of measuring the strain tensor at a depth of 30m caused by injection into a reservoir at 530m. The observed strain signals were interpreted using four independent analytic and numerical methods that resulted in estimates of the poroelastic properties and geometry of the reservoir that was consistent with data from well logs. However, studies like these are only possible if these deformations can be reliably measured. Years of lab and field work has culminated in the development of a novel borehole strainmeter capable of resolving multiple components of strain using embedded optical fibers configured as Michelson interferometers. It features four horizontal gauges separated by 45° to resolve the horizontal strain tensor as well as a vertical strain gauge and a sixth null component for state-of-health monitoring. The downhole sensing package also includes an open pipe through its center for grout circulation during single-trip deployments and a fully welded stainless steel exterior for robustness and longevity. These instruments have a resolution of 2x10-13 strain that can easily measure the solid earth tides. Preliminary data are available from four strainmeters in shale at our Oklahoma site and four in compacted sand and gravel in Utah. These are deployed from 40-60m, except one of the strainmeters in Oklahoma is deployed at 500m. The data include strains from the initial grout curing, comparisons to predicted earth tide models and in-situ calibration results, barometric pressure admittances and spectral analyses as well as signals from underground injections and surface waves from teleseismic events. Preliminary analyses indicate behavior consistent with other strainmeter deployments, and comparison to data from a Gladwin strainmeter at the Oklahoma site validate the performance of the new design. Analyses from a suite of six well tests at the Oklahoma site show for the first time how the strain tensor field varies with location during well testing.

DeWolf, Scott↗

Probabilistic Error Bounds for Low-Rank Tensor Decompositions Used in Large-Scale Data Analysis Applications (LDRD Final Report)

This report documents a research project on analyzing low-rank tensor models for data analysis that took place at Sandia National Laboratories from October 2023–September 2025. The focus of this work was to extend theoretical frameworks from statistics and probability theory for use with models for scalar, vector, and matrix data to models with tensor, or general multi-dimensional array, data. Through this work, we have provided a new set of tools for bounding errors on low-rank tensor models of both complete and sampled data. The remainder of this report is organized as follows. In Section 1, we describe the proposed work at the start of the project. Section 2 describes the research advances made as part of the project. Other research contributions in the form of conference presentations and software development is provided in Section 3. Workforce development at Sandia and Florida Atlantic University (via a subcontract on this project) is provided in Section 4.

97 MATHEMATICS AND COMPUTING↗

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗

Frontal Slice Approaches for Tensor Linear Systems

Inspired by the row and column action methods for solving large-scale linear systems, in this work, we explore the use of frontal slices for solving tensor linear systems. In particular, this paper presents a novel approach for using frontal slices of a tensor $\mathcal{A}$ to solve tensor linear systems $\mathcal{A} ∗\mathcal{X} = \mathcal{B}$ where ∗ denotes the $t$-product. In addition, we consider variations of this method, including cyclic, block, and randomized approaches, each designed to optimize performance in different operational contexts. Our primary contribution lies in the development and convergence analysis of these methods. Experimental results on synthetically generated and real-world data, including applications such as image and video deblurring, demonstrate the efficacy of our proposed approaches and validate our theoretical findings.

Luo, Hengrui↗

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗

Effective $\mathbb{Z}_{3}$ model for finite-density QCD with tensor networks

The tensor renormalization group is a promising numerical method used to study lattice statistical field theories. However, this approach is computationally expensive in 2+1 and 3+1 dimensions. Here we use tensor renormalization group methods to study an effective three-dimensional $\mathbb{Z}_{3}$ model for the heavy-quark, high-temperature, strong-coupling limit of single-flavor 3+1 dimensional quantum chromodynamics. Our results are cross-checked using the worm Monte Carlo algorithm. We present the phase diagram of the model through the measurement of the Polyakov loop, the nearest-neighbor Polyakov loop correlator, and their susceptibilities. The tensor renormalization group results are in good agreement with the literature

Bloch, Jacques↗

Simulating Large PEPs Tensor Networks on Small Quantum Devices

We systematically map low bond dimension PEPs tensor networks to quantum circuits. By measuring and reusing qubits, we are in principle able to simulate an N×M square lattice PEPs network (for arbitrary M) of bond dimension 2 using N+ 2 qubits. We then seek to determine if this mapping can yield useful values for long-range loop observables in the presence of quantum device noise in the topological Wen plaquette model by mapping a 3×3 PEPs tensor network to a 5-qubit quantum circuit and executing it on the Honeywell System Model H1-1 trapped-ion device. We find that, for this system size, the noisy observable values are indeed sufficient for diagnosing topological vs. trivial order as the Wen model is perturbed by a magnetic field term in the Hamiltonian. We provide an overview of the experimental procedure and its results. We then explain in greater detail our method for mapping 2D tensor networks to quantum circuits and its scaling properties. This serves as a proof-of-concept of the utilty of the measure-and-reuse approach for simulating large 2D quantum systems on small quantum devices.

MacCormack, Ian↗

Fermionic Isometric Tensor Network States in Two Dimensions

We generalize isometric tensor network states to fermionic systems, paving the way for efficient adaptations of 1D tensor network algorithms to 2D fermionic systems. As the first application of this formalism, we developed and benchmarked a time-evolving block-decimation (TEBD) algorithm for real-time and imaginary-time evolution. The imaginary-time evolution produces ground-state energies for gapped systems, systems with a Dirac point, and systems with gapless edge modes to good accuracy. Here, the real-time TEBD captures the scattering of two fermions and the chiral edge dynamics on the boundary of a Chern insulator.

2-dimensional systems↗

Zero-Truncated Poisson Tensor Decomposition for Sparse Count Data

We propose a novel statistical inference paradigm for zero-inflated multiway count data that dispenses with the need to distinguish between true and false zero counts. Our approach ignores all zero entries and applies zero-truncated Poisson regression on the positive counts. Inference is accomplished via tensor completion that imposes low-rank structure on the Poisson parameter space. Our main result shows that an $\textit{N}$-way rank-R parametric tensor 𝓜 ϵ (0, ∞) $I$Χ∙∙∙Χ$I$ generating Poisson observations can be accurately estimated from approximately $IR^2 \text{log}^2_2(I)$ non-zero counts for a nonnegative canonical polyadic decomposition. Several numerical experiments are presented demonstrating that our zero-truncated paradigm is comparable to the ideal scenario where the locations of false zero counts are known $\textit{a priori}$.

97 MATHEMATICS AND COMPUTING↗

Dependence of the Elastic Stiffness Tensors of PETN, α‐RDX, γ‐RDX, ϵ‐RDX, ϵ‐CL‐20, DAAF, FOX‐7, and β‐HMX on Hydrostatic Compression

Abstract The dependence of the components of the elastic stiffness tensors (or elastic constants) of the organic explosives PETN, RDX, CL‐20, DAAF, FOX‐7, and HMX on hydrostatic pressure up to 10 GPa have been computed using dispersion‐corrected density functional theory. We report the evolution of lattice parameters and the non‐zero stiffnesses for the tetragonal, orthorhombic, and monoclinic crystal symmetries. Linear and quadratic dependencies of the components of the elastic stiffness tensors on volumetric compression and hydrostatic pressure are tabulated for use in single crystal plasticity models.

36 MATERIALS SCIENCE↗

Reynolds stress tensor measurements using magnetic resonance velocimetry: expansion of the dynamic measurement range and analysis of systematic measurement errors

This study presents magnetic resonance velocimetry (MRV) Reynolds Stress measurements in a periodic hill channel with a hill Reynolds number of Re = 29,500. The velocity encoding scheme is based on the ICOSA6 method with six icosahedral encoding directions and multiple encoding values are measured to increase the dynamic range. The full Reynolds stress tensor is obtained from a voxel-wise three-dimensional Gaussian fit using the magnitude data of all acquisitions. The MRV results are compared to a wall-resolved large eddy simulation and laser Doppler velocimetry measurements conducted in the same channel. It is shown that the MRV Reynolds stress data have excellent precision and agree qualitatively with the reference data. However, there are apparent systematic deviations. One of the most prominent error contributions is the signal attenuation caused by higher orders of motion, which leads to an overestimation of the turbulence level. Another fundamental error is identified in the assumption that the turbulence is Gaussian distributed. With the presented reconstruction technique, the MRV data are fitted to a statistical model, and depending on the examined flow setup, the Gaussian model can lead to considerable errors. Possible ways of how to reduce all identified errors are presented. In summary, this technique enables Reynolds stress tensor measurements in complex internal flows with high dynamic range and excellent precision. However, several issues need to be resolved to make the turbulence quantification more accurate.

42 ENGINEERING↗

A generalized and adaptable tensor-contraction-based cluster expansion formalism for multicomponent solids

Density functional theory (DFT)-based simulations of materials have first-principles accuracy, but are very computationally expensive. For simulating various properties of multi-component alloys, the cluster expansion (CE) technique has served as the standard workaround to improve computational efficiency. However, the standard CE technique is difficult to extend to exotic and/or low-symmetry lattices, often implemented via iteration over particular cluster types, which must be enumerated per lattice structure. In this work, we introduce the tensor cluster expansion (TCE), implemented in the open-source code tce-lib, which maps correlation functions to mixed tensor contractions, eliminating the need to iterate over cluster types and additionally making the calculation of correlation functions well-suited for massively parallel architectures like GPUs. We show that local interaction energies are an immediate consequence of the TCE formalism, yielding nearly $\mathcal{O}$(1) energy difference calculations. We then use this formalism to fit CE models for the TaW and CoNiCrFeMn systems, and use these models to respectively compute the enthalpy of mixing curve and Cowley short-range order parameters, showing excellent agreement with ground truth data.

Cluster expansion↗

Mixed Precision Fermi-Operator Expansion on Tensor Cores from a Machine Learning Perspective

Here we present a second-order recursive Fermi-operator expansion scheme using mixed precision floating point operations to perform electronic structure calculations using tensor core units. A performance of over 100 teraFLOPs is achieved for half-precision floating point operations on Nvidia’s A100 tensor core units. The second-order recursive Fermi-operator scheme is formulated in terms of a generalized, differentiable deep neural network structure, which solves the quantum mechanical electronic structure problem. We demonstrate how this network can be accelerated by optimizing the weight and bias values to substantially reduce the number of layers required for convergence. We also show how this machine learning approach can be used to optimize the coefficients of the recursive Fermi-operator expansion to accurately represent the fractional occupation numbers of the electronic states at finite temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

On infinite tensor networks, complementary recovery and type II factors

We initiate a study of local operator algebras at the boundary of infinite tensor networks, using the mathematical theory of inductive limits. In particular, we consider tensor networks in which each layer acts as a quantum code with complementary recovery, a property that features prominently in the bulk-to-boundary maps intrinsic to holographic quantum error-correcting codes. In this case, we decompose the limiting Hilbert space and the algebras of observables in a way that keeps track of the entanglement in the network. As a specific example, we describe this inductive limit for the holographic Harlow-Pastawski-Preskill-Yoshida code model and relate its algebraic and error-correction features. We find that the local algebras in this model are given by the hyperfinite type II$_\infty$ factor. Next, we discuss other networks that build upon this framework and comment on a connection between type II factors and stabilizer circuits. We conclude with a discussion of multiscale entanglement renormalization ansatz networks in which complementary recovery is broken. We argue that this breaking possibly permits a limiting type III von Neumann algebra, making them more suitable ansätze for approximating subregions of quantum field theories.

holographic dualities↗