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 343 records · Page 19

Precipitation in a Cu–Cr–Zr–Mg alloy during aging

The precipitation processes in a Cu-0.69Cr-0.10Zr-0.02Mg alloy aged at 450 °C and 550 °C have been investigated by transmission electron microscopy and high resolution transmission electron microscopy. The precipitation sequence in this alloy aged at 450 °C is: supersaturated solid solution → Guinier–Preston zone (fcc Cr-rich phase) → ordered fcc Cr-rich phase → ordered bcc Cr-rich phase. The precipitation sequence in this alloy aged at 550 °C is: supersaturated solid solution → ordered fcc Cr-rich phase → ordered bcc Cr-rich phase. In the evolution of decomposition, the orientation relationship between the precipitates and the Cu matrix changes from cube-on-cube to Nishiyama–Wassermann orientation. The ordering of Cr-rich precipitates facilitates the formation of the bcc precipitates and promotes the development of Nishiyama–Wassermann orientation. - Highlights: • Two different precipitation sequences in the Cu–Cr–Zr–Mg alloy are proposed. • The changes in orientation relationship of the precipitates are presented. • The roles of ordering and coherent interface of the precipitates are discussed.

36 MATERIALS SCIENCE↗

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

Modeling Personnel Turnover in the Parametric Organization

A primary issue in organizing a new parametric cost analysis function is to determine the skill mix and number of personnel required. The skill mix can be obtained by a functional decomposition of the tasks required within the organization and a matrixed correlation with educational or experience backgrounds. The number of personnel is a function of the skills required to cover all tasks, personnel skill background and cross training, the intensity of the workload for each task, migration through various tasks by personnel along a career path, personnel hiring limitations imposed by management and the applicant marketplace, personnel training limitations imposed by management and personnel capability, and the rate at which personnel leave the organization for whatever reason. Faced with the task of relating all of these organizational facets in order to grow a parametric cost analysis (PCA) organization from scratch, it was decided that a dynamic model was required in order to account for the obvious dynamics of the forming organization. The challenge was to create such a simple model which would be credible during all phases of organizational development. The model development process was broken down into the activities of determining the tasks required for PCA, determining the skills required for each PCA task, determining the skills available in the applicant marketplace, determining the structure of the dynamic model, implementing the dynamic model, and testing the dynamic model.

Dean, Edwin B.↗

Classification of subsurface objects using singular values derived from signal frames

The classification system represents a detected object with a feature vector derived from the return signals acquired by an array of N transceivers operating in multistatic mode. The classification system generates the feature vector by transforming the real-valued return signals into complex-valued spectra, using, for example, a Fast Fourier Transform. The classification system then generates a feature vector of singular values for each user-designated spectral sub-band by applying a singular value decomposition (SVD) to the N.times.N square complex-valued matrix formed from sub-band samples associated with all possible transmitter-receiver pairs. The resulting feature vector of singular values may be transformed into a feature vector of singular value likelihoods and then subjected to a multi-category linear or neural network classifier for object classification.

97 MATHEMATICS AND COMPUTING↗

New tools for the systematic analysis and visualization of electronic excitations. I. Formalism

A variety of density matrix based methods for the analysis and visualization of electronic excitations are discussed and their implementation within the framework of the algebraic diagrammatic construction of the polarization propagator is reported. Their mathematical expressions are given and an extensive phenomenological discussion is provided to aid the interpretation of the results. Starting from several standard procedures, e.g., population analysis, natural orbital decomposition, and density plotting, we proceed to more advanced concepts of natural transition orbitals and attachment/detachment densities. In addition, special focus is laid on information coded in the transition density matrix and its phenomenological analysis in terms of an electron-hole picture. Taking advantage of both the orbital and real space representations of the density matrices, the physical information in these analysis methods is outlined, and similarities and differences between the approaches are highlighted. Moreover, new analysis tools for excited states are introduced including state averaged natural transition orbitals, which give a compact description of a number of states simultaneously, and natural difference orbitals (defined as the eigenvectors of the difference density matrix), which reveal details about orbital relaxation effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Polyimide/metal composite films via in situ decomposition of inorganic additives - Soluble polyimide versus polyimide precursor

