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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS1992

A non-linearly stable implicit finite element algorithm for hypersonic aerodynamics

A generalized curvilinear coordinate Taylor weak statement implicit finite element algorithm is developed for the two-dimensional and axisymmetric compressible Navier-Stokes equations for ideal and reacting gases. For accurate hypersonic simulation, air is modeled as a mixture of five perfect gases, i.e., molecular and atomic oxygen and nitrogen as well as nitric oxide. The associated pressure is then determined via Newton solution of the classical chemical equilibrium equation system. The directional semidiscretization is achieved using an optimal metric data Galerkin finite element weak statement, on a developed 'companion conservation law system', permitting classical test and trial space definitions. Utilizing an implicit Runge-Kutta scheme, the terminal algorithm is then nonlinearly stable, and second-order accurate in space and time on arbitrary curvilinear coordinates. Subsequently, a matrix tensor product factorization procedure permits an efficient numerical linear algebra handling for large Courant numbers. For ideal- and real-gas hypersonic flows, the algorithm generates essentially nonoscillatory numerical solutions in the presence of strong detached shocks and boundary layer-inviscid flow interactions.

Iannelli, G. S.↗

NASA NTRS1993

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

NASA NTRS1995

An efficiency study of the simultaneous analysis and design of structures

The efficiency of the Simultaneous Analysis and Design (SAND) approach in the minimum weight optimization of structural systems subject to strength and displacement constraints as well as size side constraints is investigated. SAND allows for an optimization to take place in one single operation as opposed to the more traditional and sequential Nested Analysis and Design (NAND) method, where analyses and optimizations alternate. Thus, SAND has the advantage that the stiffness matrix is never factored during the optimization retaining its original sparsity. One of SAND's disadvantages is the increase in the number of design variables and in the associated number of constraint gradient evaluations. If SAND is to be an acceptable player in the optimization field, it is essential to investigate the efficiency of the method and to present a possible cure for any inherent deficiencies.

Striz, Alfred G.↗

NASA NTRS1990

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗

NASA NTRS2003

Calculation of Free-Free Opacities

Free-free absorption is an important contribution to the opacity for radiation transport through hot materials Temperatures can be as high as several keV, such that it becomes a computational challenge to solve the Schrodinger equation efficiently for rapidly oscillating continuum functions for high angular momenta. Several groups\footnots, including ours, have studied the phase amplitude solution (PAS) of the Schrodinger equation, in which one solves equations for the wave function amplitude and phase, which are: smooth functions of the electron energy. It is also important to have an accurate Schroudinger benchmark for the development of the PAS method. We present results for dipole matrix elements, Gaunt factors, and cross sections for the absorption of radiation at various energies for Cs XIX at temperature=100 eV and density=0.187 g/cc for our newly developed PAS and Schrodinger benchmark.

Bhatia, A. K.↗

NASA NTRS2000

Shape-dependent control of cell growth, differentiation, and apoptosis: switching between attractors in cell regulatory networks

Development of characteristic tissue patterns requires that individual cells be switched locally between different phenotypes or "fates;" while one cell may proliferate, its neighbors may differentiate or die. Recent studies have revealed that local switching between these different gene programs is controlled through interplay between soluble growth factors, insoluble extracellular matrix molecules, and mechanical forces which produce cell shape distortion. Although the precise molecular basis remains unknown, shape-dependent control of cell growth and function appears to be mediated by tension-dependent changes in the actin cytoskeleton. However, the question remains: how can a generalized physical stimulus, such as cell distortion, activate the same set of genes and signaling proteins that are triggered by molecules which bind to specific cell surface receptors. In this article, we use computer simulations based on dynamic Boolean networks to show that the different cell fates that a particular cell can exhibit may represent a preprogrammed set of common end programs or "attractors" which self-organize within the cell's regulatory networks. In this type of dynamic network model of information processing, generalized stimuli (e.g., mechanical forces) and specific molecular cues elicit signals which follow different trajectories, but eventually converge onto one of a small set of common end programs (growth, quiescence, differentiation, apoptosis, etc.). In other words, if cells use this type of information processing system, then control of cell function would involve selection of preexisting (latent) behavioral modes of the cell, rather than instruction by specific binding molecules. Importantly, the results of the computer simulation closely mimic experimental data obtained with living endothelial cells. The major implication of this finding is that current methods used for analysis of cell function that rely on characterization of linear signaling pathways or clusters of genes with common activity profiles may overlook the most critical features of cellular information processing which normally determine how signal specificity is established and maintained in living cells. Copyright 2000 Academic Press.

Review↗

NASA NTRS2008

Comparison of Nonlinear Filtering Techniques for Lunar Surface Roving Navigation

Leading up to the Apollo missions the Extended Kalman Filter, a modified version of the Kalman Filter, was developed to estimate the state of a nonlinear system. Throughout the Apollo missions, Potter's Square Root Filter was used for lunar navigation. Now that NASA is returning to the Moon, the filters used during the Apollo missions must be compared to the filters that have been developed since that time, the Bierman-Thornton Filter (UD) and the Unscented Kalman Filter (UKF). The UD Filter involves factoring the covariance matrix into UDUT and has similar accuracy to the Square Root Filter; however it requires less computation time. Conversely, the UKF, which uses sigma points, is much more computationally intensive than any of the filters; however it produces the most accurate results. The Extended Kalman Filter, Potter's Square Root Filter, the Bierman-Thornton UD Filter, and the Unscented Kalman Filter each prove to be the most accurate filter depending on the specific conditions of the navigation system.

