Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Matrix factorization”

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

Algorithms for Spectral Decomposition with Applications to Optical Plume Anomaly Detection

The analysis of spectral signals for features that represent physical phenomenon is ubiquitous in the science and engineering communities. There are two main approaches that can be taken to extract relevant features from these high-dimensional data streams. The first set of approaches relies on extracting features using a physics-based paradigm where the underlying physical mechanism that generates the spectra is used to infer the most important features in the data stream. We focus on a complementary methodology that uses a data-driven technique that is informed by the underlying physics but also has the ability to adapt to unmodeled system attributes and dynamics. We discuss the following four algorithms: Spectral Decomposition Algorithm (SDA), Non-Negative Matrix Factorization (NMF), Independent Component Analysis (ICA) and Principal Components Analysis (PCA) and compare their performance on a spectral emulator which we use to generate artificial data with known statistical properties. This spectral emulator mimics the real-world phenomena arising from the plume of the space shuttle main engine and can be used to validate the results that arise from various spectral decomposition algorithms and is very useful for situations where real-world systems have very low probabilities of fault or failure. Our results indicate that methods like SDA and NMF provide a straightforward way of incorporating prior physical knowledge while NMF with a tuning mechanism can give superior performance on some tests. We demonstrate these algorithms to detect potential system-health issues on data from a spectral emulator with tunable health parameters.

Srivastava, Askok N.↗

Using Dispersed Modes During Model Correlation

Using model dispersions as a starting point allows us to quickly adjust a model to reflect new test data: a) The analyst does a lot of work before the test to save time post-test. b) Creating 1000s of model dispersions to provide "coarse tuning," then use Attune to provide the "fine tuning." Successful model tuning on three structures: a) TAURUS. b) Ares I-X C) Cart (in backup charts). Mode weighting factors, matrix norm method, and XOR vs. MAC all play key roles in determining the BME. The BME process will be used on future tests: a) ISPE modal test (ongoing work). b) SLS modal test (mid 2018).

Stewart, Eric↗

Topic Modeling Tool for PeTaL (Periodic Table of Life)

A topic modeling tool is constructed for the purpose of providing insights from biology to the engineer within the framework of PeTaL (Periodic Table of Life). The machine learning text mining tools–latent Dirichlet allocation (LDA) and nonnegative matrix factorization (NMF) with Kullback-Leibler (KL) divergence—are used to provide topic clusters to the user. Topic clusters are the underlying themes of a paper. For the text modeling problem, NMF-KL is the equivalent of probabilistic latent semantic analysis. Both LDA and NMF-KL are top-performing modeling tools. These tools are used to identify biological specimens relevant to the user. Various organisms solve a particular survival problem in nature differently. The topic clusters allow people without domain expertise to find these cross-topic themes in the body of documents and then branch out and examine papers whose target organisms solve the engineer’s problem. Abstracts from the Journal of Experimental Biology were used as input for the clustering tool in addition to a curated set of articles for validation. The tool is able to accept alternate input sources.

Machine learning↗

Sources, Transport and Visibility Impact of Ambient Submicrometer Particle Size Distributions in an Urban Area of Central Taiwan

This study applied positive matrix factorization (PMF) to identify the sources of size-resolved submicrometer (10–1000 nm) particles and quantify their contributions to impaired visibility based on the particle number size distributions (PNSDs), aerosol light extinction (b p ), air pollutants (PM 10 , PM 2.5 , SO 2 , O 3 , and NO), and meteorological parameters (temperature, relative humidity, wind speed, wind direction, and ultraviolet index) measured hourly over an urban basin in central Taiwan between 2017 and 2021. The transport of source-specific PNSDs was evaluated with wind and back trajectory analyses. The PMF revealed six sources to the total particle number (TPN), surface (TPS), volume (TPV), and b p . Factor 1 (F1), the key contributor to TPN (35.0 %), represented nucleation (<25 nm) particles associated with fresh traffic emission and secondary new particle formation, which were transported from the west-southwest by stronger winds (>2.2 m s -1 ). F2 represented the large Aitken (50–100 nm) particles transported regionally via northerly winds, whereas F3 represented large accumulation (300–1000 nm) particles, which showed elevated concentrations under stagnant conditions (<1.1 m s −1 ). F4 represented small Aitken (25–50 nm) particles arising from the growth and transport of the nucleation particles (F1) via west-southwesterly winds. F5 represented large Aitken particles originating from combustion-related SO 2 sources and carried by west-northwesterly winds. F6 represented small accumulation (100–300 nm) particles emitted both by local sources and by the remote SO 2 sources found for F5. Overall, large accumulation particles (F3) played the greatest role in determining the TPV (66.4 %) and TPS (34.8 %), and their contribution to bp increased markedly from 17.3 % to 40.7 % as visibility decreased, indicating that TPV and TPS are better metrics than TPN for estimating b p . Furthermore, slow-moving air masses—and therefore stagnant conditions—facilitate the build-up of accumulation mode particles (F3 + F6), resulting in the poorest visibility.