Polyimide-metal oxide (Co3O4 or CuO) composite films have been prepared via in situ thermal decomposition of cobalt (II) chloride or bis(trifluoroacetylacetonato)copper(II). A soluble polyimide (XU-218) and its corresponding prepolymer (polyamide acid) were individually employed as the reaction matrix. The resulting composites exhibited a greater metal oxide concentration at the air interface with polyamide acid as the reaction matrix. The water of imidization that is released during the concurrent polyamide acid cure and additive decomposition is believed to promote metal migration and oxide formation. In contrast, XU-218 doped with either HAuCl4.3H2O or AgNO3 yields surface gold or silver when thermolyzed (300 C).

Rancourt, J. D.↗

On the eigenvalue and eigenvector derivatives of a general matrix

The existence of differentiable eigenvalues and eigenvectors for a general matrix is addressed. The eigenspace which contains differentiable eigenvectors is determined and computed by using the concept of subspace intersection in conjunction with the singular value decomposition algorithm. The differentiable eigenvectors associated with repeated eigenvalues should be simultaneously the eigenvectors of the general matrix and its corresponding sensitivity matrix. Furthermore, the derivatives for differentiable eigenvectors associated with repeated eigenvalues can be computed using higher order derivatives of the matrix, whereas the corresponding eigenvalue derivatives are the eigenvalues of the sensitivity matrix.

Juang, Jer-Nan↗

The Origin of Magnetite Crystals in ALH84001 Carbonate Disks

Martian meteorite ALH84001 preserves evidence of interaction with aqueous fluids while on Mars in the form of microscopic carbonate disks believed to have formed approx 3.9 Ga ago at beginning of the Noachian epoch. Intimately associated within and throughout these carbonate disks are nanocrystal magnetites (Fe3O4) with unusual chemical and physical properties, whose origins have become the source of considerable debate. One group of hypotheses argues that these magnetites are the product of partial thermal decomposition of the host carbonate. Alternatively, the origins of magnetite and carbonate may be unrelated; that is, from the perspective of the carbonate the magnetite is allochthonous. We have sought to resolve between these hypotheses through the detailed characterized of the compositional and structural relationships between the carbonate disks, their associated magnetites and the orthopyroxene matrix in which they are embedded. Comparison of these results with experimental thermal decomposition studies of sideritic carbonates conducted under a range of heating scenarios suggests that the magnetite nanocrystals in the ALH84001 carbonate disks are not the products of thermal decomposition.

Thomas-Keprta, K. L.↗

Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods in Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.

97 MATHEMATICS AND COMPUTING↗

Sparse Regression as a Sparse Eigenvalue Problem

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Exact Sparse Least Squares (ESLS)↗

Three dimensional empirical mode decomposition analysis apparatus, method and article manufacture

An apparatus and method of analysis for three-dimensional (3D) physical phenomena. The physical phenomena may include any varying 3D phenomena such as time varying polar ice flows. A repesentation of the 3D phenomena is passed through a Hilbert transform to convert the data into complex form. A spatial variable is separated from the complex representation by producing a time based covariance matrix. The temporal parts of the principal components are produced by applying Singular Value Decomposition (SVD). Based on the rapidity with which the eigenvalues decay, the first 3-10 complex principal components (CPC) are selected for Empirical Mode Decomposition into intrinsic modes. The intrinsic modes produced are filtered in order to reconstruct the spatial part of the CPC. Finally, a filtered time series may be reconstructed from the first 3-10 filtered complex principal components.

Gloersen, Per↗

Mechanisms of radiation-induced segregation in CrFeCoNi-based single-phase concentrated solid solution alloys

