Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “tensors”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Poisson-response Tensor-on-Tensor Regression and Applications

We introduce Poisson-response tensor-on-tensor regression (PToTR), a novel regression framework designed to handle tensor responses composed element-wise of random Poisson-distributed counts. Tensors, or multi-dimensional arrays, composed of counts are common data in fields such as inter national relations, social networks, epidemiology, and medical imaging, where events occur across multiple dimensions like time, location, and dyads. PToTR accommodates such tensor responses alongside tensor covariates, providing a versatile tool for multi dimensional data analysis. We propose algorithms for maximum likelihood estimation under a canonical polyadic (CP) structure on the regression coefficient tensor that satisfy the positivity of Poisson parameters and then provide an initial theoretical error analysis for PToTR estimators. We also demonstrate the utility of PToTR through three concrete applications: longitudinal data analysis of the Integrated Crisis Early Warning System database, positron emission tomography (PET) image reconstruction, and change-point detection of communication patterns in longitudinal dyadic data. These applications highlight the versatility of PToTR in addressing complex, structured count data across various domains.

97 MATHEMATICS AND COMPUTING↗

Generalized Tensor-on-Tensor Regression (GToTR)

SAND2026-23069O Generalized Tensor-on-Tensor Regression (GToTR) is a Python-based tool for conducting generalized tensor-on-tensor regression. It provides Canonical Polyadic (CP)-based generalized tensor regression models, support for generalized linear model-like families and links, alternating-optimization model fitting methods, and a standard statistics software interface. The tool supports tensor-valued responses and covariates using the open-source Python Tensor Toolbox (pyttb) software package. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dunlavy, Daniel [Sandia National Lab. (SNL-CA), Li↗

CCUS 2024, Interpreting the strain tensor Larry Murdoch 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 during CCUS. We have demonstrated this method by deploying strainmeters at shallow depths (30 to 40m) and then conducting injection well tests in an underlying reservoir at 530m depth. The resulting data indicated that the horizontal strain at shallow strainmeters 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 ne/d over a few days (1 nanostrain = 1 part per billion strain). We then used the strain data to estimate reservoir properties, geometry and pressure through inversion of poroelastic forward models using both numerical and novel 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 fast, closed-form analytical solutions to a pressurized poroelastic inclusion and inhomogeneity in a half-space. 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. This approach markedly reduces the computational requirements and makes it feasible to use Bayesian inversion with large numerical models. Bayesian inversion is important because it provides predictions with uncertainties, which makes the results useful for decision making. We have shown with field tests and simulations that the strain tensor in the caprock is sensitive to pressure in the reservoir, reservoir properties and boundaries, and pressure in the caprock caused by leaks. These results indicate that measuring and interpreting the shallow strain tensor could be a valuable tool for both initial reservoir characterization efforts and long-term monitoring during CCUS. 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 our objective was to evaluate opportunities for strain monitoring during characterization and monitoring for CCUS. Our approach was to deploy strainmeters at shallow depths (30 to 40m) and then conduct injection well tests in an underlying reservoir at 530m depth. The results indicate that the horizontal strain at shallow strainmeters 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 ne/d over a few days (1 nanostrain = 1 part per billion strain). We then used the strain data to estimate reservoir properties, geometry and pressure through inversion of poroelastic forward models using both numerical and novel 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 fast, closed-form analytical solutions to a pressurized poroelastic inclusion and inhomogeneity in a half-space. 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. This approach markedly reduces the computational requirements and makes it feasible to use Bayesian inversion with large numerical models. Bayesian inversion is important because it provides predictions with uncertainties, which makes the results useful for decision making. In conclusion, we have shown with field tests and simulations that the strain tensor in the caprock is sensitive to pressure in the reservoir, reservoir properties and boundaries, and pressure in the caprock caused by leaks. These results indicate that measuring and interpreting the shallow strain tensor could be a valuable tool for both initial reservoir characterization efforts and long-term monitoring during CCUS.

Murdoch, Larry↗

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

On the most general tensor B(sub ij) which is zero for i does not equal j, and the most general isotropic tensor I(sub ij)

It is shown that the most general second order tensor B sub ij which is zero for i not = j is proportional to the Kronecker delta (Delta sub ij). By a slight modification of that argument, the known result was obtained that the most general second order isotropic tensor is also proportional to Delta sub ij. These results are useful for instance in obtaining the stress tensor for a viscous fluid.

Deissler, Robert G.↗

Tensor Network Path Integral Study of Dynamics in B850 LH2 Ring with Atomistically Derived Vibrations

The recently introduced multisite tensor network path integral (MS-TNPI) allows simulation of extended quantum systems coupled to dissipative media. We use MS-TNPI to simulate the exciton transport and the absorption spectrum of a B850 bacteriochlorophyll (BChl) ring. The MS-TNPI network is extended to account for the ring topology of the B850 system. Accurate molecular-dynamics-based description of the molecular vibrations and the protein scaffold is incorporated through the framework of Feynman–Vernon influence functional. To relate the present work with the excitonic picture, an exploration of the absorption spectrum is done by simulating it using approximate and topologically consistent transition dipole moment vectors. Comparison of these numerically exact MS-TNPI absorption spectra are shown with second-order cumulant approximations. Finally, the effect of temperature on both the exact and the approximate spectra is also explored.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating GNNs on GPU Sparse Tensor Cores through N:M Sparsity-Oriented Graph Reordering

Recent advancements in GPU hardware support have introduced the capability to leverage N:M sparse patterns for substantial performance gains. Graphs in Graph Neural Networks (GNNs) are typically sparse, but the sparsity is often irregular, not conforming to such sparse patterns. In this paper, we propose a novel graph reordering algorithm, the first of its kind, to reshape irregular graph data into the N:M structured sparse pattern at the tile level, allowing linear-algebra-based graph operations in GNNs to benefit from the N:M sparse hardware. The optimization is lossless, maintaining the accuracy of GNN. It can remove 98-100\% violations of the N:M sparse patterns at the vector level, and increase the proportion of conforming graphs in SuiteSparse collection from 5-9\% to 88.7-93.5\%. On A100 GPUs, the optimization accelerates Sparse Matrix Matrix (SpMM) by up to 43X (2.3X -- 7.5X on average) and speeds up the key graph operations in GNNs on real graphs by as much as 8.6X (3.5X on average).

artificial intelligence, graph neural networks↗

Toward Global Regional Seismic Moment Tensor Inversion with Three-Dimensional Earth Models for Nuclear Explosion Monitoring with Sparse Networks: Demonstration of Reciprocity for Strain Greens Tensor Database Simulation with Salvus

Seismic source characterization is an essential function of global nuclear explosion monitoring (NEM). While large events (roughly with moment magnitude, M w , greater than 5.0) can often be easily detected, located and identified with high signal-to-noise ratios at teleseismic distances (> 20°), trends in NEM research require confident source characterization at much lower magnitudes (say down to 3.0) and exploitation of sparse observations (from only a few stations) at regional distance (< 20°). Regional distance waveform inversion to characterize sources is now widely used and effective (e.g. Ford et al., 2009; Alvizuri and Tape, 2018; Alvizuri et al., 2018; Chiang et al., 2018; Ford et al., 2022). These methods obtain the magnitude, depth and seismic moment tensor, which represents the forces that excited the observed seismic waves (slip on an earthquake fault, explosion, collapse or a combination of various forces). Common to many problems in seismology, the isolation of the source 2 properties requires removal of path propagation effects that waves experience while traveling through the three-dimensional (3D) Earth (the structure exists due to different rock types, material properties, temperature and tectonic processes).

58 GEOSCIENCES↗

MIONet: Learning Multiple-Input Operators via Tensor Product

As an emerging paradigm in scientific machine learning, neural operators aim to learn operators, via neural networks, that map between infinite-dimensional function spaces. Several neural operators have been recently developed. However, all the existing neural operators are only designed to learn operators defined on a single Banach space; i.e., the input of the operator is a single function. Here, for the first time, we study the operator regression via neural networks for multiple-input operators defined on the product of Banach spaces. We first prove a universal approximation theorem of continuous multiple-input operators. We also provide a detailed theoretical analysis including the approximation error, which provides guidance for the design of the network architecture. Based on our theory and a low-rank approximation, we propose a novel neural operator, MIONet, to learn multiple-input operators. MIONet consists of several branch nets for encoding the input functions and a trunk net for encoding the domain of the output function. Here, we demonstrate that MIONet can learn solution operators involving systems governed by ordinary and partial differential equations. In our computational examples, we also show that we can endow MIONet with prior knowledge of the underlying system, such as linearity and periodicity, to further improve accuracy.

97 MATHEMATICS AND COMPUTING↗

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