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 55 records · Page 3

Lowering the Scaling of Self-Consistent Field Methods by Combining Tensor Hypercontraction and a Density Difference Ansatz

We present the tensor hypercontraction difference self-consistent field (SCF) method, an approach that reduces the formal computational scaling of traditional naive self-consistent field methods from 𝑂(𝑁 4 ) to 𝑂(𝑁 3 ) with system size 𝑁. The scaling reduction is achieved by developing a new technique for constructing the tensor hypercontraction decomposition based on the fundamental approximation made in density fitting. Combining this scheme with the difference self-consistent field methodology, we achieve a method that enables 𝑂(𝑁 3 ) scaling SCF calculations with only 𝑂(𝑁 2 ) storage requirements. In conclusion, our proof-of-concept numerical tests demonstrate robust performance with errors in total energies below 8 × 10 –4 E h and with sub 1 kcal/mol errors for relative energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Shifted power method for computing tensor eigenpairs.

Recent work on eigenvalues and eigenvectors for tensors of order m {>=} 3 has been motivated by applications in blind source separation, magnetic resonance imaging, molecular conformation, and more. In this paper, we consider methods for computing real symmetric-tensor eigenpairs of the form Ax{sup m-1} = {lambda}x subject to {parallel}x{parallel} = 1, which is closely related to optimal rank-1 approximation of a symmetric tensor. Our contribution is a novel shifted symmetric higher-order power method (SS-HOPM), which we showis guaranteed to converge to a tensor eigenpair. SS-HOPM can be viewed as a generalization of the power iteration method for matrices or of the symmetric higher-order power method. Additionally, using fixed point analysis, we can characterize exactly which eigenpairs can and cannot be found by the method. Numerical examples are presented, including examples from an extension of the method to fnding complex eigenpairs.

97 MATHEMATICS AND COMPUTING↗

Shifted power method for computing tensor eigenvalues.

Recent work on eigenvalues and eigenvectors for tensors of order m >= 3 has been motivated by applications in blind source separation, magnetic resonance imaging, molecular conformation, and more. In this paper, we consider methods for computing real symmetric-tensor eigenpairs of the form Ax{sup m-1} = lambda x subject to ||x||=1, which is closely related to optimal rank-1 approximation of a symmetric tensor. Our contribution is a shifted symmetric higher-order power method (SS-HOPM), which we show is guaranteed to converge to a tensor eigenpair. SS-HOPM can be viewed as a generalization of the power iteration method for matrices or of the symmetric higher-order power method. Additionally, using fixed point analysis, we can characterize exactly which eigenpairs can and cannot be found by the method. Numerical examples are presented, including examples from an extension of the method to finding complex eigenpairs.

99 GENERAL AND MISCELLANEOUS↗

Tensor Text-Mining Methods for Malware Identification and Detection, Malware Dynamics Characterization, and Hosts Ranking

Malware is one of the most persistent and costly cyber threats endangering reputation, confidentiality, integrity, and availability for organizations and national security. Consequently, many of the incident detection and prevention systems, and incident responders have begun to utilize machine learning as a helper in the fight against malware and other cyber threats. However, cyber defenders rely on interpretability and generalizability, yet the popular machine learning methods are black-box and often use traditional supervised solutions that do not generalize to novel malware. Therefore, there is a need to improve the existing solutions. At the same time, the majority of the prior research ignored essential evaluation criteria when reporting the results of their methods, which disables the safe reproducibility of the methods in a production environment. Tensor decomposition, on the other hand, enables interpretable unsupervised analysis of the large-scale data for the discovery of hidden patterns. Our findings, performed on real-world and large-scale experiments, show that tensor factorization-based methods yield performance results that surpasses or competes with existing supervised solutions with the added benefit of interpretability and generalizability. With the ability to analyze complex and large-scale data using tensors, we report results that reflect real-world production environments. We propose to develop new game- changing tools for malware identification and characterization that can trace malware evolution, rank the infected or malicious hosts, and streamline the work of incident response teams, malware analysts, and incident detection and prevention systems.

97 MATHEMATICS AND COMPUTING↗