Kimber, Lemon↗

NASA NTRS2010

Partial Least Squares and Neural Networks for Quantitative Calibration of Laser-induced Breakdown Spectroscopy (LIBs) of Geologic Samples

The ChemCam instrument [1] on the Mars Science Laboratory (MSL) rover will be used to obtain the chemical composition of surface targets within 7 m of the rover using Laser Induced Breakdown Spectroscopy (LIBS). ChemCam analyzes atomic emission spectra (240-800 nm) from a plasma created by a pulsed Nd:KGW 1067 nm laser. The LIBS spectra can be used in a semiquantitative way to rapidly classify targets (e.g., basalt, andesite, carbonate, sulfate, etc.) and in a quantitative way to estimate their major and minor element chemical compositions. Quantitative chemical analysis from LIBS spectra is complicated by a number of factors, including chemical matrix effects [2]. Recent work has shown promising results using multivariate techniques such as partial least squares (PLS) regression and artificial neural networks (ANN) to predict elemental abundances in samples [e.g. 2-6]. To develop, refine, and evaluate analysis schemes for LIBS spectra of geologic materials, we collected spectra of a diverse set of well-characterized natural geologic samples and are comparing the predictive abilities of PLS, cascade correlation ANN (CC-ANN) and multilayer perceptron ANN (MLP-ANN) analysis procedures.

Anderson, R. B.↗

NASA NTRS2000

A Study of Influencing Factors on the Tensile Response of a Titanium Matrix Composite With Weak Interfacial Bonding

The generalized method of cells micromechanics model is utilized to analyze the tensile stress-strain response of a representative titanium matrix composite with weak interfacial bonding. The fiber/matrix interface is modeled through application of a displacement discontinuity between the fiber and matrix once a critical debonding stress has been exceeded. Unidirectional composites with loading parallel and perpendicular to the fibers are examined, as well as a cross-ply laminate. For each of the laminates studied, analytically obtained results are compared to experimental data. The application of residual stresses through a cool-down process was found to have a significant effect on the tensile response. For the unidirectional laminate with loading applied perpendicular to the fibers, fiber packing and fiber shape were shown to have a significant effect on the predicted tensile response. Furthermore, the interface was characterized through the use of semi-emperical parameters including an interfacial compliance and a "debond stress;" defined as the stress level across the interface which activates fiber/matrix debonding. The results in this paper demonstrate that if architectural factors are correctly accounted for and the interface is appropriately characterized, the macro-level composite behavior can be correctly predicted without modifying any of the fiber or matrix constituent properties.

Goldberg, Robert K.↗

NASA NTRS1987

Inverse of polynomial matrices in the irreducible form

An algorithm is developed for finding the inverse of polynomial matrices in the irreducible form. The computational method involves the use of the left (right) matrix division method and the determination of linearly dependent vectors of the remainders. The obtained transfer function matrix has no nontrivial common factor between the elements of the numerator polynomial matrix and the denominator polynomial.

Chang, Fan R.↗

NASA NTRS1994

Method and apparatus for the collection, storage, and real time analysis of blood and other bodily fluids

The present invention provides a simple, portable, relatively inexpensive apparatus for accurately and efficiently collecting, separating, testing, and even storing between about 1-20 ml, preferably about 1-10 ml, of blood or other bodily fluid in situ. The apparatus includes a collection chamber bounded on its sides by an opening in a sheet of material, preferably clear plastic, abutting a filter card. The filter card is made of fibrous material, preferably less than about a millimeter thick, having an average pore size of less than about 3 microns. Preferably, the fibers are glass and the fibrous material has an average pore size of about 1 micron. The fibrous material is treated with a carbohydrate/protein mixture which contains between about 1-40 percent wt/vol carbohydrate and about 0.1-15 percent wt/vol nonspecific protein, preferably between about 10-20 percent carbohydrate and about 5-8 percent protein. A preferred carbohydrate/protein mixture comprises about 10 percent mannitol and about 6 percent albumin. The blood or other fluid moves through the filter card by capillary action aided by an absorbent matrix with a high Klemm factor which abuts the filter card. The absorbent matrix and/or filter card can be treated with a wide spectrum of test reagents. The speed, cleanliness, and efficiency of the separation process can be altered by: (a) changing the absolute concentration of the carbohydrate/protein mixture; (b) applying positive or negative pressure to one side of the filter; and/or (c) varying the relative density and pore size of the filter card and absorbent matrix.

Whitson, Peggy A.↗

NASA NTRS1983

Damping mechanisms in fiber reinforced laminates

Low strain damping in fiber reinforced composite materials is due to material loss factors in both fibers and matrix materials. The high modulus of the fibers makes up for the low damping factor. Strains high enough to cause transverse layer cracking in laminates with organic matrix materials causes a large permanent increase in the damping factor. This increase is not due to the transverse cracks but rather to short microcracks in the high shear strain regions. Other damping mechanisms at high strains are also discussed.

