Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor times matrix chain”

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.

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗

SymProp: Scaling Sparse Symmetric Tucker Decomposition via Symmetry Propagation

Sparse symmetric tensors are an important class of tensors, and their decompositions serve as powerful tools for revealing low-rank structures. This paper introduces SymProp, a novel approach for scaling sparse symmetric Tucker decomposition by propagating symmetry through intermediate computations. SymProp optimizes two key computational kernels: Sparse Symmetric Tensor Times Same Matrix chain (S3 TTMc) for Higher-Order Orthogonal Iteration (HOOI) and Sparse Symmetric Tensor Times Same Matrix chain Times Core (S3 TTMcTC) for Higher-Order QR Iteration (HOQRI). Our method employs a metaprogramming-based index iteration approach to efficiently handle the upper triangular parts of intermediate dense symmetric tensors. SymProp achieves up to 50.9× speedup over SPLATT and up to 360.8× over Compressed Sparse Symmetric (CSS) format on the S3 TTMc operation. Moreover, our S3 TTMc and S3 TTMcTC implementations support tensor orders four levels higher than state-of-the-art methods. Our HOQRI demonstrates superior scalability and up to a 33.6× speedup over optimized HOOI. By enabling more scalable Tucker decompositions for higher orders, decomposition ranks, and dimension sizes, SymProp opens new possibilities for analyzing complex hypergraph structures in fields such as network science, data mining, and machine learning.

Li, Zecheng [North Carolina State University]↗

Quantum quenches in two spatial dimensions using chain array matrix product states

We describe a method for simulating the real time evolution of extended quantum systems in two dimensions (2D). The method combines the benefits of integrability and matrix product states in one dimension to avoid several issues that hinder other applications of tensor based methods in 2D. In particular, it can be extended to infinitely long cylinders. As an example application we present results for quantum quenches in the 2D quantum [(2+1)-dimensional] Ising model. As a result, in quenches that cross a phase boundary we find that the return probability shows nonanalyticities in time.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Physics-Based Data-Driven Approach for Modeling of Environmental Degradation in Elastomers

Abstract Elastomers are now commonly used in a number of industries, including aerospace, structure, transportation, shipbuilding, and automotive, due to their excellent workability, formability, and flexibility. During their activity, elastomers are subjected to harsh environmental conditions, which decreases their resilience. False predictions made early in their lives can have major financial and environmental implications. Elastomers’ performance and properties, such as strength, durability, and density, are influenced by chemical changes in these materials, known as degradation, which occurs over time. This process can alter the morphology of a polymer matrix as well as cause chain scission and cross-linking, resulting in different behaviors than that of the unaged material. To demonstrate the effect of thermaloxidative aging on the mechanical behavior of elastomers, several experimental and theoretical models have been proposed. In view of the large volume of experimental data available on micro-structural evolution in the course of aging, we propose a physics-based data-driven approach to overcome the shortcomings of both phenomenological and micro-mechanical models. This work presents a novel thermodynamically consistent, multiagent machine-learned model for predicting the constitutive behavior of cross-linked elastomers during environmental aging, such as thermo-oxidative and hydrolytic aging for various states of deformation. Single mechanism degradation changes the polymer matrix over time where it is causing chain scission, reduction of cross-links, and morphology change. To capture the idealized Mullins effect and permanent set due to the effect of single aging mechanisms on nonlinear mechanical responses of elastomers, we propose a data-driven model for simulating inelastic elements in a polymer matrix. By using a sequential order reduction, we were able to reduce the 3D stress-strain tensor mapping problem to a small number of super-constrained 1D mapping problems. To systematically classify such mapping problems into a few categories, an assembly of multiple replicated conditional neural network learning agents (L-agents) is used based on our recent work. Each category is represented by a different type of agent. The effect of deformation history, aging time, and aging temperature is captured by this model. The model is validated using a broad collection of data, ranging from our experimental results to data from the literature. In addition, thermodynamic consistency and frame independence are investigated. The most significant achievements of this model are its precision, simplicity, and prediction of inelasticity under various states of deformation. The model’s accuracy and simplicity make it a good option for commercial and industrial applications. Conveniently, due to the model modular nature, it can be expanded in the future to include viscoelasticity and non-isotropic formation for better precision.

Ghaderi, Aref↗

A physics-informed multi-agents model to predict thermo-oxidative/hydrolytic aging of elastomers