TH-E-17A-02: High-Pitch and Sparse-View Helical 4D CT Via Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: 4D CT is routinely performed during radiation therapy treatment planning of thoracic and abdominal cancers. Compared with the cine mode, the helical mode is advantageous in temporal resolution. However, a low pitch (∼0.1) for 4D CT imaging is often required instead of the standard pitch (∼1) for static imaging, since standard image reconstruction based on analytic method requires the low-pitch scanning in order to satisfy the data sufficient condition when reconstructing each temporal frame individually. In comparison, the flexible iterative method enables the reconstruction of all temporal frames simultaneously, so that the image similarity among frames can be utilized to possibly perform high-pitch and sparse-view helical 4D CT imaging. The purpose of this work is to investigate such an exciting possibility for faster imaging with lower dose. Methods: A key for highpitch and sparse-view helical 4D CT imaging is the simultaneous reconstruction of all temporal frames using the prior that temporal frames are continuous along the temporal direction. In this work, such a prior is regularized through the sparsity transform based on spatiotemporal tensor framelet (TF) as a multilevel and high-order extension of total variation transform. Moreover, GPU-based fast parallel computing of X-ray transform and its adjoint together with split Bregman method is utilized for solving the 4D image reconstruction problem efficiently and accurately. Results: The simulation studies based on 4D NCAT phantoms were performed with various pitches (i.e., 0.1, 0.2, 0.5, and 1) and sparse views (i.e., 400 views per rotation instead of standard >2000 views per rotation), using 3D iterative individual reconstruction method based on 3D TF and 4D iterative simultaneous reconstruction method based on 4D TF respectively. Conclusion: The proposed TF-based simultaneous 4D image reconstruction method enables high-pitch and sparse-view helical 4D CT with lower dose and faster speed.

60 APPLIED LIFE SCIENCES↗

The tensor-train stochastic finite volume method for uncertainty quantification

The stochastic finite volume method offers an efficient one-pass approach for assessing uncertainty in hyperbolic conservation laws. Still, it struggles with the curse of dimensionality when dealing with multiple stochastic variables. Here, we introduce the stochastic finite volume method within the tensor-train framework to counteract this limitation. This integration, however, comes with its own set of difficulties, mainly due to the propensity for shock formation in hyperbolic systems. To overcome these issues, we have developed a tensor-train-adapted stochastic finite volume method that employs a global WENO reconstruction, making it suitable for such complex systems. This approach represents the first step in designing tensor-train techniques for hyperbolic systems and conservation laws involving shocks.

97 MATHEMATICS AND COMPUTING↗

Tensor optimized Fermi sphere method for nuclear matter—Power series correlated wave function and a cluster expansion

A new formalism, called “tensor optimized Fermi sphere (TOFS) method”, is developed to treat the nuclear matter using a bare interaction among nucleons. In this method, the correlated nuclear matter wave function is taken to be a power series type, Ψ{sub N}=[∑{sub n=0}{sup N}(1∕n!)F{sup n}]Φ{sub 0} and an exponential type, Ψ{sub ex}=exp(F)Φ{sub 0}, with the uncorrelated Fermi-gas wave function Φ{sub 0}, where the correlation operator F can induce central, spin–isospin, tensor, etc. correlations, and Ψ{sub ex} corresponds to a limiting case of Ψ{sub N} (N→∞). In the TOFS formalism based on Hermitian form, it is shown that the energy per particle in nuclear matter with Ψ{sub ex} can be expressed in terms of a linked-cluster expansion. On the basis of these results, we present the formula of the energy per particle in nuclear matter with Ψ{sub N}. We call the Nth-order TOFS calculation for evaluating the energy with Ψ{sub N}, where the correlation functions are optimally determined in the variation of the energy. The TOFS theory is applied for the study of symmetric nuclear matter using a central NN potential with short-range repulsion. The calculated results are fairly consistent to those of other theories such as the Brueckner–Hartree–Fock approach etc.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improved coarse-graining methods for two dimensional tensor networks including fermions

We show how to apply renormalization group algorithms incorporating entanglement filtering methods and a loop optimization to a tensor network which includes Grassmann variables which represent fermions in an underlying lattice field theory. As a numerical test a variety of quantities are calculated for two dimensional Wilson-Majorana fermions and for the two flavor Gross-Neveu model. The improved algorithms show much better accuracy for quantities such as the free energy and the determination of Fisher’s zeros.

Phase transitions↗

Tensor network study of the m = 1/2 magnetization plateau in the Shastry-Sutherland model at finite temperature

The two-dimensional infinite projected entangled pair state tensor network is evolved in imaginary time with the full update (FU) algorithm to simulate the Shastry-Sutherland model in a magnetic field at finite temperature directly in the thermodynamic limit. We focus on the phase transition into the m = 1/2 magnetization plateau, which was observed in experiments on SrCu 2 (BO 3 ) 2 . For the largest simulated bond dimension, the early evolution in the high-temperature regime is simulated with the simple update (SU) scheme and then, as the correlation length increases, continued with the FU scheme towards the critical regime. We apply a small symmetry-breaking bias field and then extrapolate towards zero bias using a simple scaling theory in the bias field. The combined SU + FU scheme provides an accurate estimate of the critical temperature, even though the results could not be fully converged in the bond dimension in the vicinity of the transition. Here, the critical temperature estimate is improved with a generalized scaling theory that combines two divergent length scales: One due to the bias, and the other due to the finite bond dimension. The obtained results are consistent with the transition being in the universality class of the two-dimensional classical Ising model. The estimated critical temperature is 3.5(2) K, which is well above the temperature 2.1 K used in the experiments.

2-dimensional systems↗