Search NASASearch

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 109 records · Page 6

Interface conditions for domain decomposition with radical grid refinement

Interface conditions for coupling the domains in a physically motivated domain decomposition method are discussed. The domain decomposition is based on an asymptotic-induced method for the numerical solution of hyperbolic conservation laws with small viscosity. The method consists of multiple stages. The first stage is to obtain a first approximation using a first-order method, such as the Godunov scheme. Subsequent stages of the method involve solving internal-layer problem via a domain decomposition. The method is derived and justified via singular perturbation techniques.

Scroggs, Jeffrey S.

Neural network based decomposition in optimal structural synthesis

The present paper describes potential applications of neural networks in the multilevel decomposition based optimal design of structural systems. The generic structural optimization problem of interest, if handled as a single problem, results in a large dimensionality problem. Decomposition strategies allow for this problem to be represented by a set of smaller, decoupled problems, for which solutions may either be obtained with greater ease or may be obtained in parallel. Neural network models derived through supervised training, are used in two distinct modes in this work. The first uses neural networks to make available efficient analysis models for use in repetitive function evaluations as required by the optimization algorithm. In the second mode, neural networks are used to represent the coupling that exists between the decomposed subproblems. The approach is illustrated by application to the multilevel decomposition-based synthesis of representative truss and frame structures.

Hajela, P.

Parallel decomposition methods for the solution of electromagnetic scattering problems

This paper contains a overview of the methods used in decomposing solutions to scattering problems onto coarse-grained parallel processors. Initially, a short summary of relevant computer architecture is presented as background to the subsequent discussion. After the introduction of a programming model for problem decomposition, specific decompositions of finite difference time domain, finite element, and integral equation solutions to Maxwell's equations are presented. The paper concludes with an outline of possible software-assisted decomposition methods and a summary.

Cwik, Tom

Downstream evolution of proper orthogonal decomposition eigenfunctions in a lobed mixer

A two-dimensional (one space and time) scalar adaptation of the proper orthogonal decomposition was applied to streamwise velocity data obtained in a lobed mixer flowfield, using a rake of 15 single-component hot wires. Through the application of the proper orthogonal decomposition, the amount of streamwise turbulent kinetic energy contained in the various proper orthogonal modes was examined for two different downstream locations (z/h = 2.6 and 3.9). The large eddy or dominant mode was shown to have a measurable decrease in the relative streamwise component of the kinetic energy between these two downstream locations. This indicates that the large eddy, as defined by the proper orthogonal decomposition, breaks down, and the flow becomes more homogeneous. A pseudoflow visualization technique was then employed to help visualize this process.

Ukeiley, L.

Optimization by decomposition in structural and multidisciplinary applications

An algorithm for a general, multilevel structural optimization by substructuring is derived, based on the linear decomposition concept that is rooted in the Bellman's Optimality Criterion enhanced with the optimum sensitivity derivatives used as a means to account for coupling among the subproblems, each of which is limited to optimization of a substructure. The algorithm applies also to those multidisciplinary problems whose subproblems form a hierarchy similar to that of substructures. In systems where the subproblems communicate with each other at the same level, the decomposition becomes non-hierarchic and the system may be optimized as a whole based on the derivatives of the system behavior with respect to the design variables computed by a method that bypasses finite differencing on the system analysis. When a multidisciplinary system includes a structure as its part, a hybrid, hierarchic/non-hierarchic decomposition applies. Numerical examples and references to computational experience accumulated to date illustrate the discussion.

Sobieszczanski-Sobieski, Jaroslaw

New evidence favoring multilevel decomposition and optimization

The issue of the utility of multilevel decomposition and optimization remains controversial. To date, only the structural optimization community has actively developed and promoted multilevel optimization techniques. However, even this community acknowledges that multilevel optimization is ideally suited for a rather limited set of problems. It is warned that decomposition typically requires eliminating local variables by using global variables and that this in turn causes ill-conditioning of the multilevel optimization by adding equality constraints. The purpose is to suggest a new multilevel optimization technique. This technique uses behavior variables, in addition to design variables and constraints, to decompose the problem. The new technique removes the need for equality constraints, simplifies the decomposition of the design problem, simplifies the programming task, and improves the convergence speed of multilevel optimization compared to conventional optimization.

Padula, Sharon L.

Application of Cloude's target decomposition theorem to polarimetric imaging radar data

In this paper we applied Cloude's decomposition to imaging radar polarimetry. We show in detail how the decomposition results can guide the interpretation of scattering from vegetated areas. For multifrequency polarimetric radar measurements of a clear-cut area, the decomposition leads us to conclude that the vegetation is probably thin compared to even the C-band radar wavelength of 6 cm. For a frosted area, we notice an increased amount of even number of reflection scattering at P-band and L-band, probably the result of penetration through the coniferous canopy resulting in trunk-ground double reflection scattering. However, the scattering for the forested area is still dominated by scattering from randomly oriented cylinders. It is found that these cylinders are thicker than in the case of clear-cut areas, leading us to conclude that scattering from the branches probably dominates in this case.

