Search NASA⌕ Search

SEARCH · Search NASA

Results for “matrix 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 109 records · Page 6

Online Voltage Event Detection Using Synchrophasor Data with Structured Sparsity-Inducing Norms

This paper develops an accurate and computationally efficient data-driven framework to detect voltage events from PMU data streams. It develops an innovative Proximal Bilateral Random Projection (PBRP) algorithm to quickly decompose the PMU data matrix into a low-rank matrix, a row-sparse event-pattern matrix and a noise matrix. Here, the row-sparse pattern matrix significantly distinguishes events from normal behavior. These matrices are then fed into a clustering algorithm to separate voltage events from normal operating conditions. Large-scale numerical study results on real-world PMU data show that the proposed algorithm is computationally more efficient and achieves higher F scores than state-of-the-art benchmarks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Accurate Numerical Simulations Of Chemical Phenomena Involved in Energy Production and Storage with MADNESS and MPQC: ALCF-2 Early Science Program Technical Report

In order to solve the electronic structure of large molecular systems on petascale computers using MADNESS, a numerical tool kit, are required fast and accurate implementations for linear algebra. MADNESS uses multiresolution analysis and low separation rank which translates high dimensional functions in tensor products using Legendre polynomial. The multiple tensor products make to the singular value decomposition and matrix multiplication the most intense operations in MADNESS. This work discusses the interfacing of Eigen3 as a C++ substitute of LAPACK and introduces Elemental for the diagonalization of large matrices. Furthermore, the present paper shows the performance these libraries on Blue Gene/ Q.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Carbon Structure Hazard Control

Carbon composite structures are widely used in virtually all advanced technology industries for a multitude of applications. The high strength-to-weight ratio and resistance to aggressive service environments make them highly desirable. Automotive, aerospace, and petroleum industries extensively use, and will continue to use, this enabling technology. As a result of this broad range of use, field and test personnel are increasingly exposed to hazards associated with these structures. No single published document exists to address the hazards and make recommendations for the hazard controls required for the different exposure possibilities from damaged structures including airborne fibers, fly, and dust. The potential for personnel exposure varies depending on the application or manipulation of the structure. The effect of exposure to carbon hazards is not limited to personnel, protection of electronics and mechanical equipment must be considered as well. The various exposure opportunities defined in this document include pre-manufacturing fly and dust, the cured structure, manufacturing/machining, post-event cleanup, and post-event test and/or evaluation. Hazard control is defined as it is applicable or applied for the specific exposure opportunity. The carbon exposure hazard includes fly, dust, fiber (cured/uncured), and matrix vapor/thermal decomposition products. By using the recommendations in this document, a high level of confidence can be assured for the protection of personnel and equipment.

Yoder, Tommy↗

Biochemical and structural controls on the decomposition dynamics of boreal upland forest moss tissues

Mosses contribute an average of 20 % of boreal upland forest net primary productivity and are frequently observed to degrade slowly compared to vascular plants. If this is caused primarily by the chemical complexity of their tissues, moss decomposition could exhibit high temperature sensitivity (measured as Q 10 ) due to high activation energy, which would imply that soil organic carbon (SOC) stocks derived from moss remains are especially vulnerable to decomposition with warming. Alternatively, the physical structure of the moss cell-wall biochemical matrix could inhibit decomposition, resulting in low decay rates and low temperature sensitivity. We tested these hypotheses by incubating mosses collected from two boreal forests in Newfoundland, Canada, for 959 days at 5°C and 18°C, while monitoring changes in the moss tissue composition using total hydrolyzable amino acid (THAA) analysis and 13 C nuclear magnetic resonance (NMR) spectroscopy. Less than 40 % of C was respired in all incubations, revealing a large pool of apparently recalcitrant C. The decay rate of the labile fraction increased in the warmer treatment, but the total amount of C loss increased only slightly, resulting in low Q 10 values (1.23–1.33) compared to L horizon soils collected from the same forests. NMR spectra were dominated by O-alkyl C throughout the experiment, indicating the persistence of potentially labile C. The accumulation of hydroxyproline (derived primarily from plant cell-wall proteins) and aromatic C indicates the selective preservation of biochemicals associated with the moss cell wall. This was supported by scanning electron microscope (SEM) images of the moss tissues, which revealed few changes in the physical structure of the cell wall after incubation. This suggests that the moss cell-wall matrix protected labile C from microbial decomposition, accounting for the low temperature sensitivity of moss decomposition despite low decay rates. Climate drivers of moss biomass and productivity, therefore, represent a potentially important regulator of boreal forest SOC responses to climate change that needs to be assessed to improve our understanding of carbon–climate feedbacks.

54 ENVIRONMENTAL SCIENCES↗

Counting SO(9) x SU(2) representations in coordinate independent state space of SU(2) matrix theory

We consider decomposition of coordinate independent states into SO(9) x SU(2) representations in SU(2) matrix theory. To see what and how many representations appear in the decomposition, we compute the character, which is given by a trace over the coordinate independent states, and decompose it into the sum of products of SO(9) and SU(2) characters.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Research on the application of a decoupling algorithm for structure analysis