Single-phase concentrated solid solution alloys have attracted wide interest due to their superior mechanical properties and enhanced radiation tolerance, which make them promising candidates for the structural applications in next-generation nuclear reactors. However, little has been understood about the intrinsic stability of their as-synthesized, high-entropy configurations against radiation damage. In this paper, we report the element segregation in CrFeCoNi, CrFeCoNiMn, and CrFeCoNiPd equiatomic alloys when subjected to 1250 kV electron irradiations at 400 °C up to a damage level of 1 displacement per atom. Cr/Fe/Mn/Pd can deplete and Co/Ni can accumulate at radiation-induced dislocation loops, while the actively segregating elements are alloy-specific. Moreover, electron-irradiated matrix of CrFeCoNiMn and CrFeCoNiPd shows L1 0 (NiMn)-type ordering decomposition and <001>-oriented spinodal decomposition between Co/Ni and Pd, respectively. Finally, these findings are rationalized based on the atomic size difference and enthalpy of mixing between the alloying elements, and identify a new important requirement to the design of radiation-tolerant alloys through modification of the composition.

36 MATERIALS SCIENCE↗

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗

Reduced-order Kalman filtering with incomplete observability

Kalman filtering is considered with reference to linear stochastic dynamic systems without complete observability. It is shown that the canonical decomposition theorem can be extended to the stochastic case and the matrix Riccati equation of the Kalman filter is order-reducible if some states are not observable. The inclusion of unobservable states in Kalman filtering makes the unobservable states 'asymptotically' observable in the filter if these unobservable states are dynamically connected to observable states and asymptotically stable. The reduced-order Kalman filter saves computation time when compared to the conventional Kalman filter.

Yonezawa, K.↗

On realizations of least-squares estimation and Kalman filtering by systolic arrays

Least-squares (LS) estimation is a basic operation in many signal processing problems. Given y = Ax + v, where A is a m x n coefficient matrix, y is a m x 1 observation vector, and v is a m x 1 zero mean white noise vector, a simple least-squares solution is finding the estimated vector x which minimizes the norm of /Ax-y/. It is well known that for an ill-conditioned matrix A, solving least-squares problems by orthogonal triangular (QR) decomposition and back substitution has robust numerical properties under finite word length effect since 2-norm is preserved. Many fast algorithms have been proposed and applied to systolic arrays. Gentleman-Kung (1981) first presented the trianglular systolic array for a basic Givens reduction. McWhirter (1983) used this array structure to find the least-squares estimation errors. Then by geometric approach, several different systolic array realizations of the recursive least-squares estimation algorithms of Lee et al (1981) were derived by Kalson-Yao (1985). Basic QR decomposition algorithms are considered in this paper and it is found that under a one-row time updating situation, the Householder transformation degenerates to a simple Givens reduction. Next, an improved least-squares estimation algorithm is derived by considering a modified version of fast Givens reduction. From this approach, the basic relationship between Givens reduction and Modified-Gram-Schmidt transformation can easily be understood. This improved algorithm also has simpler computational and inter-cell connection complexities while compared with other known least-squares algorithms and is more realistic for systolic array implementation.

Chen, M. J.↗

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m greater than or equal to n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I.↗

New Insights into the Origin of Magnetite Crystals in ALH84001 Carbonate Disks

Martian meteorite ALH84001 preserves evidence of interaction with aqueous fluids while on Mars in the form of microscopic carbonate disks believed to have formed approx.3.9 Ga ago at beginning of the Noachian epoch. Intimately associated within and throughout these carbonate disks are nanocrystal magnetites (Fe3O4) with unusual chemical and physical properties, whose ori gins have become the source of considerable debate. One group of hypotheses argues that these magnetites are the product of partial thermal decomposition of the host carbonate. Alternatively, the origins of magnetite and carbonate may be unrelated: that is, from the perspective of the carbonate the magnetite is allochthonous. We have sought to resolve between these hypotheses through the detailed characterized of the compositional and structural relationships between the carbonate disks, their associated magnetites and the orthopyroxene matrix in which they are embedded [1]. Comparison of these results with experimental thermal decomposition studies of sideritic carbonates conducted under a range of heating scenarios suggests that the magnetite nanocrystals in the ALH84001 carbonate disks are not the products of thermal decomposition.

Thomas-Keptra, Katie L.↗