Search NASA⌕ Search

SEARCH · Search NASA

Results for “tensor decomposition”

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

Stress Dependency of Brittle Creep in Granite: Insights into Source Mechanisms and Parameters

Creep in rocks refers to the gradual deformation of rock material over time under the influence of constant stress. Characterizing these deformations is of great importance for engineering design, geotechnical assessment, mining operations, geological studies, and understanding natural hazards. While laboratory experiments and a variety of numerical approaches have offered explanations for microcrack interaction and damage accumulation under the three stages of creep (primary, secondary and tertiary) in conventional creep experiments, the micromechanisms of the fractures produced in brittle creep and its dependency on the applied stress have not been explored in detail. The present study focused on investigating the fracturing mechanisms that occur during creep-induced fracturing at different stress levels and estimation of the source parameters and energy budget components. A series of uniaxial compression creep experiments have been conducted at different stress level ratios (70%, 75%, 80% and 85%), to the unconfined compressive strength (UCS) of double-flawed Barre granite specimen. Creep measurements were complemented with the Acoustic Emission (AE) measurements. The creep-induced fractures were classified into double-couple (DC), compensated linear vector dipole (CLVD) and isotropic (ISO) components using the AE moment tensor decomposition technique. The results show that non-double-couple sources dominated during creep at all the specified stress levels; however, their proportions decreased as the stress level was increased. The source parameters estimation indicated a significant increase in the magnitude of the events and the radiated seismic energy with increasing levels of stress and a slight increase in the evaluated source radius and stress drop with increasing stress levels. Furthermore, this study contributes to the existing knowledge of creep-induced fracturing by providing insights into the fracturing mechanisms and the radiated seismic energy produced, which can be helpful for the development of improved models and strategies for rock engineering and geoscience applications.

58 GEOSCIENCES↗

Gradient flow based phase-field modeling using separable neural networks

Allen–Cahn equation is a reaction–diffusion equation and is widely used for modeling phase separation. Machine learning methods for solving the Allen–Cahn equation in its strong form suffer from inaccuracies in collocation techniques, errors in computing higher-order spatial derivatives, and the large system size required by the space–time approach. To overcome these challenges, we propose solving the gradient flow of the Ginzburg–Landau free energy functional, which is equivalent to the Allen–Cahn equation, thereby avoiding the second-order spatial derivatives associated with the Allen–Cahn equation. A minimizing movement scheme is employed to solve the gradient flow problem, eliminating the complexities of a space–time approach. We utilize a separable neural network that efficiently represents the phase field through low-rank tensor decomposition. As we use the minimizing movement scheme to numerically solve the gradient flow problem, we thus, refer to the proposed method as the Separable Deep Minimizing Movement (SDMM) method. The evaluation of the functional in the minimizing movement scheme using the Gauss quadrature technique bypasses the inaccuracies associated with collocation techniques traditionally used to solve partial differential equations. A hyperbolic tangent transformation is introduced on the phase field prior to the evaluation of the functional to ensure that it remains strictly bounded within the values of the two phases. For this transformation, theoretical guarantee for energy stability of the minimizing movement scheme is established. Our results suggest that this transformation helps to improve the accuracy and efficiency significantly. The proposed method resolves the challenges faced by state-of-the-art machine learning techniques, outperforming them in both accuracy and efficiency. It is also the first machine learning method to achieve an order of magnitude speed improvement over the finite element method. In addition to its formulation and computational implementation, several case studies illustrate the applicability of the proposed method.

42 ENGINEERING↗

Perturbations of nested branes with induced gravity