Vanzyl, Jakob J.

Application of Cloude's target decomposition theorem to polarimetric imaging radar data

We apply Cloude's decomposition to imaging radar polarimetry. We derive the general expressions for the eigenvalues and eigenvectors for the case of terrain with reflection symmetry, and show in detail how the decomposition results can guide the interpretation of scattering from vegetated areas. For multi-frequency polarimetric radar measurements of a clear-cut area, the decomposition leads us to conclude that the vegetation is probably thin compared to even the C-band radar wavelength of 6 cm. For a forested area, we notice an increased amount of even number of reflection scattering at P-band and L-band, probably the result of penetration through the coniferous canopy resulting in trunk-ground double reflection scattering. The scattering for the forested area is still dominated by scattering from randomly oriented cylinders, however. It is found that these cylinders are thicker than in the case of clear-cut areas, leading us to conclude that scattering from the branches probably dominate in this case.

Vanzyl, Jakob J.

Application of the target decomposition theorem to a polarimetric random media model

With advances in polarimetric radar measurements of land surfaces, the need for understanding the underlying scattering mechanisms and dominant target features has become the focus of many studies. In particular, the maximum use of the polarimetric information to identify and/or separate parameters related to the surface features such as vegetation thickness, structure, water content, and soil surface characteristics will enhance the possibility of using polarimetric radars for monitoring the earth's surface from space. In this paper, Cloude's decomposition theorem is applied to a polarimetric random media model to simulate the radar measurements of vegetated canopies. The vegetated canopies are modeled as a three layer discrete random medium with leaves and branches in the first layer, tree trunks in the second layer, and a half space of homogeneous ground with rough interface as the bottom layer. The distorted born approximation (DBA) has been used to compute full Mueller matrix of the canopy, using canonical dielectric objects such as thin discs and cylinders as leaves, branches, and trunks, respectively. The Mueller matrix and the derived covariance matrix contain information on the second order statistics of radar signals at various polarizations from the canopy. To decompose the covariance matrix to its constituent targets, the eigenvalues and eigenvectors of the covariance matrix are computed in terms of the physical parameters of the canopy. In addition, each eigenvector explicitly shows the scattering mechanisms such as odd and even reflections in the canopy. Cloude's decomposition theorem is applied using the Pauli spin matrices as a basis and an expression for the degree of disorder or the entropy for the vegetated surface is found. Then, the physical parameters estimated from in situ measurements are used in the random media to obtain realistic covariance matrices. As a result, the sensitivity of the eigenvalue spectrums and the coefficients resulting from the target decomposition theorem to the physical parameters of the canopy are examined and the possible use of Cloude's theorem to estimate vegetation and soil parameters is discussed.

Saatchi, Sasan S.

Perfluoropolyalkylether decomposition on catalytic aluminas

The decomposition of Fomblin Z25, a commercial perfluoropolyalkylether liquid lubricant, was studied using the Penn State Micro-oxidation Test, and a thermal gravimetric/differential scanning calorimetry unit. The micro-oxidation test was conducted using 440C stainless steel and pure iron metal catalyst specimens, whereas the thermal gravimetric/differential scanning calorimetry tests were conducted using catalytic alumina pellets. Analysis of the thermal data, high pressure liquid chromatography data, and x-ray photoelectron spectroscopy data support evidence that there are two different decomposition mechanisms for Fomblin Z25, and that reductive sites on the catalytic surfaces are responsible for the decomposition of Fomblin Z25.

Morales, Wilfredo

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel

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

Differential Scanning Calorimetry of Volatile-Bearing Iron Minerals Under Mars-Like Pressures: New Insights Into Energetics and Mechanisms of Thermal Decomposition

In this study, we have examined the thermal decomposition of two volatile-bearing iron minerals, in particular, lepidocrocite (gamma-FeOOH) and siderite (FeCO3), under Mars-like pressures. Both minerals exhibit different enthalpic events during their decomposition at reduced atmospheric pressures when compared to those at ambient pressure. These differences in energetics are related to the mechanisms of thermal decomposition at Mars-like pressures. Such knowledge regarding the thermal stability of volatile-bearing minerals on Mars will provide useful information for planetary surface processes.

Lin, I.-C.

A New Method for Nonlinear and Nonstationary Time Series Analysis: The Empirical Mode Decomposition Method

