Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 127 records · Page 7

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↗

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

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

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↗

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

Task decomposition for multilimbed robots to work in the reachable-but-unorientable space

Multilimbed industrial robots that have at least one arm and two or more legs are suggested for enlarging robot workspace in industrial automation. To plan the motion of a multilimbed robot, the arm-leg motion-coordination problem is raised and task decomposition is proposed to solve the problem; that is, a given task described by the destination position and orientation of the end-effector is decomposed into subtasks for arm manipulation and for leg locomotion, respectively. The former is defined as the end-effector position and orientation with respect to the legged main body, and the latter as the main-body position and orientation in the world coordinates. Three approaches are proposed for the task decomposition. The approaches are further evaluated in terms of energy consumption, from which an optimal approach can be selected.

Su, Chao↗

Explosive decomposition of hydrazine by rapid compression of a gas volume

In the present investigation of the initiation mechanism and the explosion mode of hydrazine decomposition, a 20 cm-long column of liquid hydrazine was accelerated into a column of gaseous nitrogen, from which it was separated by a thin Teflon diaphragm, in a close-ended cylindrical chamber. Video data obtained reveal the formation of a froth generated by the acceleration of hydrazine into nitrogen at the liquid hydrazine-gaseous nitrogen interface. The explosive hydrazine decomposition had as its initiation mechanism the formation of a froth at a critical temperature; the explosion mode of hydrazine is a confined thermal runaway reaction.

Bunker, R. L.↗

Optimization by nonhierarchical asynchronous decomposition

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.

Shankar, Jayashree↗

Task decomposition for a multilimbed robot to work in reachable but unorientable space

Robot manipulators installed on legged mobile platforms are suggested for enlarging robot workspace. To plan the motion of such a system, the arm-platform motion coordination problem is raised, and a task decomposition is proposed to solve the problem. A given task described by the destination position and orientation of the end effector is decomposed into subtasks for arm manipulation and for platform configuration, respectively. The former is defined as the end-effector position and orientation with respect to the platform, and the latter as the platform position and orientation in the base coordinates. Three approaches are proposed for the task decomposition. The approaches are also evaluated in terms of the displacements, from which an optimal approach can be selected.

Su, Chau↗

A decomposition method for optimization of large-system reliability

This paper considers a decomposition approach for optimization of the reliability of a large system with a general network structure. A 3-level methodology is developed for optimal allocation of available resources among subsystems in order to ensure maximization of system-reliability. The decentralized nature of this methodology greatly reduces the complexity of the large problem and facilitates seeking the optimal solution. Two examples show that the complexity of a large system can be greatly reduced by solving several smaller-dimensional sub-problems iteratively. Sub-problems whose dimensions are small can be efficiently solved by any existing nonlinear programming method. Another important feature of this approach is the possible simplification of the objective function during the solution. This leads in some cases to an analytic solution for the lower-level optimization problems in a 3-level decomposition solution.

Li, Duan↗

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, rarefied 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.↗

An intelligent decomposition approach for efficient design of non-hierarchic systems

The design process associated with large engineering systems requires an initial decomposition of the complex systems into subsystem modules which are coupled through transference of output data. The implementation of such a decomposition approach assumes the ability exists to determine what subsystems and interactions exist and what order of execution will be imposed during the analysis process. Unfortunately, this is quite often an extremely complex task which may be beyond human ability to efficiently achieve. Further, in optimizing such a coupled system, it is essential to be able to determine which interactions figure prominently enough to significantly affect the accuracy of the optimal solution. The ability to determine 'weak' versus 'strong' coupling strengths would aid the designer in deciding which couplings could be permanently removed from consideration or which could be temporarily suspended so as to achieve computational savings with minimal loss in solution accuracy. An approach that uses normalized sensitivities to quantify coupling strengths is presented. The approach is applied to a coupled system composed of analysis equations for verification purposes.

Bloebaum, Christina L.↗

Approximation, abstraction and decomposition in search and optimization

In this paper, I discuss four different areas of my research. One portion of my research has focused on automatic synthesis of search control heuristics for constraint satisfaction problems (CSPs). I have developed techniques for automatically synthesizing two types of heuristics for CSPs: Filtering functions are used to remove portions of a search space from consideration. Another portion of my research is focused on automatic synthesis of hierarchic algorithms for solving constraint satisfaction problems (CSPs). I have developed a technique for constructing hierarchic problem solvers based on numeric interval algebra. Another portion of my research is focused on automatic decomposition of design optimization problems. We are using the design of racing yacht hulls as a testbed domain for this research. Decomposition is especially important in the design of complex physical shapes such as yacht hulls. Another portion of my research is focused on intelligent model selection in design optimization. The model selection problem results from the difficulty of using exact models to analyze the performance of candidate designs.