We study the behaviour of weak gravitational fields in models where a 4D brane is embedded inside a 5D brane equipped with induced gravity, which in turn is embedded in a 6D spacetime. We consider a specific regularization of the branes internal structures where the 5D brane can be considered thin with respect to the 4D one. We find exact solutions corresponding to pure tension source configurations on the thick 4D brane, and study perturbations at first order around these background solutions. To perform the perturbative analysis, we adopt a bulk-based approach and we express the equations in terms of gauge invariant and master variables using a 4D scalar-vector-tensor decomposition. We then propose an ansatz on the behaviour of the perturbation fields when the thickness of the 4D brane goes to zero, which corresponds to configurations where gravity remains finite everywhere in the thin limit of the 4D brane. We study the equations of motion using this ansatz, and show that they give rise to a consistent set of differential equations in the thin limit, from which the details of the internal structure of the 4D brane disappear. We conclude that the thin limit of the ''ribbon'' 4D brane inside the (already thin) 5D brane is well defined (at least when considering first order perturbations around pure tension configurations), and that the gravitational field on the 4D brane remains finite in the thin limit. We comment on the crucial role of the induced gravity term on the 5D brane.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The critical tension in the Cascading DGP model

We study the behaviour of weak gravitational fields in the 6D Cascading DGP model using a bulk-based approach. To deal with the ambiguity in the thin limit of branes of codimension higher than one, we consider a specific regularization of the internal structure of the branes where the 5D brane can be considered thin with respect to the 4D one. We consider the solutions corresponding to pure tension sources on the 4D brane, and study perturbations at first order around these background solutions. We adopt a 4D scalar-vector-tensor decomposition, and focus on the scalar sector of perturbations. We show that, in a suitable 4D limit, the trace part of the 4D metric perturbations obeys a decoupled equation which suggests that it is a ghost for background tensions smaller than a critical tension, while it is a healthy field otherwise. We give a geometrical interpretation of the existence of the critical tension and of the reason why the relevant field is a ghost or not depending on the background tension. We however find a value of the critical tension which is different from the one already found in the literature. Differently from the results in the literature, our analysis implies that, choosing the background tension suitably, we can construct ghost-free models for any value of the free parameters of the theory. We suggest that the difference lies in the procedure used to evaluate the pillbox integration across the codimension-2 brane. We confirm the validity of our analysis by performing numerically the integration in a particular case where the solution inside the thick cod-2 brane is known exactly. We stress that the singular structure of the perturbation fields in the nested branes set-ups is very subtle, and that great care has to be taken when deriving the codimension-2 junction conditions.

79 ASTRONOMY AND ASTROPHYSICS↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

Taking control of compressible modes: bulk viscosity and the turbulent dynamo

Many polyatomic astrophysical plasmas are compressible and out of chemical and thermal equilibrium, introducing a bulk viscosity into the plasma via the internal degrees of freedom of the molecular composition, directly impacting the decay of compressible modes, $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$. This is especially important for small-scale, turbulent dynamo processes in the interstellar medium (ISM), which are known to be sensitive to the effects of compression. To control the viscous properties of $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$, we perform trans-sonic, visco-resistive dynamo simulations with additional bulk viscosity $\nu _{\text{bulk}}$, deriving a new $\nu _{\text{bulk}}$ Reynolds number $\text{Re}_{\text{bulk}}$, and viscous Prandtl number $\text{P}\nu \equiv \text{Re}_{\text{bulk}}/ \text{Re}_{\text{shear}}$, where $\text{Re}_{\text{shear}}$ is the shear viscosity Reynolds number. We derive a framework for decomposing $E_{\rm mag}$ growth rates into incompressible and compressible terms via orthogonal tensor decompositions of $\boldsymbol {\nabla }\otimes \mathrm{{\boldsymbol {\mathit {v}}}}$, where $\mathrm{{\boldsymbol {\mathit {v}}}}$ is the fluid velocity. We find that $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ play a dual role, growing and decaying $E_{\rm mag}$, and that field-line stretching is the main driver of growth, even in compressible dynamos. In the absence of $\nu _{\text{bulk}}$ ($\text{P}\nu \rightarrow \infty$), $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ pile up on small-scales, creating a spectral bottleneck, which disappears for $\text{P}\nu \approx 1$. As $\text{P}\nu$ decreases, $\mathrm{{\boldsymbol {\mathit {v}}}}_{\parallel }(\boldsymbol {k})$ are dissipated at increasingly larger scales, in turn suppressing incompressible modes through a coupling between high-k modes. We emphasize the importance of further understanding the role of $\nu _{\text{bulk}}$ in compressible astrophysical plasmas, which we estimate could be as strong as the shear viscosity in the cold ISM, and highlight that compressible direct numerical simulations without bulk viscosity have unresolved compressible mode dissipation scales.

