Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 1,117 records · Page 62

Dynamic Identification for Control of Large Space Structures

This is a compilation of reports by the one author on one subject. It consists of the following five journal articles: (1) A Parametric Study of the Ibrahim Time Domain Modal Identification Algorithm; (2) Large Modal Survey Testing Using the Ibrahim Time Domain Identification Technique; (3) Computation of Normal Modes from Identified Complex Modes; (4) Dynamic Modeling of Structural from Measured Complex Modes; and (5) Time Domain Quasi-Linear Identification of Nonlinear Dynamic Systems.

Ibrahim, S. R.↗

Parallel algorithms for mapping pipelined and parallel computations

Many computational problems in image processing, signal processing, and scientific computing are naturally structured for either pipelined or parallel computation. When mapping such problems onto a parallel architecture it is often necessary to aggregate an obvious problem decomposition. Even in this context the general mapping problem is known to be computationally intractable, but recent advances have been made in identifying classes of problems and architectures for which optimal solutions can be found in polynomial time. Among these, the mapping of pipelined or parallel computations onto linear array, shared memory, and host-satellite systems figures prominently. This paper extends that work first by showing how to improve existing serial mapping algorithms. These improvements have significantly lower time and space complexities: in one case a published O(nm sup 3) time algorithm for mapping m modules onto n processors is reduced to an O(nm log m) time complexity, and its space requirements reduced from O(nm sup 2) to O(m). Run time complexity is further reduced with parallel mapping algorithms based on these improvements, which run on the architecture for which they create the mappings.

Nicol, David M.↗

Genetically Engineered Microelectronic Infrared Filters

A genetic algorithm is used for design of infrared filters and in the understanding of the material structure of a resonant tunneling diode. These two components are examples of microdevices and nanodevices that can be numerically simulated using fundamental mathematical and physical models. Because the number of parameters that can be used in the design of one of these devices is large, and because experimental exploration of the design space is unfeasible, reliable software models integrated with global optimization methods are examined The genetic algorithm and engineering design codes have been implemented on massively parallel computers to exploit their high performance. Design results are presented for the infrared filter showing new and optimized device design. Results for nanodevices are presented in a companion paper at this workshop.

Cwik, Tom↗

Problems in large-scale structural optimization

A general design optimization model for large complex systems is defined. Major features of the model that challenge various optimization algorithms are discussed. Requirements of a model optimization algorithm are identified. Objectives of the study of various algorithms are defined and a basis for conducting such a study is developed. Primal as well as transformation methods are analytically studied and a unified viewpoint of various methods is presented. Several numerical examples are solved using different methods to study their performance. Conclusions drawn from the study are presented and discussed. Areas of future research in nonlinear programming as well as structural optimization are identified and discussed.

Arora, J. S.↗

What Does Reflection from Cloud Sides Tell Us About Vertical Distribution of Cloud Droplet Sizes?

Cloud development, the onset of precipitation and the effect of aerosol on clouds depend on the structure of the cloud profiles of droplet size and phase. Aircraft measurements of cloud profiles are limited in their temporal and spatial extent. Satellites were used to observe cloud tops not cloud profiles with vertical profiles of precipitation-sized droplets anticipated from Cloudsat. The recently proposed CLAIM-3D satellite mission (cloud aerosol interaction mission in 3D) suggests to measure profiles of cloud microphysical properties by retrieving them from the solar and infrared radiation reflected or emitted from cloud sides. Inversion of measurements from the cloud sides requires rigorous understanding of the 3-dimensional (3D) properties of clouds. Here we discuss the reflected sunlight from the cloud sides and top at two wavelengths: one nonabsorbing to solar radiation (0.67 micrometers) and one with liquid water efficient absorption of solar radiation (2.1 micrometers). In contrast to the plane-parallel approximation, a conventional approach to all current operational retrievals, 3D radiative transfer is used for interpreting the observed reflectances. General properties of the radiation reflected from the sides of an isolated cloud are discussed. As a proof of concept, the paper shows a few examples of radiation reflected from cloud fields generated by a simple stochastic cloud model with the prescribed vertically resolved microphysics. To retrieve the information about droplet sizes, we propose to use the probability density function of the droplet size distribution and its first two moments instead of the assumption about fixed values of the droplet effective radius. The retrieval algorithm is based on the Bayesian theorem that combines prior information about cloud structure and microphysics with radiative transfer calculations.