A new method for analyzing nonlinear and nonstationary data has been developed. The key part of the method is the Empirical Mode Decomposition method with which any complicated data set can be decomposed into a finite and often small number of Intrinsic Mode Functions (IMF). An IMF is defined as any function having the same numbers of zero-crossing and extrema, and also having symmetric envelopes defined by the local maxima and minima respectively. The IMF also admits well-behaved Hilbert transform. This decomposition method is adaptive, and, therefore, highly efficient. Since the decomposition is based on the local characteristic time scale of the data, it is applicable to nonlinear and nonstationary processes. With the Hilbert transform, the Intrinsic Mode Functions yield instantaneous frequencies as functions of time that give sharp identifications of imbedded structures. The final presentation of the results is an energy-frequency-time distribution, designated as the Hilbert Spectrum. Classical nonlinear system models are used to illustrate the roles played by the nonlinear and nonstationary effects in the energy-frequency-time distribution.

Huang, Norden E.

A Domain Decomposition Parallelization of the Fast Marching Method

In this paper, the first domain decomposition parallelization of the Fast Marching Method for level sets has been presented. Parallel speedup has been demonstrated in both the optimal and non-optimal domain decomposition case. The parallel performance of the proposed method is strongly dependent on load balancing separately the number of nodes on each side of the interface. A load imbalance of nodes on either side of the domain leads to an increase in communication and rollback operations. Furthermore, the amount of inter-domain communication can be reduced by aligning the inter-domain boundaries with the interface normal vectors. In the case of optimal load balancing and aligned inter-domain boundaries, the proposed parallel FMM algorithm is highly efficient, reaching efficiency factors of up to 0.98. Future work will focus on the extension of the proposed parallel algorithm to higher order accuracy. Also, to further enhance parallel performance, the coupling of the domain decomposition parallelization to the G(sub 0)-based parallelization will be investigated.

Herrmann, M.

Phlogopite Decomposition, Water, and Venus

Venus is a hot and dry planet with a surface temperature of 660 to 740 K and 30 parts per million by volume (ppmv) water vapor in its lower atmosphere. In contrast Earth has an average surface temperature of 288 K and 1-4% water vapor in its troposphere. The hot and dry conditions on Venus led many to speculate that hydrous minerals on the surface of Venus would not be there today even though they might have formed in a potentially wetter past. Thermodynamic calculations predict that many hydrous minerals are unstable under current Venusian conditions. Thermodynamics predicts whether a particular mineral is stable or not, but we need experimental data on the decomposition rate of hydrous minerals to determine if they survive on Venus today. Previously, we determined the decomposition rate of the amphibole tremolite, and found that it could exist for billions of years at current surface conditions. Here, we present our initial results on the decomposition of phlogopite mica, another common hydrous mineral on Earth.

Johnson, N. M.

Computer implemented empirical mode decomposition method, apparatus and article of manufacture

A computer implemented physical signal analysis method is invented. This method includes two essential steps and the associated presentation techniques of the results. All the steps exist only in a computer: there are no analytic expressions resulting from the method. The first step is a computer implemented Empirical Mode Decomposition to extract a collection of Intrinsic Mode Functions (IMF) from nonlinear, nonstationary physical signals. The decomposition is based on the direct extraction of the energy associated with various intrinsic time scales in the physical signal. Expressed in the IMF's, they have well-behaved Hilbert Transforms from which instantaneous frequencies can be calculated. The second step is the Hilbert Transform. The final result is the Hilbert Spectrum. Thus, the invention can localize any event on the time as well as the frequency axis. The decomposition can also be viewed as an expansion of the data in terms of the IMF's. Then, these IMF's, based on and derived from the data, can serve as the basis of that expansion. The local energy and the instantaneous frequency derived from the IMF's through the Hilbert transform give a full energy-frequency-time distribution of the data which is designated as the Hilbert Spectrum.

Huang, Norden E.

Empirical mode decomposition apparatus, method and article of manufacture for analyzing biological signals and performing curve fitting

A computer implemented physical signal analysis method includes four basic steps and the associated presentation techniques of the results. The first step is a computer implemented Empirical Mode Decomposition that extracts a collection of Intrinsic Mode Functions (IMF) from nonlinear, nonstationary physical signals. The decomposition is based on the direct extraction of the energy associated with various intrinsic time scales in the physical signal. Expressed in the IMF's, they have well-behaved Hilbert Transforms from which instantaneous frequencies can be calculated. The second step is the Hilbert Transform which produces a Hilbert Spectrum. Thus, the invention can localize any event on the time as well as the frequency axis. The decomposition can also be viewed as an expansion of the data in terms of the IMF's. Then, these IMF's, based on and derived from the data, can serve as the basis of that expansion. The local energy and the instantaneous frequency derived from the IMF's through the Hilbert transform give a full energy-frequency-time distribution of the data which is designated as the Hilbert Spectrum. The third step filters the physical signal by combining a subset of the IMFs. In the fourth step, a curve may be fitted to the filtered signal which may not have been possible with the original, unfiltered signal.

Huang, Norden E.