MHD↗

Effective interactions in the s d shell

We perform here a quantitative study of the microscopic effective shell-model interactions in the valence sd shell, obtained from modern nucleon-nucleon potentials, chiral N3LO, JISP16 and Daejeon16, using No-Core Shell-Model wave functions and the Okubo-Lee-Suzuki transformation. We investigate the monopole properties of those interactions in comparison with the phenomenological universal sd-shell interaction, USDB. Theoretical binding energies and low-energy spectra of O isotopes and of selected sd-shell nuclei, are presented. We conclude that there is a noticeable improvement in the quality of the effective interaction when it is derived from the Daejeon16 potential. We show that its proton-neutron centroids are consistent with those from USDB. We then propose monopole modifications of the Daejeon16 centroids in order to provide an adjusted interaction yielding significantly improved agreement with the experiment. A spin-tensor decomposition of two-body effective interactions is applied in order to extract more information on the structure of the centroids and to understand the reason for deficiencies arising from our current theoretical approximations. The concern of the possible role of the three-nucleon forces is addressed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

New shell closure for neutron-rich Sn isotopes

The variation of E(2{sub 1}{sup +}) of {sup 134-140}Sn calculated with empirical SMPN interaction has striking similarity with that of experimental E(2{sub 1}{sup +}) of even-even {sup 18-22}O and {sup 42-48}Ca, showing clearly that N=84-88 spectra exhibit the effect of gradually filling up the nu(2f{sub 7/2}) orbital, which finally culminates in a new shell closure at N=90. Realistic two-body interaction CWG does not show this feature. Spin-tensor decomposition of SMPN and CWG interactions and variations of their components with valence neutron number reveals that the origin of the shell closure at {sup 140}Sn lies in the three-body effects. Calculations with CWG3M, which is obtained by including a simple three-body monopole term in the CWG interaction, predict decreasing E(2{sub 1}{sup +}) for {sup 136,138}Sn and a shell closure at {sup 140}Sn.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Partial Dynamical Symmetry in Quantum Hamiltonians with Higher-Order Terms

A generic procedure is proposed to construct many-body quantum Hamiltonians with partial dynamical symmetry. It is based on a tensor decomposition of the Hamiltonian and allows the construction of a hierarchy of interactions that have selected classes of solvable states. The method is illustrated in the SO(6) limit of the interacting boson model of atomic nuclei and applied to the nucleus {sup 196}Pt.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗

Elliptically-Contoured Tensor-variate Distributions with Application to Image Learning

Statistical analysis of tensor-valued data has largely used the tensor-variate normal (TVN) distribution that may be inadequate for data arising from distributions with heavier or lighter tails. We study a general family of elliptically contoured (EC) TV distributions and derive its characterizations, moments, marginal, and conditional distributions. We describe procedures for maximum likelihood estimation from data that are (1) uncorrelated draws from an EC distribution, (2) from a scale mixture of the TVN distribution, and (3) from an underlying but unknown EC distribution, for which we extend Tyler’s robust estimator. A detailed simulation study highlights the benefits of choosing an EC distribution over the TVN for heavier-tailed data. We develop TV classification rules using discriminant analysis and EC errors and show that they better predict cats and dogs from images in the Animal Faces-HQ dataset than the TVN-based rules. A novel tensor-on-tensor regression and TV analysis of variance (TANOVA) framework under EC errors is also demonstrated to better characterize gender, age, and ethnic origin than the usual TVN-based TANOVA in the celebrated labeled faces of the wild dataset.

97 MATHEMATICS AND COMPUTING↗

Poblano v 1.0

Poblano is a Matlab toolbox of large-scale algorithms for nonlinear optimization. The algorithms in Poblano require only first-order derivative information (e.g., gradients for scalar-valued objective functions), and therefore can scale to very large problems [6].Poblano is a set of general purpose methods for solving unconstrained nonlinear optimization methods. It has been applied to standard test problems covering a range of application areas. The driving application for Poblano development has been tensor decompositions in data analysis applications (bibliometric analysis, social network analysis, chemometrics, etc.) [1].