Marshak, Alexander↗

Regional mapping of forest canopy water content and biomass using AIRSAR images over BOREAS study area

In recent years, monitoring vegetation biomass over various climate zones has become the primary focus of several studies interested in assessing the role of the ecosystem responses to climate change and human activities. Airborne and spaceborne Synthetic Aperture Radar (SAR) systems provide a useful tool to directly estimate biomass due to its sensitivity to structural and moisture characteristics of vegetation canopies. Even though the sensitivity of SAR data to total aboveground biomass has been successfully demonstrated in many controlled experiments over boreal forests and forest plantations, so far, no biomass estimation algorithm has been developed. This is mainly due to the fact that the SAR data, even at lowest frequency (P-band) saturates at biomass levels of about 200 tons/ha, and the structure and moisture information in the SAR signal forces the estimation algorithm to be forest type dependent. In this paper, we discuss the development of a hybrid forest biomass algorithm which uses a SAR derived land cover map in conjunction with a forest backscatter model and an inversion algorithm to estimate forest canopy water content. It is shown that unlike the direct biomass estimation from SAR data, the estimation of water content does not depend on the seasonal and/or environmental conditions. The total aboveground biomass can then be derived from canopy water content for each type of forest by incorporating other ecological information. Preliminary results from this technique over several boreal forest stands indicate that (1) the forest biomass can be estimated with reasonable accuracy, and (2) the saturation level of the SAR signal can be enhanced by separating the crown and trunk biomass in the inversion algorithm. We have used the JPL AIRSAR data over BOREAS southern study area to test the algorithm and to generate regional scale water content and biomass maps. The results are compared with ground data and the sources of errors are discussed. Several SAR images in synoptic modes are used to generate the parameter maps. The maps are then combined to generate mosaic maps over the BOREAS modeling grid.

Saatchi, Sasan↗

What does Reflection from Cloud Sides tell us about Vertical Distribution of Cloud Droplet Sizes?

Cloud development, the onset of precipitation and the effect of aerosol on clouds depend on the structure of the cloud profiles of droplet size and phase. Aircraft measurements of cloud profiles are limited in their temporal and spatial extent. Satellites were used to observe cloud tops not cloud profiles with vertical profiles of precipitation-sized droplets anticipated from CloudSat. The recently proposed CLAIM-3D satellite mission (cloud aerosol interaction mission in 3-D) suggests to measure profiles of cloud microphysical properties by retrieving them from the solar and infrared radiation reflected or emitted from cloud sides. Inversion of measurements from the cloud sides requires rigorous understanding of the 3-dimentional(3-D) properties of clouds. Here we discuss the reflected sunlight from the cloud sides and top at two wavelengths: one nonabsorbing to solar radiation (0.67 microns) and one with liquid water efficient absorption of solar radiation (2.1 microns). In contrast to the plane-parallel approximation, a conventional approach to all current operational retrievals, 3-D radiative transfer is used for interpreting the observed reflectances. General properties of the radiation reflected from the sides of an isolated cloud are discussed. As a proof of concept, the paper shows a few examples of radiation reflected from cloud fields generated by a simple stochastic cloud model with the prescribed vertically resolved microphysics. To retrieve the information about droplet sizes, we propose to use the probability density function of the droplet size distribution and its first two moments instead of the assumption about fixed values of the droplet effective radius. The retrieval algorithm is based on the Bayesian theorem that combines prior information about cloud structure and microphysics with radiative transfer calculations.

Marshak, A.↗

A VHDL Core for Intrinsic Evolution of Discrete Time Filters with Signal Feedback

The design of an Evolvable Machine VHDL Core is presented, representing a discrete-time processing structure capable of supporting control system applications. This VHDL Core is implemented in an FPGA and is interfaced with an evolutionary algorithm implemented in firmware on a Digital Signal Processor (DSP) to create an evolvable system platform. The salient features of this architecture are presented. The capability to implement IIR filter structures is presented along with the results of the intrinsic evolution of a filter. The robustness of the evolved filter design is tested and its unique characteristics are described.