Ellman, Thomas↗

Polar decomposition for attitude determination from vector observations

This work treats the problem of weighted least squares fitting of a 3D Euclidean-coordinate transformation matrix to a set of unit vectors measured in the reference and transformed coordinates. A closed-form analytic solution to the problem is re-derived. The fact that the solution is the closest orthogonal matrix to some matrix defined on the measured vectors and their weights is clearly demonstrated. Several known algorithms for computing the analytic closed form solution are considered. An algorithm is discussed which is based on the polar decomposition of matrices into the closest unitary matrix to the decomposed matrix and a Hermitian matrix. A somewhat longer improved algorithm is suggested too. A comparison of several algorithms is carried out using simulated data as well as real data from the Upper Atmosphere Research Satellite. The comparison is based on accuracy and time consumption. It is concluded that the algorithms based on polar decomposition yield a simple although somewhat less accurate solution. The precision of the latter algorithms increase with the number of the measured vectors and with the accuracy of their measurement.

Bar-Itzhack, Itzhack Y.↗

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A preconditioned domain decomposition scheme is introduced for the solution of the 3D aerodynamic sensitivity equation. This scheme uses the iterative GMRES procedure to solve the effective sensitivity equation of the boundary-interface cells in the sensitivity analysis domain-decomposition scheme. Excluding the dense matrices and the effect of cross terms between boundary-interfaces is found to produce an efficient preconditioning matrix.

Eleshaky, Mohammed E.↗

The helical decomposition and the instability assumption

Direct numerical simulations show that the triadic transfer function T(k,p,q) peaks sharply when q (or p) is much smaller than k. The triadic transfer function T(k,p,q) gives the rate of energy input into wave number k from all interactions with modes of wave number p and q, where k, p, q form a triangle. This observation was thought to suggest that energy is cascaded downscale through non-local interactions with local transfer and that there was a strong connection between large and small scales. Both suggestions were in contradiction with the classical Kolmogorov picture of the energy cascade. The helical decomposition was found useful in distinguishing between kinematically independent interactions. That analysis has gone beyond the question of non-local interaction with local transfer. In particular, an assumption about the statistical direction of triadic energy transfer in any kinematically independent interaction was introduced (the instability assumption). That assumption is not necessary for the conclusions about non-local interactions with local transfer recalled above. In the case of turbulence under rapid rotation, the instability assumption leads to the prediction that energy is transferred in spectral space from the poles of the rotation axis toward the equator. The instability assumption is thought to be of general validity for any type of triad interactions (e.g. internal waves). The helical decomposition and the instability assumption offer detailed information about the homogeneous statistical dynamics of the Navier-Stokes equations. The objective was to explore the validity of the instability assumption and to study the contributions of the various types of helical interactions to the energy cascade and the subgrid-scale eddy-viscosity. This was done in the context of spectral closures of the Direct Interaction or Quasi-Normal type.

Waleffe, Fabian A.↗

On the decomposition of synchronous state mechines using sequence invariant state machines

This paper presents a few techniques for the decomposition of Synchronous State Machines of medium to large sizes into smaller component machines. The methods are based on the nature of the transitions and sequences of states in the machine and on the number and variety of inputs to the machine. The results of the decomposition, and of using the Sequence Invariant State Machine (SISM) Design Technique for generating the component machines, include great ease and quickness in the design and implementation processes. Furthermore, there is increased flexibility in making modifications to the original design leading to negligible re-design time.

Hebbalalu, K.↗

An investigation of the use of temporal decomposition in space mission scheduling

This research involves an examination of techniques for solving scheduling problems in long-duration space missions. The mission timeline is broken up into several time segments, which are then scheduled incrementally. Three methods are presented for identifying the activities that are to be attempted within these segments. The first method is a mathematical model, which is presented primarily to illustrate the structure of the temporal decomposition problem. Since the mathematical model is bound to be computationally prohibitive for realistic problems, two heuristic assignment procedures are also presented. The first heuristic method is based on dispatching rules for activity selection, and the second heuristic assigns performances of a model evenly over timeline segments. These heuristics are tested using a sample Space Station mission and a Spacelab mission. The results are compared with those obtained by scheduling the missions without any problem decomposition. The applicability of this approach to large-scale mission scheduling problems is also discussed.

Bullington, Stanley E.↗