source apportionment↗

Extracellular matrix and growth factors in branching morphogenesis

The unifying hypothesis of the NSCORT in gravitational biology postulates that the ECM and growth factors are key interrelated components of a macromolecular regulatory system. The ECM is known to be important in growth and branching morphogenesis of embryonic organs. Growth factors have been detected in the developing embryo, and often the pattern of localization is associated with areas undergoing epithelial-mesenchymal interactions. Causal relationships between these components may be of fundamental importance in control of branching morphogenesis.

Non-NASA Center↗

Necessary and sufficient conditions for the complete controllability and observability of systems in series using the coprime factorization of a rational matrix

The series connection of two linear time-invariant systems that have minimal state space system descriptions is considered. From these descriptions, strict-system-equivalent polynomial matrix system descriptions in the manner of Rosenbrock are derived. They are based on the factorization of the transfer matrix of the subsystems as a ratio of two right or left coprime polynomial matrices. They give rise to a simple polynomial matrix system description of the tandem connection. Theorem 1 states that for the complete controllability and observability of the state space system description of the series connection, it is necessary and sufficient that certain 'denominator' and 'numerator' groups are coprime. Consequences for feedback systems are drawn in Corollary 1. The role of pole-zero cancellations is explained by Lemma 3 and Corollaires 2 and 3.

Callier, F. M.↗

Spatial operator factorization and inversion of the manipulator mass matrix

This paper advances two linear operator factorizations of the manipulator mass matrix. Embedded in the factorizations are many of the techniques that are regarded as very efficient computational solutions to inverse and forward dynamics problems. The operator factorizations provide a high-level architectural understanding of the mass matrix and its inverse, which is not visible in the detailed algorithms. They also lead to a new approach to the development of computer programs or organize complexity in robot dynamics.

Rodriguez, Guillermo↗

Studies of social group dynamics under isolated conditions. Objective summary of the literature as it relates to potential problems of long duration space flight

Scientific literature which deals with the study of human behavior and crew interaction in situations simulating long term space flight is summarized and organized. A bibliography of all the pertinent U.S. literature available is included, along with definitions of the behavioral characteristics terms employed. The summarized studies are analyzed according to behavioral factors and environmental conditions. The analysis consist of two matrices. (1) The matrix of factors studied correlates each research study area and individual study with the behavioral factors that were investigated in the study. (2) The matrix of conclusions identifies those studies whose investigators appeared to draw specific conclusions concerning questions of importance to NASA.

Vinograd, S. P.↗

Adjoint Techniques for Topology Optimization of Structures Under Damage Conditions

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation (Haftka and Gurdal, 1992) in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers (Akgun et al., 1998a and 1999). It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages (Haftka et al., 1983). A common method for topology optimization is that of compliance minimization (Bendsoe, 1995) which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system.. Shennan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this (Akgun et al., 1998b). SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

Optimization of Aerospace Structure Subject to Damage Tolerance Criteria

The objective of this cooperative agreement was to seek computationally efficient ways to optimize aerospace structures subject to damage tolerance criteria. Optimization was to involve sizing as well as topology optimization. The work was done in collaboration with Steve Scotti, Chauncey Wu and Joanne Walsh at the NASA Langley Research Center. Computation of constraint sensitivity is normally the most time-consuming step of an optimization procedure. The cooperative work first focused on this issue and implemented the adjoint method of sensitivity computation in an optimization code (runstream) written in Engineering Analysis Language (EAL). The method was implemented both for bar and plate elements including buckling sensitivity for the latter. Lumping of constraints was investigated as a means to reduce the computational cost. Adjoint sensitivity computation was developed and implemented for lumped stress and buckling constraints. Cost of the direct method and the adjoint method was compared for various structures with and without lumping. The results were reported in two papers. It is desirable to optimize topology of an aerospace structure subject to a large number of damage scenarios so that a damage tolerant structure is obtained. Including damage scenarios in the design procedure is critical in order to avoid large mass penalties at later stages. A common method for topology optimization is that of compliance minimization which has not been used for damage tolerant design. In the present work, topology optimization is treated as a conventional problem aiming to minimize the weight subject to stress constraints. Multiple damage configurations (scenarios) are considered. Each configuration has its own structural stiffness matrix and, normally, requires factoring of the matrix and solution of the system of equations. Damage that is expected to be tolerated is local and represents a small change in the stiffness matrix compared to the baseline (undamaged) structure. The exact solution to a slightly modified set of equations can be obtained from the baseline solution economically without actually solving the modified system. Sherrnan-Morrison-Woodbury (SMW) formulas are matrix update formulas that allow this. SMW formulas were therefore used here to compute adjoint displacements for sensitivity computation and structural displacements in damaged configurations.

