Search NASA⌕ Search

SEARCH · Search NASA

Results for “Structural 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 253 records · Page 14

Decomposition Algorithm for Global Reachability on a Time-Varying Graph

A decomposition algorithm has been developed for global reachability analysis on a space-time grid. By exploiting the upper block-triangular structure, the planning problem is decomposed into smaller subproblems, which is much more scalable than the original approach. Recent studies have proposed the use of a hot-air (Montgolfier) balloon for possible exploration of Titan and Venus because these bodies have thick haze or cloud layers that limit the science return from an orbiter, and the atmospheres would provide enough buoyancy for balloons. One of the important questions that needs to be addressed is what surface locations the balloon can reach from an initial location, and how long it would take. This is referred to as the global reachability problem, where the paths from starting locations to all possible target locations must be computed. The balloon could be driven with its own actuation, but its actuation capability is fairly limited. It would be more efficient to take advantage of the wind field and ride the wind that is much stronger than what the actuator could produce. It is possible to pose the path planning problem as a graph search problem on a directed graph by discretizing the spacetime world and the vehicle actuation. The decomposition algorithm provides reachability analysis of a time-varying graph. Because the balloon only moves in the positive direction in time, the adjacency matrix of the graph can be represented with an upper block-triangular matrix, and this upper block-triangular structure can be exploited to decompose a large graph search problem. The new approach consumes a much smaller amount of memory, which also helps speed up the overall computation when the computing resource has a limited physical memory compared to the problem size.

Kuwata, Yoshiaki↗

Decomposing Systems Into Subsystems For Design

