Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor methods”

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

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

At least 91 records · Page 5

Conservative discretization of the Landau collision integral

Here we describe a density, momentum-, and energy-conserving discretization of the nonlinear Landau collision integral. The method is suitable for both the finite-element and discontinuous Galerkin methods and does not require structured meshes. The conservation laws for the discretization are proven algebraically and demonstrated numerically for an axially symmetric nonlinear relaxation problem using a finite-element implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Determination of optical constants of a biaxially anisotropic film by standard multiangle monochromatic ellipsometry

Possibilities of standard multiangle monochromatic ellipsometry in the determination of parameters of a uniform biaxially anisotropic layer are studied for the case of an arbitrary orientation of the two principal axes in the plane of incidence of the light beam and perpendicularity of the third axis to the plane of incidence. Using numerical simulation, it has been found that the measurement accuracy that is necessary in the determination of all the three principal components of the dielectric permittivity tensor ε and tilt angle of the axes using only angular dependences of ellipsometric parameters must be no worse than 0.0001°, which is far beyond the accuracy limits provided by present-day ellipsometers. If the tilt angle is known, standard multiangle monochromatic ellipsometry provides the determination of thickness and all three principal components of the dielectric permittivity tensor. This method allows one to determine the layer thickness and tensor component for the axis perpendicular to the plane of incidence, as well as the average value of components for the axes lying in the plane of incidence without involving the data about the tilt angle of the axes. This is demonstrated by an example of experimental data for biaxially anisotropic SiO{sub x} films obtained by oblique deposition of silicon monoxide SiO evaporated in vacuum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗

Driven assembly with multiaxial fields: Creating a soft mode in assemblies of anisometric induced dipoles

We show that multiaxial fields can induce time-averaged, noncentrosymmetric interactions between particles having polarization anisotropy, yet the multiaxial field itself does not exert either a force or a torque on an isolated particle. These induced interactions lead to particle assemblies whose energy is strongly dependent on both the translational and orientational degrees of freedom of the system. The situation is similar to a collection of permanent dipoles, but the symmetry of the time-averaged interaction is quite distinct, and the scale of the system energy can be dynamically controlled by the magnitude of the applied multiaxial field. In our paper, the case of polarizable rods is considered in detail, and it is suggested that collections of rods embedded in spheres can be used to create a material with a dynamically tunable magnetic permeability or dielectric permittivity. We report on Monte Carlo simulations performed to investigate the behavior of assemblies of both multiaxial-field induced dipoles and permanent dipoles arranged onto two-dimensional lattices. Lastly, the ground state of the induced dipoles is an orientational soft mode of aligned dipoles, whereas that of the permanent dipoles is a vortex state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Reduced scaling Hilbert space variational Monte Carlo

We show that for both single-Slater-Jastrow and Jastrow geminal power wave functions the formal cost scaling of Hilbert space variational Monte Carlo can be reduced from fifth to fourth order in the system size, thus bringing it in line with the long-standing scaling of its real space counterpart. While traditional quantum chemistry methods can reduce costs related to the two-electron integral tensor through various tensor decomposition methods, we show that such approaches are ineffective in the presence of Hilbert space Jastrow factors. Instead, we develop a simple semi-stochastic approach that can take similar advantage of the near-sparsity of this four-index tensor. Through demonstrations on alkanes of increasing length, we show that accuracy and overall statistical uncertainty are not meaningfully affected and that a total cost crossover is reached as early as 50 electrons when using a minimal basis. Further study will be needed to assess where the crossover occurs in more compact molecular geometries and larger basis sets and to explore how in that context the crossover can be accelerated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient Decision Trees for Tensor Regressions

Here, we proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variables are tensors (i.e., multi-way arrays). We devised and implemented fast randomized and deterministic algorithms for efficient fitting of scalar-on-tensor trees, making TT competitive against tensor-input GP models (Yu, Li, and Liu; Sun et al.). Based on scalar-on-tensor tree models, we extend our method to tensor-on-tensor problems using additive tree ensemble approaches. Theoretical justification and extensive experiments, including testing robustness to entrywise input tensor noise, are provided on real and synthetic datasets to illustrate the performance of TT. Our implementation is provided at https://github.com/hrluo/TensorDecisionTreeRegressor. Supplementary materials for this article are available online.

Decision tree regressions↗

Probing celestial energy and charge correlations through real-time quantum simulations: Insights from the Schwinger model