The mathematical theory for decoupling mth-order matrix differential equations is presented. It is shown that the decoupling precedure can be developed from the algebraic theory of matrix polynomials. The role of eigenprojectors and latent projectors in the decoupling process is discussed and the mathematical relationships between eigenvalues, eigenvectors, latent roots, and latent vectors are developed. It is shown that the eigenvectors of the companion form of a matrix contains the latent vectors as a subset. The spectral decomposition of a matrix and the application to differential equations is given.

Denman, E. D.↗

Approaches to optimization of SS/TDMA time slot assignment

Reduction techniques for traffic matrices are explored in some detail. These matrices arise in satellite switched time-division multiple access (SS/TDMA) techniques whereby switching of uplink and downlink beams is required to facilitate interconnectivity of beam zones. A traffic matrix is given to represent that traffic to be transmitted from n uplink beams to n downlink beams within a TDMA frame typically of 1 ms duration. The frame is divided into segments of time and during each segment a portion of the traffic is represented by a switching mode. This time slot assignment is characterized by a mode matrix in which there is not more than a single non-zero entry on each line (row or column) of the matrix. Investigation is confined to decomposition of an n x n traffic matrix by mode matrices with a requirement that the decomposition be 100 percent efficient or, equivalently, that the line(s) in the original traffic matrix whose sum is maximal (called critical line(s)) remain maximal as mode matrices are subtracted throughout the decomposition process. A method of decomposition of an n x n traffic matrix by mode matrices results in a number of steps that is bounded by n(2) - 2n + 2. It is shown that this upper bound exists for an n x n matrix wherein all the lines are maximal (called a quasi doubly stochastic (QDS) matrix) or for an n x n matrix that is completely arbitrary. That is, the fact that no method can exist with a lower upper bound is shown for both QDS and arbitrary matrices, in an elementary and straightforward manner.

Wade, T. O.↗

Analytic techniques for solving the transport equations in electroweak baryogenesis

We develop an efficient method for solving transport equations, particularly in the context of electroweak baryogenesis. It provides fully-analytical results under mild approximations and can also test semi-analytical results, which are applicable in more general cases. Key elements of our method include the reduction of the second-order differential equations to first order, representing the set of coupled equations as a block matrix of the particle densities and their derivatives, identification of zero modes, and block decomposition of the matrix. We apply our method to calculate the baryon asymmetry of the Universe (BAU) in a Standard Model effective field theory framework of complex Yukawa couplings to determine the sensitivity of the resulting BAU to modifications of various model parameters and rates, and to estimate the effect of the commonly-used thin-wall approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On obtaining the forward phase functions of Saturn ring features from radio occultation observations

It is noted that the near-forward scattering functions of particles in Saturn ring features are related to 3.6 cm radio occultation power spectra by a Fredholm integral equation of the first kind. The equation reduces to an algebraic system of equation whose solution by usual inversion techniques (that is, least mean squares) is ruled out by the near singularity of the forward transformation matrix. A combination of constrained linear inversion and a filtering algorithm based on eigenvector decomposition of the matrix reduces the instabilities; this yields derived phase functions valid over the range of zero to about 12 mrad. It is noted that these functions represent the collective forward diffraction lobe of particles greater than about 1 m in radius. Since multiple scattering of the signal is a significant effect, the measured phase functions must be adjusted to obtain the singly scattered component. This single-scattering correction is examined for two physical models, namely the monolayer and the classical discrete random slab; in addition, the fraction of opacity in submeter particles for each model for particular ring features is estimated.

Zebker, H. A.↗

Velocity space degrees of freedom of plasma fluctuations

We present the first measurements of a plasma velocity-space cross-correlation matrix. A singular value decomposition is applied to this inherently Hermitian matrix, and the relation between the eigenmodes and the plasma kinetic fluctuation modes is explored. A generalized wave admittance is introduced for these eigenmodes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Input/output system identification - Learning from repeated experiments

The paper describes three approaches and possible variations for the determination of the Markov parameters for forced response data using general inputs. It is shown that, when the parameters in the solution procedure are bootstrapped, the results can be obtained very efficiently, but the errors propagate throughout all parameters. By arranging the data in a different form and using singular value decomposition, the resulting identified parameters are more accurate, in the least number of successive experiments, at the expense of a large matrix singular value decomposition. When a recursive procedure is employed, the calculations can be performed very efficiently, but the number of repetitions of the experiments is much greater for a given accuracy than for any of the previous approaches. An alternative formulation is proposed to combine the advantages of each of the approaches.

Juang, Jer-Nan↗

Low-energy high-brightness electron beam dynamics based on slice beam matrix method