Gwaltney, David A.↗

Eddy current correction in volume-localized MR spectroscopy

The quality of volume-localized magnetic resonance spectroscopy is affected by eddy currents caused by gradient switching. Eddy currents can be reduced with improved gradient systems; however, it has been suggested that the distortion due to eddy currents can be compensated for during postprocessing with a single-frequency reference signal. The authors propose modifying current techniques for acquiring the single-frequency reference signal by using relaxation weighting to reduce interference from components that cannot be eliminated by digital filtering alone. Additional sequences with T1 or T2 weighting for reference signal acquisition are shown to have the same eddy current characteristics as the original signal without relaxation weighting. The authors also studied a new eddy current correction method that does not require a single-frequency reference signal. This method uses two free induction decays (FIDs) collected from the same volume with two sequences with opposite gradients. Phase errors caused by eddy currents are opposite in these two FIDs and can be canceled completely by combining the FIDs. These methods were tested in a phantom. Eddy current distortions were corrected, allowing quantitative measurement of structures such as the -CH = CH- component, which is otherwise undetectable.

NASA Discipline Musculoskeletal↗

Single-mode projection filters for modal parameter identification for flexible structures

Single-mode projection filters are developed for eigensystem parameter identification from both analytical results and test data. Explicit formulations of these projection filters are derived using the orthogonal matrices of the controllability and observability matrices in the general sense. A global minimum optimization algorithm is applied to update the filter parameters by using the interval analysis method. The updated modal parameters represent the characteristics of the test data. For illustration of this new approach, a numerical simulation for the MAST beam structure is shown by using a one-dimensional global optimization algorithm to identify modal frequencies and damping. The projection filters are practical for parallel processing implementation.

Huang, Jen-Kuang↗

Algorithms for parallel flow solvers on message passing architectures

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.

Vanderwijngaart, Rob F.↗

A hybrid M-algorithm/sequential decoder for convolutional and trellis codes