Interactions among systems displayed in concise format. DeMAID (Design Manager's Aide for Intelligent Decomposition) is knowledge based software system for automating sequencing of subprocesses in design process and identifying possible multilevel structure for synthesis problem. Reorders and groups modules of equipment being designed on basis of links among modules, helping design manager make design decisions early in design cycle. Written in FORTRAN 77.

Rogers, James L., Jr.↗

Program Helps Decompose Complex Design Systems

DeMAID (A Design Manager's Aid for Intelligent Decomposition) computer program is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Groups modular subsystems on basis of interactions among them. Saves considerable money and time in total design process, particularly in new design problem in which order of modules has not been defined. Available in two machine versions: Macintosh and Sun.

Rogers, James L., Jr.↗

Program Helps Decompose Complex Design Systems

DeMAID (Design Manager's Aid for Intelligent Decomposition) computer program is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problems such as large platforms in outer space. Groups modular subsystems on basis of interactions among them. Saves considerable amount of money and time in total design process, particularly in new design problem in which order of modules has not been defined. Originally written for design problems, also applicable to problems containing modules (processes) that take inputs and generate outputs. Available in three machine versions: Macintosh written in Symantec's Think C 3.01, Sun, and SGI IRIS in C language.

Rogers, James L., Jr.↗

Analytical and Computational Properties of Distributed Approaches to MDO

Historical evolution of engineering disciplines and the complexity of the MDO problem suggest that disciplinary autonomy is a desirable goal in formulating and solving MDO problems. We examine the notion of disciplinary autonomy and discuss the analytical properties of three approaches to formulating and solving MDO problems that achieve varying degrees of autonomy by distributing the problem along disciplinary lines. Two of the approaches-Optimization by Linear Decomposition and Collaborative Optimization-are based on bi-level optimization and reflect what we call a structural perspective. The third approach, Distributed Analysis Optimization, is a single-level approach that arises from what we call an algorithmic perspective. The main conclusion of the paper is that disciplinary autonomy may come at a price: in the bi-level approaches, the system-level constraints introduced to relax the interdisciplinary coupling and enable disciplinary autonomy can cause analytical and computational difficulties for optimization algorithms. The single-level alternative we discuss affords a more limited degree of autonomy than that of the bi-level approaches, but without the computational difficulties of the bi-level methods. Key Words: Autonomy, bi-level optimization, distributed optimization, multidisciplinary optimization, multilevel optimization, nonlinear programming, problem integration, system synthesis

Alexandrov, Natalia M.↗

Computational and Experimental Study of Energetic Materials in a Counterflow Microgravity Environment

Counterflow diffusion flames are studied for various fuels flowing against decomposition products from solid ammonium perchlorate (AP) pellets in order to obtain fundamental understanding of composite propellant flame structure and chemistry. We illustrate this approach through a combined experimental and numerical study of a fuel mixture consisting of C2H4 CO + H2, and C2H2 + C2H4 flowing against solid AP. For these particular AP-fuel systems, the resulting flame zone simulates the various flame structures that are ex+ to exist between reaction products from Ap crystals and a hydrocarbon binder. As in all our experimental studies, quantitative species and temperature profiles have been measured between the fuel exit and AP surface. Species measured included CN, NH, NO, OH, N2, CO2, CO, H2, CO, HCl, and H2O. Temperature was measured using a thermocouple at the exit, spontaneous Raman scattering measurements throughout the flame, OH rotational population distributions, and NO vibrational population distributions. The burning rate of AP was also measured as a function of strain rate, given by the separation distance between the AP surface and the gaseous hydrocarbon fuel tube exit plane. This distance was nominally set at 5 mm, although studies have been performed for variations in separation distance. The measured 12 scalars are compared with predictions from a detailed gas-phase kinetics model consisting of 86 species and 531 reactions. Model predictions are found to be in good agreement with experiment and illustrate the type of kinetic features that may be expected to occur in propellants when AP particle size distributions are varied. Furthermore, the results constitute the continued development of a necessary database and validation of a comprehensive model for studying more complex AP-solid fuel systems in microgravity. Exploratory studies have also been performed with liquid and solid fuels at normal gravity. Because of melting (and hence dripping) and deep thermal wave penetration into the liquid, these experiments were found feasible, but not used for obtaining quantitative data. Microgravity experiments are needed to eliminate the dripping and boiling phenomena of these systems at normal gravity. Microgravity tests in the NASA Glenn 2.2 second drop tower were performed (1) to demonstrate the feasibility of performing propellant experiments using the NASA Glenn microgravity facilities, (2) to develop the operational procedures for safe handing of the energetic materials and disposal of their toxic combustion by-products and (3) to obtain initial measurements of the AP burning rate and flame structure under microgravity conditions. Experiments were conducted on the CH4/AP system previously studied at normal gravity using a modified design of the counterflow burner and a NASA Glenn Pig Rig, i.e., one of the existing drop rigs for general-purpose usage. In these experiments, the AP burning rate was measured directly with a linear variable differential transducer (LVDT) and video imaging of the flame structure was recorded ignition was achieved by hot wires stretched across the AP surfaces. Initial drop tower combustion data show that with the same burner separation distance and flow conditions of the normal gravity experiments, the AP burning rate is approximately a factor of two lower. This difference is likely a result of radiation effects, but further tests with longer test times need to be conducted to verify that steady state conditions were achieved under microgravity conditions.

Takahashi, Fumiaki↗

Finding corner point correspondence from wavelet decomposition of image data

A time efficient algorithm for image registration between two images that differ in translation is discussed. The algorithm is based on coarse-fine strategy using wavelet decomposition of both the images. The wavelet decomposition serves two different purposes: (1) its high frequency components are used to detect feature points (corner points here) and (2) it provides coarse-to-fine structure for making the algorithm time efficient. The algorithm is based on detecting the corner points from one of the images called reference image and computing corresponding points from the other image called test image by using local correlations using 7x7 windows centered around the corner points. The corresponding points are detected at the lowest decomposition level in a search area of about 11x11 (depending on the translation) and potential points of correspondence are projected onto higher levels. In the subsequent levels the local correlations are computed in a search area of no more than 3x3 for refinement of the correspondence.

Manohar, Mareboyana↗

Investigation of the large scale coherent structure in a jet and its relevance to jet noise

A study was conducted to determine the causes of aircraft noise in large jet aircraft. It was determined that jet noise varies strongly with velocity and that significant pure tones are generated by rotor-stator interaction in the jet engines. An objective method for deducing the large eddy structure in a large jet is described. The provisions of lighthill's theory are analyzed and applied to investigating the nature of jet noise. There is considerable evidence that a large scale coherent structure exists in a jet and that this structure can play a major role in sound radiation. Mathematical models are developed to define the parameters of orthogonal decomposition, finite extent velocity field, homogeneous fields, and periodic velocity fields.

Arndt, R. E. A.↗

Functional reasoning in diagnostic problem solving

This work is one facet of an integrated approach to diagnostic problem solving for aircraft and space systems currently under development. The authors are applying a method of modeling and reasoning about deep knowledge based on a functional viewpoint. The approach recognizes a level of device understanding which is intermediate between a compiled level of typical Expert Systems, and a deep level at which large-scale device behavior is derived from known properties of device structure and component behavior. At this intermediate functional level, a device is modeled in three steps. First, a component decomposition of the device is defined. Second, the functionality of each device/subdevice is abstractly identified. Third, the state sequences which implement each function are specified. Given a functional representation and a set of initial conditions, the functional reasoner acts as a consequence finder. The output of the consequence finder can be utilized in diagnostic problem solving. The paper also discussed ways in which this functional approach may find application in the aerospace field.

Sticklen, Jon↗

Efficient Modal Basis Selection Criteria for Reduced-Order Nonlinear Simulation

A modal basis selection technique for a reduced-order nonlinear numerical simulation with application to two-dimensional structures is presented as a two-step procedure. A system identification analysis is first performed using proper orthogonal decomposition. Using these results, a set of load-invariant bases consisting of the normal modes is next selected. Two criteria for making the basis selection are offered; one using the modal assurance criterion and the other using the modal expansion theorem. The quality of the subsequent reduced-order analyses are examined through comparison with computationally intensive finite element nonlinear simulations in physical degrees-of-freedom. A clamped flat isotropic plate under a random acoustic loading is considered to demonstrate the procedure. It is found that the subject procedure enables formation of an accurate and computationally efficient reduced-order system applicable to a broad range of loading conditions.

Przekop, Adam↗

Parallel Adaptive Mesh Refinement Library

Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.

Mac-Neice, Peter↗

Plane waves and structures in turbulent channel flow

A direct simulation of turbulent flow in a channel is analyzed by the method of empirical eigenfunctions (Karhunen-Loeve procedure, proper orthogonal decomposition). This analysis reveals the presence of propagating plane waves in the turbulent flow. The velocity of propagation is determined by the flow velocity at the location of maximal Reynolds stress. The analysis further suggests that the interaction of these waves appears to be essential to the local production of turbulence via bursting or sweeping events in the turbulent boundary layer, with the additional suggestion that the fast acting plane waves act as triggers.

Sirovich, L.↗

Reduced Dimensionality Analysis of TEMPO Ozone Profile Retrievals Using the Compact Phase Space (CPSR) Algorithm

TEMPO ozone (O 3 ) profile retrievals are expected to have fidelity in the troposphere due the sensitivities of the associated averaging kernels. However, those averaging kernels are severely rank deficiency meaning that a visual inspection of the vertical structure of the averaging kernel profile sensitivities is misleading due linear dependencies in the profile. The Compact Phase Space Retrieval (CPSR) algorithm use singular value decompositions of the averaging kernels and the ‘compressed’ retrieval solution error covariance to project the transformed averaging kernels into a space that removes the linear dependencies and accounts for the solution error uncertainties. In this oral presentation and poster, we apply the CPSR dimensional reduction analysis to TEMPO and TROPOMI O 3 profile retrievals for 13:45 UTC March 29, 2024 to study the phase space characteristics of the transformed averaging kernels as a function of latitude for North America. Our results show that TEMPO generally has more phase space vertical structure in the troposphere than TROPOMI. TEMPO has four to five dominant modes, and TROPOMI has five to six dominant modes. That means that dimensional reduction can reduce the TEMPO resource requirements by ~77% and the TROPOMI requirements by ~81%. Finally, we found that after removing linear dependences and after accounting for solution uncertainties TEMPO still has sensitivities throughout the troposphere.

TEMPO↗

A simple parallel prefix algorithm for compact finite-difference schemes

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is highly efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study was conducted to provide a simple truncation formula. Experimental results were measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for the compact scheme on high-performance computers.

Sun, Xian-He↗

Symposium on Parallel Computational Methods for Large-scale Structural Analysis and Design, 2nd, Norfolk, VA, US

Computing speed is leaping forward by several orders of magnitude each decade. Engineers and scientists gathered at a NASA Langley symposium to discuss these exciting trends as they apply to parallel computational methods for large-scale structural analysis and design. Among the topics discussed were: large-scale static analysis; dynamic, transient, and thermal analysis; domain decomposition (substructuring); and nonlinear and numerical methods.

Storaasli, Olaf O.↗

Plane-wave analysis of solar acoustic-gravity waves: A (slightly) new approach

The plane-wave decomposition of the acoustic-gravity wave effects observed in the photosphere provides a computationally efficient technique that probes the structure of the upper convective zone and boundary. In this region, the flat sun approximation is considered as being reasonably accurate. A technique to be used for the systematic plane-wave analysis of Michelson Doppler imager data, as part of the solar oscillations investigation, is described. Estimates of sensitivity are presented, and the effects of using different planar mappings are discussed. The technique is compared with previous approaches to the three dimensional plane-wave problem.

Bogart, Richard S.↗

Observation and Modeling of Single Wall Carbon Nanotube Bend Junctions

Single wall carbon nanotube (SWNT) bends, with diameters from approx. 1.0 to 2.5 nm and bend angles from 18 deg. to 34 deg., are observed in catalytic decomposition of hydrocarbons at 600 - 1200 C. An algorithm using molecular dynamics simulation (MD) techniques is developed to model these structures that are considered to be SWNT junctions formed by topological defects (i.e. pentagon-heptagon pairs). The algorithm is used to predict the tube helicities and defect configurations for bend junctions using the observed tube diameters and bend angles. The number and arrangement of the defects at the junction interfaces are found to depend on the tube helicities and bend angle. The structural and energetic calculations using the Brenner potential show a number of stable junction configurations for each bend angle with the 34 deg. bends being more stable than the others. Tight binding calculations for local density of state (LDOS) and transmission coefficients are carried out to investigate electrical properties of the bend junctions.

Han, Jie↗

A Parallel Prefix Algorithm for Almost Toeplitz Tridiagonal Systems

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study has been conducted to provide a simple truncation formula. Experimental results have been measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for symmetric, almost symmetric Toeplitz tridiagonal systems and for the compact scheme on high-performance computers.

Sun, Xian-He↗