Preserving the phase space quality has been of crucial importance to high-brightness electron beam transport. Any driving source of beam performance limitations in such a transport system must be carefully examined in order to preserve the beam phase space quality. It is found that in the low beam energy, high bunch charge regime, space charge effect on the charged particle beam evolution can be complicated. It may be insufficient to analyze the beam properties through the envelope or lower order moments for the mere bulk of the beam. In this work we will study the space-charge-dominated, low-energy, high-brightness electron beam dynamics based on the slice beam matrix method. The slice beam matrix method, extended from the existing bulk beam analysis, is applicable to an arbitrary longitudinal bunch distribution and can thus take the nonlinear RF curvature into account. The semi-analytical sliced beam space charge model is constructed and assumes an axisymmetric beam in the presence of perfect conducting cylindrical pipe with circular cross section. We present in this paper the theoretical formulation, starting from single-particle dynamics, space charge field calculation, followed by the moment description of a collection of particles, based on beam sigma matrix and longitudinal slice decomposition. We prove the equivalence between the beam matrix method and the envelope formalism in the presence of space charge effect, in both the transverse and longitudinal dimensions. Two examples are then demonstrated, one for a unit cell of superconducting radio-frequency (RF) cavity and the other for a 1.5-cell RF gun system. The semi-analytical results from beam matrix calculation are discussed and compared with particle tracking simulation using ASTRA. In conclusion, we expect that the analysis based on the slice beam matrix method shall serve as an efficient and advanced tool to further investigate the low-energy high-brightness electron beam dynamics.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multilinear algebra for analyzing data with multiple linkages.

Link analysis typically focuses on a single type of connection, e.g., two journal papers are linked because they are written by the same author. However, often we want to analyze data that has multiple linkages between objects, e.g., two papers may have the same keywords and one may cite the other. The goal of this paper is to show that multilinear algebra provides a tool for multilink analysis. We analyze five years of publication data from journals published by the Society for Industrial and Applied Mathematics. We explore how papers can be grouped in the context of multiple link types using a tensor to represent all the links between them. A PARAFAC decomposition on the resulting tensor yields information similar to the SVD decomposition of a standard adjacency matrix. We show how the PARAFAC decomposition can be used to understand the structure of the document space and define paper-paper similarities based on multiple linkages. Examples are presented where the decomposed tensor data is used to find papers similar to a body of work (e.g., related by topic or similar to a particular author's papers), find related authors using linkages other than explicit co-authorship or citations, distinguish between papers written by different authors with the same name, and predict the journal in which a paper was published.

97 MATHEMATICS AND COMPUTING↗

Factorization-based texture segmentation

This study introduces a factorization-based approach that efficiently segments textured images. We use local spectral histograms as features, and construct an M × N feature matrix using M-dimensional feature vectors in an N-pixel image. Based on the observation that each feature can be approximated by a linear combination of several representative features, we factor the feature matrix into two matrices-one consisting of the representative features and the other containing the weights of representative features at each pixel used for linear combination. The factorization method is based on singular value decomposition and nonnegative matrix factorization. The method uses local spectral histograms to discriminate region appearances in a computationally efficient way and at the same time accurately localizes region boundaries. Finally, the experiments conducted on public segmentation data sets show the promise of this simple yet powerful approach.

97 MATHEMATICS AND COMPUTING↗

Imposing equilibrium on experimental 3-D stress fields using Hodge decomposition and FFT-based optimization

Here, we present a methodology to impose micromechanical constraints, i.e. stress equilibrium at grain and sub-grain scale, to an arbitrary (non-equilibrated) voxelized stress field obtained, for example, by means of synchrotron X-ray diffraction techniques. The method consists in finding the equilibrated stress field closest (in L 2 -norm sense) to the measured non-equilibrated stress field, via the solution of an optimization problem. The extraction of the divergence-free (equilibrated) part of a general (non-equilibrated) field is performed using the Hodge decomposition of a symmetric matrix field, which is the generalization of the Helmholtz decomposition of a vector field into the sum of an irrotational field and a solenoidal field. The combination of: a) the Euler–Lagrange equations that solve the optimization problem, and b) the Hodge decomposition, gives a differential expression that contains the bi-harmonic operator and two times the curl operator acting on the experimental stress field. These high-order derivatives can be efficiently performed in Fourier space. The method is applied to filter the non-equilibrated parts of a synthetic piecewise constant stress fields with a known ground truth, and stress fields in Gum Metal, a beta-Ti-based alloy measured in-situ using Diffraction Contrast Tomography (DCT). In both cases, the largest corrections were obtained near grain boundaries.

36 MATERIALS SCIENCE↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices

In this work, we describe a multilevel preconditioning technique for solving sparse symmetric linear systems of equations. This “Multilevel Schur Low-Rank” (MSLR) preconditioner first builds a tree structure $\mathcal{T}$ based on a hierarchical decomposition of the matrix and then computes an approximate inverse of the original matrix level by level. Unlike classical direct solvers, the construction of the MSLR preconditioner follows a top-down traversal of $\mathcal{T}$ and exploits a low-rank property that is satisfied by the difference between the inverses of the local Schur complements and specific blocks of the original matrix. A few steps of the generalized Lanczos tridiagonalization procedure are applied to capture most of this difference. Numerical results are reported to illustrate the efficiency and robustness of the MSLR preconditioner with both two- and three-dimensional discretized PDE problems and with publicly available test problems.

97 MATHEMATICS AND COMPUTING↗

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 (↗