The Viterbi Algorithm (VA) is optimum in the sense of being maximum likelihood for decoding codes with a trellis structure. However, since the VA is in fact an exhaustive search of the code trellis, the complexity of the VA grows exponentially with the constraint length upsilon. This limits its application to codes with small values of upsilon and relatively modest coding gains. The M-Algorithm (MA) is a limited search scheme which carries forward M paths in the trellis, all of the same length. All successors of the M paths are extended at the next trellis depth, and all but the best M of these are dropped. Since a limited search convolutional decoder will flounder indefinitely if one of the paths in storage is not the correct one, the data are usually transmitted in blocks. It has been shown that the performance of the MA approaches the VA at high signal to noise ratios (SNR's) with an M which is far less than the 2 sup upsilon states in the full trellis. Thus the MA can be used with larger values of upsilon, making larger coding gains possible at high SNR's. However, it still requires a relatively large fixed computational effort to achieve good performance.

Wang, Fu-Quan↗

Numerical investigation of sound transmission through double wall cylinders with respect to active noise control

Market pressure for more fuel efficient air travel has led to increased use of turboprop and higher bypass turbofan engines. The low frequency components of propeller, jet and boundary layer noise are difficult to attenuate with conventional passive techniques. Weight and geometric restrictions for sound absorbing meterials limit the amount and type of treatment that may be applied. An active noise control (ANC) method is providing to be an attractive alternative. The approach taken in this paper uses a numerical finite/boundary element method (FEM/BEM) that may be easilty adapted to arbitrary geometries. A double walled cylinder is modeled using commercially available software. The outer shell is modeled as an aluminum cylinder, similar to that of aircraft skins. The inner shell is modeled as a composite material representative of a lightweight, stiff trim panel. Two different inner shell materials are used. The first is representative of current trim structure, the second a much stiffer composite. The primary source is generated by an exterior acoustic monopole. Control fields are generated using normal force inputs to the inner cylindrical shell. A linear least mean square (LMS) algorithm is used to determine amplitudes of control forces that minimize the interior acoustic field. Coupling of acoustic and structural modes and noise reductions are discussed for each of the inner shell materials.

Coats, T. J.↗

Structural Optimization Using the Newton Modified Barrier Method

The Newton Modified Barrier Method (NMBM) is applied to structural optimization problems with large a number of design variables and constraints. This nonlinear mathematical programming algorithm was based on the Modified Barrier Function (MBF) theory and the Newton method for unconstrained optimization. The distinctive feature of the NMBM method is the rate of convergence that is due to the fact that the design remains in the Newton area after each Lagrange multiplier update. This convergence characteristic is illustrated by application to structural problems with a varying number of design variables and constraints. The results are compared with those obtained by optimality criteria (OC) methods and by the ASTROS program.

Khot, N. S.↗

Contact solution algorithms

Two algorithms for obtaining static contact solutions are described in this presentation. Although they were derived for contact problems involving specific structures (a tire and a solid rubber cylinder), they are sufficiently general to be applied to other shell-of-revolution and solid-body contact problems. The shell-of-revolution contact algorithm is a method of obtaining a point load influence coefficient matrix for the portion of shell surface that is expected to carry a contact load. If the shell is sufficiently linear with respect to contact loading, a single influence coefficient matrix can be used to obtain a good approximation of the contact pressure distribution. Otherwise, the matrix will be updated to reflect nonlinear load-deflection behavior. The solid-body contact algorithm utilizes a Lagrange multiplier to include the contact constraint in a potential energy functional. The solution is found by applying the principle of minimum potential energy. The Lagrange multiplier is identified as the contact load resultant for a specific deflection. At present, only frictionless contact solutions have been obtained with these algorithms. A sliding tread element has been developed to calculate friction shear force in the contact region of the rolling shell-of-revolution tire model.

Tielking, John T.↗

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This report investigates the utility of the Hilbert Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this report is to demonstrate the potential applications of the Hilbert Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F-18 Active Aeroelastic Wing airplane, an Aerostructures Test Wing, and pitch plunge simulation.

Brenner, Martin J.↗

ICAP: An Interactive Cluster Analysis Procedure for analyzing remotely sensed data

An Interactive Cluster Analysis Procedure (ICAP) was developed to derive classifier training statistics from remotely sensed data. The algorithm interfaces the rapid numerical processing capacity of a computer with the human ability to integrate qualitative information. Control of the clustering process alternates between the algorithm, which creates new centroids and forms clusters and the analyst, who evaluate and elect to modify the cluster structure. Clusters can be deleted or lumped pairwise, or new centroids can be added. A summary of the cluster statistics can be requested to facilitate cluster manipulation. The ICAP was implemented in APL (A Programming Language), an interactive computer language. The flexibility of the algorithm was evaluated using data from different LANDSAT scenes to simulate two situations: one in which the analyst is assumed to have no prior knowledge about the data and wishes to have the clusters formed more or less automatically; and the other in which the analyst is assumed to have some knowledge about the data structure and wishes to use that information to closely supervise the clustering process. For comparison, an existing clustering method was also applied to the two data sets.

Wharton, S. W.↗

Discrete crack growth analysis methodology for through cracks in pressurized fuselage structures

A methodology for simulating the growth of long through cracks in the skin of pressurized aircraft fuselage structures is described. Crack trajectories are allowed to be arbitrary and are computed as part of the simulation. The interaction between the mechanical loads acting on the superstructure and the local structural response near the crack tips is accounted for by employing a hierarchical modeling strategy. The structural response for each cracked configuration is obtained using a geometrically nonlinear shell finite element analysis procedure. Four stress intensity factors, two for membrane behavior and two for bending using Kirchhoff plate theory, are computed using an extension of the modified crack closure integral method. Crack trajectories are determined by applying the maximum tangential stress criterion. Crack growth results in localized mesh deletion, and the deletion regions are remeshed automatically using a newly developed all-quadrilateral meshing algorithm. The effectiveness of the methodology and its applicability to performing practical analyses of realistic structures is demonstrated by simulating curvilinear crack growth in a fuselage panel that is representative of a typical narrow-body aircraft. The predicted crack trajectory and fatigue life compare well with measurements of these same quantities from a full-scale pressurized panel test.

Potyondy, David O.↗