This paper introduces a novel physics-informed multi-agents constitutive model to propose prediction in quasi-static constitutive behavior of cross-linked elastomer and the loss of mechanical performance during environmental aging. The presented model is used to simulate the effect of single-mechanism chemical aging (i.e. thermal-inducedor hydrolytic aging) on the behavior of the material in this hybrid framework. Those environmental single-mechanism damages change the polymer matrix over time due to massive chain scission, chain formations, and changing the arrangement of molecules in the polymer matrix. Here we propose a data-driven super-constrained machine-learned engine to represent damage in the polymer matrix and capture the changes in material behavior, including its inelastic features such as Mullins effect and permanent set in the course of aging. We have simplified the 3D stress–strain tensor mapping problem into a small number of super-constrained 1D mapping problems by means of a sequential order reduction. An assembly of multiple replicated conditional neural-network learning-agents (L-agents) is trained to systematically simplify the high-dimensional mapping problem into multiple 1D problems, each represented by a different type of agent. Our hybrid framework is designed to capture the effect of deformation history, aging time, and aging temperature. The model is validated with respect to a comprehensive set of experiments specifically designed to benchmark model capabilities and also against available data in the literature. Thermodynamic consistency and frame independency have been verified. Besides acceptable predictive abilities, a significant reduction of computational cost to predict behavior at multiple states of deformation is the most significant feature of this model.

42 ENGINEERING↗

A multisite decomposition of the tensor network path integrals

Tensor network decompositions of path integrals for simulating open quantum systems have recently been proven to be useful. However, these methods scale exponentially with the system size. This makes it challenging to simulate the non-equilibrium dynamics of extended quantum systems coupled with local dissipative environments. In this work, we extend the tensor network path integral (TNPI) framework to efficiently simulate such extended systems. The Feynman–Vernon influence functional is a popular approach used to account for the effect of environments on the dynamics of the system. In order to facilitate the incorporation of the influence functional into a multisite framework (MS-TNPI), we combine a matrix product state (MPS) decomposition of the reduced density tensor of the system along the sites with a corresponding tensor network representation of the time axis to construct an efficient 2D tensor network. The 2D MS-TNPI network, when contracted, yields the time-dependent reduced density tensor of the extended system as an MPS. The algorithm presented is independent of the system Hamiltonian. We outline an iteration scheme to take the simulation beyond the non-Markovian memory introduced by solvents. Applications to spin chains coupled to local harmonic baths are presented; we consider the Ising, XXZ, and Heisenberg models, demonstrating that the presence of local environments can often dissipate the entanglement between the sites. We discuss three factors causing the system to transition from a coherent oscillatory dynamics to a fully incoherent dynamics. The MS-TNPI method is useful for studying a variety of extended quantum systems coupled with solvents.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Finite-size subthermal regime in disordered SU ( N ) -symmetric Heisenberg chains

SU⁡(N) symmetry is incompatible with the many-body localized (MBL) phase, even when strong disorder is present. However, recent studies have shown that finite-size SU⁡(2) systems exhibit nonergodic, subthermal behavior, characterized by the breakdown of the eigenstate thermalization hypothesis, and by the excited eigenstates entanglement entropy that is intermediate between area and volume law. In this paper, we extend previous studies of the SU⁡(2)-symmetric disordered Heisenberg model to larger systems, using the time-dependent density matrix renormalization group (tDMRG) method. We simulate quench dynamics from weakly entangled initial states up to long times, finding robust subthermal behavior at stronger disorder. Although we find an increased tendency towards thermalization at larger system sizes, the subthermal regime persists at intermediate time scales, nevertheless, and therefore should be accessible experimentally. At weaker disorder, we observe signatures of thermalization; however, entanglement entropy exhibits slow sublinear growth, in contrast to conventional thermalizing systems. Furthermore, we study dynamics of the SU⁡(3)-symmetric disordered Heisenberg model. Similarly, strong disorder drives the system into subthermal regime, albeit thermalizing phase is broader compared to the SU⁡(2) case. Finally, our findings demonstrate the robustness of the subthermal regime in spin chains with non-Abelian continuous symmetry, and are consistent with eventual thermalization at large system sizes and long time scales, suggested by previous studies.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient quantum circuits for Szegedy quantum walks

