Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Metallo-Organic Decomposition (MOD) film development

The processing techniques and problems encountered in formulating metallo-organic decomposition (MOD) films used in contracting structures for thin solar cells are described. The use of thermogravimetric analysis (TGA) and differential scanning calorimetry (DSC) techniques performed at Jet Propulsion Laboratory (JPL) in understanding the decomposition reactions lead to improvements in process procedures. The characteristics of the available MOD films were described in detail.

Parker, J.↗
NASA NTRS1988

Isotopic fractionation in ozone decomposition

The oxygen isotopic fractionation, which occurs during ozone decomposition, has been determined, complementing earlier studies on the fractionation during ozone formation. Oxygen produced in the decomposition is depleted in heavy isotopes in a mass-independent fashion. The mechanism for the mass-independent effect is unknown, though the fractionation magnitude information is required for modeling the steady-state isotopic composition of stratospheric ozone.

Bhattacharya, S. K.↗
NASA NTRS1988

A parallel Householder tridiagonalization stratagem using scattered square decomposition

The parallel stratagem in this paper uses scattered square decomposition, introduced by Fox (1985), for its data assignment and then exploits parallelism in the solution steps of the sequential Householder tridiagonalization algorithm. One may condense a real symmetric full matrix A of order n into a tridiagonal form by the stratagem in concurrent machines where N(=D-squared) processors are used. Expressions for efficiency and speedup are given for the evaluation of the stratagem. An alternative stratagem which requires less data transmission but more computations is also discussed. The results shown that the Householder method of tridiagonalization may be implemented on a concurrent machine efficiently by scattered square decomposition provided that the number of matrix elements contained in each processor is much larger than the number of processors of the concurrent machine, and the ratio of the time to transmit one data item from one processor to any other processor to the time to perform a floating-point arithmetic operation is small enough.

Chang, H. Y.↗
NASA NTRS1989

A knowledge-based tool for multilevel decomposition of a complex design problem

Although much work has been done in applying artificial intelligence (AI) tools and techniques to problems in different engineering disciplines, only recently has the application of these tools begun to spread to the decomposition of complex design problems. A new tool based on AI techniques has been developed to implement a decomposition scheme suitable for multilevel optimization and display of data in an N x N matrix format.

Rogers, James L.↗
NASA NTRS1989

A decomposition-based design optimization method with applications

A two-level design optimization metholology is described. A progress report of its application to Printed Wiring Board (PWB) assembly examples is given. The design of PWB assemblies is a complex task which is generally conducted as a sequential process. Individual PWBs are usually designed first, followed by the composition of the PWBs into an assembly. As a result, optimizing design considerations such as assembly reliability cannot be accomplished. This study showed that a two-level decomposition method can be employed to optimize for reliability at both the PWB- and the assembly-level in a coupled manner. The two-level decomposition method also resolved the mixed-integer nonlinear programming nature of the problem rather easily.

Azarm, Shapour↗
NASA NTRS1989

Multilevel decomposition of complete vehicle configuration in a parallel computing environment

This research summarizes various approaches to multilevel decomposition to solve large structural problems. A linear decomposition scheme based on the Sobieski algorithm is selected as a vehicle for automated synthesis of a complete vehicle configuration in a parallel processing environment. The research is in a developmental state. Preliminary numerical results are presented for several example problems.

Bhatt, Vinay↗
NASA NTRS1988

Fast polar decomposition of an arbitrary matrix

The polar decomposition of an m x n matrix A of full rank, where m is greater than or equal to n, can be computed using a quadratically convergent algorithm. The algorithm is based on a Newton iteration involving a matrix inverse. With the use of a preliminary complete orthogonal decomposition the algorithm can be extended to arbitrary A. How to use the algorithm to compute the positive semi-definite square root of a Hermitian positive semi-definite matrix is described. A hybrid algorithm which adaptively switches from the matrix inversion based iteration to a matrix multiplication based iteration due to Kovarik, and to Bjorck and Bowie is formulated. The decision when to switch is made using a condition estimator. This matrix multiplication rich algorithm is shown to be more efficient on machines for which matrix multiplication can be executed 1.5 times faster than matrix inversion.

Higham, Nicholas J.↗
NASA NTRS1988

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.↗
NASA NTRS1989

Novel techniques for data decomposition and load balancing for parallel processing of vision systems: Implementation and evaluation using a motion estimation system

Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.

Choudhary, Alok Nidhi↗
NASA NTRS1990

Integrated control/structure optimization by multilevel decomposition

A method for integrated control/structure optimization by multilevel decomposition is presented. It is shown that several previously reported methods were actually partial decompositions wherein only the control was decomposed into a subsystem design. One of these partially decomposed problems was selected as a benchmark example for comparison. The system is fully decomposed into structural and control subsystem designs and an improved design is produced. Theory, implementation, and results for the method are presented and compared with the benchmark example.

Zeiler, Thomas A.↗
NASA NTRS1990

Integrated control/structure optimization by multilevel decomposition