Motivated by recent developments in the application of light-ray operators (LROs) in high energy physics, we propose a new strategy to study correlation functions of LROs through real-time quantum simulations. We argue that quantum simulators provide an ideal laboratory to explore the properties LROs in lower-dimensional quantum field theories. This is exemplified in the 1 + 1 -d Schwinger model, employing tensor network methods, focusing on the calculation of energy and charge correlators. Despite some challenges in extracting the necessary correlation functions from the lattice, the methodology used can be extended to real quantum devices. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Thermalization at low temperatures via weakly damped multisite baths

We study the thermalization properties of one-dimensional open quantum systems coupled to baths at their boundary. The baths are driven to their thermal states via Lindblad operators, while the system undergoes Hamiltonian dynamics. We specifically consider multisite baths and investigate the extent to which the late-time steady state resembles a Gibbs state at some controllable temperature set by the baths. We study three models: a noninteracting fermion model accessible via free-fermion technology, and two interacting models, the XZ model and the chiral clock model, which are accessible via tensor network methods. We show that, by tuning towards the weak coupling and slow relaxation limits, one can engineer low temperatures in the bulk of the system provided the bath size is big enough. Here, we use this capability to study energy transport in the XZ model at lower temperatures than previously reported. Our work paves the way for future studies of interacting open quantum systems at low temperatures.

1-dimensional spin chains↗

BoBa

BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.

Yao, Jin [Lawrence Livermore National Laboratory (↗

Pairwise connected tensor network representation of path integrals

It has been recently shown how the tensorial nature of real-time path integrals (PIs) involving the Feynman-Vernon influence functional can be utilized with matrix product states, taking advantage of the finite length of the bath-induced memory. Tensor networks (TNs) promise to provide a unified language to express the structure of a PI. A generalized TN specifically incorporating the pairwise interaction structure of the influence functional and its invariance with respect to the average forward-backward position or the sojourn value in the form of the blip representation is derived and implemented. This pairwise connected TNPI (PC-TNPI) is illustrated through applications to typical spin-boson problems and explorations of the differences caused by the exact form of the spectral density. The storage and performance scalings are reported, showing the compactness of the representation and the efficiency of the contraction process. Finally, taking advantage of the compressed representation, the viability of using PC-TNPI for simulating multistate problems is demonstrated. The PC-TNPI structure can be shown to yield other TN algorithms currently in use. Consequently, it should be possible to use it as a starting point for deriving other optimized procedures.

36 MATERIALS SCIENCE↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

Multipartite entanglement measures and quantum criticality from matrix and tensor product states

We compute the multipartite entanglement measures such as the global entanglement of various one- and two-dimensional quantum systems to probe the quantum criticality based on the matrix and tensor product states (MPSs and TPSs). We use the infinite time-evolving block decimation (iTEBD) method to find the ground states numerically in the form of MPSs and TPSs, and then evaluate their entanglement measures by the method of tensor renormalization group (TRG). We find that these entanglement measures can characterize the quantum phase transitions by their derivative discontinuity right at the critical points in all models considered here. We also comment on the scaling behaviors of the entanglement measures by the ideas of quantum-state renormalization group transformations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 Parallel Alternative for Energy-Efficient Neural Network Training and Inferencing

Energy efficiency of training and inferencing with large neural network models is a critical challenge facing the future of sustainable large-scale machine learning workloads. This paper introduces an alternative strategy, called phantom parallelism, to minimize the net energy consumption of traditional tensor (model) parallelism, the most energy-inefficient component of large neural network training. The approach is presented in the context of feed-forward network architectures as a preliminary, but comprehensive, proof-of-principle study of the proposed methodology. We derive new forward and backward propagation operators for phantom parallelism, implement them as custom autograd operations within an end-to-end phantom parallel training pipeline and compare its parallel performance and energy-efficiency against those of conventional tensor parallel training pipelines. Formal analyses that predict lower bandwidth and FLOP counts are presented with supporting empirical results on up to 256 GPUs that corroborate these gains. Experiments are shown to deliver ∼50% reduction in the energy consumed to train FFNs using the proposed phantom parallel approach when compared with conventional tensor parallel methods. Additionally, the proposed approach is shown to train smaller phantom models to the same model loss on smaller GPU counts as larger tensor parallel models on larger GPU counts offering the possibility for even greater energy savings.

Seal, Sudip [ORNL] (ORCID:0000000332330656)↗