A major advantage in using Szegedy’s formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm. - Highlights: • A general theoretical framework for implementing Szegedy walks using quantum circuits. • Explicit efficient quantum circuit implementation of the Szegedy walk for several classes of graphs. • Efficient implementation of Szegedy walks for quantum page-ranking of a certain class of graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hydrodynamics of nonintegrable systems from a relaxation-time approximation

We develop a general kinetic theory framework to describe the hydrodynamics of strongly interacting, nonequilibrium quantum systems in which integrability is weakly broken, leaving a few residual conserved quantities. This framework is based on a generalized relaxation-time approximation; it gives a simple, but surprisingly accurate, prescription for computing nonequilibrium transport even in strongly interacting systems. We validate the predictions of this approximation against matrix product operator calculations on chaotic quantum spin chains, finding surprisingly good agreement. Lastly, we show that despite its simplicity, our framework can capture phenomena distinctive to strongly interacting systems, such as widely separated charge and energy diffusion constants.

1-dimensional spin chains↗

Spatiotemporal Crossover between Low- and High-Temperature Dynamical Regimes in the Quantum Heisenberg Magnet

The stranglehold of low temperatures on fascinating quantum phenomena in one-dimensional quantum magnets has been challenged recently by the discovery of anomalous spin transport at high temperatures. Whereas both regimes have been investigated separately, no study has attempted to reconcile them. For instance, the paradigmatic quantum Heisenberg spin-$1/2$ chain falls at low-temperature within the Tomonaga-Luttinger liquid framework, while its high-temperature dynamics is superdiffusive and relates to the Kardar-Parisi-Zhang universality class in $1+1$ dimensions. This work aims at reconciling the two regimes. Building on large-scale matrix product state simulations, we find that they are connected by a temperature-dependent spatiotemporal crossover. In this work, as the temperature $T$ is reduced, we show that the onset of superdiffusion takes place at longer length and time scales $\propto 1/T$. This prediction has direct consequences for experiments including nuclear magnetic resonance: it is consistent with earlier measurements on the nearly ideal Heisenberg $S=1/2$ chain compound Sr$_2$CuO$_3$ yet calls for new and dedicated experiments.

1-dimensional spin chains↗

Numerical Methods for Large-Scale Data Factorization (Final Report (Milestone Date 9/30/11) for Subcontract No. B594099)

The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead of the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.

97 MATHEMATICS AND COMPUTING↗

Time-dependent variational principle for mixed matrix product states in the thermodynamic limit

Here, we describe a time evolution algorithm for quantum spin chains whose Hamiltonians are composed of an infinite uniform left and right bulk part, and an arbitrary finite region in between. The left and right bulk parts are allowed to be different from each other. The algorithm is based on the time-dependent variational principle (TDVP) of matrix product states. It is inversion-free and very simple to adapt from an existing TDVP code for finite systems. The importance of working in the projective Hilbert space is highlighted. We study the quantum Ising model as a benchmark and an illustrative example. The spread of information after a local quench is studied in both the ballistic and the diffusive case. We also offer a derivation of TDVP directly from symplectic geometry.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Finite and infinite matrix product states for Gutzwiller projected mean-field wave functions

Matrix product states (MPS) and “dressed” ground states of quadratic mean fields (e.g., Gutzwiller projected Slater determinants) are both important classes of variational wave functions. This latter class has played important roles in understanding superconductivity and quantum spin liquids. We present a method to obtain both the finite and infinite MPS (iMPS) representation of the ground state of an arbitrary fermionic quadratic mean-field Hamiltonian (which in the simplest case is a Slater determinant and in the most general case is a Pfaffian). We also show how to represent products of such states (e.g., determinants times Pfaffians). From this representation one can project to single occupancy and evaluate the entanglement spectra after Gutzwiller projection. We then obtain the MPS and iMPS representation of Gutzwiller projected mean-field states that arise from the variational slave-fermion approach to the S = 1 bilinear-biquadratic quantum spin chain. To accomplish this, we develop an approach to orthogonalize degenerate iMPS to find all the states in the degenerate ground-state manifold. We find the energies of the MPS and iMPS states match the variational energies closely, indicating the method is accurate and there is minimal loss due to truncation error. We then present an exploration of the entanglement spectra of projected slave-fermion states, exploring their qualitative features and finding good qualitative agreement with the respective exact ground-state spectra found from density matrix renormalization group.

1-dimensional spin chains↗