A method for integrated control/structure optimization by multilevel decomposition is presented. It is shown that several previously reported methods were actually partial decompositions wherein only the control was decomposed into a subsystem design. One of these partially decomposed problems was selected as a benchmark example for comparison. The present paper fully decomposes the system into structural and control subsystem designs and produces an improved design. Theory, implementation, and results for the method are presented and compared with the benchmark example.

Zeiler, Thomas A.↗
NASA NTRS1990

Improved solution for system identification equations by Epsilon-Decomposition

Matrix eigenvalue theory is used to examine the source of ill-conditioning in linear algebraic equations. This approach highlights the crucial role played by the zero and near-zero eigenvalues and corresponding eigenvectors of poorly conditioned systems. Insight gained from this approach is used to significantly improve a recently developed solution procedure called Epsilon-Decomposition (E-D). E-D is an efficient alternative to Singular Value Decomposition (SVD) for ill-conditioned systems arising in parameter estimation and system identification studies. The efficiency of the improved E-D over SVD resides in the need to only obtain the zero and near-zero eigenvalues of the coefficient matrix as opposed to all of its eigenvalues and vectors (as required by SVD). Thus, the efficiency of E-D is significant for large matrices with small rank deficiency.

Ojalvo, Irving U.↗
NASA NTRS1990

Substructuring decomposition and controller synthesis

A decentralized design procedure is proposed for the control design for flexible structures. The structure to be controlled is decomposed into several substructures by using a natural decomposition called substructuring decomposition. For each substructure, a subcontroller is designed by using the linear quadratic optimal control theory. Then, a controller synthesis scheme called Substructural Controller Synthesis (SCS) is used to assemble the subcontrollers into a system controller, which is to be used to control the whole structure. A plane truss example is used to illustrate the efficacy of the proposed method.

Su, Tzu-Jeng↗
NASA NTRS1990

Adaptive domain decomposition for Monte Carlo simulations on parallel processors

A method is described for performing direct simulation Monte Carlo (DSMC) calculations on parallel processors using adaptive domain decomposition to distribute the computational work load. The method has been implemented on a commercially available hypercube and benchmark results are presented which show the performance of the method relative to current supercomputers. The problems studied were simulations of equilibrium conditions in a closed, stationary box, a two-dimensional vortex flow, and the hypersonic, rarefield flow in a two-dimensional channel. For these problems, the parallel DSMC method ran 5 to 13 times faster than on a single processor of a Cray-2. The adaptive decomposition method worked well in uniformly distributing the computational work over an arbitrary number of processors and reduced the average computational time by over a factor of two in certain cases.

Wilmoth, Richard G.↗
NASA NTRS1990

Reliable algorithm for modal decomposition

This paper describes a reliable, general algorithm for modal decomposition in real arithmetic and its use in analyzing and synthesizing control logic for linear dynamic systems. The numerical difficulties are described associated with computing the Jordan canonical form when the system has repeated, or nearly repeated, eigenvalues. A new algorithm is described that satisfactorily solves these numerical difficulties. The relation and extension to related numerical analysis research are discussed to clarify the reliability of the techniques. Finally, its implementation as a practical modal decomposition method for efficiently computing the matrix exponential, transfer functions, and frequency response is also described.

Walker, Robert A.↗
NASA NTRS1991

Characteristic eddy decomposition of turbulence in a channel

The proper orthogonal decomposition technique (Lumley's decomposition) is applied to the turbulent flow in a channel to extract coherent structures by decomposing the velocity field into characteristic eddies with random coefficients. In the homogeneous spatial directions, a generaliztion of the shot-noise expansion is used to determine the characteristic eddies. In this expansion, the Fourier coefficients of the characteristic eddy cannot be obtained from the second-order statistics. Three different techniques are used to determine the phases of these coefficients. They are based on: (1) the bispectrum, (2) a spatial compactness requirement, and (3) a functional continuity argument. Results from these three techniques are found to be similar in most respects. The implications of these techniques and the shot-noise expansion are discussed. The dominant eddy is found to contribute as much as 76 percent to the turbulent kinetic energy. In both 2D and 3D, the characteristic eddies consist of an ejection region straddled by streamwise vortices that leave the wall in the very short streamwise distance of about 100 wall units.

Moin, Parviz↗
NASA NTRS1990

Multitasking domain decomposition fast Poisson solvers on the Cray Y-MP

The results of multitasking implementation of a domain decomposition fast Poisson solver on eight processors of the Cray Y-MP are presented. The object of this research is to study the performance of domain decomposition methods on a Cray supercomputer and to analyze the performance of different multitasking techniques using highly parallel algorithms. Two implementations of multitasking are considered: macrotasking (parallelism at the subroutine level) and microtasking (parallelism at the do-loop level). A conventional FFT-based fast Poisson solver is also multitasked. The results of different implementations are compared and analyzed. A speedup of over 7.4 on the Cray Y-MP running in a dedicated environment is achieved for all cases.

Chan, Tony F.↗