Akgun, Mehmet A.↗

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗

Stresses in a three-dimensional unidirectional composite containing broken fibers

An approximate solution is developed for the determination of the interlaminar normal and shear stresses in the vicinity of a crack in a three dimensional composite containing unidirectional linearly elastic fibers in an infinite linearly elastic matrix. In order to reduce the complexity of the formulation, certain assumptions are made as to the physically significant stresses to be retained. These simplifications reduce the partial differential equations of elasticity to differential-difference equations which are tractable using Fourier transform techniques. This 'material modeling' approach is in contrast with solutions developed by considering each lamina as a homogeneous, orthotropic layer. The resulting solution does not contain the classical singular stress field for the fibers and the influence of broken fibers on unbroken fibers is felt by a change in stress concentration factors. The matrix stresses however, are unbounded as the fiber spacing vanishes and an equivalent fiber-matrix geometry is proposed which gives the correct singular behavior. The numerical solution is considered in detail and several specific examples are presented. The potential for damaged or debonded zones to be generated by an embedded crack is discussed, and stress concentration factors for fibers near the crack are given. Detailed comparisons are made between the present solution, the analogous two-dimensional problem, and corresponding shear-lag models.

Goree, J. G.↗

A fast, preconditioned conjugate gradient Toeplitz solver

A simple factorization is given of an arbitrary hermitian, positive definite matrix in which the factors are well-conditioned, hermitian, and positive definite. In fact, given knowledge of the extreme eigenvalues of the original matrix A, an optimal improvement can be achieved, making the condition numbers of each of the two factors equal to the square root of the condition number of A. This technique is to applied to the solution of hermitian, positive definite Toeplitz systems. Large linear systems with hermitian, positive definite Toeplitz matrices arise in some signal processing applications. A stable fast algorithm is given for solving these systems that is based on the preconditioned conjugate gradient method. The algorithm exploits Toeplitz structure to reduce the cost of an iteration to O(n log n) by applying the fast Fourier Transform to compute matrix-vector products. Matrix factorization is used as a preconditioner.

Pan, Victor↗

A comparison of discrete linear filtering algorithms.

Seven filter algorithms were presented in a recent survey paper (Kaminski, 1971), and were compared computationally (operations count) when relatively few observations were to be processed. These algorithms are now elaborated further. Details of the computations are presented, and it is shown that for problems with even moderately large amounts of data, the information matrix and square-root information matrix formulations are computationally more efficient than the other methods considered (conventional Kalman, stabilized Kalman, and square-root covariance mechanizations). It is pointed out that Schmidt's matrix factorization-Householder transformation technique leads to the same equations as those obtained via Potter's method. Several improvements in the equation mechanization are given.

Bierman, G. J.↗

Factorization Of Positive Definite, Banded Hermitian Matrices

Report discusses application of Cholesky factorization algorithm to positive definite, banded Hermitian matrices. Begins by extending Cholesky factorization algorithm to cover uniformly-partitioned, banded, positive definite matrices of rank n that is real symmetric or Hermitian. Then two stratagems given for use of algorithm in concurrent-processing system in which N less than it has to be to enable factorization of matrix in as few serial steps as possible and where uniformly high efficiency expected from all processing elements. One of major purposes of this and related studies to maximize speedup and efficiency in system of concurrent-data-processing elements.

Salama, Moktar A.↗

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗

An intrinsically n-dimensional generalized flux vector splitting implicit finite element Euler algorithm

A generalized flux-vector splitting implicit Galerkin finite-element algorithm for the Euler equations in curvilinear coordinates for ideal and reacting gases is derived. For an arbitrary equation of state, the curvilinear-coordinate flux vector is split in kinematic and kinetic components, and the associated jacobian matrix eigenvalues explicitly depend on the metric data. After directional semidiscretization, the terminal ordinary differential-equation system is solved via a nonlinearly stable implicit Runge-Kutta scheme in concert with an accurate tensor matrix product factorization. The results for selected two-dimensional supersonic and axisymmetric hypersonic flows validate the algorithm and verify its robustness for curvilinear-coordinate computations. The evolution towards a steady state is achieved for large Courant numbers without indication of numerical instabilities.

Iannelli, G. S.↗