Plunkett, R.↗

NASA NTRS1991

Extracellular matrix and cell shape: potential control points for inhibition of angiogenesis

Capillary endothelial (CE) cells require two extracellular signals in order to switch from quiescence to growth and back to differentiation during angiogenesis: soluble angiogenic factors and insoluble extracellular matrix (ECM) molecules. Soluble endothelial mitogens, such as basic fibroblast growth factor (FGF), act over large distances to trigger capillary growth, whereas ECM molecules act locally to modulate cell responsiveness to these soluble cues. Recent studies reveal that ECM molecules regulate CE cell growth and differentiation by modulating cell shape and by activating intracellular chemical signaling pathways inside the cell. Recognition of the importance of ECM and cell shape during capillary morphogenesis has led to the identification of a series of new angiogenesis inhibitors. Elucidation of the molecular mechanism of capillary regulation may result in development of even more potent angiogenesis modulators in the future.

Non-NASA Center↗

NASA NTRS1974

Matrix isolation technique for the study of some factors affecting the partitioning of trace elements

The factors that affect the preferred positions of cations in ionic solid solutions were investigated utilizing vibrational spectroscopy. Solid solutions of the sulfate and chromate ions codoped with La(+3) and Ca(+2) in a KBr host lattice were examined as a function of the polyvalent cation concentration. The cation-anion pairing process was found to be random for Ca(+2), whereas the formation of La(+3)-SO4(-2) ion pairs with a C2 sub v bonding geometry is highly preferential to any type of La(+3)-CrO4(-2) ion pair formation. The relative populations of ion pair site configurations are discussed in terms of an energy-entropy competition model which can be applied to the partition of trace elements during magmatic processes.

Grzybowski, J. M.↗

NASA NTRS1991

Unified formulation of dynamics for serial rigid multibody systems

There has been a growing interest in the development of new and efficient algorithms for multibody dynamics in recent years. Serial rigid multibody systems form the basic subcomponents of general multibody systems, and a variety of algorithms to solve the serial chain forward dynamics problem have been proposed. In this paper, the economy of representation and analysis tools provided by the spatial operator algebra are used to clarify the inherent structure of these algorithms, to identify those that are similar, and to study the relationships among the ones that are distinct. For the purposes of this study, the algorithms are categorized into three classes: algorithms that require the explicit computation of the mass matrix, algorithms that are completely recursive in nature, and algorithms of intermediate complexity. In addition, alternative factorizations for the mass matrix and closed form expressions for its inverse are derived. These results provide a unifying perspective, within which these diverse dynamics algorithms arise naturally as a consequence of a progressive exploitation of the structure of the mass matrix.

Jain, Abhinandan↗

NASA NTRS1992

A performance study of sparse Cholesky factorization on INTEL iPSC/860

The problem of Cholesky factorization of a sparse matrix has been very well investigated on sequential machines. A number of efficient codes exist for factorizing large unstructured sparse matrices. However, there is a lack of such efficient codes on parallel machines in general, and distributed machines in particular. Some of the issues that are critical to the implementation of sparse Cholesky factorization on a distributed memory parallel machine are ordering, partitioning and mapping, load balancing, and ordering of various tasks within a processor. Here, we focus on the effect of various partitioning schemes on the performance of sparse Cholesky factorization on the Intel iPSC/860. Also, a new partitioning heuristic for structured as well as unstructured sparse matrices is proposed, and its performance is compared with other schemes.

Zubair, M.↗

NASA NTRS1989

Recursive form of the eigensystem realization algorithm for system identification

An algorithm is developed for recursively calculating the minimum realization of a linear system from sampled impulse response data. The Gram-Schmidt orthonormalization technique is used to generate an orthonormal basis for factorization of the data matrix. The system matrix thus identified is in upper Hessenberg form, which has advantages for the identification of modal parameters including damping coefficients, frequencies, mode shapes, and modal participation factors. It also has the property that once an element of the system matrix is computed, it is never altered as the dimension of the model is increased in the recursive process. Numerical examples are presented for comparison of the recursive and nonrecursive forms of the eigensystem realization algorithm.

Longman, Richard W.↗

NASA NTRS2008

Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1M Unknowns

Matrix methods for solving integral equations via direct solve LU factorization are presently limited to weeks to months of very expensive supercomputer time for problems sizes of several hundred thousand unknowns. This report presents matrix LU factor solutions for electromagnetic scattering problems for problem sizes to one million unknowns with thousands of right hand sides that run in mere days on PC level hardware. This EM solution is accomplished by utilizing the numerical low rank nature of spatially blocked unknowns using the Adaptive Cross Approximation for compressing the rank deficient blocks of the system Z matrix, the L and U factors, the right hand side forcing function and the final current solution. This compressed matrix solution is applied to a frequency domain EM solution of Maxwell's equations using standard Method of Moments approach. Compressed matrix storage and operations count leads to orders of magnitude reduction in memory and run time.

Shaeffer, John↗