Dunlavy, Daniel↗

ENSIGN

ENSIGN is a data analytics software package offering a modern unsupervised machine learning solution for scalable discovery in Big Data. The analytics in ENSIGN are based on an advanced mathematical tool called tensor decomposition and they are optimized to run efficiently on a range of computing platforms (from small multicore Desktop platforms to large Supercomputing clusters and novel high-end memory-driven computing platforms such as HPE Superdome Flex). ENSIGN enables the user to extract deep insights from the entirety of massive-scale (100s of Gigabytes or Terabytes scale) multidimensional data. ENSIGN uncovers latent patterns in data without the user having to specify or describe what the patterns are; the user, in the first place, may not even know such patterns existed and that they have to look for such patterns. The insights gained from ENSIGN could be trailheads that can be used as starting points for deeper forensic investigation.

Baskaran, Muthu↗

ENSIGN

ENSIGN is a data analytics software package offering a modern unsupervised machine learning solution for scalable discovery in Big Data. The analytics in ENSIGN are based on an advanced mathematical tool called tensor decomposition and they are optimized to run efficiently on a range of computing platforms (from small multicore Desktop platforms to large Supercomputing clusters and novel high-end memory-driven computing platforms such as HPE Superdome Flex). ENSIGN enables the user to extract deep insights from the entirety of massive-scale (100s of Gigabytes or Terabytes scale) multidimensional data. ENSIGN uncovers latent patterns in data without the user having to specify or describe what the patterns are; the user, in the first place, may not even know such patterns existed and that they have to look for such patterns. The insights gained from ENSIGN could be trailheads that can be used as starting points for deeper forensic investigation.

Baskaran, Muthu↗

AdversarialTensors

This library builds a framework for defending ML models against adversarial attacks. The library will be developed at various stages leading to publication and software release at each stage. We employ tensor decomposition strategies as preprocessing stages for the first stage to provide robustness against the prominent adversarial noise. In the second stage, we develop a latent noise generator capable of generating novel adversarial noise that threatens the existing state-of-the-art defense strategy. In the third stage, we develop a UNSUP-GAN model, where the generator is trained to denoise against latent noise and most adversarial noises. This generator can provide a robust adversarial attack against any unseen attack.

Bhattarai, Manish↗

Reducing Computation and Communication in Scientific Computing: Connecting Theory to Practice.

This report summarizes the work produced as part of a Truman Fellowship appointment and its associated LDRD project. The overall goal of the project was to develop better algorithms and implementations for key computational kernels within the field of scientific computing by designing them to be communication efficient, moving as little data as possible. The primary problem of interest was dense matrix multiplication; other computations that were addressed include sparse matrix-matrix multiplication, QR factorization, solving symmetric linear systems, and the symmetric eigendecomposition. The project also involved the study of computations at the intersection of scientific computing and data analysis, including nonnegative matrix factorization for discovering latent factors, Tucker tensor decomposition for data compression, and sampling methods for similarity search.

97 MATHEMATICS AND COMPUTING↗

General-Purpose Bayesian Tensor Learning With Automatic Rank Determination and Uncertainty Quantification

A major challenge in many machine learning tasks is that the model expressive power depends on model size. Low-rank tensor methods are an efficient tool for handling the curse of dimensionality in many large-scale machine learning models. The major challenges in training a tensor learning model include how to process the high-volume data, how to determine the tensor rank automatically, and how to estimate the uncertainty of the results. While existing tensor learning focuses on a specific task, this paper proposes a generic Bayesian framework that can be employed to solve a broad class of tensor learning problems such as tensor completion, tensor regression, and tensorized neural networks. We develop a low-rank tensor prior for automatic rank determination in nonlinear problems. Our method is implemented with both stochastic gradient Hamiltonian Monte Carlo (SGHMC) and Stein Variational Gradient Descent (SVGD). We compare the automatic rank determination and uncertainty quantification of these two solvers. We demonstrate that our proposed method can determine the tensor rank automatically and can quantify the uncertainty of the obtained results. We validate our framework on tensor completion tasks and tensorized neural network training tasks.

Bayesian inference↗